# 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_lt(s(t_h4s_integers_int,X1),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))))))))))))),file('i/f/int_arith/not__less', ch4s_intu_u_ariths_notu_u_less)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/int_arith/not__less', aHLu_FALSITY)).
fof(47, axiom,![X1]:![X2]:s(t_bool,h4s_integers_intu_u_le(s(t_h4s_integers_int,X2),s(t_h4s_integers_int,X1)))=s(t_bool,h4s_integers_intu_u_lt(s(t_h4s_integers_int,X2),s(t_h4s_integers_int,h4s_integers_intu_u_add(s(t_h4s_integers_int,X1),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))))))))))),file('i/f/int_arith/not__less', ah4s_integers_INTu_u_LEu_u_LT1)).
fof(57, 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/int_arith/not__less', ah4s_integers_intu_u_le0)).
fof(78, axiom,![X5]:(s(t_bool,X5)=s(t_bool,t)|s(t_bool,X5)=s(t_bool,f)),file('i/f/int_arith/not__less', aHLu_BOOLu_CASES)).
fof(79, axiom,(~(p(s(t_bool,f)))<=>p(s(t_bool,t))),file('i/f/int_arith/not__less', ah4s_bools_NOTu_u_CLAUSESu_c2)).
# SZS output end CNFRefutation
