# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(29, axiom,![X11]:![X6]:(p(s(t_bool,h4s_integers_intu_u_le(s(t_h4s_integers_int,X6),s(t_h4s_integers_int,X11))))<=>~(p(s(t_bool,h4s_integers_intu_u_lt(s(t_h4s_integers_int,X11),s(t_h4s_integers_int,X6)))))),file('i/f/integer/NUM__POSINT__EXISTS', ah4s_integers_intu_u_le0)).
fof(37, axiom,![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_0)))))=>?[X10]:s(t_h4s_integers_int,X1)=s(t_h4s_integers_int,h4s_integers_intu_u_ofu_u_num(s(t_h4s_nums_num,X10)))),file('i/f/integer/NUM__POSINT__EXISTS', ah4s_integers_NUMu_u_POSINTu_u_EX)).
fof(69, axiom,s(t_h4s_integers_int,h4s_integers_intu_u_0)=s(t_h4s_integers_int,h4s_integers_intu_u_ofu_u_num(s(t_h4s_nums_num,h4s_nums_0))),file('i/f/integer/NUM__POSINT__EXISTS', ah4s_integers_INTu_u_0)).
fof(133, conjecture,![X9]:(p(s(t_bool,h4s_integers_intu_u_le(s(t_h4s_integers_int,h4s_integers_intu_u_ofu_u_num(s(t_h4s_nums_num,h4s_nums_0))),s(t_h4s_integers_int,X9))))=>?[X10]:s(t_h4s_integers_int,X9)=s(t_h4s_integers_int,h4s_integers_intu_u_ofu_u_num(s(t_h4s_nums_num,X10)))),file('i/f/integer/NUM__POSINT__EXISTS', ch4s_integers_NUMu_u_POSINTu_u_EXISTS)).
# SZS output end CNFRefutation
