%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP014-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:37:27 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.83s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 2
% Syntax : Number of clauses : 54 ( 54 unt; 0 nHn; 5 RR)
% Number of literals : 54 ( 53 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 139 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(group_axiom,axiom,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(inverse(X1),X3))),X4),inverse(multiply(X2,X4))))) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',group_axiom) ).
cnf(prove_associativity,negated_conjecture,
multiply(a,multiply(b,c)) != multiply(multiply(a,b),c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_associativity) ).
cnf(c_0_2,axiom,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(inverse(X1),X3))),X4),inverse(multiply(X2,X4))))) = X3,
group_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),X3)),X4),inverse(multiply(X2,X4))))) = inverse(multiply(multiply(inverse(multiply(inverse(X5),multiply(inverse(inverse(X1)),X3))),X6),inverse(multiply(X5,X6)))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(inverse(X1),multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),X3)),X4),inverse(multiply(X2,X4)))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(X1),multiply(X1,multiply(X2,inverse(multiply(multiply(inverse(multiply(inverse(X3),X4)),X5),inverse(multiply(X3,X5))))))) = multiply(inverse(inverse(X2)),X4),
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_6,plain,
multiply(inverse(X1),multiply(X1,X2)) = multiply(inverse(inverse(X3)),multiply(inverse(X3),X2)),
inference(spm,[status(thm)],[c_0_5,c_0_2]) ).
cnf(c_0_7,plain,
multiply(inverse(X1),multiply(X1,X2)) = multiply(inverse(X3),multiply(X3,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),X4),inverse(multiply(inverse(X1),X4))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),multiply(X1,X4)),inverse(multiply(inverse(X5),multiply(X5,X4)))))) = X3,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
multiply(inverse(X1),multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),X4),inverse(multiply(X5,X4)))))) = multiply(X5,X3),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_11,plain,
multiply(multiply(inverse(X1),multiply(X1,X2)),inverse(multiply(X3,inverse(X3)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_4]),c_0_4]) ).
cnf(c_0_12,plain,
multiply(inverse(multiply(inverse(X1),multiply(X1,X2))),X2) = multiply(inverse(multiply(inverse(X3),multiply(X3,X4))),X4),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
multiply(inverse(multiply(inverse(X1),multiply(X1,X2))),X2) = multiply(inverse(X3),multiply(X3,inverse(multiply(X4,inverse(X4))))),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,plain,
multiply(inverse(inverse(X1)),multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),X3)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_12]),c_0_4]) ).
cnf(c_0_15,plain,
multiply(X1,inverse(multiply(X2,inverse(X2)))) = multiply(X1,inverse(multiply(X3,inverse(X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_14]) ).
cnf(c_0_16,plain,
inverse(multiply(X1,inverse(X1))) = inverse(multiply(X2,inverse(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_15]),c_0_2]) ).
cnf(c_0_17,plain,
multiply(inverse(X1),multiply(X1,multiply(X2,inverse(multiply(X3,inverse(X3)))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_14]) ).
cnf(c_0_18,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_14]) ).
cnf(c_0_19,plain,
multiply(inverse(X1),multiply(X1,multiply(X2,inverse(X2)))) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
inverse(multiply(multiply(inverse(multiply(inverse(X1),multiply(inverse(X2),multiply(X2,X3)))),X4),inverse(multiply(X1,X4)))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_7]),c_0_2]) ).
cnf(c_0_21,plain,
multiply(X1,multiply(X2,inverse(X2))) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_19]),c_0_20]) ).
cnf(c_0_22,plain,
multiply(inverse(X1),multiply(X1,inverse(X2))) = inverse(inverse(inverse(X2))),
inference(spm,[status(thm)],[c_0_7,c_0_21]) ).
cnf(c_0_23,plain,
multiply(inverse(X1),multiply(X1,X2)) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_24,plain,
inverse(inverse(multiply(X1,inverse(X1)))) = multiply(a,inverse(a)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_18]) ).
cnf(c_0_25,plain,
multiply(inverse(inverse(X1)),multiply(inverse(X2),multiply(X2,X3))) = multiply(inverse(X4),multiply(X4,multiply(X1,X3))),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_26,plain,
inverse(multiply(a,inverse(a))) = multiply(a,inverse(a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_24]),c_0_21]),c_0_24]),c_0_24]) ).
cnf(c_0_27,plain,
inverse(multiply(multiply(inverse(multiply(inverse(a),multiply(a,multiply(X1,X2)))),multiply(X1,X3)),inverse(multiply(inverse(X4),multiply(X4,X3))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_7]),c_0_25]) ).
cnf(c_0_28,plain,
multiply(inverse(inverse(inverse(X1))),X1) = multiply(inverse(inverse(inverse(X2))),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_14]),c_0_4]) ).
cnf(c_0_29,plain,
inverse(multiply(X1,inverse(X1))) = multiply(X1,inverse(X1)),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_30,plain,
inverse(multiply(multiply(inverse(multiply(inverse(X1),multiply(X1,X2))),X2),inverse(multiply(inverse(X3),multiply(X3,X4))))) = X4,
inference(spm,[status(thm)],[c_0_27,c_0_12]) ).
cnf(c_0_31,plain,
multiply(inverse(inverse(inverse(X1))),X1) = multiply(a,inverse(a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24]),c_0_21]),c_0_24]) ).
cnf(c_0_32,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_29]),c_0_23]),c_0_23]),c_0_23]),c_0_21]) ).
cnf(c_0_33,plain,
inverse(multiply(multiply(a,inverse(a)),inverse(inverse(inverse(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_21]),c_0_31]),c_0_23]) ).
cnf(c_0_34,plain,
inverse(multiply(multiply(a,inverse(a)),X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_35,plain,
multiply(multiply(a,inverse(a)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_34]),c_0_14]) ).
cnf(c_0_36,plain,
multiply(X1,multiply(inverse(inverse(inverse(X1))),X2)) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_23,c_0_32]) ).
cnf(c_0_37,plain,
inverse(multiply(multiply(inverse(multiply(inverse(X1),multiply(X1,multiply(X2,X3)))),X4),inverse(multiply(inverse(X2),X4)))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_25]),c_0_2]) ).
cnf(c_0_38,plain,
multiply(inverse(X1),X1) = multiply(a,inverse(a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_35]),c_0_29]),c_0_35]),c_0_23]),c_0_31]) ).
cnf(c_0_39,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_35]),c_0_24]),c_0_29]),c_0_35]) ).
cnf(c_0_40,plain,
inverse(multiply(X1,inverse(multiply(X2,X1)))) = X2,
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_37,c_0_38]),c_0_21]),c_0_39]),c_0_38]),c_0_29]),c_0_35]),c_0_39]) ).
cnf(c_0_41,plain,
multiply(X1,inverse(multiply(multiply(inverse(multiply(inverse(X2),multiply(X2,X3))),X3),inverse(multiply(inverse(X1),X4))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_12]) ).
cnf(c_0_42,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[c_0_23,c_0_39]) ).
cnf(c_0_44,plain,
inverse(multiply(multiply(inverse(X1),multiply(X1,X2)),inverse(multiply(X3,multiply(multiply(inverse(X3),multiply(inverse(X4),multiply(X4,X5))),X2))))) = X5,
inference(spm,[status(thm)],[c_0_20,c_0_7]) ).
cnf(c_0_45,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
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_41,c_0_42]),c_0_23]),c_0_39]),c_0_38]),c_0_39]),c_0_35]) ).
cnf(c_0_46,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_39]) ).
cnf(c_0_47,plain,
multiply(multiply(X1,multiply(multiply(inverse(X1),X2),X3)),inverse(X3)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_23]),c_0_39]),c_0_23]),c_0_39]) ).
cnf(c_0_48,negated_conjecture,
multiply(a,multiply(b,c)) != multiply(multiply(a,b),c),
inference(fof_simplification,[status(thm)],[prove_associativity]) ).
cnf(c_0_49,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_39]),c_0_39]) ).
cnf(c_0_50,plain,
multiply(X1,multiply(multiply(inverse(X1),X2),X3)) = multiply(X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_39]) ).
cnf(c_0_51,negated_conjecture,
multiply(a,multiply(b,c)) != multiply(multiply(a,b),c),
c_0_48 ).
cnf(c_0_52,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_39]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP014-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.57 % Computer : n020.cluster.edu
% 0.09/0.57 % Model : x86_64 x86_64
% 0.09/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57 % Memory : 8046.5625MB
% 0.09/0.57 % OS : Linux 6.8.0-71-generic
% 0.09/0.58 % CPULimit : 300
% 0.09/0.58 % WCLimit : 300
% 0.09/0.58 % DateTime : Sun Sep 20 19:54:33 UTC 2026
% 0.09/0.58 % CPUTime :
% 0.09/0.58 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.62 Running first-order theorem proving
% 0.09/0.62 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.14/0.83 % Version: 3.5.1
% 0.14/0.83 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.83 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.83 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.83 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.83 % Starting sh5l with 300s (1) cores
% 0.14/0.83 % new_bool_3 with pid 1080055 completed with status 9
% 0.14/0.83 % new_bool_1 with pid 1080056 completed with status 9
% 0.14/0.83 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1080054 completed with status 0
% 0.14/0.83 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.83 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.83 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.83 % No SInE strategy applied
% 0.14/0.83 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.14/0.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.83 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.83 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.83 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.83 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.83 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.83 % U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1080062 completed with status 0
% 0.14/0.83 % Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.83 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.83 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.83 % No SInE strategy applied
% 0.14/0.83 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.14/0.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.83 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.83 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.83 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.83 % Preprocessing time : 0.001 s
% 0.14/0.83 % Presaturation interreduction done
% 0.14/0.83
% 0.14/0.83 % Proof found!
% 0.14/0.83 % SZS status Unsatisfiable
% 0.14/0.83 % SZS output start CNFRefutation
% See solution above
% 0.14/0.83 % Parsed axioms : 2
% 0.14/0.83 % Removed by relevancy pruning/SinE : 0
% 0.14/0.83 % Initial clauses : 2
% 0.14/0.83 % Removed in clause preprocessing : 0
% 0.14/0.83 % Initial clauses in saturation : 2
% 0.14/0.83 % Processed clauses : 288
% 0.14/0.83 % ...of these trivial : 70
% 0.14/0.83 % ...subsumed : 147
% 0.14/0.83 % ...remaining for further processing : 71
% 0.14/0.83 % Other redundant clauses eliminated : 0
% 0.14/0.83 % Clauses deleted for lack of memory : 0
% 0.14/0.83 % Backward-subsumed : 2
% 0.14/0.83 % Backward-rewritten : 55
% 0.14/0.83 % Generated clauses : 7924
% 0.14/0.83 % ...of the previous two non-redundant : 7342
% 0.14/0.83 % ...aggressively subsumed : 0
% 0.14/0.83 % Contextual simplify-reflections : 0
% 0.14/0.83 % Paramodulations : 7924
% 0.14/0.83 % Factorizations : 0
% 0.14/0.83 % NegExts : 0
% 0.14/0.83 % Equation resolutions : 0
% 0.14/0.83 % Disequality decompositions : 0
% 0.14/0.83 % Total rewrite steps : 5567
% 0.14/0.83 % ...of those cached : 4223
% 0.14/0.83 % Propositional unsat checks : 0
% 0.14/0.83 % Propositional check models : 0
% 0.14/0.83 % Propositional check unsatisfiable : 0
% 0.14/0.83 % Propositional clauses : 0
% 0.14/0.83 % Propositional clauses after purity: 0
% 0.14/0.83 % Propositional unsat core size : 0
% 0.14/0.83 % Propositional preprocessing time : 0.000
% 0.14/0.83 % Propositional encoding time : 0.000
% 0.14/0.83 % Propositional solver time : 0.000
% 0.14/0.83 % Success case prop preproc time : 0.000
% 0.14/0.83 % Success case prop encoding time : 0.000
% 0.14/0.83 % Success case prop solver time : 0.000
% 0.14/0.83 % Current number of processed clauses : 12
% 0.14/0.83 % Positive orientable unit clauses : 11
% 0.14/0.83 % Positive unorientable unit clauses: 1
% 0.14/0.83 % Negative unit clauses : 0
% 0.14/0.83 % Non-unit-clauses : 0
% 0.14/0.83 % Current number of unprocessed clauses: 2121
% 0.14/0.83 % ...number of literals in the above : 2121
% 0.14/0.83 % Current number of archived formulas : 0
% 0.14/0.83 % Current number of archived clauses : 59
% 0.14/0.83 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.83 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.83 % Non-unit clause-clause subsumptions : 0
% 0.14/0.83 % Unit Clause-clause subsumption calls : 185
% 0.14/0.83 % Rewrite failures with RHS unbound : 0
% 0.14/0.83 % BW rewrite match attempts : 586
% 0.14/0.83 % BW rewrite match successes : 89
% 0.14/0.83 % Condensation attempts : 0
% 0.14/0.83 % Condensation successes : 0
% 0.14/0.83 % Termbank termtop insertions : 219065
% 0.14/0.83 % Search garbage collected termcells : 2
% 0.14/0.83
% 0.14/0.83 % -------------------------------------------------
% 0.14/0.83 % User time : 0.168 s
% 0.14/0.83 % System time : 0.014 s
% 0.14/0.83 % Total time : 0.182 s
% 0.14/0.83 % Maximum resident set size: 3636 pages
% 0.14/0.83
% 0.14/0.83 % -------------------------------------------------
% 0.14/0.83 % User time : 0.862 s
% 0.14/0.83 % System time : 0.102 s
% 0.14/0.83 % Total time : 0.965 s
% 0.14/0.83 % Maximum resident set size: 4864 pages
% 0.14/0.83 % E exiting
%------------------------------------------------------------------------------