# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![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),X3),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),h4s_lists_append(s(t_h4s_lists_list(X1),X2),s(t_h4s_lists_list(X1),X3))))),file('i/f/sorting/PERM__FUN__APPEND', ch4s_sortings_PERMu_u_FUNu_u_APPEND)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/sorting/PERM__FUN__APPEND', aHLu_TRUTH)).
fof(7, axiom,![X9]:(s(t_bool,X9)=s(t_bool,t)<=>p(s(t_bool,X9))),file('i/f/sorting/PERM__FUN__APPEND', ah4s_bools_EQu_u_CLAUSESu_c1)).
fof(8, axiom,![X1]:![X10]:![X8]:(p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X8))),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),X8)))=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__APPEND', ah4s_sortings_PERMu_u_EQUIVALENCEu_u_ALTu_u_DEF)).
fof(9, axiom,![X1]:![X2]:![X3]: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),X3),s(t_h4s_lists_list(X1),X2))))),s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X2),s(t_h4s_lists_list(X1),X3)))))),file('i/f/sorting/PERM__FUN__APPEND', ah4s_sortings_PERMu_u_APPEND)).
# SZS output end CNFRefutation
