# 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),X4))))=>(p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),h4s_sortings_perm(s(t_h4s_lists_list(X1),X3))),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),X5))),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),X4))),s(t_h4s_lists_list(X1),X2))))),file('i/f/sorting/PERM__CONG__2', ch4s_sortings_PERMu_u_CONGu_u_2)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/sorting/PERM__CONG__2', aHLu_FALSITY)).
fof(3, axiom,![X6]:![X7]:((p(s(t_bool,X7))=>p(s(t_bool,X6)))=>((p(s(t_bool,X6))=>p(s(t_bool,X7)))=>s(t_bool,X7)=s(t_bool,X6))),file('i/f/sorting/PERM__CONG__2', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(23, axiom,![X1]:![X19]:![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),X19))))<=>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),X19)))),file('i/f/sorting/PERM__CONG__2', ah4s_sortings_PERMu_u_EQUIVALENCEu_u_ALTu_u_DEF)).
fof(24, axiom,![X8]:(s(t_bool,X8)=s(t_bool,t)|s(t_bool,X8)=s(t_bool,f)),file('i/f/sorting/PERM__CONG__2', aHLu_BOOLu_CASES)).
fof(27, axiom,![X8]:(s(t_bool,X8)=s(t_bool,t)<=>p(s(t_bool,X8))),file('i/f/sorting/PERM__CONG__2', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
