TSTP Solution File: RNG121+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : RNG121+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 20:26:59 EDT 2022
% Result : Theorem 0.33s 23.52s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 49 ( 13 unt; 0 def)
% Number of atoms : 247 ( 62 equ)
% Maximal formula atoms : 52 ( 5 avg)
% Number of connectives : 330 ( 132 ~; 144 |; 40 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 5 con; 0-4 aty)
% Number of variables : 88 ( 5 sgn 41 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSSum,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aSet0(X2) )
=> ! [X3] :
( X3 = sdtpldt1(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ? [X5,X6] :
( aElementOf0(X5,X1)
& aElementOf0(X6,X2)
& sdtpldt0(X5,X6) = X4 ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSSum) ).
fof(mDefIdeal,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefIdeal) ).
fof(mPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> aIdeal0(slsdtgt0(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mPrIdeal) ).
fof(m__2174,hypothesis,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2174) ).
fof(mDefPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( aElement0(X4)
& sdtasdt0(X1,X4) = X3 ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefPrIdeal) ).
fof(mMulUnit,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulUnit) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2091) ).
fof(mMulZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulZero) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsC_01) ).
fof(mSortsC,axiom,
aElement0(sz00),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsC) ).
fof(m__2203,hypothesis,
( aElementOf0(sz00,slsdtgt0(xa))
& aElementOf0(xa,slsdtgt0(xa))
& aElementOf0(sz00,slsdtgt0(xb))
& aElementOf0(xb,slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2203) ).
fof(m__,conjecture,
aElementOf0(xb,xI),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddZero) ).
fof(c_0_13,plain,
! [X7,X8,X9,X10,X10,X13,X14,X9,X16,X17] :
( ( aSet0(X9)
| X9 != sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( aElementOf0(esk3_4(X7,X8,X9,X10),X7)
| ~ aElementOf0(X10,X9)
| X9 != sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( aElementOf0(esk4_4(X7,X8,X9,X10),X8)
| ~ aElementOf0(X10,X9)
| X9 != sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( sdtpldt0(esk3_4(X7,X8,X9,X10),esk4_4(X7,X8,X9,X10)) = X10
| ~ aElementOf0(X10,X9)
| X9 != sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( ~ aElementOf0(X13,X7)
| ~ aElementOf0(X14,X8)
| sdtpldt0(X13,X14) != X10
| aElementOf0(X10,X9)
| X9 != sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( ~ aElementOf0(esk5_3(X7,X8,X9),X9)
| ~ aElementOf0(X16,X7)
| ~ aElementOf0(X17,X8)
| sdtpldt0(X16,X17) != esk5_3(X7,X8,X9)
| ~ aSet0(X9)
| X9 = sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( aElementOf0(esk6_3(X7,X8,X9),X7)
| aElementOf0(esk5_3(X7,X8,X9),X9)
| ~ aSet0(X9)
| X9 = sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( aElementOf0(esk7_3(X7,X8,X9),X8)
| aElementOf0(esk5_3(X7,X8,X9),X9)
| ~ aSet0(X9)
| X9 = sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) )
& ( sdtpldt0(esk6_3(X7,X8,X9),esk7_3(X7,X8,X9)) = esk5_3(X7,X8,X9)
| aElementOf0(esk5_3(X7,X8,X9),X9)
| ~ aSet0(X9)
| X9 = sdtpldt1(X7,X8)
| ~ aSet0(X7)
| ~ aSet0(X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSSum])])])])])])]) ).
fof(c_0_14,plain,
! [X4,X5,X6,X7,X4] :
( ( aSet0(X4)
| ~ aIdeal0(X4) )
& ( ~ aElementOf0(X6,X4)
| aElementOf0(sdtpldt0(X5,X6),X4)
| ~ aElementOf0(X5,X4)
| ~ aIdeal0(X4) )
& ( ~ aElement0(X7)
| aElementOf0(sdtasdt0(X7,X5),X4)
| ~ aElementOf0(X5,X4)
| ~ aIdeal0(X4) )
& ( aElementOf0(esk9_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( aElement0(esk11_1(X4))
| aElementOf0(esk10_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( ~ aElementOf0(sdtasdt0(esk11_1(X4),esk9_1(X4)),X4)
| aElementOf0(esk10_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( aElement0(esk11_1(X4))
| ~ aElementOf0(sdtpldt0(esk9_1(X4),esk10_1(X4)),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( ~ aElementOf0(sdtasdt0(esk11_1(X4),esk9_1(X4)),X4)
| ~ aElementOf0(sdtpldt0(esk9_1(X4),esk10_1(X4)),X4)
| ~ aSet0(X4)
| aIdeal0(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefIdeal])])])])])])]) ).
fof(c_0_15,plain,
! [X2] :
( ~ aElement0(X2)
| aIdeal0(slsdtgt0(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mPrIdeal])]) ).
cnf(c_0_16,plain,
( aElementOf0(X4,X3)
| ~ aSet0(X1)
| ~ aSet0(X2)
| X3 != sdtpldt1(X2,X1)
| sdtpldt0(X5,X6) != X4
| ~ aElementOf0(X6,X1)
| ~ aElementOf0(X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,hypothesis,
xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2174]) ).
cnf(c_0_18,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( aIdeal0(slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( aSet0(X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( aElement0(esk18_3(X5,X6,X7))
| ~ aElementOf0(X7,X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( sdtasdt0(X5,esk18_3(X5,X6,X7)) = X7
| ~ aElementOf0(X7,X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( ~ aElement0(X9)
| sdtasdt0(X5,X9) != X7
| aElementOf0(X7,X6)
| X6 != slsdtgt0(X5)
| ~ aElement0(X5) )
& ( ~ aElementOf0(esk19_2(X5,X6),X6)
| ~ aElement0(X11)
| sdtasdt0(X5,X11) != esk19_2(X5,X6)
| ~ aSet0(X6)
| X6 = slsdtgt0(X5)
| ~ aElement0(X5) )
& ( aElement0(esk20_2(X5,X6))
| aElementOf0(esk19_2(X5,X6),X6)
| ~ aSet0(X6)
| X6 = slsdtgt0(X5)
| ~ aElement0(X5) )
& ( sdtasdt0(X5,esk20_2(X5,X6)) = esk19_2(X5,X6)
| aElementOf0(esk19_2(X5,X6),X6)
| ~ aSet0(X6)
| X6 = slsdtgt0(X5)
| ~ aElement0(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefPrIdeal])])])])])])]) ).
fof(c_0_21,plain,
! [X2] :
( ( sdtasdt0(X2,sz10) = X2
| ~ aElement0(X2) )
& ( X2 = sdtasdt0(sz10,X2)
| ~ aElement0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulUnit])])]) ).
cnf(c_0_22,hypothesis,
( aElementOf0(X1,X2)
| sdtpldt0(X3,X4) != X1
| X2 != xI
| ~ aElementOf0(X4,slsdtgt0(xb))
| ~ aElementOf0(X3,slsdtgt0(xa))
| ~ aSet0(slsdtgt0(xa))
| ~ aSet0(slsdtgt0(xb)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( aSet0(slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
fof(c_0_25,plain,
! [X2] :
( ( sdtasdt0(X2,sz00) = sz00
| ~ aElement0(X2) )
& ( sz00 = sdtasdt0(sz00,X2)
| ~ aElement0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulZero])])]) ).
cnf(c_0_26,plain,
( aElementOf0(X3,X2)
| ~ aElement0(X1)
| X2 != slsdtgt0(X1)
| sdtasdt0(X1,X4) != X3
| ~ aElement0(X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_29,hypothesis,
( aElementOf0(X1,X2)
| sdtpldt0(X3,X4) != X1
| X2 != xI
| ~ aElementOf0(X4,slsdtgt0(xb))
| ~ aElementOf0(X3,slsdtgt0(xa))
| ~ aSet0(slsdtgt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_30,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_31,plain,
( aElementOf0(sdtasdt0(X3,X2),X1)
| ~ aIdeal0(X1)
| ~ aElementOf0(X2,X1)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,plain,
( sz00 = sdtasdt0(sz00,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
aElement0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_34,plain,
( aElementOf0(X1,X2)
| X2 != slsdtgt0(X1)
| ~ aElement0(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])])]) ).
cnf(c_0_35,hypothesis,
( aElementOf0(X1,X2)
| sdtpldt0(X3,X4) != X1
| X2 != xI
| ~ aElementOf0(X4,slsdtgt0(xb))
| ~ aElementOf0(X3,slsdtgt0(xa)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_23]),c_0_30])]) ).
cnf(c_0_36,hypothesis,
aElementOf0(xb,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2203]) ).
cnf(c_0_37,plain,
( aElementOf0(sz00,X1)
| ~ aIdeal0(X1)
| ~ aElementOf0(X2,X1)
| ~ aElement0(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_38,plain,
( aElementOf0(X1,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_34]) ).
fof(c_0_39,negated_conjecture,
~ aElementOf0(xb,xI),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_40,hypothesis,
( aElementOf0(X1,X2)
| sdtpldt0(X3,xb) != X1
| X2 != xI
| ~ aElementOf0(X3,slsdtgt0(xa)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( aElementOf0(sz00,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_19]) ).
fof(c_0_42,plain,
! [X2] :
( ( sdtpldt0(X2,sz00) = X2
| ~ aElement0(X2) )
& ( X2 = sdtpldt0(sz00,X2)
| ~ aElement0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])]) ).
fof(c_0_43,negated_conjecture,
~ aElementOf0(xb,xI),
inference(fof_simplification,[status(thm)],[c_0_39]) ).
cnf(c_0_44,hypothesis,
( aElementOf0(X1,X2)
| sdtpldt0(sz00,xb) != X1
| X2 != xI ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_24])]) ).
cnf(c_0_45,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_46,negated_conjecture,
~ aElementOf0(xb,xI),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_47,hypothesis,
( aElementOf0(X1,X2)
| xb != X1
| X2 != xI ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_30])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_46,c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG121+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 13:25:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.33/23.40 eprover: CPU time limit exceeded, terminating
% 0.33/23.40 eprover: CPU time limit exceeded, terminating
% 0.33/23.40 eprover: CPU time limit exceeded, terminating
% 0.33/23.40 eprover: CPU time limit exceeded, terminating
% 0.33/23.52 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.33/23.52
% 0.33/23.52 # Failure: Resource limit exceeded (time)
% 0.33/23.52 # OLD status Res
% 0.33/23.52 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.33/23.52 # Preprocessing time : 0.020 s
% 0.33/23.52 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.33/23.52 # Preprocessing time : 0.021 s
% 0.33/23.52
% 0.33/23.52 # Proof found!
% 0.33/23.52 # SZS status Theorem
% 0.33/23.52 # SZS output start CNFRefutation
% See solution above
% 0.33/23.52 # Proof object total steps : 49
% 0.33/23.52 # Proof object clause steps : 27
% 0.33/23.52 # Proof object formula steps : 22
% 0.33/23.52 # Proof object conjectures : 5
% 0.33/23.52 # Proof object clause conjectures : 2
% 0.33/23.52 # Proof object formula conjectures : 3
% 0.33/23.52 # Proof object initial clauses used : 15
% 0.33/23.52 # Proof object initial formulas used : 13
% 0.33/23.52 # Proof object generating inferences : 12
% 0.33/23.52 # Proof object simplifying inferences : 14
% 0.33/23.52 # Training examples: 0 positive, 0 negative
% 0.33/23.52 # Parsed axioms : 53
% 0.33/23.52 # Removed by relevancy pruning/SinE : 0
% 0.33/23.52 # Initial clauses : 121
% 0.33/23.52 # Removed in clause preprocessing : 4
% 0.33/23.52 # Initial clauses in saturation : 117
% 0.33/23.52 # Processed clauses : 598
% 0.33/23.52 # ...of these trivial : 22
% 0.33/23.52 # ...subsumed : 188
% 0.33/23.52 # ...remaining for further processing : 388
% 0.33/23.52 # Other redundant clauses eliminated : 18
% 0.33/23.52 # Clauses deleted for lack of memory : 0
% 0.33/23.52 # Backward-subsumed : 52
% 0.33/23.52 # Backward-rewritten : 11
% 0.33/23.52 # Generated clauses : 1902
% 0.33/23.52 # ...of the previous two non-trivial : 1603
% 0.33/23.52 # Contextual simplify-reflections : 118
% 0.33/23.52 # Paramodulations : 1855
% 0.33/23.52 # Factorizations : 0
% 0.33/23.52 # Equation resolutions : 47
% 0.33/23.52 # Current number of processed clauses : 325
% 0.33/23.52 # Positive orientable unit clauses : 59
% 0.33/23.52 # Positive unorientable unit clauses: 0
% 0.33/23.52 # Negative unit clauses : 10
% 0.33/23.52 # Non-unit-clauses : 256
% 0.33/23.52 # Current number of unprocessed clauses: 986
% 0.33/23.52 # ...number of literals in the above : 5189
% 0.33/23.52 # Current number of archived formulas : 0
% 0.33/23.52 # Current number of archived clauses : 63
% 0.33/23.52 # Clause-clause subsumption calls (NU) : 16025
% 0.33/23.52 # Rec. Clause-clause subsumption calls : 6829
% 0.33/23.52 # Non-unit clause-clause subsumptions : 341
% 0.33/23.52 # Unit Clause-clause subsumption calls : 452
% 0.33/23.52 # Rewrite failures with RHS unbound : 0
% 0.33/23.52 # BW rewrite match attempts : 13
% 0.33/23.52 # BW rewrite match successes : 11
% 0.33/23.52 # Condensation attempts : 0
% 0.33/23.52 # Condensation successes : 0
% 0.33/23.52 # Termbank termtop insertions : 35132
% 0.33/23.52
% 0.33/23.52 # -------------------------------------------------
% 0.33/23.52 # User time : 0.075 s
% 0.33/23.52 # System time : 0.007 s
% 0.33/23.52 # Total time : 0.082 s
% 0.33/23.52 # Maximum resident set size: 5024 pages
% 0.33/46.42 eprover: CPU time limit exceeded, terminating
% 0.33/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.33/46.44 eprover: No such file or directory
% 0.33/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.33/46.44 eprover: No such file or directory
% 0.33/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.33/46.45 eprover: No such file or directory
% 0.33/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.33/46.45 eprover: No such file or directory
% 0.33/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.33/46.46 eprover: No such file or directory
% 0.33/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.33/46.47 eprover: No such file or directory
% 0.33/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.33/46.47 eprover: No such file or directory
% 0.33/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.33/46.48 eprover: No such file or directory
% 0.33/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.33/46.48 eprover: No such file or directory
% 0.33/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.33/46.49 eprover: No such file or directory
%------------------------------------------------------------------------------