# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:((p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),happ(s(t_fun(t_h4s_lists_list(X1),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))))&p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),happ(s(t_fun(t_h4s_lists_list(X1),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)))))=>p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),happ(s(t_fun(t_h4s_lists_list(X1),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__TRANS', ch4s_sortings_PERMu_u_TRANS)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/sorting/PERM__TRANS', aHLu_FALSITY)).
fof(24, axiom,![X1]:![X20]:(p(s(t_bool,h4s_relations_transitive(s(t_fun(X1,t_fun(X1,t_bool)),X20))))<=>![X4]:![X3]:![X2]:((p(s(t_bool,happ(s(t_fun(X1,t_bool),happ(s(t_fun(X1,t_fun(X1,t_bool)),X20),s(X1,X4))),s(X1,X3))))&p(s(t_bool,happ(s(t_fun(X1,t_bool),happ(s(t_fun(X1,t_fun(X1,t_bool)),X20),s(X1,X3))),s(X1,X2)))))=>p(s(t_bool,happ(s(t_fun(X1,t_bool),happ(s(t_fun(X1,t_fun(X1,t_bool)),X20),s(X1,X4))),s(X1,X2)))))),file('i/f/sorting/PERM__TRANS', ah4s_relations_transitiveu_u_def)).
fof(25, axiom,![X1]:p(s(t_bool,h4s_relations_transitive(s(t_fun(t_h4s_lists_list(X1),t_fun(t_h4s_lists_list(X1),t_bool)),h4s_sortings_perm)))),file('i/f/sorting/PERM__TRANS', ah4s_sortings_PERMu_u_transitive)).
fof(26, axiom,![X7]:(s(t_bool,X7)=s(t_bool,t)|s(t_bool,X7)=s(t_bool,f)),file('i/f/sorting/PERM__TRANS', aHLu_BOOLu_CASES)).
fof(28, axiom,p(s(t_bool,t)),file('i/f/sorting/PERM__TRANS', aHLu_TRUTH)).
fof(30, axiom,![X7]:(s(t_bool,X7)=s(t_bool,t)<=>p(s(t_bool,X7))),file('i/f/sorting/PERM__TRANS', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
