%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP436-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:39:48 PM UTC 2026
% Result : Unsatisfiable 0.61s 0.58s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 2
% Syntax : Number of clauses : 54 ( 54 unt; 0 nHn; 4 RR)
% Number of literals : 54 ( 53 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 13 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 164 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X1))))) = X4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c_0_2,axiom,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X1))))) = X4,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(X3,X4))),inverse(X5))),multiply(X5,multiply(X3,X1))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(multiply(multiply(X2,multiply(X3,inverse(X4))),multiply(X4,multiply(X5,X1))))) = multiply(X6,multiply(multiply(inverse(X6),inverse(multiply(X3,X5))),inverse(X2))),
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(X2,multiply(inverse(X3),inverse(multiply(X4,multiply(X5,multiply(X2,inverse(X3))))))))),inverse(X5))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
multiply(inverse(X1),inverse(multiply(multiply(inverse(X2),inverse(multiply(X3,multiply(X1,multiply(X4,inverse(X2)))))),X3))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_5]) ).
cnf(c_0_7,plain,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(X4,X1))))) = multiply(inverse(X5),inverse(multiply(X2,multiply(X3,multiply(X4,inverse(X5)))))),
inference(spm,[status(thm)],[c_0_2,c_0_6]) ).
cnf(c_0_8,plain,
multiply(inverse(X1),inverse(multiply(multiply(X2,inverse(multiply(X3,multiply(X1,multiply(X4,X2))))),X3))) = X4,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(multiply(inverse(X2),inverse(multiply(X3,X4))),X3))),inverse(X2))) = X4,
inference(spm,[status(thm)],[c_0_5,c_0_2]) ).
cnf(c_0_10,plain,
multiply(inverse(X1),inverse(multiply(multiply(inverse(X2),inverse(multiply(X3,X4))),X3))) = multiply(inverse(X1),inverse(multiply(multiply(inverse(X2),inverse(multiply(X5,X4))),X5))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
inverse(multiply(multiply(inverse(X1),inverse(multiply(X2,X3))),X2)) = inverse(multiply(multiply(inverse(X1),inverse(multiply(X4,X3))),X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_9]) ).
cnf(c_0_12,plain,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(X4,X1))))) = multiply(X5,inverse(multiply(X2,multiply(X3,multiply(X4,X5))))),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_13,plain,
inverse(multiply(multiply(a1,inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(X3,X4))),a1))))),X1)) = inverse(multiply(X3,X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_2]),c_0_12]) ).
cnf(c_0_14,plain,
multiply(inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(X3,X1))),multiply(inverse(X4),inverse(multiply(X5,X6))))))),inverse(multiply(X6,multiply(X4,X3)))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_15,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(X2,multiply(X3,inverse(multiply(X4,multiply(X5,multiply(X2,X3)))))))),inverse(X5))) = X4,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_16,plain,
inverse(multiply(multiply(a1,inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),inverse(X3)),a1))))),X1)) = inverse(X3),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),inverse(X5)))))),inverse(X6))) = multiply(X5,multiply(X4,inverse(X6))),
inference(spm,[status(thm)],[c_0_15,c_0_4]) ).
cnf(c_0_18,plain,
inverse(multiply(multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(X4)),X1))))),X2)) = inverse(X4),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_19,plain,
multiply(multiply(multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(X4)),X1))))),X2),multiply(X5,inverse(X6))) = multiply(X4,multiply(X5,inverse(X6))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_17]) ).
cnf(c_0_20,plain,
multiply(multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(X4)),X1))))),X2) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_19]),c_0_2]) ).
cnf(c_0_21,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(X2,X3))),inverse(X4))) = multiply(X5,multiply(multiply(inverse(X5),inverse(multiply(X2,X3))),inverse(X4))),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_22,plain,
multiply(X1,inverse(multiply(multiply(X2,multiply(multiply(inverse(X2),inverse(X3)),inverse(X4))),multiply(X4,X3)))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_20]) ).
cnf(c_0_23,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(X2)),inverse(X3))) = multiply(X4,multiply(multiply(inverse(X4),inverse(X2)),inverse(X3))),
inference(spm,[status(thm)],[c_0_21,c_0_8]) ).
cnf(c_0_24,plain,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),inverse(multiply(X3,X4))),inverse(X5)),multiply(X6,multiply(multiply(inverse(X6),inverse(multiply(a1,multiply(multiply(inverse(a1),inverse(multiply(X3,X4))),inverse(X5))))),X1))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_4]),c_0_4]) ).
cnf(c_0_25,plain,
inverse(multiply(multiply(inverse(X1),inverse(X2)),X2)) = inverse(multiply(multiply(inverse(X1),inverse(X3)),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_22]),c_0_22]) ).
cnf(c_0_26,plain,
multiply(X1,multiply(inverse(X1),inverse(X2))) = multiply(X3,multiply(inverse(X3),inverse(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_22]) ).
cnf(c_0_27,plain,
multiply(multiply(inverse(X1),inverse(X2)),X2) = multiply(multiply(inverse(X1),inverse(X3)),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_24]) ).
cnf(c_0_28,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_22]) ).
cnf(c_0_29,plain,
multiply(multiply(inverse(X1),inverse(X2)),X2) = multiply(multiply(X3,inverse(X3)),inverse(X1)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
multiply(X1,inverse(X1)) = multiply(multiply(a1,inverse(a1)),inverse(multiply(X2,inverse(X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_29]) ).
cnf(c_0_31,plain,
multiply(X1,inverse(X1)) = multiply(multiply(X2,inverse(X2)),inverse(multiply(X3,inverse(X3)))),
inference(spm,[status(thm)],[c_0_30,c_0_28]) ).
cnf(c_0_32,plain,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X4))))) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_9]) ).
cnf(c_0_33,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(X3,X1))),X3))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_31]) ).
cnf(c_0_34,plain,
multiply(X1,inverse(multiply(a1,inverse(a1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_33]),c_0_15]) ).
cnf(c_0_35,plain,
multiply(X1,inverse(multiply(X2,inverse(X2)))) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_28]) ).
cnf(c_0_36,plain,
multiply(inverse(X1),multiply(X2,multiply(inverse(X2),X1))) = multiply(a1,inverse(a1)),
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_37,plain,
multiply(X1,multiply(X2,inverse(X2))) = multiply(X3,multiply(inverse(X3),inverse(inverse(X1)))),
inference(spm,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_38,plain,
multiply(inverse(inverse(inverse(X1))),multiply(X1,multiply(a1,inverse(a1)))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_39,plain,
multiply(X1,multiply(inverse(X1),inverse(X2))) = inverse(inverse(inverse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_38]),c_0_34]),c_0_34]) ).
cnf(c_0_40,plain,
multiply(X1,multiply(X2,inverse(X2))) = inverse(inverse(inverse(inverse(X1)))),
inference(rw,[status(thm)],[c_0_37,c_0_39]) ).
cnf(c_0_41,plain,
multiply(multiply(X1,inverse(X1)),inverse(X2)) = inverse(inverse(inverse(inverse(inverse(X2))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_40]),c_0_35]) ).
cnf(c_0_42,plain,
multiply(X1,inverse(X1)) = inverse(inverse(inverse(multiply(a1,inverse(a1))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_33]) ).
cnf(c_0_43,plain,
inverse(inverse(multiply(a1,inverse(a1)))) = multiply(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_41]),c_0_33]),c_0_42]) ).
cnf(c_0_44,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_43]),c_0_42]),c_0_40]) ).
cnf(c_0_45,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(rw,[status(thm)],[c_0_40,c_0_44]) ).
cnf(c_0_46,plain,
inverse(multiply(X1,inverse(X1))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_45]),c_0_45]) ).
cnf(c_0_47,plain,
inverse(inverse(inverse(X1))) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_46]),c_0_41]),c_0_44]),c_0_41]),c_0_44]) ).
cnf(c_0_48,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_44,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_50,plain,
multiply(X1,multiply(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_49 ).
cnf(c_0_52,plain,
multiply(inverse(X1),X1) = multiply(a1,inverse(a1)),
inference(spm,[status(thm)],[c_0_36,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP436-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n011.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:13:10 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.61/0.58 % Version: 3.5.1
% 0.61/0.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.61/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.61/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.61/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.61/0.58 % Starting sh5l with 300s (1) cores
% 0.61/0.58 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 75501 completed with status 0
% 0.61/0.58 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.61/0.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.61/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.61/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/0.58 % No SInE strategy applied
% 0.61/0.58 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.61/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.61/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.61/0.58 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.61/0.58 % Starting new_bool_3 with 136s (1) cores
% 0.61/0.58 % Starting new_bool_1 with 136s (1) cores
% 0.61/0.58 % U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 75508 completed with status 0
% 0.61/0.58 % Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.61/0.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.61/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.61/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/0.58 % No SInE strategy applied
% 0.61/0.58 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.61/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.61/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.61/0.58 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.61/0.58 % Preprocessing time : 0.001 s
% 0.61/0.58 % Presaturation interreduction done
% 0.61/0.58
% 0.61/0.58 % Proof found!
% 0.61/0.58 % SZS status Unsatisfiable
% 0.61/0.58 % SZS output start CNFRefutation
% See solution above
% 0.61/0.58 % Parsed axioms : 2
% 0.61/0.58 % Removed by relevancy pruning/SinE : 0
% 0.61/0.58 % Initial clauses : 2
% 0.61/0.58 % Removed in clause preprocessing : 0
% 0.61/0.58 % Initial clauses in saturation : 2
% 0.61/0.58 % Processed clauses : 290
% 0.61/0.58 % ...of these trivial : 54
% 0.61/0.58 % ...subsumed : 163
% 0.61/0.58 % ...remaining for further processing : 73
% 0.61/0.58 % Other redundant clauses eliminated : 0
% 0.61/0.58 % Clauses deleted for lack of memory : 0
% 0.61/0.58 % Backward-subsumed : 3
% 0.61/0.58 % Backward-rewritten : 32
% 0.61/0.58 % Generated clauses : 8519
% 0.61/0.58 % ...of the previous two non-redundant : 7730
% 0.61/0.58 % ...aggressively subsumed : 0
% 0.61/0.58 % Contextual simplify-reflections : 0
% 0.61/0.58 % Paramodulations : 8519
% 0.61/0.58 % Factorizations : 0
% 0.61/0.58 % NegExts : 0
% 0.61/0.58 % Equation resolutions : 0
% 0.61/0.58 % Disequality decompositions : 0
% 0.61/0.58 % Total rewrite steps : 2788
% 0.61/0.58 % ...of those cached : 1656
% 0.61/0.58 % Propositional unsat checks : 0
% 0.61/0.58 % Propositional check models : 0
% 0.61/0.58 % Propositional check unsatisfiable : 0
% 0.61/0.58 % Propositional clauses : 0
% 0.61/0.58 % Propositional clauses after purity: 0
% 0.61/0.58 % Propositional unsat core size : 0
% 0.61/0.58 % Propositional preprocessing time : 0.000
% 0.61/0.58 % Propositional encoding time : 0.000
% 0.61/0.58 % Propositional solver time : 0.000
% 0.61/0.58 % Success case prop preproc time : 0.000
% 0.61/0.58 % Success case prop encoding time : 0.000
% 0.61/0.58 % Success case prop solver time : 0.000
% 0.61/0.58 % Current number of processed clauses : 36
% 0.61/0.58 % Positive orientable unit clauses : 25
% 0.61/0.58 % Positive unorientable unit clauses: 11
% 0.61/0.58 % Negative unit clauses : 0
% 0.61/0.58 % Non-unit-clauses : 0
% 0.61/0.58 % Current number of unprocessed clauses: 7311
% 0.61/0.58 % ...number of literals in the above : 7311
% 0.61/0.58 % Current number of archived formulas : 0
% 0.61/0.58 % Current number of archived clauses : 37
% 0.61/0.58 % Clause-clause subsumption calls (NU) : 0
% 0.61/0.58 % Rec. Clause-clause subsumption calls : 0
% 0.61/0.58 % Non-unit clause-clause subsumptions : 0
% 0.61/0.58 % Unit Clause-clause subsumption calls : 160
% 0.61/0.58 % Rewrite failures with RHS unbound : 0
% 0.61/0.58 % BW rewrite match attempts : 715
% 0.61/0.58 % BW rewrite match successes : 96
% 0.61/0.58 % Condensation attempts : 0
% 0.61/0.58 % Condensation successes : 0
% 0.61/0.58 % Termbank termtop insertions : 197495
% 0.61/0.58 % Search garbage collected termcells : 2
% 0.61/0.58
% 0.61/0.58 % -------------------------------------------------
% 0.61/0.58 % User time : 0.144 s
% 0.61/0.58 % System time : 0.014 s
% 0.61/0.58 % Total time : 0.158 s
% 0.61/0.58 % Maximum resident set size: 3636 pages
% 0.61/0.58
% 0.61/0.58 % -------------------------------------------------
% 0.61/0.58 % User time : 0.704 s
% 0.61/0.58 % System time : 0.059 s
% 0.61/0.58 % Total time : 0.763 s
% 0.61/0.58 % Maximum resident set size: 4864 pages
% 0.61/0.58 % E exiting
%------------------------------------------------------------------------------