# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,h4s_integers_intu_u_lt(s(t_h4s_integers_int,X2),s(t_h4s_integers_int,X1))))<=>~(p(s(t_bool,h4s_integers_intu_u_ge(s(t_h4s_integers_int,X2),s(t_h4s_integers_int,X1)))))),file('i/f/HolSmt/r116', ch4s_HolSmts_r116)).
fof(23, axiom,![X1]:![X2]:s(t_bool,h4s_integers_intu_u_ge(s(t_h4s_integers_int,X2),s(t_h4s_integers_int,X1)))=s(t_bool,h4s_integers_intu_u_le(s(t_h4s_integers_int,X1),s(t_h4s_integers_int,X2))),file('i/f/HolSmt/r116', ah4s_integers_intu_u_ge0)).
fof(31, axiom,![X1]:![X2]:s(t_bool,h4s_integers_intu_u_lt(s(t_h4s_integers_int,X2),s(t_h4s_integers_int,X1)))=s(t_bool,h4s_integers_intu_u_le(s(t_h4s_integers_int,h4s_integers_intu_u_add(s(t_h4s_integers_int,X2),s(t_h4s_integers_int,h4s_integers_intu_u_ofu_u_num(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))))))),s(t_h4s_integers_int,X1))),file('i/f/HolSmt/r116', ah4s_intu_u_ariths_lessu_u_tou_u_lequ_u_samer)).
fof(32, axiom,![X1]:![X2]:(~(p(s(t_bool,h4s_integers_intu_u_le(s(t_h4s_integers_int,X2),s(t_h4s_integers_int,X1)))))<=>p(s(t_bool,h4s_integers_intu_u_lt(s(t_h4s_integers_int,X1),s(t_h4s_integers_int,X2))))),file('i/f/HolSmt/r116', ah4s_integers_INTu_u_NOTu_u_LE)).
# SZS output end CNFRefutation
