%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM924+2 : TPTP v7.0.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n105.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:22:39 EST 2018
% Result : Theorem 0.58s
% Output : CNFRefutation 0.58s
% Verified :
% SZS Type : None (Could not find formula named the1)
% Syntax : Number of formulae : 51
% Comments :
%------------------------------------------------------------------------------
fof(94,axiom,
! [X116,X117] : equal(times_times_int(X116,X117),times_times_int(X117,X116)),
file('/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1',fact_325_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).
fof(106,axiom,
! [X42] : equal(bit1(X42),plus_plus_int(plus_plus_int(one_one_int,X42),X42)),
file('/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1',fact_234_Bit1__def) ).
fof(174,axiom,
! [X42] : equal(bit0(X42),plus_plus_int(X42,X42)),
file('/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1',fact_180_Bit0__def) ).
fof(225,axiom,
! [X8,X17,X30] : equal(plus_plus_int(X8,plus_plus_int(X17,X30)),plus_plus_int(X17,plus_plus_int(X8,X30))),
file('/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1',fact_131_zadd__left__commute) ).
fof(242,axiom,
ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int)),
file('/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
fof(322,axiom,
! [X214] : equal(times_times_int(X214,zero_zero_int),zero_zero_int),
file('/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1',fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J) ).
fof(337,axiom,
! [X35] : equal(power_power_int(X35,number_number_of_nat(bit0(bit1(pls)))),times_times_int(X35,X35)),
file('/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1',fact_201_power2__eq__square) ).
fof(468,axiom,
! [X70,X71,X189] : equal(plus_plus_int(plus_plus_int(X70,X71),X189),plus_plus_int(X70,plus_plus_int(X71,X189))),
file('/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1',fact_130_zadd__assoc) ).
fof(553,axiom,
! [X85,X86] : equal(plus_plus_int(X85,X86),plus_plus_int(X86,X85)),
file('/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1',fact_328_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
fof(603,axiom,
equal(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t)),
file('/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1',fact_3_t) ).
fof(671,conjecture,
ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
file('/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1',conj_0) ).
fof(694,axiom,
equal(pls,zero_zero_int),
file('/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1',fact_170_Pls__def) ).
fof(717,negated_conjecture,
~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
inference(assume_negation,[status(cth)],[671]) ).
fof(749,negated_conjecture,
~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
inference(fof_simplification,[status(thm)],[717,theory(equality)]) ).
fof(1021,plain,
! [X118,X119] : equal(times_times_int(X118,X119),times_times_int(X119,X118)),
inference(variable_rename,[status(thm)],[94]) ).
cnf(1022,plain,
times_times_int(X1,X2) = times_times_int(X2,X1),
inference(split_conjunct,[status(thm)],[1021]) ).
fof(1050,plain,
! [X43] : equal(bit1(X43),plus_plus_int(plus_plus_int(one_one_int,X43),X43)),
inference(variable_rename,[status(thm)],[106]) ).
cnf(1051,plain,
bit1(X1) = plus_plus_int(plus_plus_int(one_one_int,X1),X1),
inference(split_conjunct,[status(thm)],[1050]) ).
fof(1247,plain,
! [X43] : equal(bit0(X43),plus_plus_int(X43,X43)),
inference(variable_rename,[status(thm)],[174]) ).
cnf(1248,plain,
bit0(X1) = plus_plus_int(X1,X1),
inference(split_conjunct,[status(thm)],[1247]) ).
fof(1383,plain,
! [X31,X32,X33] : equal(plus_plus_int(X31,plus_plus_int(X32,X33)),plus_plus_int(X32,plus_plus_int(X31,X33))),
inference(variable_rename,[status(thm)],[225]) ).
cnf(1384,plain,
plus_plus_int(X1,plus_plus_int(X2,X3)) = plus_plus_int(X2,plus_plus_int(X1,X3)),
inference(split_conjunct,[status(thm)],[1383]) ).
cnf(1432,plain,
ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int)),
inference(split_conjunct,[status(thm)],[242]) ).
fof(1665,plain,
! [X215] : equal(times_times_int(X215,zero_zero_int),zero_zero_int),
inference(variable_rename,[status(thm)],[322]) ).
cnf(1666,plain,
times_times_int(X1,zero_zero_int) = zero_zero_int,
inference(split_conjunct,[status(thm)],[1665]) ).
fof(1710,plain,
! [X36] : equal(power_power_int(X36,number_number_of_nat(bit0(bit1(pls)))),times_times_int(X36,X36)),
inference(variable_rename,[status(thm)],[337]) ).
cnf(1711,plain,
power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))) = times_times_int(X1,X1),
inference(split_conjunct,[status(thm)],[1710]) ).
fof(2079,plain,
! [X190,X191,X192] : equal(plus_plus_int(plus_plus_int(X190,X191),X192),plus_plus_int(X190,plus_plus_int(X191,X192))),
inference(variable_rename,[status(thm)],[468]) ).
cnf(2080,plain,
plus_plus_int(plus_plus_int(X1,X2),X3) = plus_plus_int(X1,plus_plus_int(X2,X3)),
inference(split_conjunct,[status(thm)],[2079]) ).
fof(2326,plain,
! [X87,X88] : equal(plus_plus_int(X87,X88),plus_plus_int(X88,X87)),
inference(variable_rename,[status(thm)],[553]) ).
cnf(2327,plain,
plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
inference(split_conjunct,[status(thm)],[2326]) ).
cnf(2475,plain,
plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int) = times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),
inference(split_conjunct,[status(thm)],[603]) ).
cnf(2662,negated_conjecture,
~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
inference(split_conjunct,[status(thm)],[749]) ).
cnf(2726,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[694]) ).
cnf(2827,plain,
power_power_int(X1,number_number_of_nat(plus_plus_int(bit1(pls),bit1(pls)))) = times_times_int(X1,X1),
inference(rw,[status(thm)],[1711,1248,theory(equality)]),
[unfolding] ).
cnf(2875,plain,
times_times_int(plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(plus_plus_int(bit1(pls),bit1(pls)),plus_plus_int(bit1(pls),bit1(pls)))),m),one_one_int),t) = plus_plus_int(power_power_int(s,number_number_of_nat(plus_plus_int(bit1(pls),bit1(pls)))),one_one_int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2475,1248,theory(equality)]),1248,theory(equality)]),1248,theory(equality)]),
[unfolding] ).
cnf(2884,plain,
ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(plus_plus_int(bit1(pls),bit1(pls)),plus_plus_int(bit1(pls),bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(plus_plus_int(bit1(pls),bit1(pls)),plus_plus_int(bit1(pls),bit1(pls)))),m),one_one_int),zero_zero_int)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1432,1248,theory(equality)]),1248,theory(equality)]),1248,theory(equality)]),1248,theory(equality)]),
[unfolding] ).
cnf(2996,negated_conjecture,
~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(plus_plus_int(bit1(pls),bit1(pls)))),one_one_int),zero_zero_int),
inference(rw,[status(thm)],[2662,1248,theory(equality)]),
[unfolding] ).
cnf(3052,plain,
power_power_int(X1,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))) = times_times_int(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[2827,1051,theory(equality)]),1051,theory(equality)]),
[unfolding] ).
cnf(3105,plain,
times_times_int(plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)),plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))),m),one_one_int),t) = plus_plus_int(power_power_int(s,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))),one_one_int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2875,1051,theory(equality)]),1051,theory(equality)]),1051,theory(equality)]),1051,theory(equality)]),1051,theory(equality)]),1051,theory(equality)]),
[unfolding] ).
cnf(3114,plain,
ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)),plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)),plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))),m),one_one_int),zero_zero_int)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2884,1051,theory(equality)]),1051,theory(equality)]),1051,theory(equality)]),1051,theory(equality)]),1051,theory(equality)]),1051,theory(equality)]),1051,theory(equality)]),1051,theory(equality)]),
[unfolding] ).
cnf(3244,negated_conjecture,
~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))),one_one_int),zero_zero_int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[2996,1051,theory(equality)]),1051,theory(equality)]),
[unfolding] ).
cnf(3279,plain,
times_times_int(X1,pls) = zero_zero_int,
inference(rw,[status(thm)],[1666,2726,theory(equality)]) ).
cnf(3280,plain,
times_times_int(X1,pls) = pls,
inference(rw,[status(thm)],[3279,2726,theory(equality)]) ).
cnf(6914,plain,
power_power_int(X1,number_number_of_nat(plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(one_one_int,one_one_int))))))) = times_times_int(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3052,2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]) ).
cnf(12958,negated_conjecture,
~ ord_less_int(plus_plus_int(one_one_int,times_times_int(s,s)),pls),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3244,2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),6914,theory(equality)]),2327,theory(equality)]),2726,theory(equality)]) ).
cnf(21642,plain,
times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(one_one_int,plus_plus_int(one_one_int,plus_plus_int(one_one_int,one_one_int))))))))))))))) = plus_plus_int(power_power_int(s,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))),one_one_int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3105,2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2080,theory(equality)]),2080,theory(equality)]),2080,theory(equality)]),2080,theory(equality)]),2080,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1022,theory(equality)]),2327,theory(equality)]),1022,theory(equality)]) ).
cnf(21643,plain,
times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(one_one_int,plus_plus_int(one_one_int,plus_plus_int(one_one_int,one_one_int))))))))))))))) = plus_plus_int(one_one_int,times_times_int(s,s)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[21642,2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),6914,theory(equality)]),2327,theory(equality)]) ).
cnf(22541,plain,
ord_less_int(plus_plus_int(one_one_int,times_times_int(s,s)),pls),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3114,2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2080,theory(equality)]),2080,theory(equality)]),2080,theory(equality)]),2080,theory(equality)]),2080,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1022,theory(equality)]),2327,theory(equality)]),1022,theory(equality)]),21643,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2327,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),2080,theory(equality)]),2080,theory(equality)]),2080,theory(equality)]),2080,theory(equality)]),2080,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1384,theory(equality)]),1022,theory(equality)]),2327,theory(equality)]),2726,theory(equality)]),3280,theory(equality)]) ).
cnf(22542,plain,
$false,
inference(sr,[status(thm)],[22541,12958,theory(equality)]) ).
cnf(22543,plain,
$false,
22542,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM924+2 : TPTP v7.0.0. Released v5.3.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n105.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.625MB
% 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Fri Jan 5 15:46:49 CST 2018
% 0.03/0.24 % CPUTime :
% 0.07/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.28 --creating new selector for []
% 0.58/0.94 -running prover on /export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1 with time limit 29
% 0.58/0.94 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpOow0oA/sel_theBenchmark.p_1']
% 0.58/0.94 -prover status Theorem
% 0.58/0.94 Problem theBenchmark.p solved in phase 0.
% 0.58/0.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.58/0.94 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.58/0.94 Solved 1 out of 1.
% 0.58/0.94 # Problem is unsatisfiable (or provable), constructing proof object
% 0.58/0.94 # SZS status Theorem
% 0.58/0.94 # SZS output start CNFRefutation.
% See solution above
% 0.58/0.95 # SZS output end CNFRefutation
%------------------------------------------------------------------------------