# 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))))=>s(t_h4s_nums_num,h4s_arithmetics_mod(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X1)))=s(t_h4s_nums_num,X2)),file('i/f/arithmetic/LESS__MOD', ch4s_arithmetics_LESSu_u_MOD)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/arithmetic/LESS__MOD', aHLu_TRUTH)).
fof(6, axiom,![X3]:(s(t_bool,X3)=s(t_bool,t)<=>p(s(t_bool,X3))),file('i/f/arithmetic/LESS__MOD', ah4s_bools_EQu_u_CLAUSESu_c1)).
fof(7, axiom,![X6]:s(t_h4s_nums_num,h4s_arithmetics_u_2b(s(t_h4s_nums_num,h4s_nums_0),s(t_h4s_nums_num,X6)))=s(t_h4s_nums_num,X6),file('i/f/arithmetic/LESS__MOD', ah4s_arithmetics_ADDu_u_CLAUSESu_c0)).
fof(8, axiom,![X6]:s(t_h4s_nums_num,h4s_arithmetics_u_2a(s(t_h4s_nums_num,h4s_nums_0),s(t_h4s_nums_num,X6)))=s(t_h4s_nums_num,h4s_nums_0),file('i/f/arithmetic/LESS__MOD', ah4s_arithmetics_MULTu_u_CLAUSESu_c0)).
fof(9, axiom,![X7]:![X1]:![X2]:(?[X8]:(s(t_h4s_nums_num,X2)=s(t_h4s_nums_num,h4s_arithmetics_u_2b(s(t_h4s_nums_num,h4s_arithmetics_u_2a(s(t_h4s_nums_num,X8),s(t_h4s_nums_num,X1))),s(t_h4s_nums_num,X7)))&p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X7),s(t_h4s_nums_num,X1)))))=>s(t_h4s_nums_num,h4s_arithmetics_mod(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X1)))=s(t_h4s_nums_num,X7)),file('i/f/arithmetic/LESS__MOD', ah4s_arithmetics_MODu_u_UNIQUE)).
# SZS output end CNFRefutation
