# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,h4s_bits_bit(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X1))))=>p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,h4s_arithmetics_exp(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit2(s(t_h4s_nums_num,h4s_arithmetics_zero))))),s(t_h4s_nums_num,X2))),s(t_h4s_nums_num,X1))))),file('i/f/bit/BIT__IMP__GE__TWOEXP', ch4s_bits_BITu_u_IMPu_u_GEu_u_TWOEXP)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/bit/BIT__IMP__GE__TWOEXP', aHLu_FALSITY)).
fof(17, axiom,![X1]:![X9]:(~(p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,X9),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,X9))))),file('i/f/bit/BIT__IMP__GE__TWOEXP', ah4s_arithmetics_NOTu_u_LESSu_u_EQUAL)).
fof(18, axiom,![X1]:![X2]:(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,h4s_arithmetics_exp(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit2(s(t_h4s_nums_num,h4s_arithmetics_zero))))),s(t_h4s_nums_num,X2))))))=>~(p(s(t_bool,h4s_bits_bit(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X1)))))),file('i/f/bit/BIT__IMP__GE__TWOEXP', ah4s_bits_NOTu_u_BITu_u_GTu_u_TWOEXP)).
fof(19, axiom,![X3]:(s(t_bool,X3)=s(t_bool,t)|s(t_bool,X3)=s(t_bool,f)),file('i/f/bit/BIT__IMP__GE__TWOEXP', aHLu_BOOLu_CASES)).
fof(20, axiom,p(s(t_bool,t)),file('i/f/bit/BIT__IMP__GE__TWOEXP', aHLu_TRUTH)).
fof(22, axiom,![X3]:(s(t_bool,X3)=s(t_bool,t)<=>p(s(t_bool,X3))),file('i/f/bit/BIT__IMP__GE__TWOEXP', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
