TSTP Solution File: RNG126+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG126+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:15:52 EDT 2023
% Result : Theorem 5.66s 1.15s
% Output : CNFRefutation 5.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 45 ( 21 unt; 0 def)
% Number of atoms : 182 ( 16 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 225 ( 88 ~; 86 |; 37 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-3 aty)
% Number of variables : 51 ( 0 sgn; 34 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2273,hypothesis,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p',m__2273) ).
fof(mDefGCD,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ! [X3] :
( aGcdOfAnd0(X3,X1,X2)
<=> ( aDivisorOf0(X3,X1)
& aDivisorOf0(X3,X2)
& ! [X4] :
( ( aDivisorOf0(X4,X1)
& aDivisorOf0(X4,X2) )
=> doDivides0(X4,X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p',mDefGCD) ).
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/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p',mDefIdeal) ).
fof(m__2174,hypothesis,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p',m__2174) ).
fof(mDefDvs,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aElement0(X2)
& doDivides0(X2,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p',mDefDvs) ).
fof(m__2129,hypothesis,
aGcdOfAnd0(xc,xa,xb),
file('/export/starexec/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p',m__2129) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p',m__2091) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p',mMulComm) ).
fof(m__2373,hypothesis,
( aDivisorOf0(xu,xa)
& aDivisorOf0(xu,xb) ),
file('/export/starexec/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p',m__2373) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(X1,X3) = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p',mDefDiv) ).
fof(m__2744,hypothesis,
doDivides0(xu,xc),
file('/export/starexec/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p',m__2744) ).
fof(m__,conjecture,
aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
file('/export/starexec/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p',m__) ).
fof(c_0_12,hypothesis,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
fof(c_0_13,hypothesis,
! [X8] :
( aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X8,xI)
| X8 = sz00
| ~ iLess0(sbrdtbr0(X8),sbrdtbr0(xu)) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_14,plain,
! [X13,X14,X15,X16,X17] :
( ( aDivisorOf0(X15,X13)
| ~ aGcdOfAnd0(X15,X13,X14)
| ~ aElement0(X13)
| ~ aElement0(X14) )
& ( aDivisorOf0(X15,X14)
| ~ aGcdOfAnd0(X15,X13,X14)
| ~ aElement0(X13)
| ~ aElement0(X14) )
& ( ~ aDivisorOf0(X16,X13)
| ~ aDivisorOf0(X16,X14)
| doDivides0(X16,X15)
| ~ aGcdOfAnd0(X15,X13,X14)
| ~ aElement0(X13)
| ~ aElement0(X14) )
& ( aDivisorOf0(esk2_3(X13,X14,X17),X13)
| ~ aDivisorOf0(X17,X13)
| ~ aDivisorOf0(X17,X14)
| aGcdOfAnd0(X17,X13,X14)
| ~ aElement0(X13)
| ~ aElement0(X14) )
& ( aDivisorOf0(esk2_3(X13,X14,X17),X14)
| ~ aDivisorOf0(X17,X13)
| ~ aDivisorOf0(X17,X14)
| aGcdOfAnd0(X17,X13,X14)
| ~ aElement0(X13)
| ~ aElement0(X14) )
& ( ~ doDivides0(esk2_3(X13,X14,X17),X17)
| ~ aDivisorOf0(X17,X13)
| ~ aDivisorOf0(X17,X14)
| aGcdOfAnd0(X17,X13,X14)
| ~ aElement0(X13)
| ~ aElement0(X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefGCD])])])])])]) ).
fof(c_0_15,plain,
! [X47,X48,X49,X50,X51] :
( ( aSet0(X47)
| ~ aIdeal0(X47) )
& ( ~ aElementOf0(X49,X47)
| aElementOf0(sdtpldt0(X48,X49),X47)
| ~ aElementOf0(X48,X47)
| ~ aIdeal0(X47) )
& ( ~ aElement0(X50)
| aElementOf0(sdtasdt0(X50,X48),X47)
| ~ aElementOf0(X48,X47)
| ~ aIdeal0(X47) )
& ( aElementOf0(esk11_1(X51),X51)
| ~ aSet0(X51)
| aIdeal0(X51) )
& ( aElement0(esk13_1(X51))
| aElementOf0(esk12_1(X51),X51)
| ~ aSet0(X51)
| aIdeal0(X51) )
& ( ~ aElementOf0(sdtasdt0(esk13_1(X51),esk11_1(X51)),X51)
| aElementOf0(esk12_1(X51),X51)
| ~ aSet0(X51)
| aIdeal0(X51) )
& ( aElement0(esk13_1(X51))
| ~ aElementOf0(sdtpldt0(esk11_1(X51),esk12_1(X51)),X51)
| ~ aSet0(X51)
| aIdeal0(X51) )
& ( ~ aElementOf0(sdtasdt0(esk13_1(X51),esk11_1(X51)),X51)
| ~ aElementOf0(sdtpldt0(esk11_1(X51),esk12_1(X51)),X51)
| ~ aSet0(X51)
| aIdeal0(X51) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefIdeal])])])])])]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xu,xI),
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,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_19,plain,
! [X60,X61] :
( ( aElement0(X61)
| ~ aDivisorOf0(X61,X60)
| ~ aElement0(X60) )
& ( doDivides0(X61,X60)
| ~ aDivisorOf0(X61,X60)
| ~ aElement0(X60) )
& ( ~ aElement0(X61)
| ~ doDivides0(X61,X60)
| aDivisorOf0(X61,X60)
| ~ aElement0(X60) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDvs])])])]) ).
cnf(c_0_20,plain,
( aDivisorOf0(X1,X2)
| ~ aGcdOfAnd0(X1,X3,X2)
| ~ aElement0(X3)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
aGcdOfAnd0(xc,xa,xb),
inference(split_conjunct,[status(thm)],[m__2129]) ).
cnf(c_0_22,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_23,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_24,plain,
( aElementOf0(sdtasdt0(X1,X2),X3)
| ~ aElement0(X1)
| ~ aElementOf0(X2,X3)
| ~ aIdeal0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,hypothesis,
aElementOf0(xu,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,hypothesis,
aIdeal0(sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
fof(c_0_27,plain,
! [X78,X79] :
( ~ aElement0(X78)
| ~ aElement0(X79)
| sdtasdt0(X78,X79) = sdtasdt0(X79,X78) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
cnf(c_0_28,plain,
( aElement0(X1)
| ~ aDivisorOf0(X1,X2)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,hypothesis,
aDivisorOf0(xu,xa),
inference(split_conjunct,[status(thm)],[m__2373]) ).
fof(c_0_30,plain,
! [X62,X63,X65] :
( ( aElement0(esk16_2(X62,X63))
| ~ doDivides0(X62,X63)
| ~ aElement0(X62)
| ~ aElement0(X63) )
& ( sdtasdt0(X62,esk16_2(X62,X63)) = X63
| ~ doDivides0(X62,X63)
| ~ aElement0(X62)
| ~ aElement0(X63) )
& ( ~ aElement0(X65)
| sdtasdt0(X62,X65) != X63
| doDivides0(X62,X63)
| ~ aElement0(X62)
| ~ aElement0(X63) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])]) ).
cnf(c_0_31,hypothesis,
aDivisorOf0(xc,xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_32,hypothesis,
( aElementOf0(sdtasdt0(X1,xu),sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_33,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22])]) ).
cnf(c_0_35,plain,
( sdtasdt0(X1,esk16_2(X1,X2)) = X2
| ~ doDivides0(X1,X2)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,hypothesis,
doDivides0(xu,xc),
inference(split_conjunct,[status(thm)],[m__2744]) ).
cnf(c_0_37,hypothesis,
aElement0(xc),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_31]),c_0_23])]) ).
cnf(c_0_38,plain,
( aElement0(esk16_2(X1,X2))
| ~ doDivides0(X1,X2)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_39,negated_conjecture,
~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_40,hypothesis,
( aElementOf0(sdtasdt0(xu,X1),sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_41,hypothesis,
sdtasdt0(xu,esk16_2(xu,xc)) = xc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_34])]) ).
cnf(c_0_42,hypothesis,
aElement0(esk16_2(xu,xc)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_36]),c_0_37]),c_0_34])]) ).
cnf(c_0_43,negated_conjecture,
~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : RNG126+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n013.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 19:32:29 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.cnJvT9uXWw/E---3.1_15829.p
% 5.66/1.15 # Version: 3.1pre001
% 5.66/1.15 # Preprocessing class: FSLSSMSSSSSNFFN.
% 5.66/1.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.66/1.15 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.66/1.15 # Starting new_bool_3 with 300s (1) cores
% 5.66/1.15 # Starting new_bool_1 with 300s (1) cores
% 5.66/1.15 # Starting sh5l with 300s (1) cores
% 5.66/1.15 # new_bool_1 with pid 15908 completed with status 0
% 5.66/1.15 # Result found by new_bool_1
% 5.66/1.15 # Preprocessing class: FSLSSMSSSSSNFFN.
% 5.66/1.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.66/1.15 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.66/1.15 # Starting new_bool_3 with 300s (1) cores
% 5.66/1.15 # Starting new_bool_1 with 300s (1) cores
% 5.66/1.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.66/1.15 # Search class: FGHSF-FFMM32-MFFFFFNN
% 5.66/1.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 5.66/1.15 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 5.66/1.15 # G-E--_208_B07_F1_SE_CS_SP_PS_S4d with pid 15911 completed with status 0
% 5.66/1.15 # Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S4d
% 5.66/1.15 # Preprocessing class: FSLSSMSSSSSNFFN.
% 5.66/1.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.66/1.15 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.66/1.15 # Starting new_bool_3 with 300s (1) cores
% 5.66/1.15 # Starting new_bool_1 with 300s (1) cores
% 5.66/1.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.66/1.15 # Search class: FGHSF-FFMM32-MFFFFFNN
% 5.66/1.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 5.66/1.15 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 5.66/1.15 # Preprocessing time : 0.004 s
% 5.66/1.15 # Presaturation interreduction done
% 5.66/1.15
% 5.66/1.15 # Proof found!
% 5.66/1.15 # SZS status Theorem
% 5.66/1.15 # SZS output start CNFRefutation
% See solution above
% 5.66/1.15 # Parsed axioms : 48
% 5.66/1.15 # Removed by relevancy pruning/SinE : 11
% 5.66/1.15 # Initial clauses : 85
% 5.66/1.15 # Removed in clause preprocessing : 4
% 5.66/1.15 # Initial clauses in saturation : 81
% 5.66/1.15 # Processed clauses : 3735
% 5.66/1.15 # ...of these trivial : 630
% 5.66/1.15 # ...subsumed : 1165
% 5.66/1.15 # ...remaining for further processing : 1940
% 5.66/1.15 # Other redundant clauses eliminated : 28
% 5.66/1.15 # Clauses deleted for lack of memory : 0
% 5.66/1.15 # Backward-subsumed : 53
% 5.66/1.15 # Backward-rewritten : 250
% 5.66/1.15 # Generated clauses : 34998
% 5.66/1.15 # ...of the previous two non-redundant : 30653
% 5.66/1.15 # ...aggressively subsumed : 0
% 5.66/1.15 # Contextual simplify-reflections : 138
% 5.66/1.15 # Paramodulations : 34968
% 5.66/1.15 # Factorizations : 2
% 5.66/1.15 # NegExts : 0
% 5.66/1.15 # Equation resolutions : 30
% 5.66/1.15 # Total rewrite steps : 33812
% 5.66/1.15 # Propositional unsat checks : 0
% 5.66/1.15 # Propositional check models : 0
% 5.66/1.15 # Propositional check unsatisfiable : 0
% 5.66/1.15 # Propositional clauses : 0
% 5.66/1.15 # Propositional clauses after purity: 0
% 5.66/1.15 # Propositional unsat core size : 0
% 5.66/1.15 # Propositional preprocessing time : 0.000
% 5.66/1.15 # Propositional encoding time : 0.000
% 5.66/1.15 # Propositional solver time : 0.000
% 5.66/1.15 # Success case prop preproc time : 0.000
% 5.66/1.15 # Success case prop encoding time : 0.000
% 5.66/1.15 # Success case prop solver time : 0.000
% 5.66/1.15 # Current number of processed clauses : 1546
% 5.66/1.15 # Positive orientable unit clauses : 803
% 5.66/1.15 # Positive unorientable unit clauses: 0
% 5.66/1.15 # Negative unit clauses : 3
% 5.66/1.15 # Non-unit-clauses : 740
% 5.66/1.15 # Current number of unprocessed clauses: 26675
% 5.66/1.15 # ...number of literals in the above : 108178
% 5.66/1.15 # Current number of archived formulas : 0
% 5.66/1.15 # Current number of archived clauses : 384
% 5.66/1.15 # Clause-clause subsumption calls (NU) : 38158
% 5.66/1.15 # Rec. Clause-clause subsumption calls : 24781
% 5.66/1.15 # Non-unit clause-clause subsumptions : 1348
% 5.66/1.15 # Unit Clause-clause subsumption calls : 2046
% 5.66/1.15 # Rewrite failures with RHS unbound : 0
% 5.66/1.15 # BW rewrite match attempts : 6160
% 5.66/1.15 # BW rewrite match successes : 162
% 5.66/1.15 # Condensation attempts : 0
% 5.66/1.15 # Condensation successes : 0
% 5.66/1.15 # Termbank termtop insertions : 738546
% 5.66/1.15
% 5.66/1.15 # -------------------------------------------------
% 5.66/1.15 # User time : 0.655 s
% 5.66/1.15 # System time : 0.027 s
% 5.66/1.15 # Total time : 0.682 s
% 5.66/1.15 # Maximum resident set size: 2016 pages
% 5.66/1.15
% 5.66/1.15 # -------------------------------------------------
% 5.66/1.15 # User time : 0.659 s
% 5.66/1.15 # System time : 0.027 s
% 5.66/1.15 # Total time : 0.686 s
% 5.66/1.15 # Maximum resident set size: 1744 pages
% 5.66/1.15 % E---3.1 exiting
%------------------------------------------------------------------------------