# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(s(t_h4s_nums_num,X2)=s(t_h4s_nums_num,X1)|(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,X2))),s(t_h4s_nums_num,X1))))|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,X1))),s(t_h4s_nums_num,X2)))))),file('i/f/arithmetic/LESS__LESS__CASES', ch4s_arithmetics_LESSu_u_LESSu_u_CASES)).
fof(30, axiom,![X1]:![X2]:((~(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,X2))),s(t_h4s_nums_num,X1)))))&~(s(t_h4s_nums_num,X2)=s(t_h4s_nums_num,X1)))=>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,X1))),s(t_h4s_nums_num,X2))))),file('i/f/arithmetic/LESS__LESS__CASES', ah4s_arithmetics_LESSu_u_CASESu_u_IMP)).
fof(70, axiom,![X1]:![X2]: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,X2))),s(t_h4s_nums_num,X1)))=s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,h4s_nums_suc(s(t_h4s_nums_num,X2))),s(t_h4s_nums_num,X1))),file('i/f/arithmetic/LESS__LESS__CASES', ah4s_arithmetics_LESSu_u_EQ)).
# SZS output end CNFRefutation
