%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG005-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:05:27 PM UTC 2026
% Result : Unsatisfiable 0.33s 0.66s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of clauses : 71 ( 34 unt; 0 nHn; 51 RR)
% Number of literals : 152 ( 20 equ; 84 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 179 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(addition_is_well_defined,axiom,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',addition_is_well_defined) ).
cnf(associativity_of_addition2,axiom,
( ~ sum(X1,X5,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',associativity_of_addition2) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',additive_identity2) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',left_inverse) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',closure_of_addition) ).
cnf(distributivity3,axiom,
( ~ product(X6,X2,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',distributivity3) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',additive_identity1) ).
cnf(a_times_b,hypothesis,
product(a,b,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b) ).
cnf(commutativity_of_addition,axiom,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).
cnf(distributivity4,axiom,
( ~ sum(X3,X5,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| product(X6,X2,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',distributivity4) ).
cnf(multiplication_is_well_defined,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',multiplication_is_well_defined) ).
cnf(associativity_of_addition1,axiom,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',associativity_of_addition1) ).
cnf(a_inverse_times_b,hypothesis,
product(additive_inverse(a),b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_inverse_times_b) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',closure_of_multiplication) ).
cnf(right_inverse,axiom,
sum(X1,additive_inverse(X1),additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',right_inverse) ).
cnf(prove_sum_is_additive_id,negated_conjecture,
~ sum(c,d,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_sum_is_additive_id) ).
cnf(c_0_16,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_17,plain,
( ~ sum(X1,X5,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_addition2]) ).
cnf(c_0_18,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
c_0_16 ).
cnf(c_0_19,axiom,
sum(X1,additive_identity,X1),
additive_identity2 ).
cnf(c_0_20,plain,
( ~ sum(X1,X5,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X3,X4,X6) ),
c_0_17 ).
cnf(c_0_21,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_22,plain,
( ~ sum(X2,additive_identity,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_24,plain,
( ~ product(X6,X2,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
inference(fof_simplification,[status(thm)],[distributivity3]) ).
cnf(c_0_25,plain,
( ~ sum(X4,additive_identity,X3)
| ~ sum(X4,additive_inverse(X2),X1)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
add(X1,additive_identity) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_28,plain,
( ~ product(X6,X2,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
c_0_24 ).
cnf(c_0_29,hypothesis,
product(a,b,d),
a_times_b ).
cnf(c_0_30,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_addition]) ).
cnf(c_0_31,plain,
( ~ sum(X3,X5,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| product(X6,X2,X7) ),
inference(fof_simplification,[status(thm)],[distributivity4]) ).
cnf(c_0_32,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[multiplication_is_well_defined]) ).
cnf(c_0_33,plain,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_addition1]) ).
cnf(c_0_34,plain,
( ~ sum(X3,additive_inverse(X2),X1)
| sum(X1,X2,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_26]) ).
cnf(c_0_35,plain,
( ~ sum(additive_identity,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_36,hypothesis,
( ~ sum(X4,X3,a)
| ~ product(X4,b,X1)
| ~ product(X3,b,X2)
| sum(X1,X2,d) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
c_0_30 ).
cnf(c_0_38,plain,
( ~ sum(X3,X5,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| product(X6,X2,X7) ),
c_0_31 ).
cnf(c_0_39,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
c_0_32 ).
cnf(c_0_40,hypothesis,
product(additive_inverse(a),b,c),
a_inverse_times_b ).
cnf(c_0_41,plain,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
c_0_33 ).
cnf(c_0_42,plain,
( ~ sum(X2,X3,X1)
| X1 = add(X2,X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_43,plain,
sum(additive_identity,X1,additive_inverse(additive_inverse(X1))),
inference(spm,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_44,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_23]) ).
cnf(c_0_45,hypothesis,
( ~ sum(X2,a,a)
| ~ product(X2,b,X1)
| sum(X1,d,d) ),
inference(spm,[status(thm)],[c_0_36,c_0_29]) ).
cnf(c_0_46,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_47,plain,
( ~ sum(additive_inverse(X2),X2,X1)
| X1 = additive_identity ),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_48,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_37,c_0_23]) ).
cnf(c_0_49,hypothesis,
( ~ sum(X3,a,X1)
| ~ sum(X4,d,X2)
| ~ product(X3,b,X4)
| product(X1,b,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_29]) ).
cnf(c_0_50,hypothesis,
( ~ product(additive_inverse(a),b,X1)
| X1 = c ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_51,plain,
( ~ sum(X3,X4,X2)
| ~ sum(X1,X3,additive_inverse(X4))
| sum(X1,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_41,c_0_21]) ).
cnf(c_0_52,axiom,
sum(X1,additive_inverse(X1),additive_identity),
right_inverse ).
cnf(c_0_53,plain,
additive_inverse(additive_inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_54,hypothesis,
( ~ sum(X1,a,a)
| sum(multiply(X1,b),d,d) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_55,plain,
sum(add(X1,additive_inverse(X2)),X2,X1),
inference(spm,[status(thm)],[c_0_34,c_0_23]) ).
cnf(c_0_56,plain,
add(X1,additive_inverse(X1)) = additive_identity,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_57,hypothesis,
( ~ sum(X3,a,X1)
| ~ sum(multiply(X3,b),d,X2)
| product(X1,b,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_46]) ).
cnf(c_0_58,hypothesis,
multiply(additive_inverse(a),b) = c,
inference(spm,[status(thm)],[c_0_50,c_0_46]) ).
cnf(c_0_59,plain,
( ~ sum(X1,X2,X2)
| sum(X1,additive_identity,additive_identity) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_60,hypothesis,
sum(multiply(additive_identity,b),d,d),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_61,hypothesis,
( ~ sum(c,d,X1)
| product(additive_identity,b,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_21]),c_0_58]) ).
cnf(c_0_62,plain,
add(X1,X2) = add(X2,X1),
inference(spm,[status(thm)],[c_0_42,c_0_48]) ).
cnf(c_0_63,hypothesis,
sum(multiply(additive_identity,b),additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,plain,
( ~ product(X2,X3,X1)
| X1 = multiply(X2,X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_46]) ).
cnf(c_0_65,hypothesis,
product(additive_identity,b,add(d,c)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_23]),c_0_62]) ).
cnf(c_0_66,hypothesis,
multiply(additive_identity,b) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_63]),c_0_26]) ).
cnf(c_0_67,negated_conjecture,
~ sum(c,d,additive_identity),
inference(fof_simplification,[status(thm)],[prove_sum_is_additive_id]) ).
cnf(c_0_68,hypothesis,
add(d,c) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_69,negated_conjecture,
~ sum(c,d,additive_identity),
c_0_67 ).
cnf(c_0_70,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_68]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n015.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.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 04:13:06 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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
% 0.33/0.66 % Version: 3.5.1
% 0.33/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.33/0.66 % Starting sh5l with 300s (1) cores
% 0.33/0.66 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 528894 completed with status 0
% 0.33/0.66 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.33/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.66 % No SInE strategy applied
% 0.33/0.66 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.33/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.33/0.66 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.33/0.66 % Starting new_bool_3 with 136s (1) cores
% 0.33/0.66 % Starting new_bool_1 with 136s (1) cores
% 0.33/0.66 % new_bool_3 with pid 528902 completed with status 0
% 0.33/0.66 % Result found by new_bool_3
% 0.33/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.66 % No SInE strategy applied
% 0.33/0.66 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.33/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.33/0.66 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.33/0.66 % Starting new_bool_3 with 136s (1) cores
% 0.33/0.66 % Preprocessing time : 0.002 s
% 0.33/0.66 % Presaturation interreduction done
% 0.33/0.66
% 0.33/0.66 % Proof found!
% 0.33/0.66 % SZS status Unsatisfiable
% 0.33/0.66 % SZS output start CNFRefutation
% See solution above
% 0.33/0.66 % Parsed axioms : 20
% 0.33/0.66 % Removed by relevancy pruning/SinE : 0
% 0.33/0.66 % Initial clauses : 20
% 0.33/0.66 % Removed in clause preprocessing : 0
% 0.33/0.66 % Initial clauses in saturation : 20
% 0.33/0.66 % Processed clauses : 1212
% 0.33/0.66 % ...of these trivial : 103
% 0.33/0.66 % ...subsumed : 575
% 0.33/0.66 % ...remaining for further processing : 534
% 0.33/0.66 % Other redundant clauses eliminated : 0
% 0.33/0.66 % Clauses deleted for lack of memory : 0
% 0.33/0.66 % Backward-subsumed : 1
% 0.33/0.66 % Backward-rewritten : 35
% 0.33/0.66 % Generated clauses : 4575
% 0.33/0.66 % ...of the previous two non-redundant : 3090
% 0.33/0.66 % ...aggressively subsumed : 0
% 0.33/0.66 % Contextual simplify-reflections : 0
% 0.33/0.66 % Paramodulations : 4575
% 0.33/0.66 % Factorizations : 0
% 0.33/0.66 % NegExts : 0
% 0.33/0.66 % Equation resolutions : 0
% 0.33/0.66 % Disequality decompositions : 0
% 0.33/0.66 % Total rewrite steps : 3404
% 0.33/0.66 % ...of those cached : 3147
% 0.33/0.66 % Propositional unsat checks : 0
% 0.33/0.66 % Propositional check models : 0
% 0.33/0.66 % Propositional check unsatisfiable : 0
% 0.33/0.66 % Propositional clauses : 0
% 0.33/0.66 % Propositional clauses after purity: 0
% 0.33/0.66 % Propositional unsat core size : 0
% 0.33/0.66 % Propositional preprocessing time : 0.000
% 0.33/0.66 % Propositional encoding time : 0.000
% 0.33/0.66 % Propositional solver time : 0.000
% 0.33/0.66 % Success case prop preproc time : 0.000
% 0.33/0.66 % Success case prop encoding time : 0.000
% 0.33/0.66 % Success case prop solver time : 0.000
% 0.33/0.66 % Current number of processed clauses : 478
% 0.33/0.66 % Positive orientable unit clauses : 68
% 0.33/0.66 % Positive unorientable unit clauses: 1
% 0.33/0.66 % Negative unit clauses : 1
% 0.33/0.66 % Non-unit-clauses : 408
% 0.33/0.66 % Current number of unprocessed clauses: 1499
% 0.33/0.66 % ...number of literals in the above : 2837
% 0.33/0.66 % Current number of archived formulas : 0
% 0.33/0.66 % Current number of archived clauses : 56
% 0.33/0.66 % Clause-clause subsumption calls (NU) : 30962
% 0.33/0.66 % Rec. Clause-clause subsumption calls : 24992
% 0.33/0.66 % Non-unit clause-clause subsumptions : 559
% 0.33/0.66 % Unit Clause-clause subsumption calls : 16
% 0.33/0.66 % Rewrite failures with RHS unbound : 0
% 0.33/0.66 % BW rewrite match attempts : 107
% 0.33/0.66 % BW rewrite match successes : 25
% 0.33/0.66 % Condensation attempts : 0
% 0.33/0.66 % Condensation successes : 0
% 0.33/0.66 % Termbank termtop insertions : 48113
% 0.33/0.66 % Search garbage collected termcells : 61
% 0.33/0.66
% 0.33/0.66 % -------------------------------------------------
% 0.33/0.66 % User time : 0.138 s
% 0.33/0.66 % System time : 0.009 s
% 0.33/0.66 % Total time : 0.147 s
% 0.33/0.66 % Maximum resident set size: 3648 pages
% 0.33/0.66
% 0.33/0.66 % -------------------------------------------------
% 0.33/0.66 % User time : 0.512 s
% 0.33/0.66 % System time : 0.029 s
% 0.33/0.66 % Total time : 0.541 s
% 0.33/0.66 % Maximum resident set size: 4608 pages
% 0.33/0.66 % E exiting
%------------------------------------------------------------------------------