%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP419-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 : 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:39:46 PM UTC 2026
% Result : Unsatisfiable 1.78s 0.69s
% Output : CNFRefutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 2
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 12 RR)
% Number of literals : 43 ( 42 equ; 11 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 15 ( 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 : 113 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_0_2,axiom,
inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),multiply(X4,X5)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(inverse(multiply(b2,inverse(multiply(inverse(inverse(X1)),inverse(multiply(b2,inverse(multiply(inverse(b2),b2)))))))),multiply(b2,b2)) = X1,
inference(rw,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),multiply(X4,X5)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_6,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(inverse(X2)),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)) = multiply(inverse(multiply(X4,inverse(multiply(X2,inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),multiply(X4,X5)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_3]),c_0_3]),c_0_6]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)) = multiply(inverse(multiply(inverse(multiply(X4,inverse(multiply(inverse(inverse(X5)),inverse(multiply(X6,inverse(multiply(inverse(X6),X6)))))))),inverse(multiply(X2,inverse(multiply(multiply(X4,X6),inverse(multiply(inverse(multiply(X4,X6)),multiply(X4,X6))))))))),X5),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
inverse(multiply(inverse(multiply(X1,multiply(inverse(multiply(b2,inverse(multiply(inverse(X2),inverse(multiply(b2,inverse(multiply(inverse(b2),b2)))))))),multiply(b2,b2)))),multiply(X1,X3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(inverse(inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))),inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),inverse(multiply(X2,inverse(multiply(multiply(X4,X5),inverse(multiply(inverse(multiply(X4,X5)),multiply(X4,X5)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_8]),c_0_6]),c_0_3]) ).
cnf(c_0_10,plain,
multiply(inverse(inverse(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,X3)))),inverse(multiply(X3,inverse(multiply(inverse(X3),X3))))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_9]),c_0_6]),c_0_6]) ).
cnf(c_0_11,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,X3)) = multiply(inverse(multiply(X4,inverse(X2))),multiply(X4,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_10]),c_0_6]) ).
cnf(c_0_12,plain,
multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(inverse(X2),X2)))))),multiply(X1,X3)) = multiply(inverse(X4),multiply(inverse(inverse(multiply(inverse(multiply(X5,inverse(X4))),multiply(X5,X2)))),X3)),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_13,plain,
multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(inverse(X2),X2)))))),multiply(X1,inverse(multiply(X2,inverse(multiply(inverse(X2),X2)))))) = multiply(inverse(X3),X3),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_15,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
c_0_14 ).
cnf(c_0_17,plain,
multiply(inverse(inverse(multiply(inverse(X1),X1))),inverse(multiply(inverse(X2),inverse(multiply(inverse(b2),b2))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
multiply(multiply(inverse(X1),X1),a2) != a2,
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_19,plain,
multiply(inverse(X1),X1) = inverse(multiply(inverse(b2),b2)),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_20,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),inverse(X3))),multiply(inverse(multiply(X4,inverse(X2))),multiply(X4,X5))) = multiply(inverse(multiply(X6,inverse(X3))),multiply(X6,multiply(X1,X5))),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
multiply(multiply(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)),multiply(inverse(multiply(X4,inverse(multiply(X2,inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),multiply(X4,X5))),a2) != a2,
inference(spm,[status(thm)],[c_0_18,c_0_3]) ).
cnf(c_0_22,plain,
multiply(inverse(X1),X1) = inverse(multiply(inverse(X2),X2)),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_23,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),inverse(X3))),multiply(inverse(X4),X4)) = multiply(inverse(multiply(b2,inverse(X3))),multiply(b2,multiply(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_20]) ).
cnf(c_0_24,plain,
multiply(inverse(multiply(inverse(X1),X1)),multiply(inverse(inverse(X2)),multiply(X3,X4))) = multiply(inverse(multiply(b2,inverse(X2))),multiply(b2,multiply(X3,X4))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_20]) ).
cnf(c_0_25,negated_conjecture,
multiply(multiply(inverse(multiply(X1,multiply(inverse(b2),b2))),multiply(inverse(multiply(X2,multiply(inverse(X3),X3))),multiply(X2,X1))),a2) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_6]),c_0_22]) ).
cnf(c_0_26,plain,
multiply(inverse(multiply(inverse(X1),inverse(X2))),multiply(inverse(X3),X3)) = multiply(inverse(multiply(b2,inverse(X2))),multiply(b2,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_6]) ).
cnf(c_0_27,plain,
multiply(inverse(multiply(inverse(X1),X1)),multiply(inverse(inverse(X2)),X3)) = multiply(inverse(multiply(b2,inverse(X2))),multiply(b2,X3)),
inference(spm,[status(thm)],[c_0_24,c_0_6]) ).
cnf(c_0_28,negated_conjecture,
multiply(multiply(inverse(multiply(X1,multiply(inverse(X2),X2))),multiply(inverse(multiply(X3,multiply(inverse(X4),X4))),multiply(X3,X1))),a2) != a2,
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_29,plain,
multiply(multiply(inverse(X1),X1),multiply(inverse(X2),X2)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_15]) ).
cnf(c_0_30,plain,
multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(X1),multiply(inverse(X2),X2)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_31,plain,
multiply(inverse(multiply(inverse(X1),X1)),multiply(inverse(X2),X2)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_15]),c_0_15]) ).
cnf(c_0_32,negated_conjecture,
multiply(multiply(inverse(multiply(X1,multiply(inverse(X2),X2))),multiply(multiply(inverse(b2),b2),multiply(multiply(inverse(X3),X3),X1))),a2) != a2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22]) ).
cnf(c_0_33,plain,
multiply(inverse(multiply(X1,multiply(inverse(X2),X2))),multiply(X1,X3)) = multiply(X3,multiply(inverse(b2),b2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_22]),c_0_6]),c_0_22]) ).
cnf(c_0_34,plain,
multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(X2),multiply(inverse(X3),X3)))) = X2,
inference(spm,[status(thm)],[c_0_30,c_0_15]) ).
cnf(c_0_35,plain,
multiply(multiply(inverse(b2),b2),multiply(inverse(X1),X1)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[c_0_31,c_0_22]) ).
cnf(c_0_36,negated_conjecture,
multiply(multiply(inverse(multiply(X1,multiply(inverse(b2),b2))),multiply(multiply(inverse(b2),b2),X1)),a2) != a2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
multiply(multiply(inverse(b2),b2),X1) = multiply(X1,multiply(inverse(b2),b2)),
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_33,c_0_17]),c_0_22]),c_0_22]),c_0_35]),c_0_22]),c_0_26]),c_0_22]),c_0_33]) ).
cnf(c_0_38,negated_conjecture,
multiply(a2,multiply(inverse(b2),b2)) != a2,
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_36,c_0_37]),c_0_35]),c_0_22]),c_0_35]),c_0_35]),c_0_37]) ).
cnf(c_0_39,plain,
multiply(multiply(inverse(X1),X1),X2) = multiply(X2,multiply(inverse(X1),X1)),
inference(spm,[status(thm)],[c_0_37,c_0_15]) ).
cnf(c_0_40,negated_conjecture,
multiply(a2,multiply(inverse(X1),X1)) != a2,
inference(spm,[status(thm)],[c_0_38,c_0_15]) ).
cnf(c_0_41,plain,
multiply(X1,multiply(inverse(b2),b2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_39]),c_0_34]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_40,c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP419-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 : 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:08:26 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/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
% 1.78/0.69 % Version: 3.5.1
% 1.78/0.69 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.78/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.78/0.69 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.78/0.69 % Starting new_bool_3 with 300s (1) cores
% 1.78/0.69 % Starting new_bool_1 with 300s (1) cores
% 1.78/0.69 % Starting sh5l with 300s (1) cores
% 1.78/0.69 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 527868 completed with status 0
% 1.78/0.69 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.78/0.69 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.78/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.78/0.69 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.78/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.78/0.69 % No SInE strategy applied
% 1.78/0.69 % Search class: FUUPF-FFSF21-DFFFFFNN
% 1.78/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.78/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.78/0.69 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.78/0.69 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.78/0.69 % Starting new_bool_3 with 136s (1) cores
% 1.78/0.69 % Starting new_bool_1 with 136s (1) cores
% 1.78/0.69 % U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 527877 completed with status 0
% 1.78/0.69 % Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 1.78/0.69 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.78/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.78/0.69 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.78/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.78/0.69 % No SInE strategy applied
% 1.78/0.69 % Search class: FUUPF-FFSF21-DFFFFFNN
% 1.78/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.78/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.78/0.69 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.78/0.69 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.78/0.69 % Preprocessing time : 0.001 s
% 1.78/0.69 % Presaturation interreduction done
% 1.78/0.69
% 1.78/0.69 % Proof found!
% 1.78/0.69 % SZS status Unsatisfiable
% 1.78/0.69 % SZS output start CNFRefutation
% See solution above
% 1.78/0.69 % Parsed axioms : 2
% 1.78/0.69 % Removed by relevancy pruning/SinE : 0
% 1.78/0.69 % Initial clauses : 2
% 1.78/0.69 % Removed in clause preprocessing : 0
% 1.78/0.69 % Initial clauses in saturation : 2
% 1.78/0.69 % Processed clauses : 796
% 1.78/0.69 % ...of these trivial : 51
% 1.78/0.69 % ...subsumed : 644
% 1.78/0.69 % ...remaining for further processing : 101
% 1.78/0.69 % Other redundant clauses eliminated : 0
% 1.78/0.69 % Clauses deleted for lack of memory : 0
% 1.78/0.69 % Backward-subsumed : 20
% 1.78/0.69 % Backward-rewritten : 28
% 1.78/0.69 % Generated clauses : 11024
% 1.78/0.69 % ...of the previous two non-redundant : 10461
% 1.78/0.69 % ...aggressively subsumed : 0
% 1.78/0.69 % Contextual simplify-reflections : 0
% 1.78/0.69 % Paramodulations : 11024
% 1.78/0.69 % Factorizations : 0
% 1.78/0.69 % NegExts : 0
% 1.78/0.69 % Equation resolutions : 0
% 1.78/0.69 % Disequality decompositions : 0
% 1.78/0.69 % Total rewrite steps : 13830
% 1.78/0.69 % ...of those cached : 13199
% 1.78/0.69 % Propositional unsat checks : 0
% 1.78/0.69 % Propositional check models : 0
% 1.78/0.69 % Propositional check unsatisfiable : 0
% 1.78/0.69 % Propositional clauses : 0
% 1.78/0.69 % Propositional clauses after purity: 0
% 1.78/0.69 % Propositional unsat core size : 0
% 1.78/0.69 % Propositional preprocessing time : 0.000
% 1.78/0.69 % Propositional encoding time : 0.000
% 1.78/0.69 % Propositional solver time : 0.000
% 1.78/0.69 % Success case prop preproc time : 0.000
% 1.78/0.69 % Success case prop encoding time : 0.000
% 1.78/0.69 % Success case prop solver time : 0.000
% 1.78/0.69 % Current number of processed clauses : 51
% 1.78/0.69 % Positive orientable unit clauses : 14
% 1.78/0.69 % Positive unorientable unit clauses: 18
% 1.78/0.69 % Negative unit clauses : 19
% 1.78/0.69 % Non-unit-clauses : 0
% 1.78/0.69 % Current number of unprocessed clauses: 9447
% 1.78/0.69 % ...number of literals in the above : 9447
% 1.78/0.69 % Current number of archived formulas : 0
% 1.78/0.69 % Current number of archived clauses : 50
% 1.78/0.69 % Clause-clause subsumption calls (NU) : 0
% 1.78/0.69 % Rec. Clause-clause subsumption calls : 0
% 1.78/0.69 % Non-unit clause-clause subsumptions : 0
% 1.78/0.69 % Unit Clause-clause subsumption calls : 284
% 1.78/0.69 % Rewrite failures with RHS unbound : 0
% 1.78/0.69 % BW rewrite match attempts : 876
% 1.78/0.69 % BW rewrite match successes : 139
% 1.78/0.69 % Condensation attempts : 0
% 1.78/0.69 % Condensation successes : 0
% 1.78/0.69 % Termbank termtop insertions : 781562
% 1.78/0.69 % Search garbage collected termcells : 2
% 1.78/0.69
% 1.78/0.69 % -------------------------------------------------
% 1.78/0.69 % User time : 0.185 s
% 1.78/0.69 % System time : 0.012 s
% 1.78/0.69 % Total time : 0.197 s
% 1.78/0.69 % Maximum resident set size: 3640 pages
% 1.78/0.69
% 1.78/0.69 % -------------------------------------------------
% 1.78/0.69 % User time : 1.088 s
% 1.78/0.69 % System time : 0.067 s
% 1.78/0.69 % Total time : 1.155 s
% 1.78/0.69 % Maximum resident set size: 4864 pages
% 1.78/0.69 % E exiting
%------------------------------------------------------------------------------