%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP747+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 : n017.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 12:41:10 PM UTC 2026
% Result : Theorem 4.32s 1.27s
% Output : CNFRefutation 4.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 59 ( 44 unt; 0 def)
% Number of atoms : 82 ( 81 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 38 ( 15 ~; 18 |; 5 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 121 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f08,axiom,
! [X4,X5,X6] :
( ( mult(X4,mult(X5,X6)) = mult(X4,mult(X6,X5))
& mult(mult(X4,X5),X6) = mult(mult(X4,X6),X5) )
| ( mult(mult(X4,X6),X5) = mult(X4,mult(X5,X6))
& mult(mult(X4,X5),X6) = mult(X4,mult(X6,X5)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
fof(f06,axiom,
! [X2] : mult(unit,X2) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
fof(f07,axiom,
! [X3,X1,X2] : mult(mult(mult(X2,X1),X3),X1) = mult(X2,mult(mult(X1,X3),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
fof(f05,axiom,
! [X2] : mult(X2,unit) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(goals,conjecture,
mult(mult(a,b),c) = mult(a,mult(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_7,plain,
! [X20,X21,X22] :
( ( mult(mult(X20,X22),X21) = mult(X20,mult(X21,X22))
| mult(X20,mult(X21,X22)) = mult(X20,mult(X22,X21)) )
& ( mult(mult(X20,X22),X21) = mult(X20,mult(X21,X22))
| mult(mult(X20,X21),X22) = mult(mult(X20,X22),X21) )
& ( mult(mult(X20,X21),X22) = mult(X20,mult(X22,X21))
| mult(X20,mult(X21,X22)) = mult(X20,mult(X22,X21)) )
& ( mult(mult(X20,X21),X22) = mult(X20,mult(X22,X21))
| mult(mult(X20,X21),X22) = mult(mult(X20,X22),X21) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[f08])]) ).
fof(c_0_8,plain,
! [X16] : mult(unit,X16) = X16,
inference(variable_rename,[status(thm)],[f06]) ).
fof(c_0_9,plain,
! [X17,X18,X19] : mult(mult(mult(X19,X18),X17),X18) = mult(X19,mult(mult(X18,X17),X18)),
inference(variable_rename,[status(thm)],[f07]) ).
cnf(c_0_10,plain,
( mult(mult(X1,X3),X2) = mult(X1,mult(X2,X3))
| mult(X1,mult(X2,X3)) = mult(X1,mult(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
mult(X1,X2) = mult(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11]),c_0_11])]) ).
fof(c_0_14,plain,
! [X15] : mult(X15,unit) = X15,
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_15,plain,
! [X9,X10] : ld(X10,mult(X10,X9)) = X9,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_16,plain,
mult(X1,mult(mult(X2,X1),X3)) = mult(X2,mult(X1,mult(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_17,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
mult(X1,mult(X2,X1)) = mult(X2,mult(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_20,plain,
ld(X1,mult(X2,mult(X1,X2))) = mult(X2,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
mult(mult(X1,mult(X1,X2)),X3) = mult(X1,mult(mult(X3,X1),X2)),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
fof(c_0_22,plain,
! [X7,X8] : mult(X8,ld(X8,X7)) = X7,
inference(variable_rename,[status(thm)],[f01]) ).
cnf(c_0_23,plain,
( mult(mult(X1,X3),X2) = mult(X1,mult(X2,X3))
| mult(mult(X1,X2),X3) = mult(mult(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,plain,
mult(mult(X1,X2),mult(X1,X2)) = mult(X1,mult(X2,mult(X2,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_13]),c_0_18]),c_0_21]),c_0_13]) ).
cnf(c_0_25,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
ld(X1,mult(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_27,plain,
ld(X1,mult(X2,mult(X2,X1))) = mult(X2,X2),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_28,plain,
( mult(mult(X1,X3),X2) != mult(X1,mult(X3,X2))
| mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2)) ),
inference(ef,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
mult(X1,mult(X2,ld(X1,X2))) = mult(X2,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_13]),c_0_25]),c_0_13]) ).
cnf(c_0_30,plain,
ld(ld(X1,X2),X2) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_31,plain,
ld(ld(X1,X2),mult(X1,X2)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_32,plain,
( mult(X2,mult(X1,X3)) != mult(X1,mult(X3,X2))
| mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_33,plain,
mult(X1,ld(X2,X1)) = ld(X2,mult(X1,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_34,plain,
ld(mult(X1,X1),mult(X1,X2)) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( mult(X3,mult(X1,X2)) != mult(X1,mult(X2,X3))
| mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2)) ),
inference(ar,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_32]),c_0_13]) ).
cnf(c_0_36,plain,
mult(mult(X1,X2),ld(X1,X2)) = mult(X2,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_24]),c_0_34]),c_0_27]) ).
cnf(c_0_37,plain,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(mult(X3,X1),X2)),
inference(spm,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_38,plain,
( mult(mult(X2,X3),X1) != mult(X3,mult(X1,X2))
| mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_13]) ).
fof(c_0_39,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_40,plain,
( mult(mult(X1,X2),X3) != mult(X1,mult(X2,X3))
| mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_13]) ).
cnf(c_0_41,plain,
mult(X1,mult(X2,mult(X2,X1))) = mult(X2,mult(X1,mult(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_26]),c_0_24]),c_0_37]),c_0_13]) ).
cnf(c_0_42,plain,
( mult(mult(X3,X2),X1) != mult(X3,mult(X1,X2))
| mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_13]) ).
fof(c_0_43,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
inference(fof_simplification,[status(thm)],[c_0_39]) ).
cnf(c_0_44,plain,
( mult(mult(X1,X2),X3) != mult(X2,mult(X1,X3))
| mult(mult(X1,X2),X3) = mult(X2,mult(X3,X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_13]) ).
cnf(c_0_45,plain,
mult(mult(X1,X2),mult(X2,X1)) = mult(X1,mult(X2,mult(X2,X1))),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_24]),c_0_13]),c_0_21]),c_0_13]),c_0_13]),c_0_41]) ).
cnf(c_0_46,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_47,plain,
( mult(X2,mult(X3,X1)) != mult(X3,mult(X1,X2))
| mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_32]) ).
fof(c_0_48,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
inference(fof_nnf,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
( mult(ld(X1,X2),mult(X1,X3)) != mult(X2,X3)
| mult(ld(X1,X2),mult(X3,X1)) = mult(X2,X3) ),
inference(spm,[status(thm)],[c_0_44,c_0_25]) ).
cnf(c_0_50,plain,
ld(mult(X1,X2),mult(X2,X1)) = unit,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_45]),c_0_24]),c_0_46]) ).
cnf(c_0_51,plain,
( mult(mult(X3,X1),X2) != mult(X3,mult(X1,X2))
| mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_13]) ).
cnf(c_0_52,plain,
( mult(mult(X2,X3),X1) = mult(X2,mult(X1,X3))
| mult(mult(X1,X2),X3) = mult(mult(X2,X3),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_53,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
mult(X1,mult(X2,X3)) = mult(mult(X3,X2),X1),
inference(ar,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_11]),c_0_11]),c_0_13]) ).
cnf(c_0_55,plain,
mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2)),
inference(ar,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_13]) ).
cnf(c_0_56,negated_conjecture,
mult(c,mult(a,b)) != mult(a,mult(b,c)),
inference(rw,[status(thm)],[c_0_53,c_0_13]) ).
cnf(c_0_57,plain,
mult(X1,mult(X2,X3)) = mult(X3,mult(X1,X2)),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP747+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 20:32:41 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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
% 4.32/1.27 % Version: 3.5.1
% 4.32/1.27 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.32/1.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.32/1.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.32/1.27 % Starting new_bool_3 with 300s (1) cores
% 4.32/1.27 % Starting new_bool_1 with 300s (1) cores
% 4.32/1.27 % Starting sh5l with 300s (1) cores
% 4.32/1.27 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 594357 completed with status 0
% 4.32/1.27 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.32/1.27 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.32/1.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.32/1.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.32/1.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.32/1.27 % No SInE strategy applied
% 4.32/1.27 % Search class: FGUPM-FFSF22-MFFFFFNN
% 4.32/1.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.32/1.27 % Starting SubtermCWHack with 136s (1) cores
% 4.32/1.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.32/1.27 % Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 226s (1) cores
% 4.32/1.27 % Starting G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 4.32/1.27 % Starting new_bool_3 with 150s (1) cores
% 4.32/1.27 % G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 594364 completed with status 0
% 4.32/1.27 % Result found by G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.32/1.27 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.32/1.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.32/1.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.32/1.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.32/1.27 % No SInE strategy applied
% 4.32/1.27 % Search class: FGUPM-FFSF22-MFFFFFNN
% 4.32/1.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.32/1.27 % Starting SubtermCWHack with 136s (1) cores
% 4.32/1.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.32/1.27 % Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 226s (1) cores
% 4.32/1.27 % Starting G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 4.32/1.27 % Preprocessing time : 0.001 s
% 4.32/1.27 % Presaturation interreduction done
% 4.32/1.27
% 4.32/1.27 % Proof found!
% 4.32/1.27 % SZS status Theorem
% 4.32/1.27 % SZS output start CNFRefutation
% See solution above
% 4.32/1.27 % Parsed axioms : 9
% 4.32/1.27 % Removed by relevancy pruning/SinE : 0
% 4.32/1.27 % Initial clauses : 12
% 4.32/1.27 % Removed in clause preprocessing : 0
% 4.32/1.27 % Initial clauses in saturation : 12
% 4.32/1.27 % Processed clauses : 523
% 4.32/1.27 % ...of these trivial : 84
% 4.32/1.27 % ...subsumed : 286
% 4.32/1.27 % ...remaining for further processing : 153
% 4.32/1.27 % Other redundant clauses eliminated : 0
% 4.32/1.27 % Clauses deleted for lack of memory : 0
% 4.32/1.27 % Backward-subsumed : 4
% 4.32/1.27 % Backward-rewritten : 86
% 4.32/1.27 % Generated clauses : 24452
% 4.32/1.27 % ...of the previous two non-redundant : 22750
% 4.32/1.27 % ...aggressively subsumed : 0
% 4.32/1.27 % Contextual simplify-reflections : 0
% 4.32/1.27 % Paramodulations : 24422
% 4.32/1.27 % Factorizations : 23
% 4.32/1.27 % NegExts : 0
% 4.32/1.27 % Equation resolutions : 7
% 4.32/1.27 % Disequality decompositions : 0
% 4.32/1.27 % Total rewrite steps : 22841
% 4.32/1.27 % ...of those cached : 20589
% 4.32/1.27 % Propositional unsat checks : 0
% 4.32/1.27 % Propositional check models : 0
% 4.32/1.27 % Propositional check unsatisfiable : 0
% 4.32/1.27 % Propositional clauses : 0
% 4.32/1.27 % Propositional clauses after purity: 0
% 4.32/1.27 % Propositional unsat core size : 0
% 4.32/1.27 % Propositional preprocessing time : 0.000
% 4.32/1.27 % Propositional encoding time : 0.000
% 4.32/1.27 % Propositional solver time : 0.000
% 4.32/1.27 % Success case prop preproc time : 0.000
% 4.32/1.27 % Success case prop encoding time : 0.000
% 4.32/1.27 % Success case prop solver time : 0.000
% 4.32/1.27 % Current number of processed clauses : 53
% 4.32/1.27 % Positive orientable unit clauses : 43
% 4.32/1.27 % Positive unorientable unit clauses: 7
% 4.32/1.27 % Negative unit clauses : 0
% 4.32/1.27 % Non-unit-clauses : 3
% 4.32/1.27 % Current number of unprocessed clauses: 22196
% 4.32/1.27 % ...number of literals in the above : 49461
% 4.32/1.27 % Current number of archived formulas : 0
% 4.32/1.27 % Current number of archived clauses : 100
% 4.32/1.27 % Clause-clause subsumption calls (NU) : 2056
% 4.32/1.27 % Rec. Clause-clause subsumption calls : 1988
% 4.32/1.27 % Non-unit clause-clause subsumptions : 57
% 4.32/1.27 % Unit Clause-clause subsumption calls : 331
% 4.32/1.27 % Rewrite failures with RHS unbound : 0
% 4.32/1.27 % BW rewrite match attempts : 585
% 4.32/1.27 % BW rewrite match successes : 282
% 4.32/1.27 % Condensation attempts : 0
% 4.32/1.27 % Condensation successes : 0
% 4.32/1.27 % Termbank termtop insertions : 501205
% 4.32/1.27 % Search garbage collected termcells : 9
% 4.32/1.27
% 4.32/1.27 % -------------------------------------------------
% 4.32/1.27 % User time : 0.697 s
% 4.32/1.27 % System time : 0.029 s
% 4.32/1.27 % Total time : 0.726 s
% 4.32/1.27 % Maximum resident set size: 3636 pages
% 4.32/1.27
% 4.32/1.27 % -------------------------------------------------
% 4.32/1.27 % User time : 2.284 s
% 4.32/1.27 % System time : 0.123 s
% 4.32/1.27 % Total time : 2.408 s
% 4.32/1.27 % Maximum resident set size: 4864 pages
% 4.32/1.27 % E exiting
%------------------------------------------------------------------------------