# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,p(s(t_bool,h4s_relations_transitive(s(t_fun(t_h4s_nums_num,t_fun(t_h4s_nums_num,t_bool)),h4s_primu_u_recs_u_3c)))),file('i/f/arithmetic/transitive__LESS', ch4s_arithmetics_transitiveu_u_LESS)).
fof(4, axiom,![X1]:![X2]:(p(s(t_bool,h4s_relations_transitive(s(t_fun(X1,t_fun(X1,t_bool)),X2))))<=>![X3]:![X4]:![X5]:((p(s(t_bool,happ(s(t_fun(X1,t_bool),happ(s(t_fun(X1,t_fun(X1,t_bool)),X2),s(X1,X3))),s(X1,X4))))&p(s(t_bool,happ(s(t_fun(X1,t_bool),happ(s(t_fun(X1,t_fun(X1,t_bool)),X2),s(X1,X4))),s(X1,X5)))))=>p(s(t_bool,happ(s(t_fun(X1,t_bool),happ(s(t_fun(X1,t_fun(X1,t_bool)),X2),s(X1,X3))),s(X1,X5)))))),file('i/f/arithmetic/transitive__LESS', ah4s_relations_transitiveu_u_def)).
fof(5, axiom,![X6]:![X7]:![X8]:((p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),happ(s(t_fun(t_h4s_nums_num,t_fun(t_h4s_nums_num,t_bool)),h4s_primu_u_recs_u_3c),s(t_h4s_nums_num,X8))),s(t_h4s_nums_num,X7))))&p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),happ(s(t_fun(t_h4s_nums_num,t_fun(t_h4s_nums_num,t_bool)),h4s_primu_u_recs_u_3c),s(t_h4s_nums_num,X7))),s(t_h4s_nums_num,X6)))))=>p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),happ(s(t_fun(t_h4s_nums_num,t_fun(t_h4s_nums_num,t_bool)),h4s_primu_u_recs_u_3c),s(t_h4s_nums_num,X8))),s(t_h4s_nums_num,X6))))),file('i/f/arithmetic/transitive__LESS', ah4s_arithmetics_LESSu_u_TRANS)).
# SZS output end CNFRefutation
