# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:(s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X4)))=s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X3)))=>s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X2),s(t_h4s_lists_list(X1),X4)))))=s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X2),s(t_h4s_lists_list(X1),X3)))))),file('i/f/sorting/PERM__FUN__CONS__IFF', ch4s_sortings_PERMu_u_FUNu_u_CONSu_u_IFF)).
fof(8, axiom,![X1]:![X10]:![X2]:(p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X2))),s(t_h4s_lists_list(X1),X10))))<=>s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X2)))=s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X10)))),file('i/f/sorting/PERM__FUN__CONS__IFF', ah4s_sortings_PERMu_u_EQUIVALENCEu_u_ALTu_u_DEF)).
fof(9, axiom,![X1]:![X2]:![X3]:![X4]:s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X2),s(t_h4s_lists_list(X1),X4))))),s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X2),s(t_h4s_lists_list(X1),X3)))))=s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X4))),s(t_h4s_lists_list(X1),X3))),file('i/f/sorting/PERM__FUN__CONS__IFF', ah4s_sortings_PERMu_u_CONSu_u_IFF)).
# SZS output end CNFRefutation
