# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, axiom,p(s(t_bool,t)),file('i/f/sorting/PERM__TRANS', aHLu_TRUTH)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/sorting/PERM__TRANS', aHLu_FALSITY)).
fof(8, axiom,![X7]:p(s(t_bool,h4s_relations_transitive(s(t_fun(t_h4s_lists_list(X7),t_fun(t_h4s_lists_list(X7),t_bool)),h4s_sortings_perm)))),file('i/f/sorting/PERM__TRANS', ah4s_sortings_PERMu_u_transitive)).
fof(11, axiom,![X1]:(s(t_bool,X1)=s(t_bool,t)<=>p(s(t_bool,X1))),file('i/f/sorting/PERM__TRANS', ah4s_bools_EQu_u_CLAUSESu_c1)).
fof(36, axiom,![X1]:(s(t_bool,X1)=s(t_bool,f)<=>~(p(s(t_bool,X1)))),file('i/f/sorting/PERM__TRANS', ah4s_bools_EQu_u_CLAUSESu_c3)).
fof(51, axiom,![X7]:![X23]:(p(s(t_bool,h4s_relations_transitive(s(t_fun(X7,t_fun(X7,t_bool)),X23))))<=>![X6]:![X11]:![X24]:((p(s(t_bool,happ(s(t_fun(X7,t_bool),happ(s(t_fun(X7,t_fun(X7,t_bool)),X23),s(X7,X6))),s(X7,X11))))&p(s(t_bool,happ(s(t_fun(X7,t_bool),happ(s(t_fun(X7,t_fun(X7,t_bool)),X23),s(X7,X11))),s(X7,X24)))))=>p(s(t_bool,happ(s(t_fun(X7,t_bool),happ(s(t_fun(X7,t_fun(X7,t_bool)),X23),s(X7,X6))),s(X7,X24)))))),file('i/f/sorting/PERM__TRANS', ah4s_relations_transitiveu_u_def)).
fof(133, conjecture,![X7]:![X24]:![X11]:![X6]:((p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X7),t_bool),happ(s(t_fun(t_h4s_lists_list(X7),t_fun(t_h4s_lists_list(X7),t_bool)),h4s_sortings_perm),s(t_h4s_lists_list(X7),X6))),s(t_h4s_lists_list(X7),X11))))&p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X7),t_bool),happ(s(t_fun(t_h4s_lists_list(X7),t_fun(t_h4s_lists_list(X7),t_bool)),h4s_sortings_perm),s(t_h4s_lists_list(X7),X11))),s(t_h4s_lists_list(X7),X24)))))=>p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X7),t_bool),happ(s(t_fun(t_h4s_lists_list(X7),t_fun(t_h4s_lists_list(X7),t_bool)),h4s_sortings_perm),s(t_h4s_lists_list(X7),X6))),s(t_h4s_lists_list(X7),X24))))),file('i/f/sorting/PERM__TRANS', ch4s_sortings_PERMu_u_TRANS)).
# SZS output end CNFRefutation
