# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:~((p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X1))))&p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,h4s_nums_suc(s(t_h4s_nums_num,X2)))))))),file('i/f/arithmetic/LESS__LESS__SUC', ch4s_arithmetics_LESSu_u_LESSu_u_SUC)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/arithmetic/LESS__LESS__SUC', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/arithmetic/LESS__LESS__SUC', aHLu_FALSITY)).
fof(5, axiom,![X1]:~(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,X1))))),file('i/f/arithmetic/LESS__LESS__SUC', ah4s_primu_u_recs_LESSu_u_REFL)).
fof(6, axiom,![X1]:![X2]:(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,h4s_nums_suc(s(t_h4s_nums_num,X1))))))<=>(s(t_h4s_nums_num,X2)=s(t_h4s_nums_num,X1)|p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X1)))))),file('i/f/arithmetic/LESS__LESS__SUC', ah4s_primu_u_recs_LESSu_u_THM)).
fof(7, axiom,![X4]:![X1]:![X2]:((p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X1))))&p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,X4)))))=>p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X4))))),file('i/f/arithmetic/LESS__LESS__SUC', ah4s_arithmetics_LESSu_u_TRANS)).
fof(8, axiom,![X3]:(s(t_bool,X3)=s(t_bool,t)|s(t_bool,X3)=s(t_bool,f)),file('i/f/arithmetic/LESS__LESS__SUC', aHLu_BOOLu_CASES)).
# SZS output end CNFRefutation
