# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X2),s(t_h4s_lists_list(X1),X2)))),file('i/f/sorting/PERM__REFL', ch4s_sortings_PERMu_u_REFL)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/sorting/PERM__REFL', aHLu_FALSITY)).
fof(6, axiom,![X3]:(s(t_bool,f)=s(t_bool,X3)<=>~(p(s(t_bool,X3)))),file('i/f/sorting/PERM__REFL', ah4s_bools_EQu_u_CLAUSESu_c2)).
fof(43, axiom,(p(s(t_bool,f))<=>![X3]:p(s(t_bool,X3))),file('i/f/sorting/PERM__REFL', ah4s_bools_Fu_u_DEF)).
fof(56, axiom,![X1]:![X27]:![X28]:(p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X28),s(t_h4s_lists_list(X1),X27))))<=>![X4]:s(t_h4s_lists_list(X1),h4s_lists_filter(s(t_fun(X1,t_bool),d_equals(s(X1,X4))),s(t_h4s_lists_list(X1),X28)))=s(t_h4s_lists_list(X1),h4s_lists_filter(s(t_fun(X1,t_bool),d_equals(s(X1,X4))),s(t_h4s_lists_list(X1),X27)))),file('i/f/sorting/PERM__REFL', ah4s_sortings_PERMu_u_DEF)).
fof(60, axiom,![X3]:(s(t_bool,X3)=s(t_bool,t)|s(t_bool,X3)=s(t_bool,f)),file('i/f/sorting/PERM__REFL', aHLu_BOOLu_CASES)).
fof(61, axiom,(~(p(s(t_bool,f)))<=>p(s(t_bool,t))),file('i/f/sorting/PERM__REFL', ah4s_bools_NOTu_u_CLAUSESu_c2)).
# SZS output end CNFRefutation
