%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG122+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:56 PM UTC 2026
% Result : Theorem 0.22s 5.63s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 50 ( 19 unt; 0 def)
% Number of atoms : 147 ( 37 equ)
% Maximal formula atoms : 29 ( 2 avg)
% Number of connectives : 159 ( 62 ~; 54 |; 30 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
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/sandbox/benchmark/theBenchmark.p',mDefIdeal) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddComm) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__2174,hypothesis,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& aIdeal0(xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2174) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aElement0(X3)
& aElement0(X2)
& aElement0(X1) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddAsso) ).
fof(m__2666,hypothesis,
( ( iLess0(sbrdtbr0(xr),sbrdtbr0(xu))
| xr = sz00 )
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& aElement0(xr)
& aElement0(xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2666) ).
fof(m__2690,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2690) ).
fof(mAddInvr,axiom,
! [X1] :
( aElement0(X1)
=> ( sz00 = sdtpldt0(smndt0(X1),X1)
& sdtpldt0(X1,smndt0(X1)) = sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddInvr) ).
fof(m__2273,hypothesis,
( ! [X1] :
( ( X1 != sz00
& aElementOf0(X1,xI) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
fof(m__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
fof(c_0_13,negated_conjecture,
xr != sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_14,plain,
! [X62,X63,X64,X65,X66] :
( ( aIdeal0(X66)
| ~ aSet0(X66)
| ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
| ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
| aElement0(esk11_1(X66)) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| aElementOf0(esk10_1(X66),X66)
| ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| aElementOf0(esk10_1(X66),X66)
| aElement0(esk11_1(X66)) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| aElementOf0(esk9_1(X66),X66) )
& ( ~ aIdeal0(X62)
| ~ aElementOf0(X63,X62)
| aElementOf0(sdtasdt0(X65,X63),X62)
| ~ aElement0(X65) )
& ( ~ aIdeal0(X62)
| ~ aElementOf0(X63,X62)
| aElementOf0(sdtpldt0(X63,X64),X62)
| ~ aElementOf0(X64,X62) )
& ( ~ aIdeal0(X62)
| aSet0(X62) ) ),
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_15,plain,
! [X13,X14] :
( sdtpldt0(X13,X14) = sdtpldt0(X14,X13)
| ~ aElement0(X14)
| ~ aElement0(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
fof(c_0_16,negated_conjecture,
xr != sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X34,X35] :
( aElement0(X35)
| ~ aElementOf0(X35,X34)
| ~ aSet0(X34) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_18,plain,
( ~ aIdeal0(X1)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_20,plain,
! [X15,X16,X17] :
( sdtpldt0(sdtpldt0(X15,X16),X17) = sdtpldt0(X15,sdtpldt0(X16,X17))
| ~ aElement0(X17)
| ~ aElement0(X16)
| ~ aElement0(X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])])]) ).
cnf(c_0_21,hypothesis,
xb = sdtpldt0(sdtasdt0(xq,xu),xr),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_22,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,hypothesis,
aElement0(xr),
inference(split_conjunct,[status(thm)],[m__2666]) ).
fof(c_0_24,negated_conjecture,
xr != sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(fof_nnf,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[m__2690]) ).
cnf(c_0_27,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
( ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,hypothesis,
( ~ aElement0(sdtasdt0(xq,xu))
| sdtpldt0(xr,sdtasdt0(xq,xu)) = xb ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
fof(c_0_30,plain,
! [X19] :
( ( ~ aElement0(X19)
| sz00 = sdtpldt0(smndt0(X19),X19) )
& ( ~ aElement0(X19)
| sdtpldt0(X19,smndt0(X19)) = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddInvr])])])]) ).
fof(c_0_31,hypothesis,
( ! [X1] :
( ( X1 != sz00
& aElementOf0(X1,xI) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
cnf(c_0_32,negated_conjecture,
xr != sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,hypothesis,
aElement0(smndt0(sdtasdt0(xq,xu))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_34,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_35,hypothesis,
( ~ aElement0(X1)
| ~ aElement0(sdtasdt0(xq,xu))
| sdtpldt0(xr,sdtpldt0(sdtasdt0(xq,xu),X1)) = sdtpldt0(xb,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23])]) ).
cnf(c_0_36,plain,
( ~ aElement0(X1)
| sdtpldt0(X1,smndt0(X1)) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_37,hypothesis,
! [X117] :
( ( ~ iLess0(sbrdtbr0(X117),sbrdtbr0(xu))
| X117 = sz00
| ~ aElementOf0(X117,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_31])])])]) ).
cnf(c_0_38,negated_conjecture,
sdtpldt0(xb,smndt0(sdtasdt0(xq,xu))) != xr,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_22]),c_0_33]),c_0_34])]) ).
cnf(c_0_39,hypothesis,
( ~ aElement0(sdtasdt0(xq,xu))
| sdtpldt0(xb,smndt0(sdtasdt0(xq,xu))) = sdtpldt0(xr,sz00) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_33])]) ).
fof(c_0_40,plain,
! [X11,X12] :
( aElement0(sdtasdt0(X11,X12))
| ~ aElement0(X12)
| ~ aElement0(X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_41,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( ~ aElement0(sdtasdt0(xq,xu))
| sdtpldt0(xr,sz00) != xr ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_41]),c_0_27])]) ).
cnf(c_0_45,hypothesis,
aElement0(xq),
inference(split_conjunct,[status(thm)],[m__2666]) ).
fof(c_0_46,plain,
! [X18] :
( ( ~ aElement0(X18)
| X18 = sdtpldt0(sz00,X18) )
& ( ~ aElement0(X18)
| sdtpldt0(X18,sz00) = X18 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])])]) ).
cnf(c_0_47,negated_conjecture,
sdtpldt0(xr,sz00) != xr,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45])]) ).
cnf(c_0_48,plain,
( ~ aElement0(X1)
| sdtpldt0(X1,sz00) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG122+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/5.47 % Computer : n001.cluster.edu
% 0.17/5.47 % Model : x86_64 x86_64
% 0.17/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.47 % Memory : 8046.5625MB
% 0.17/5.47 % OS : Linux 6.8.0-71-generic
% 0.17/5.47 % CPULimit : 300
% 0.17/5.47 % WCLimit : 300
% 0.17/5.47 % DateTime : Mon Sep 21 04:27:33 UTC 2026
% 0.17/5.47 % CPUTime :
% 0.17/5.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/5.53 Running first-order theorem proving
% 0.22/5.53 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.22/5.63 % Version: 3.5.1
% 0.22/5.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/5.63 % Starting new_bool_3 with 300s (1) cores
% 0.22/5.63 % Starting new_bool_1 with 300s (1) cores
% 0.22/5.63 % Starting sh5l with 300s (1) cores
% 0.22/5.63 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2182350 completed with status 0
% 0.22/5.63 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/5.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/5.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.63 % No SInE strategy applied
% 0.22/5.63 % Search class: FGHSF-FSMM32-MFFFFFNN
% 0.22/5.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.63 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/5.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.22/5.63 % Starting new_bool_3 with 136s (1) cores
% 0.22/5.63 % Starting new_bool_1 with 136s (1) cores
% 0.22/5.63 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2182358 completed with status 0
% 0.22/5.63 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/5.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/5.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.63 % No SInE strategy applied
% 0.22/5.63 % Search class: FGHSF-FSMM32-MFFFFFNN
% 0.22/5.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.63 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/5.63 % Preprocessing time : 0.002 s
% 0.22/5.63 % Presaturation interreduction done
% 0.22/5.63
% 0.22/5.63 % Proof found!
% 0.22/5.63 % SZS status Theorem
% 0.22/5.63 % SZS output start CNFRefutation
% See solution above
% 0.22/5.63 % Parsed axioms : 54
% 0.22/5.63 % Removed by relevancy pruning/SinE : 0
% 0.22/5.63 % Initial clauses : 122
% 0.22/5.63 % Removed in clause preprocessing : 4
% 0.22/5.63 % Initial clauses in saturation : 118
% 0.22/5.63 % Processed clauses : 321
% 0.22/5.63 % ...of these trivial : 5
% 0.22/5.63 % ...subsumed : 25
% 0.22/5.63 % ...remaining for further processing : 291
% 0.22/5.63 % Other redundant clauses eliminated : 18
% 0.22/5.63 % Clauses deleted for lack of memory : 0
% 0.22/5.63 % Backward-subsumed : 2
% 0.22/5.63 % Backward-rewritten : 5
% 0.22/5.63 % Generated clauses : 498
% 0.22/5.63 % ...of the previous two non-redundant : 439
% 0.22/5.63 % ...aggressively subsumed : 0
% 0.22/5.63 % Contextual simplify-reflections : 1
% 0.22/5.63 % Paramodulations : 482
% 0.22/5.63 % Factorizations : 0
% 0.22/5.63 % NegExts : 0
% 0.22/5.63 % Equation resolutions : 18
% 0.22/5.63 % Disequality decompositions : 0
% 0.22/5.63 % Total rewrite steps : 255
% 0.22/5.63 % ...of those cached : 234
% 0.22/5.63 % Propositional unsat checks : 0
% 0.22/5.63 % Propositional check models : 0
% 0.22/5.63 % Propositional check unsatisfiable : 0
% 0.22/5.63 % Propositional clauses : 0
% 0.22/5.63 % Propositional clauses after purity: 0
% 0.22/5.63 % Propositional unsat core size : 0
% 0.22/5.63 % Propositional preprocessing time : 0.000
% 0.22/5.63 % Propositional encoding time : 0.000
% 0.22/5.63 % Propositional solver time : 0.000
% 0.22/5.63 % Success case prop preproc time : 0.000
% 0.22/5.63 % Success case prop encoding time : 0.000
% 0.22/5.63 % Success case prop solver time : 0.000
% 0.22/5.63 % Current number of processed clauses : 152
% 0.22/5.63 % Positive orientable unit clauses : 42
% 0.22/5.63 % Positive unorientable unit clauses: 0
% 0.22/5.63 % Negative unit clauses : 12
% 0.22/5.63 % Non-unit-clauses : 98
% 0.22/5.63 % Current number of unprocessed clauses: 333
% 0.22/5.63 % ...number of literals in the above : 1644
% 0.22/5.63 % Current number of archived formulas : 0
% 0.22/5.63 % Current number of archived clauses : 125
% 0.22/5.63 % Clause-clause subsumption calls (NU) : 2207
% 0.22/5.63 % Rec. Clause-clause subsumption calls : 476
% 0.22/5.63 % Non-unit clause-clause subsumptions : 21
% 0.22/5.63 % Unit Clause-clause subsumption calls : 55
% 0.22/5.63 % Rewrite failures with RHS unbound : 0
% 0.22/5.63 % BW rewrite match attempts : 6
% 0.22/5.63 % BW rewrite match successes : 4
% 0.22/5.63 % Condensation attempts : 0
% 0.22/5.63 % Condensation successes : 0
% 0.22/5.63 % Termbank termtop insertions : 17290
% 0.22/5.63 % Search garbage collected termcells : 1911
% 0.22/5.63
% 0.22/5.63 % -------------------------------------------------
% 0.22/5.63 % User time : 0.030 s
% 0.22/5.63 % System time : 0.011 s
% 0.22/5.63 % Total time : 0.041 s
% 0.22/5.63 % Maximum resident set size: 3956 pages
% 0.22/5.63
% 0.22/5.63 % -------------------------------------------------
% 0.22/5.63 % User time : 0.074 s
% 0.22/5.63 % System time : 0.022 s
% 0.22/5.63 % Total time : 0.096 s
% 0.22/5.63 % Maximum resident set size: 4864 pages
% 0.22/5.63 % E exiting
%------------------------------------------------------------------------------