%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC340+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 : 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:45:55 PM UTC 2026
% Result : Theorem 279.68s 36.80s
% Output : CNFRefutation 279.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 16 unt; 0 def)
% Number of atoms : 206 ( 23 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 259 ( 93 ~; 103 |; 29 &)
% ( 4 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( totalorderedP(X1)
& segmentP(X2,X1) )
| ~ strictorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != 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] :
( ssList(X4)
=> ( ( totalorderedP(X1)
& segmentP(X2,X1) )
| ~ strictorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( totalorderedP(X1)
& segmentP(X2,X1) )
| ~ strictorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
( ( ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) )
& 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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[ax93]) ).
fof(c_0_12,plain,
! [X43,X44,X45,X46,X47,X48] :
( ( ~ ssList(X43)
| strictorderedP(X43)
| ~ lt(esk12_1(X43),esk13_1(X43)) )
& ( ~ ssList(X43)
| strictorderedP(X43)
| app(app(esk14_1(X43),cons(esk12_1(X43),esk15_1(X43))),cons(esk13_1(X43),esk16_1(X43))) = X43 )
& ( ~ ssList(X43)
| strictorderedP(X43)
| ssList(esk16_1(X43)) )
& ( ~ ssList(X43)
| strictorderedP(X43)
| ssList(esk15_1(X43)) )
& ( ~ ssList(X43)
| strictorderedP(X43)
| ssList(esk14_1(X43)) )
& ( ~ ssList(X43)
| strictorderedP(X43)
| ssItem(esk13_1(X43)) )
& ( ~ ssList(X43)
| strictorderedP(X43)
| ssItem(esk12_1(X43)) )
& ( ~ ssList(X43)
| lt(X44,X45)
| app(app(X46,cons(X44,X47)),cons(X45,X48)) != X43
| ~ ssList(X48)
| ~ ssList(X47)
| ~ ssList(X46)
| ~ ssItem(X45)
| ~ ssItem(X44)
| ~ strictorderedP(X43) ) ),
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_13,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ ssList(X11)
| totalorderedP(X11)
| ~ leq(esk5_1(X11),esk6_1(X11)) )
& ( ~ ssList(X11)
| totalorderedP(X11)
| app(app(esk7_1(X11),cons(esk5_1(X11),esk8_1(X11))),cons(esk6_1(X11),esk9_1(X11))) = X11 )
& ( ~ ssList(X11)
| totalorderedP(X11)
| ssList(esk9_1(X11)) )
& ( ~ ssList(X11)
| totalorderedP(X11)
| ssList(esk8_1(X11)) )
& ( ~ ssList(X11)
| totalorderedP(X11)
| ssList(esk7_1(X11)) )
& ( ~ ssList(X11)
| totalorderedP(X11)
| ssItem(esk6_1(X11)) )
& ( ~ ssList(X11)
| totalorderedP(X11)
| ssItem(esk5_1(X11)) )
& ( ~ ssList(X11)
| leq(X12,X13)
| app(app(X14,cons(X12,X15)),cons(X13,X16)) != X11
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssList(X14)
| ~ ssItem(X13)
| ~ ssItem(X12)
| ~ totalorderedP(X11) ) ),
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_14,negated_conjecture,
( ~ segmentP(esk4_0,esk1_0)
| ~ totalorderedP(esk1_0) ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
segmentP(esk4_0,esk1_0),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_16,plain,
! [X68,X69] :
( ( ~ ssItem(X68)
| ~ ssItem(X69)
| lt(X68,X69)
| ~ leq(X68,X69)
| X68 = X69 )
& ( ~ ssItem(X68)
| ~ ssItem(X69)
| ~ lt(X68,X69)
| leq(X68,X69) )
& ( ~ ssItem(X68)
| ~ ssItem(X69)
| ~ lt(X68,X69)
| X68 != X69 ) ),
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_11])])])])]) ).
cnf(c_0_17,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_12]) ).
cnf(c_0_18,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_13]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
~ totalorderedP(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk9_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssItem(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssItem(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| ~ leq(esk5_1(X1),esk6_1(X1))
| totalorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,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_17]) ).
cnf(c_0_30,negated_conjecture,
app(app(esk7_1(esk1_0),cons(esk5_1(esk1_0),esk8_1(esk1_0))),cons(esk6_1(esk1_0),esk9_1(esk1_0))) = esk1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_31,negated_conjecture,
strictorderedP(esk1_0),
inference(rw,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk9_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_20]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk8_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_20]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk7_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_20]) ).
cnf(c_0_35,negated_conjecture,
ssItem(esk6_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_20]) ).
cnf(c_0_36,negated_conjecture,
ssItem(esk5_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_20]) ).
cnf(c_0_37,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_27,c_0_28]),c_0_26]),c_0_25]) ).
cnf(c_0_38,negated_conjecture,
lt(esk5_1(esk1_0),esk6_1(esk1_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_29,c_0_30]),c_0_31]),c_0_19]),c_0_32]),c_0_33]),c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_19])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC340+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n004.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 08:17:05 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.52 Running first-order theorem proving
% 0.25/0.52 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
% 279.68/36.80 % Version: 3.5.1
% 279.68/36.80 % Preprocessing class: FSLSSMSSSSSNFFN.
% 279.68/36.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 279.68/36.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 279.68/36.80 % Starting new_bool_3 with 300s (1) cores
% 279.68/36.80 % Starting new_bool_1 with 300s (1) cores
% 279.68/36.80 % Starting sh5l with 300s (1) cores
% 279.68/36.80 % new_bool_3 with pid 2688258 completed with status 0
% 279.68/36.80 % Result found by new_bool_3
% 279.68/36.80 % Preprocessing class: FSLSSMSSSSSNFFN.
% 279.68/36.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 279.68/36.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 279.68/36.80 % Starting new_bool_3 with 300s (1) cores
% 279.68/36.80 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 279.68/36.80 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 279.68/36.80 % Search class: FGHSF-FFMM21-MFFFFFNN
% 279.68/36.80 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 279.68/36.80 % Starting SubtermCWHack with 31s (1) cores
% 279.68/36.80 % SubtermCWHack with pid 2688261 completed with status 8
% 279.68/36.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 279.68/36.80 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2688686 completed with status 0
% 279.68/36.80 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 279.68/36.80 % Preprocessing class: FSLSSMSSSSSNFFN.
% 279.68/36.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 279.68/36.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 279.68/36.80 % Starting new_bool_3 with 300s (1) cores
% 279.68/36.80 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 279.68/36.80 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 279.68/36.80 % Search class: FGHSF-FFMM21-MFFFFFNN
% 279.68/36.80 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 279.68/36.80 % Starting SubtermCWHack with 31s (1) cores
% 279.68/36.80 % SubtermCWHack with pid 2688261 completed with status 8
% 279.68/36.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 279.68/36.80 % Preprocessing time : 0.002 s
% 279.68/36.80 % Presaturation interreduction done
% 279.68/36.80
% 279.68/36.80 % Proof found!
% 279.68/36.80 % SZS status Theorem
% 279.68/36.80 % SZS output start CNFRefutation
% See solution above
% 279.68/36.80 % Parsed axioms : 96
% 279.68/36.80 % Removed by relevancy pruning/SinE : 45
% 279.68/36.80 % Initial clauses : 96
% 279.68/36.80 % Removed in clause preprocessing : 2
% 279.68/36.80 % Initial clauses in saturation : 94
% 279.68/36.80 % Processed clauses : 7157
% 279.68/36.80 % ...of these trivial : 92
% 279.68/36.80 % ...subsumed : 3864
% 279.68/36.80 % ...remaining for further processing : 3201
% 279.68/36.80 % Other redundant clauses eliminated : 200
% 279.68/36.80 % Clauses deleted for lack of memory : 0
% 279.68/36.80 % Backward-subsumed : 113
% 279.68/36.80 % Backward-rewritten : 131
% 279.68/36.80 % Generated clauses : 300784
% 279.68/36.80 % ...of the previous two non-redundant : 298317
% 279.68/36.80 % ...aggressively subsumed : 0
% 279.68/36.80 % Contextual simplify-reflections : 347
% 279.68/36.80 % Paramodulations : 300529
% 279.68/36.80 % Factorizations : 0
% 279.68/36.80 % NegExts : 0
% 279.68/36.80 % Equation resolutions : 256
% 279.68/36.80 % Disequality decompositions : 0
% 279.68/36.80 % Total rewrite steps : 31044
% 279.68/36.80 % ...of those cached : 31016
% 279.68/36.80 % Propositional unsat checks : 0
% 279.68/36.80 % Propositional check models : 0
% 279.68/36.80 % Propositional check unsatisfiable : 0
% 279.68/36.80 % Propositional clauses : 0
% 279.68/36.80 % Propositional clauses after purity: 0
% 279.68/36.80 % Propositional unsat core size : 0
% 279.68/36.80 % Propositional preprocessing time : 0.000
% 279.68/36.80 % Propositional encoding time : 0.000
% 279.68/36.80 % Propositional solver time : 0.000
% 279.68/36.80 % Success case prop preproc time : 0.000
% 279.68/36.80 % Success case prop encoding time : 0.000
% 279.68/36.80 % Success case prop solver time : 0.000
% 279.68/36.80 % Current number of processed clauses : 2861
% 279.68/36.80 % Positive orientable unit clauses : 29
% 279.68/36.80 % Positive unorientable unit clauses: 0
% 279.68/36.80 % Negative unit clauses : 2
% 279.68/36.80 % Non-unit-clauses : 2830
% 279.68/36.80 % Current number of unprocessed clauses: 291276
% 279.68/36.80 % ...number of literals in the above : 1168037
% 279.68/36.80 % Current number of archived formulas : 0
% 279.68/36.80 % Current number of archived clauses : 332
% 279.68/36.80 % Clause-clause subsumption calls (NU) : 367647
% 279.68/36.80 % Rec. Clause-clause subsumption calls : 185207
% 279.68/36.80 % Non-unit clause-clause subsumptions : 4313
% 279.68/36.80 % Unit Clause-clause subsumption calls : 7221
% 279.68/36.80 % Rewrite failures with RHS unbound : 0
% 279.68/36.80 % BW rewrite match attempts : 38
% 279.68/36.80 % BW rewrite match successes : 10
% 279.68/36.80 % Condensation attempts : 0
% 279.68/36.80 % Condensation successes : 0
% 279.68/36.80 % Termbank termtop insertions : 6247233
% 279.68/36.80 % Search garbage collected termcells : 2323
% 279.68/36.80
% 279.68/36.80 % -------------------------------------------------
% 279.68/36.80 % User time : 34.017 s
% 279.68/36.80 % System time : 1.436 s
% 279.68/36.80 % Total time : 35.454 s
% 279.68/36.80 % Maximum resident set size: 3704 pages
% 279.68/36.80
% 279.68/36.80 % -------------------------------------------------
% 279.68/36.80 % User time : 34.024 s
% 279.68/36.80 % System time : 1.446 s
% 279.68/36.80 % Total time : 35.470 s
% 279.68/36.80 % Maximum resident set size: 4864 pages
% 279.68/36.80 % E exiting
%------------------------------------------------------------------------------