# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:![X5]:(p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X5),s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X4),s(t_h4s_lists_list(X1),X3))))))=>p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X2),s(t_h4s_lists_list(X1),X5))),s(t_h4s_lists_list(X1),h4s_lists_append(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))))))))),file('i/f/sorting/CONS__PERM', ch4s_sortings_CONSu_u_PERM)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/sorting/CONS__PERM', aHLu_FALSITY)).
fof(22, axiom,![X1]:![X8]:![X18]:![X5]:(p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X18),s(t_h4s_lists_list(X1),X8))),s(t_h4s_lists_list(X1),X5))))<=>?[X4]:?[X3]:(s(t_h4s_lists_list(X1),X5)=s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X4),s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X18),s(t_h4s_lists_list(X1),X3)))))&p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X8),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/CONS__PERM', ah4s_sortings_PERMu_u_CONSu_u_EQu_u_APPEND)).
fof(23, axiom,![X8]:(s(t_bool,X8)=s(t_bool,t)|s(t_bool,X8)=s(t_bool,f)),file('i/f/sorting/CONS__PERM', aHLu_BOOLu_CASES)).
fof(27, axiom,p(s(t_bool,t)),file('i/f/sorting/CONS__PERM', aHLu_TRUTH)).
fof(29, axiom,![X8]:(s(t_bool,X8)=s(t_bool,t)<=>p(s(t_bool,X8))),file('i/f/sorting/CONS__PERM', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
