%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC273+1 : TPTP v9.3.1. Released v2.4.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:43:44 PM UTC 2026
% Result : Theorem 234.30s 34.70s
% Output : CNFRefutation 234.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 14 unt; 0 def)
% Number of atoms : 216 ( 22 equ)
% Maximal formula atoms : 30 ( 6 avg)
% Number of connectives : 277 ( 97 ~; 110 |; 39 &)
% ( 4 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn 43 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( totalorderedP(X1)
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X3)
& segmentP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ strictorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( totalorderedP(X1)
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X3)
& segmentP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ strictorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( totalorderedP(X1)
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X3)
& segmentP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ strictorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
! [X11] :
( ~ totalorderedP(esk1_0)
& ( ~ strictorderedP(X11)
| ~ segmentP(X11,esk3_0)
| ~ segmentP(esk4_0,X11)
| ~ neq(esk3_0,X11)
| ~ ssList(X11) )
& strictorderedP(esk3_0)
& segmentP(esk4_0,esk3_0)
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_7,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[ax93]) ).
fof(c_0_8,plain,
! [X26,X27,X28,X29,X30,X31] :
( ( ~ ssList(X26)
| strictorderedP(X26)
| ~ lt(esk10_1(X26),esk11_1(X26)) )
& ( ~ ssList(X26)
| strictorderedP(X26)
| app(app(esk12_1(X26),cons(esk10_1(X26),esk13_1(X26))),cons(esk11_1(X26),esk14_1(X26))) = X26 )
& ( ~ ssList(X26)
| strictorderedP(X26)
| ssList(esk14_1(X26)) )
& ( ~ ssList(X26)
| strictorderedP(X26)
| ssList(esk13_1(X26)) )
& ( ~ ssList(X26)
| strictorderedP(X26)
| ssList(esk12_1(X26)) )
& ( ~ ssList(X26)
| strictorderedP(X26)
| ssItem(esk11_1(X26)) )
& ( ~ ssList(X26)
| strictorderedP(X26)
| ssItem(esk10_1(X26)) )
& ( ~ ssList(X26)
| lt(X27,X28)
| app(app(X29,cons(X27,X30)),cons(X28,X31)) != X26
| ~ ssList(X31)
| ~ ssList(X30)
| ~ ssList(X29)
| ~ ssItem(X28)
| ~ ssItem(X27)
| ~ strictorderedP(X26) ) ),
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)],[ax12])])])])])]) ).
fof(c_0_9,plain,
! [X12,X13,X14,X15,X16,X17] :
( ( ~ ssList(X12)
| totalorderedP(X12)
| ~ leq(esk5_1(X12),esk6_1(X12)) )
& ( ~ ssList(X12)
| totalorderedP(X12)
| app(app(esk7_1(X12),cons(esk5_1(X12),esk8_1(X12))),cons(esk6_1(X12),esk9_1(X12))) = X12 )
& ( ~ ssList(X12)
| totalorderedP(X12)
| ssList(esk9_1(X12)) )
& ( ~ ssList(X12)
| totalorderedP(X12)
| ssList(esk8_1(X12)) )
& ( ~ ssList(X12)
| totalorderedP(X12)
| ssList(esk7_1(X12)) )
& ( ~ ssList(X12)
| totalorderedP(X12)
| ssItem(esk6_1(X12)) )
& ( ~ ssList(X12)
| totalorderedP(X12)
| ssItem(esk5_1(X12)) )
& ( ~ ssList(X12)
| leq(X13,X14)
| app(app(X15,cons(X13,X16)),cons(X14,X17)) != X12
| ~ ssList(X17)
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14)
| ~ ssItem(X13)
| ~ totalorderedP(X12) ) ),
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)],[ax11])])])])])]) ).
cnf(c_0_10,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
~ totalorderedP(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X73,X74] :
( ( ~ ssItem(X73)
| ~ ssItem(X74)
| lt(X73,X74)
| ~ leq(X73,X74)
| X73 = X74 )
& ( ~ ssItem(X73)
| ~ ssItem(X74)
| ~ lt(X73,X74)
| leq(X73,X74) )
& ( ~ ssItem(X73)
| ~ ssItem(X74)
| ~ lt(X73,X74)
| X73 != X74 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ strictorderedP(X1)
| lt(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| app(app(esk7_1(X1),cons(esk5_1(X1),esk8_1(X1))),cons(esk6_1(X1),esk9_1(X1))) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
~ totalorderedP(esk3_0),
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk9_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssItem(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssItem(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ leq(esk5_1(X1),esk6_1(X1))
| totalorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| lt(X1,X2) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_26,negated_conjecture,
app(app(esk7_1(esk3_0),cons(esk5_1(esk3_0),esk8_1(esk3_0))),cons(esk6_1(esk3_0),esk9_1(esk3_0))) = esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_27,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk9_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_17]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk8_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_17]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk7_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_17]) ).
cnf(c_0_31,negated_conjecture,
ssItem(esk6_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_16]),c_0_17]) ).
cnf(c_0_32,negated_conjecture,
ssItem(esk5_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_17]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ lt(esk5_1(X1),esk6_1(X1))
| totalorderedP(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22]),c_0_21]) ).
cnf(c_0_34,negated_conjecture,
lt(esk5_1(esk3_0),esk6_1(esk3_0)),
inference(cn,[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(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_16]),c_0_28]),c_0_29]),c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC273+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n001.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 08:16:14 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.55 Running first-order theorem proving
% 0.23/0.55 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
% 234.30/34.70 % Version: 3.5.1
% 234.30/34.70 % Preprocessing class: FSLSSMSSSSSNFFN.
% 234.30/34.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 234.30/34.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 234.30/34.70 % Starting new_bool_3 with 300s (1) cores
% 234.30/34.70 % Starting new_bool_1 with 300s (1) cores
% 234.30/34.70 % Starting sh5l with 300s (1) cores
% 234.30/34.70 % new_bool_1 with pid 2649782 completed with status 0
% 234.30/34.70 % Result found by new_bool_1
% 234.30/34.70 % Preprocessing class: FSLSSMSSSSSNFFN.
% 234.30/34.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 234.30/34.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 234.30/34.70 % Starting new_bool_3 with 300s (1) cores
% 234.30/34.70 % Starting new_bool_1 with 300s (1) cores
% 234.30/34.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 234.30/34.70 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 234.30/34.70 % Search class: FGHSF-FFMM21-MFFFFFNN
% 234.30/34.70 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 234.30/34.70 % Starting SubtermCWHack with 31s (1) cores
% 234.30/34.70 % SubtermCWHack with pid 2649785 completed with status 8
% 234.30/34.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 234.30/34.70 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2649947 completed with status 0
% 234.30/34.70 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 234.30/34.70 % Preprocessing class: FSLSSMSSSSSNFFN.
% 234.30/34.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 234.30/34.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 234.30/34.70 % Starting new_bool_3 with 300s (1) cores
% 234.30/34.70 % Starting new_bool_1 with 300s (1) cores
% 234.30/34.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 234.30/34.70 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 234.30/34.70 % Search class: FGHSF-FFMM21-MFFFFFNN
% 234.30/34.70 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 234.30/34.70 % Starting SubtermCWHack with 31s (1) cores
% 234.30/34.70 % SubtermCWHack with pid 2649785 completed with status 8
% 234.30/34.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 234.30/34.70 % Preprocessing time : 0.003 s
% 234.30/34.70 % Presaturation interreduction done
% 234.30/34.70
% 234.30/34.70 % Proof found!
% 234.30/34.70 % SZS status Theorem
% 234.30/34.70 % SZS output start CNFRefutation
% See solution above
% 234.30/34.70 % Parsed axioms : 96
% 234.30/34.70 % Removed by relevancy pruning/SinE : 43
% 234.30/34.70 % Initial clauses : 101
% 234.30/34.70 % Removed in clause preprocessing : 2
% 234.30/34.70 % Initial clauses in saturation : 99
% 234.30/34.70 % Processed clauses : 4561
% 234.30/34.70 % ...of these trivial : 50
% 234.30/34.70 % ...subsumed : 1938
% 234.30/34.70 % ...remaining for further processing : 2573
% 234.30/34.70 % Other redundant clauses eliminated : 111
% 234.30/34.70 % Clauses deleted for lack of memory : 0
% 234.30/34.70 % Backward-subsumed : 82
% 234.30/34.70 % Backward-rewritten : 96
% 234.30/34.70 % Generated clauses : 159046
% 234.30/34.70 % ...of the previous two non-redundant : 158106
% 234.30/34.70 % ...aggressively subsumed : 0
% 234.30/34.70 % Contextual simplify-reflections : 299
% 234.30/34.70 % Paramodulations : 158899
% 234.30/34.70 % Factorizations : 0
% 234.30/34.70 % NegExts : 0
% 234.30/34.70 % Equation resolutions : 148
% 234.30/34.70 % Disequality decompositions : 0
% 234.30/34.70 % Total rewrite steps : 16443
% 234.30/34.70 % ...of those cached : 16411
% 234.30/34.70 % Propositional unsat checks : 0
% 234.30/34.70 % Propositional check models : 0
% 234.30/34.70 % Propositional check unsatisfiable : 0
% 234.30/34.70 % Propositional clauses : 0
% 234.30/34.70 % Propositional clauses after purity: 0
% 234.30/34.70 % Propositional unsat core size : 0
% 234.30/34.70 % Propositional preprocessing time : 0.000
% 234.30/34.70 % Propositional encoding time : 0.000
% 234.30/34.70 % Propositional solver time : 0.000
% 234.30/34.70 % Success case prop preproc time : 0.000
% 234.30/34.70 % Success case prop encoding time : 0.000
% 234.30/34.70 % Success case prop solver time : 0.000
% 234.30/34.70 % Current number of processed clauses : 2292
% 234.30/34.70 % Positive orientable unit clauses : 37
% 234.30/34.70 % Positive unorientable unit clauses: 0
% 234.30/34.70 % Negative unit clauses : 2
% 234.30/34.70 % Non-unit-clauses : 2253
% 234.30/34.70 % Current number of unprocessed clauses: 152902
% 234.30/34.70 % ...number of literals in the above : 604310
% 234.30/34.70 % Current number of archived formulas : 0
% 234.30/34.70 % Current number of archived clauses : 271
% 234.30/34.70 % Clause-clause subsumption calls (NU) : 503560
% 234.30/34.70 % Rec. Clause-clause subsumption calls : 195003
% 234.30/34.70 % Non-unit clause-clause subsumptions : 2312
% 234.30/34.70 % Unit Clause-clause subsumption calls : 5584
% 234.30/34.70 % Rewrite failures with RHS unbound : 0
% 234.30/34.70 % BW rewrite match attempts : 36
% 234.30/34.70 % BW rewrite match successes : 16
% 234.30/34.70 % Condensation attempts : 0
% 234.30/34.70 % Condensation successes : 0
% 234.30/34.70 % Termbank termtop insertions : 3085663
% 234.30/34.70 % Search garbage collected termcells : 2419
% 234.30/34.70
% 234.30/34.70 % -------------------------------------------------
% 234.30/34.70 % User time : 32.319 s
% 234.30/34.70 % System time : 1.151 s
% 234.30/34.70 % Total time : 33.470 s
% 234.30/34.70 % Maximum resident set size: 4016 pages
% 234.30/34.70
% 234.30/34.70 % -------------------------------------------------
% 234.30/34.70 % User time : 32.328 s
% 234.30/34.70 % System time : 1.158 s
% 234.30/34.70 % Total time : 33.486 s
% 234.30/34.70 % Maximum resident set size: 4608 pages
% 234.30/34.70 % E exiting
%------------------------------------------------------------------------------