# 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(3, axiom,~(p(s(t_bool,f))),file('i/f/sorting/PERM__REFL', aHLu_FALSITY)).
fof(19, axiom,![X5]:(s(t_bool,X5)=s(t_bool,f)<=>~(p(s(t_bool,X5)))),file('i/f/sorting/PERM__REFL', ah4s_bools_EQu_u_CLAUSESu_c3)).
fof(34, axiom,![X1]:![X13]:![X14]:(p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X14),s(t_h4s_lists_list(X1),X13))))<=>![X6]:s(t_h4s_lists_list(X1),h4s_lists_filter(s(t_fun(X1,t_bool),d_equals(s(X1,X6))),s(t_h4s_lists_list(X1),X14)))=s(t_h4s_lists_list(X1),h4s_lists_filter(s(t_fun(X1,t_bool),d_equals(s(X1,X6))),s(t_h4s_lists_list(X1),X13)))),file('i/f/sorting/PERM__REFL', ah4s_sortings_PERMu_u_DEF)).
# SZS output end CNFRefutation
