# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:![X5]:(p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X5))),s(t_h4s_lists_list(X1),X2))))=>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),X5),s(t_h4s_lists_list(X1),X4))))),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),h4s_lists_append(s(t_h4s_lists_list(X1),X2),s(t_h4s_lists_list(X1),X4))))),s(t_h4s_lists_list(X1),X3)))),file('i/f/sorting/PERM__REWR', ch4s_sortings_PERMu_u_REWR)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/sorting/PERM__REWR', aHLu_TRUTH)).
fof(21, axiom,![X6]:(s(t_bool,X6)=s(t_bool,t)<=>p(s(t_bool,X6))),file('i/f/sorting/PERM__REWR', ah4s_bools_EQu_u_CLAUSESu_c1)).
fof(44, axiom,![X1]:![X3]:![X4]:![X5]: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),X4),s(t_h4s_lists_list(X1),X5))))),s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X3),s(t_h4s_lists_list(X1),X5)))))=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__REWR', ah4s_sortings_PERMu_u_APPENDu_u_IFFu_c1)).
fof(45, axiom,![X1]:![X20]:![X9]:(p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X9))),s(t_h4s_lists_list(X1),X20))))<=>s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X9)))=s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X20)))),file('i/f/sorting/PERM__REWR', ah4s_sortings_PERMu_u_EQUIVALENCEu_u_ALTu_u_DEF)).
# SZS output end CNFRefutation
