# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:![X5]:(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),h4s_lists_cons(s(X1,X2),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_append(s(t_h4s_lists_list(X1),X4),s(t_h4s_lists_list(X1),X5)))))=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),h4s_lists_append(s(t_h4s_lists_list(X1),X3),s(t_h4s_lists_list(X1),X5)))))))),file('i/f/sorting/PERM__FUN__CONS__APPEND__1', ch4s_sortings_PERMu_u_FUNu_u_CONSu_u_APPENDu_u_1)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/sorting/PERM__FUN__CONS__APPEND__1', aHLu_TRUTH)).
fof(9, axiom,![X1]:![X11]:![X12]:![X13]:![X14]:((p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X14))),s(t_h4s_lists_list(X1),X12))))&p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X13))),s(t_h4s_lists_list(X1),X11)))))=>p(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_append(s(t_h4s_lists_list(X1),X14),s(t_h4s_lists_list(X1),X13))))),s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X12),s(t_h4s_lists_list(X1),X11))))))),file('i/f/sorting/PERM__FUN__CONS__APPEND__1', ah4s_sortings_PERMu_u_CONG)).
fof(10, axiom,![X1]:![X15]:![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),X15))))<=>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),X15)))),file('i/f/sorting/PERM__FUN__CONS__APPEND__1', ah4s_sortings_PERMu_u_EQUIVALENCEu_u_ALTu_u_DEF)).
fof(11, axiom,![X1]:![X3]:![X4]:![X16]:s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X16),s(t_h4s_lists_list(X1),X4))),s(t_h4s_lists_list(X1),X3)))=s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X16),s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X4),s(t_h4s_lists_list(X1),X3))))),file('i/f/sorting/PERM__FUN__CONS__APPEND__1', ah4s_lists_APPEND0u_c1)).
fof(12, axiom,~(p(s(t_bool,f))),file('i/f/sorting/PERM__FUN__CONS__APPEND__1', aHLu_FALSITY)).
fof(13, axiom,![X10]:(s(t_bool,X10)=s(t_bool,t)|s(t_bool,X10)=s(t_bool,f)),file('i/f/sorting/PERM__FUN__CONS__APPEND__1', aHLu_BOOLu_CASES)).
# SZS output end CNFRefutation
