TSTP Solution File: NUM924+8 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM924+8 : TPTP v7.0.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n112.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:41 EST 2018
% Result : Theorem 82.02s
% Output : CNFRefutation 82.11s
% Verified :
% SZS Type : None (Could not find formula named 1ity))
% Syntax : Number of formulae : 66
% Comments :
%------------------------------------------------------------------------------
fof(13,axiom,
equal(hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_1427_semiring__norm_I115_J) ).
fof(358,conjecture,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',conj_0) ).
fof(609,axiom,
! [X14] : equal(hAPP(int,int,succ,hAPP(int,int,pred,X14)),ti(int,X14)),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_2899_succ__pred) ).
fof(750,axiom,
equal(zero_zero(nat),hAPP(int,nat,nat_1,zero_zero(int))),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_1102_transfer__nat__int__numerals_I1_J) ).
fof(1143,axiom,
equal(hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))),hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat)))),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_1452_nat__2) ).
fof(1408,axiom,
! [X21,X22] : equal(hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,bit0,X21)),X22),hAPP(int,int,bit0,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X21),X22))),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_63_mult__Bit0) ).
fof(1600,axiom,
equal(hAPP(int,int,bit0,pls),pls),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_122_Bit0__Pls) ).
fof(1607,axiom,
! [X26,X47] : equal(hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X26),X47),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X47),X26)),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_23_zmult__commute) ).
fof(2152,axiom,
! [X47] : equal(hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X47),pls),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_62_mult__Pls) ).
fof(2196,axiom,
! [X21] : equal(hAPP(int,int,succ,hAPP(int,int,bit1,X21)),hAPP(int,int,bit0,hAPP(int,int,succ,X21))),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_1526_succ__Bit1) ).
fof(3982,axiom,
equal(hAPP(int,int,succ,pls),hAPP(int,int,bit1,pls)),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_1525_succ__Pls) ).
fof(4236,axiom,
! [X21] : equal(hAPP(int,int,succ,X21),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X21),one_one(int))),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_1528_succ__def) ).
fof(4251,axiom,
! [X21] : equal(hAPP(int,int,succ,hAPP(int,int,bit0,X21)),hAPP(int,int,bit1,X21)),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_1527_succ__Bit0) ).
fof(4273,axiom,
! [X21] : equal(hAPP(int,int,number_number_of(int),X21),ti(int,X21)),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_22_number__of__is__id) ).
fof(4420,axiom,
! [X21] : equal(hAPP(int,int,pred,hAPP(int,int,bit1,X21)),hAPP(int,int,bit0,X21)),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_2900_pred__Bit1) ).
fof(4601,axiom,
equal(pls,zero_zero(int)),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_123_Pls__def) ).
fof(4882,axiom,
! [X21] : equal(hAPP(int,int,pred,hAPP(int,int,bit0,X21)),hAPP(int,int,bit1,hAPP(int,int,pred,X21))),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_2901_pred__Bit0) ).
fof(4953,axiom,
equal(hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t)),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',fact_3_t) ).
fof(5130,axiom,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),zero_zero(int)))),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',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(5338,axiom,
! [X1,X111] : equal(hAPP(X1,X1,combi(X1),X111),ti(X1,X111)),
file('/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2',help_COMBI_1_1_U) ).
fof(5739,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
inference(assume_negation,[status(cth)],[358]) ).
fof(5766,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
inference(fof_simplification,[status(thm)],[5739,theory(equality)]) ).
cnf(6186,plain,
hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))) = hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(7389,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
inference(split_conjunct,[status(thm)],[5766]) ).
fof(8261,plain,
! [X15] : equal(hAPP(int,int,succ,hAPP(int,int,pred,X15)),ti(int,X15)),
inference(variable_rename,[status(thm)],[609]) ).
cnf(8262,plain,
hAPP(int,int,succ,hAPP(int,int,pred,X1)) = ti(int,X1),
inference(split_conjunct,[status(thm)],[8261]) ).
cnf(8770,plain,
zero_zero(nat) = hAPP(int,nat,nat_1,zero_zero(int)),
inference(split_conjunct,[status(thm)],[750]) ).
cnf(10180,plain,
hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))) = hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))),
inference(split_conjunct,[status(thm)],[1143]) ).
fof(11120,plain,
! [X23,X24] : equal(hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,bit0,X23)),X24),hAPP(int,int,bit0,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X23),X24))),
inference(variable_rename,[status(thm)],[1408]) ).
cnf(11121,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,bit0,X1)),X2) = hAPP(int,int,bit0,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X1),X2)),
inference(split_conjunct,[status(thm)],[11120]) ).
cnf(11830,plain,
hAPP(int,int,bit0,pls) = pls,
inference(split_conjunct,[status(thm)],[1600]) ).
fof(11851,plain,
! [X48,X49] : equal(hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X48),X49),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X49),X48)),
inference(variable_rename,[status(thm)],[1607]) ).
cnf(11852,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X1),X2) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X2),X1),
inference(split_conjunct,[status(thm)],[11851]) ).
fof(13891,plain,
! [X48] : equal(hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X48),pls),
inference(variable_rename,[status(thm)],[2152]) ).
cnf(13892,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X1) = pls,
inference(split_conjunct,[status(thm)],[13891]) ).
fof(14023,plain,
! [X22] : equal(hAPP(int,int,succ,hAPP(int,int,bit1,X22)),hAPP(int,int,bit0,hAPP(int,int,succ,X22))),
inference(variable_rename,[status(thm)],[2196]) ).
cnf(14024,plain,
hAPP(int,int,succ,hAPP(int,int,bit1,X1)) = hAPP(int,int,bit0,hAPP(int,int,succ,X1)),
inference(split_conjunct,[status(thm)],[14023]) ).
cnf(20477,plain,
hAPP(int,int,succ,pls) = hAPP(int,int,bit1,pls),
inference(split_conjunct,[status(thm)],[3982]) ).
fof(21364,plain,
! [X22] : equal(hAPP(int,int,succ,X22),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X22),one_one(int))),
inference(variable_rename,[status(thm)],[4236]) ).
cnf(21365,plain,
hAPP(int,int,succ,X1) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X1),one_one(int)),
inference(split_conjunct,[status(thm)],[21364]) ).
fof(21418,plain,
! [X22] : equal(hAPP(int,int,succ,hAPP(int,int,bit0,X22)),hAPP(int,int,bit1,X22)),
inference(variable_rename,[status(thm)],[4251]) ).
cnf(21419,plain,
hAPP(int,int,succ,hAPP(int,int,bit0,X1)) = hAPP(int,int,bit1,X1),
inference(split_conjunct,[status(thm)],[21418]) ).
fof(21510,plain,
! [X22] : equal(hAPP(int,int,number_number_of(int),X22),ti(int,X22)),
inference(variable_rename,[status(thm)],[4273]) ).
cnf(21511,plain,
hAPP(int,int,number_number_of(int),X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[21510]) ).
fof(21974,plain,
! [X22] : equal(hAPP(int,int,pred,hAPP(int,int,bit1,X22)),hAPP(int,int,bit0,X22)),
inference(variable_rename,[status(thm)],[4420]) ).
cnf(21975,plain,
hAPP(int,int,pred,hAPP(int,int,bit1,X1)) = hAPP(int,int,bit0,X1),
inference(split_conjunct,[status(thm)],[21974]) ).
cnf(22589,plain,
pls = zero_zero(int),
inference(split_conjunct,[status(thm)],[4601]) ).
fof(23632,plain,
! [X22] : equal(hAPP(int,int,pred,hAPP(int,int,bit0,X22)),hAPP(int,int,bit1,hAPP(int,int,pred,X22))),
inference(variable_rename,[status(thm)],[4882]) ).
cnf(23633,plain,
hAPP(int,int,pred,hAPP(int,int,bit0,X1)) = hAPP(int,int,bit1,hAPP(int,int,pred,X1)),
inference(split_conjunct,[status(thm)],[23632]) ).
cnf(24010,plain,
hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int)) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t),
inference(split_conjunct,[status(thm)],[4953]) ).
cnf(24658,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),zero_zero(int)))),
inference(split_conjunct,[status(thm)],[5130]) ).
fof(25417,plain,
! [X112,X113] : equal(hAPP(X112,X112,combi(X112),X113),ti(X112,X113)),
inference(variable_rename,[status(thm)],[5338]) ).
cnf(25418,plain,
hAPP(X1,X1,combi(X1),X2) = ti(X1,X2),
inference(split_conjunct,[status(thm)],[25417]) ).
cnf(27045,plain,
hAPP(int,int,number_number_of(int),X1) = hAPP(int,int,combi(int),X1),
inference(rw,[status(thm)],[21511,25418,theory(equality)]),
[unfolding] ).
cnf(27135,plain,
hAPP(int,int,succ,hAPP(int,int,pred,X1)) = hAPP(int,int,combi(int),X1),
inference(rw,[status(thm)],[8262,25418,theory(equality)]),
[unfolding] ).
cnf(28316,plain,
hAPP(int,nat,nat_1,pls) = zero_zero(nat),
inference(rw,[status(thm)],[8770,22589,theory(equality)]) ).
cnf(30112,plain,
hAPP(int,int,succ,hAPP(int,int,pred,X1)) = hAPP(int,int,number_number_of(int),X1),
inference(rw,[status(thm)],[27135,27045,theory(equality)]) ).
cnf(31921,plain,
hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))) = hAPP(nat,nat,suc,hAPP(nat,nat,suc,hAPP(int,nat,nat_1,pls))),
inference(rw,[status(thm)],[6186,28316,theory(equality)]) ).
cnf(35312,plain,
hAPP(int,nat,nat_1,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))) = hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[10180,30112,theory(equality)]),23633,theory(equality)]),21975,theory(equality)]),11830,theory(equality)]),14024,theory(equality)]),20477,theory(equality)]) ).
cnf(35313,plain,
hAPP(int,nat,nat_1,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))) = hAPP(nat,nat,suc,hAPP(nat,nat,suc,hAPP(int,nat,nat_1,pls))),
inference(rw,[status(thm)],[35312,28316,theory(equality)]) ).
cnf(188128,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,succ,hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,nat_1,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))))),pls)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[7389,31921,theory(equality)]),35313,theory(equality)]),21365,theory(equality)]),22589,theory(equality)]) ).
cnf(470649,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),t),hAPP(int,int,bit1,hAPP(int,int,bit0,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),m),hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,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)],[24010,30112,theory(equality)]),23633,theory(equality)]),23633,theory(equality)]),21975,theory(equality)]),11830,theory(equality)]),14024,theory(equality)]),14024,theory(equality)]),20477,theory(equality)]),11121,theory(equality)]),11121,theory(equality)]),11852,theory(equality)]),21365,theory(equality)]),21419,theory(equality)]),11852,theory(equality)]) ).
cnf(470650,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),t),hAPP(int,int,bit1,hAPP(int,int,bit0,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),m),hAPP(int,int,bit1,pls))))) = hAPP(int,int,succ,hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,nat_1,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[470649,31921,theory(equality)]),35313,theory(equality)]),21365,theory(equality)]) ).
cnf(710699,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,succ,hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,nat_1,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))))),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)],[24658,30112,theory(equality)]),23633,theory(equality)]),23633,theory(equality)]),21975,theory(equality)]),11830,theory(equality)]),14024,theory(equality)]),14024,theory(equality)]),20477,theory(equality)]),11121,theory(equality)]),11121,theory(equality)]),11852,theory(equality)]),21365,theory(equality)]),21419,theory(equality)]),11852,theory(equality)]),470650,theory(equality)]),30112,theory(equality)]),23633,theory(equality)]),23633,theory(equality)]),21975,theory(equality)]),11830,theory(equality)]),14024,theory(equality)]),14024,theory(equality)]),20477,theory(equality)]),11121,theory(equality)]),11121,theory(equality)]),11852,theory(equality)]),21365,theory(equality)]),21419,theory(equality)]),22589,theory(equality)]),11852,theory(equality)]),13892,theory(equality)]) ).
cnf(710700,plain,
$false,
inference(sr,[status(thm)],[710699,188128,theory(equality)]) ).
cnf(710701,plain,
$false,
710700,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM924+8 : TPTP v7.0.0. Released v5.3.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n112.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 15:57:49 CST 2018
% 0.03/0.23 % CPUTime :
% 0.07/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.31 --creating new selector for []
% 29.69/30.11 eprover: CPU time limit exceeded, terminating
% 82.02/82.84 -running prover on /export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_1 with time limit 29
% 82.02/82.84 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_1']
% 82.02/82.84 -prover status ResourceOut
% 82.02/82.84 -running prover on /export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2 with time limit 80
% 82.02/82.84 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=80', '/export/starexec/sandbox/tmp/tmpGxYqON/sel_theBenchmark.p_2']
% 82.02/82.84 -prover status Theorem
% 82.02/82.84 Problem theBenchmark.p solved in phase 1.
% 82.02/82.84 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 82.02/82.84 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 82.02/82.84 Solved 1 out of 1.
% 82.02/82.84 # Problem is unsatisfiable (or provable), constructing proof object
% 82.02/82.84 # SZS status Theorem
% 82.02/82.84 # SZS output start CNFRefutation.
% See solution above
% 82.11/82.86 # SZS output end CNFRefutation
%------------------------------------------------------------------------------