# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),happ(s(t_fun(t_h4s_lists_list(X1),t_fun(t_h4s_lists_list(X1),t_bool)),h4s_sortings_perm),s(t_h4s_lists_list(X1),h4s_lists_nil))),s(t_h4s_lists_list(X1),X2))))<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/sorting/PERM__NIL_c1', ch4s_sortings_PERMu_u_NILu_c1)).
fof(39, axiom,![X1]:![X2]:(p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),happ(s(t_fun(t_h4s_lists_list(X1),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),h4s_lists_nil))))<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/sorting/PERM__NIL_c1', ah4s_sortings_PERMu_u_NILu_c0)).
fof(53, axiom,![X1]:![X2]:p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),happ(s(t_fun(t_h4s_lists_list(X1),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),X2)))),file('i/f/sorting/PERM__NIL_c1', ah4s_sortings_PERMu_u_REFL)).
fof(56, axiom,![X1]:![X30]:![X31]:s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),happ(s(t_fun(t_h4s_lists_list(X1),t_fun(t_h4s_lists_list(X1),t_bool)),h4s_sortings_perm),s(t_h4s_lists_list(X1),X31))),s(t_h4s_lists_list(X1),X30)))=s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),happ(s(t_fun(t_h4s_lists_list(X1),t_fun(t_h4s_lists_list(X1),t_bool)),h4s_sortings_perm),s(t_h4s_lists_list(X1),X30))),s(t_h4s_lists_list(X1),X31))),file('i/f/sorting/PERM__NIL_c1', ah4s_sortings_PERMu_u_SYM)).
# SZS output end CNFRefutation
