# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![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,X2),s(t_h4s_integers_int,X1))))|s(t_h4s_integers_int,X2)=s(t_h4s_integers_int,X1))),file('i/f/integer/INT__LE__LT', ch4s_integers_INTu_u_LEu_u_LT)).
fof(23, axiom,![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,X2)))))),file('i/f/integer/INT__LE__LT', ah4s_integers_INTu_u_LTu_u_ANTISYM)).
fof(26, axiom,![X1]:![X2]:(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,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/integer/INT__LE__LT', ah4s_integers_INTu_u_LTu_u_TOTAL)).
fof(38, 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/integer/INT__LE__LT', ah4s_integers_intu_u_le0)).
fof(40, 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/integer/INT__LE__LT', ah4s_integers_INTu_u_NOTu_u_LE)).
fof(46, axiom,![X2]:p(s(t_bool,h4s_integers_intu_u_le(s(t_h4s_integers_int,X2),s(t_h4s_integers_int,X2)))),file('i/f/integer/INT__LE__LT', ah4s_integers_INTu_u_LEu_u_REFL)).
# SZS output end CNFRefutation
