%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG126+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:05:57 PM UTC 2026
% Result : Theorem 0.17s 0.68s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 48 ( 20 unt; 0 def)
% Number of atoms : 198 ( 15 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 253 ( 103 ~; 98 |; 36 &)
% ( 4 <=>; 12 =>; 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 : 62 ( 0 sgn 38 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefIdeal,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) )
& ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) ) ) )
& aSet0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefIdeal) ).
fof(m__,conjecture,
aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2174,hypothesis,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& aIdeal0(xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2174) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
fof(m__2273,hypothesis,
( ! [X1] :
( ( X1 != sz00
& aElementOf0(X1,xI) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2273) ).
fof(mDefGCD,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> ! [X3] :
( aGcdOfAnd0(X3,X1,X2)
<=> ( ! [X4] :
( ( aDivisorOf0(X4,X2)
& aDivisorOf0(X4,X1) )
=> doDivides0(X4,X3) )
& aDivisorOf0(X3,X2)
& aDivisorOf0(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefGCD) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( sdtasdt0(X1,X3) = X2
& aElement0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiv) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(mDefDvs,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( doDivides0(X2,X1)
& aElement0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDvs) ).
fof(m__2129,hypothesis,
aGcdOfAnd0(xc,xa,xb),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2129) ).
fof(m__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).
fof(m__2744,hypothesis,
doDivides0(xu,xc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2744) ).
fof(c_0_12,plain,
! [X48,X49,X50,X51,X52] :
( ( aIdeal0(X52)
| ~ aSet0(X52)
| ~ aElementOf0(sdtpldt0(esk11_1(X52),esk12_1(X52)),X52)
| ~ aElementOf0(sdtasdt0(esk13_1(X52),esk11_1(X52)),X52) )
& ( aIdeal0(X52)
| ~ aSet0(X52)
| ~ aElementOf0(sdtpldt0(esk11_1(X52),esk12_1(X52)),X52)
| aElement0(esk13_1(X52)) )
& ( aIdeal0(X52)
| ~ aSet0(X52)
| aElementOf0(esk12_1(X52),X52)
| ~ aElementOf0(sdtasdt0(esk13_1(X52),esk11_1(X52)),X52) )
& ( aIdeal0(X52)
| ~ aSet0(X52)
| aElementOf0(esk12_1(X52),X52)
| aElement0(esk13_1(X52)) )
& ( aIdeal0(X52)
| ~ aSet0(X52)
| aElementOf0(esk11_1(X52),X52) )
& ( ~ aIdeal0(X48)
| ~ aElementOf0(X49,X48)
| aElementOf0(sdtasdt0(X51,X49),X48)
| ~ aElement0(X51) )
& ( ~ aIdeal0(X48)
| ~ aElementOf0(X49,X48)
| aElementOf0(sdtpldt0(X49,X50),X48)
| ~ aElementOf0(X50,X48) )
& ( ~ aIdeal0(X48)
| aSet0(X48) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).
fof(c_0_13,negated_conjecture,
~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_14,plain,
( ~ aIdeal0(X3)
| ~ aElementOf0(X2,X3)
| ~ aElement0(X1)
| aElementOf0(sdtasdt0(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_16,plain,
! [X81,X82] :
( sdtasdt0(X81,X82) = sdtasdt0(X82,X81)
| ~ aElement0(X82)
| ~ aElement0(X81) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
fof(c_0_17,hypothesis,
( ! [X1] :
( ( X1 != sz00
& aElementOf0(X1,xI) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
fof(c_0_18,plain,
! [X14,X15,X16,X17,X18] :
( ( ~ aElement0(X15)
| ~ aElement0(X14)
| aGcdOfAnd0(X18,X14,X15)
| ~ aDivisorOf0(X18,X15)
| ~ aDivisorOf0(X18,X14)
| ~ doDivides0(esk2_3(X14,X15,X18),X18) )
& ( ~ aElement0(X15)
| ~ aElement0(X14)
| aGcdOfAnd0(X18,X14,X15)
| ~ aDivisorOf0(X18,X15)
| ~ aDivisorOf0(X18,X14)
| aDivisorOf0(esk2_3(X14,X15,X18),X15) )
& ( ~ aElement0(X15)
| ~ aElement0(X14)
| aGcdOfAnd0(X18,X14,X15)
| ~ aDivisorOf0(X18,X15)
| ~ aDivisorOf0(X18,X14)
| aDivisorOf0(esk2_3(X14,X15,X18),X14) )
& ( ~ aElement0(X15)
| ~ aElement0(X14)
| ~ aGcdOfAnd0(X16,X14,X15)
| doDivides0(X17,X16)
| ~ aDivisorOf0(X17,X15)
| ~ aDivisorOf0(X17,X14) )
& ( ~ aElement0(X15)
| ~ aElement0(X14)
| ~ aGcdOfAnd0(X16,X14,X15)
| aDivisorOf0(X16,X15) )
& ( ~ aElement0(X15)
| ~ aElement0(X14)
| ~ aGcdOfAnd0(X16,X14,X15)
| aDivisorOf0(X16,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_19,negated_conjecture,
~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
cnf(c_0_20,hypothesis,
( ~ aElement0(X1)
| ~ aElementOf0(X2,xI)
| aElementOf0(sdtasdt0(X1,X2),xI) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X65,X66,X68] :
( ( ~ aElement0(X66)
| ~ aElement0(X65)
| doDivides0(X65,X66)
| sdtasdt0(X65,X68) != X66
| ~ aElement0(X68) )
& ( ~ aElement0(X66)
| ~ aElement0(X65)
| ~ doDivides0(X65,X66)
| sdtasdt0(X65,esk16_2(X65,X66)) = X66 )
& ( ~ aElement0(X66)
| ~ aElement0(X65)
| ~ doDivides0(X65,X66)
| aElement0(esk16_2(X65,X66)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])])]) ).
fof(c_0_23,plain,
! [X87,X88] :
( aElement0(X88)
| ~ aElementOf0(X88,X87)
| ~ aSet0(X87) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_24,hypothesis,
! [X8] :
( ( ~ iLess0(sbrdtbr0(X8),sbrdtbr0(xu))
| X8 = sz00
| ~ aElementOf0(X8,xI) )
& xu != sz00
& aElementOf0(xu,xI) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_25,plain,
( ~ aIdeal0(X1)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_26,plain,
! [X63,X64] :
( ( ~ aElement0(X63)
| aDivisorOf0(X64,X63)
| ~ doDivides0(X64,X63)
| ~ aElement0(X64) )
& ( ~ aElement0(X63)
| ~ aDivisorOf0(X64,X63)
| doDivides0(X64,X63) )
& ( ~ aElement0(X63)
| ~ aDivisorOf0(X64,X63)
| aElement0(X64) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDvs])])])])]) ).
cnf(c_0_27,plain,
( ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aGcdOfAnd0(X1,X3,X2)
| aDivisorOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,hypothesis,
aGcdOfAnd0(xc,xa,xb),
inference(split_conjunct,[status(thm)],[m__2129]) ).
cnf(c_0_29,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_30,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
fof(c_0_31,negated_conjecture,
~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
cnf(c_0_32,hypothesis,
( ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElementOf0(X1,xI)
| aElementOf0(sdtasdt0(X1,X2),xI) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_33,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| ~ doDivides0(X1,X2)
| sdtasdt0(X1,esk16_2(X1,X2)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| ~ doDivides0(X1,X2)
| aElement0(esk16_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_35,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_36,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_38,plain,
( ~ aElement0(X2)
| ~ aDivisorOf0(X1,X2)
| aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,hypothesis,
aDivisorOf0(xc,xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_40,negated_conjecture,
~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,hypothesis,
xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2174]) ).
cnf(c_0_42,hypothesis,
( ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElementOf0(X2,xI)
| ~ doDivides0(X2,X1)
| aElementOf0(X1,xI) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_43,hypothesis,
doDivides0(xu,xc),
inference(split_conjunct,[status(thm)],[m__2744]) ).
cnf(c_0_44,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_45,hypothesis,
aElement0(xc),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_30])]) ).
cnf(c_0_46,negated_conjecture,
~ aElementOf0(xc,xI),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_36]),c_0_44]),c_0_45])]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG126+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.59 % Computer : n004.cluster.edu
% 0.13/0.59 % Model : x86_64 x86_64
% 0.13/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.59 % Memory : 8046.5625MB
% 0.13/0.59 % OS : Linux 6.8.0-71-generic
% 0.13/0.59 % CPULimit : 300
% 0.13/0.59 % WCLimit : 300
% 0.13/0.59 % DateTime : Mon Sep 21 04:21:36 UTC 2026
% 0.13/0.59 % CPUTime :
% 0.13/0.59 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.64 Running first-order theorem proving
% 0.17/0.64 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.68 % Version: 3.5.1
% 0.17/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.68 % Starting sh5l with 300s (1) cores
% 0.17/0.68 % new_bool_3 with pid 2233229 completed with status 0
% 0.17/0.68 % Result found by new_bool_3
% 0.17/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.68 % Search class: FGHSF-FFMM32-MFFFFFNN
% 0.17/0.68 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.68 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.68 % SubtermCWHack with pid 2233232 completed with status 0
% 0.17/0.68 % Result found by SubtermCWHack
% 0.17/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.68 % Search class: FGHSF-FFMM32-MFFFFFNN
% 0.17/0.68 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.68 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.68 % Preprocessing time : 0.001 s
% 0.17/0.68
% 0.17/0.68 % Proof found!
% 0.17/0.68 % SZS status Theorem
% 0.17/0.68 % SZS output start CNFRefutation
% See solution above
% 0.17/0.68 % Parsed axioms : 48
% 0.17/0.68 % Removed by relevancy pruning/SinE : 11
% 0.17/0.68 % Initial clauses : 85
% 0.17/0.68 % Removed in clause preprocessing : 4
% 0.17/0.68 % Initial clauses in saturation : 81
% 0.17/0.68 % Processed clauses : 517
% 0.17/0.68 % ...of these trivial : 3
% 0.17/0.68 % ...subsumed : 335
% 0.17/0.68 % ...remaining for further processing : 179
% 0.17/0.68 % Other redundant clauses eliminated : 13
% 0.17/0.68 % Clauses deleted for lack of memory : 0
% 0.17/0.68 % Backward-subsumed : 5
% 0.17/0.68 % Backward-rewritten : 5
% 0.17/0.68 % Generated clauses : 1276
% 0.17/0.68 % ...of the previous two non-redundant : 1005
% 0.17/0.68 % ...aggressively subsumed : 0
% 0.17/0.68 % Contextual simplify-reflections : 10
% 0.17/0.68 % Paramodulations : 1265
% 0.17/0.68 % Factorizations : 0
% 0.17/0.68 % NegExts : 0
% 0.17/0.68 % Equation resolutions : 13
% 0.17/0.68 % Disequality decompositions : 0
% 0.17/0.68 % Total rewrite steps : 1032
% 0.17/0.68 % ...of those cached : 1016
% 0.17/0.68 % Propositional unsat checks : 0
% 0.17/0.68 % Propositional check models : 0
% 0.17/0.68 % Propositional check unsatisfiable : 0
% 0.17/0.68 % Propositional clauses : 0
% 0.17/0.68 % Propositional clauses after purity: 0
% 0.17/0.68 % Propositional unsat core size : 0
% 0.17/0.68 % Propositional preprocessing time : 0.000
% 0.17/0.68 % Propositional encoding time : 0.000
% 0.17/0.68 % Propositional solver time : 0.000
% 0.17/0.68 % Success case prop preproc time : 0.000
% 0.17/0.68 % Success case prop encoding time : 0.000
% 0.17/0.68 % Success case prop solver time : 0.000
% 0.17/0.68 % Current number of processed clauses : 159
% 0.17/0.68 % Positive orientable unit clauses : 29
% 0.17/0.68 % Positive unorientable unit clauses: 0
% 0.17/0.68 % Negative unit clauses : 3
% 0.17/0.68 % Non-unit-clauses : 127
% 0.17/0.68 % Current number of unprocessed clauses: 503
% 0.17/0.68 % ...number of literals in the above : 2158
% 0.17/0.68 % Current number of archived formulas : 0
% 0.17/0.68 % Current number of archived clauses : 10
% 0.17/0.68 % Clause-clause subsumption calls (NU) : 4775
% 0.17/0.68 % Rec. Clause-clause subsumption calls : 3751
% 0.17/0.68 % Non-unit clause-clause subsumptions : 350
% 0.17/0.68 % Unit Clause-clause subsumption calls : 6
% 0.17/0.68 % Rewrite failures with RHS unbound : 0
% 0.17/0.68 % BW rewrite match attempts : 5
% 0.17/0.68 % BW rewrite match successes : 5
% 0.17/0.68 % Condensation attempts : 0
% 0.17/0.68 % Condensation successes : 0
% 0.17/0.68 % Termbank termtop insertions : 23149
% 0.17/0.68 % Search garbage collected termcells : 1531
% 0.17/0.68
% 0.17/0.68 % -------------------------------------------------
% 0.17/0.68 % User time : 0.022 s
% 0.17/0.68 % System time : 0.003 s
% 0.17/0.68 % Total time : 0.025 s
% 0.17/0.68 % Maximum resident set size: 3952 pages
% 0.17/0.68
% 0.17/0.68 % -------------------------------------------------
% 0.17/0.68 % User time : 0.026 s
% 0.17/0.68 % System time : 0.006 s
% 0.17/0.68 % Total time : 0.031 s
% 0.17/0.68 % Maximum resident set size: 4864 pages
% 0.17/0.68 % E exiting
%------------------------------------------------------------------------------