# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),h4s_lists_reverse(s(t_h4s_lists_list(X1),X3))),s(t_h4s_lists_list(X1),X2)))=s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X3),s(t_h4s_lists_list(X1),X2))),file('i/f/sorting/PERM__REVERSE__EQ_c0', ch4s_sortings_PERMu_u_REVERSEu_u_EQu_c0)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/sorting/PERM__REVERSE__EQ_c0', aHLu_FALSITY)).
fof(3, axiom,![X4]:![X5]:((p(s(t_bool,X5))=>p(s(t_bool,X4)))=>((p(s(t_bool,X4))=>p(s(t_bool,X5)))=>s(t_bool,X5)=s(t_bool,X4))),file('i/f/sorting/PERM__REVERSE__EQ_c0', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(18, axiom,![X1]:![X12]:![X13]:![X14]:((p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X14),s(t_h4s_lists_list(X1),X13))))&p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X13),s(t_h4s_lists_list(X1),X12)))))=>p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X14),s(t_h4s_lists_list(X1),X12))))),file('i/f/sorting/PERM__REVERSE__EQ_c0', ah4s_sortings_PERMu_u_TRANS)).
fof(19, axiom,![X1]:![X2]:![X3]:s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X3),s(t_h4s_lists_list(X1),X2)))=s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X2),s(t_h4s_lists_list(X1),X3))),file('i/f/sorting/PERM__REVERSE__EQ_c0', ah4s_sortings_PERMu_u_SYM)).
fof(20, axiom,![X1]:![X15]:p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X15),s(t_h4s_lists_list(X1),h4s_lists_reverse(s(t_h4s_lists_list(X1),X15)))))),file('i/f/sorting/PERM__REVERSE__EQ_c0', ah4s_sortings_PERMu_u_REVERSE)).
fof(21, axiom,![X6]:(s(t_bool,X6)=s(t_bool,t)|s(t_bool,X6)=s(t_bool,f)),file('i/f/sorting/PERM__REVERSE__EQ_c0', aHLu_BOOLu_CASES)).
fof(22, axiom,p(s(t_bool,t)),file('i/f/sorting/PERM__REVERSE__EQ_c0', aHLu_TRUTH)).
fof(24, axiom,![X6]:(s(t_bool,X6)=s(t_bool,t)<=>p(s(t_bool,X6))),file('i/f/sorting/PERM__REVERSE__EQ_c0', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
