# 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,h4s_integers_intu_u_ofu_u_num(s(t_h4s_nums_num,h4s_nums_0))),s(t_h4s_integers_int,X2))))&p(s(t_bool,h4s_integers_intu_u_lt(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,X1)))))=>p(s(t_bool,h4s_integers_intu_u_lt(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,h4s_integers_intu_u_add(s(t_h4s_integers_int,X2),s(t_h4s_integers_int,X1))))))),file('i/f/integer/INT__LET__ADD', ch4s_integers_INTu_u_LETu_u_ADD)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/integer/INT__LET__ADD', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/integer/INT__LET__ADD', aHLu_FALSITY)).
fof(6, axiom,![X3]:(s(t_bool,X3)=s(t_bool,t)<=>p(s(t_bool,X3))),file('i/f/integer/INT__LET__ADD', ah4s_bools_EQu_u_CLAUSESu_c1)).
fof(7, axiom,![X4]:![X1]:![X2]:![X5]:((p(s(t_bool,h4s_integers_intu_u_le(s(t_h4s_integers_int,X5),s(t_h4s_integers_int,X2))))&p(s(t_bool,h4s_integers_intu_u_lt(s(t_h4s_integers_int,X1),s(t_h4s_integers_int,X4)))))=>p(s(t_bool,h4s_integers_intu_u_lt(s(t_h4s_integers_int,h4s_integers_intu_u_add(s(t_h4s_integers_int,X5),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,X4))))))),file('i/f/integer/INT__LET__ADD', ah4s_integers_INTu_u_LETu_u_ADD2)).
fof(8, axiom,![X3]:(s(t_bool,X3)=s(t_bool,t)|s(t_bool,X3)=s(t_bool,f)),file('i/f/integer/INT__LET__ADD', aHLu_BOOLu_CASES)).
fof(9, axiom,![X2]:s(t_h4s_integers_int,h4s_integers_intu_u_add(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,X2)))=s(t_h4s_integers_int,X2),file('i/f/integer/INT__LET__ADD', ah4s_integers_INTu_u_ADDu_u_LID)).
# SZS output end CNFRefutation
