%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL253-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 01:12:17 PM UTC 2026
% Result : Unsatisfiable 9.52s 2.06s
% Output : CNFRefutation 9.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of clauses : 72 ( 32 unt; 0 nHn; 38 RR)
% Number of literals : 125 ( 4 equ; 61 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 138 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(implies(p,q),implies(and(p,r),and(q,r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_0_10,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_11,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_10 ).
cnf(c_0_12,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_13,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_14,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_13 ).
cnf(c_0_16,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_18,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_20,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_21,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_22,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_24,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_25,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_26,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_27,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_28,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_29,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(X1,or(not(or(X1,X2)),X3))) ),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_30,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_31,plain,
( ~ axiom(or(X1,or(or(X1,X2),X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_28,c_0_12]) ).
cnf(c_0_33,plain,
( ~ theorem(X1)
| ~ theorem(or(not(X2),X3))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_29]) ).
cnf(c_0_34,plain,
( ~ theorem(or(X1,or(X2,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_35,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( ~ theorem(X2)
| ~ theorem(or(not(X3),X1))
| ~ theorem(or(not(X2),X3))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_33]) ).
cnf(c_0_37,plain,
theorem(or(not(or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( ~ theorem(or(X2,X2))
| ~ theorem(or(not(X2),X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_40,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_41,plain,
( ~ theorem(or(or(X1,X1),or(X1,X1)))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_42,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_24,c_0_39]) ).
cnf(c_0_43,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_40,c_0_12]) ).
cnf(c_0_44,plain,
( ~ theorem(or(or(X1,X1),X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
~ theorem(implies(implies(p,q),implies(and(p,r),and(q,r)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_47,plain,
( ~ theorem(or(or(or(X1,X2),or(X1,X2)),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_44,c_0_42]) ).
cnf(c_0_48,plain,
( ~ theorem(or(X3,X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_42]) ).
cnf(c_0_49,negated_conjecture,
~ theorem(implies(implies(p,q),implies(and(p,r),and(q,r)))),
c_0_46 ).
cnf(c_0_50,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_51,plain,
( ~ theorem(or(X2,or(X1,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
( ~ theorem(or(X1,X2))
| ~ theorem(or(not(X3),X4))
| theorem(or(X1,or(not(or(not(X2),X3)),X4))) ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_53,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_42]) ).
cnf(c_0_54,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_12]),c_0_12]),c_0_12]),c_0_50]),c_0_50]) ).
cnf(c_0_55,plain,
( ~ theorem(or(X3,X1))
| ~ theorem(or(not(X2),X3))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_30,c_0_43]) ).
cnf(c_0_57,plain,
( ~ axiom(or(X2,or(or(X1,or(X2,X3)),X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_53,c_0_27]) ).
cnf(c_0_58,negated_conjecture,
( ~ theorem(or(or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))),p))
| ~ theorem(or(not(q),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
( ~ theorem(or(not(X3),X2))
| theorem(or(X1,or(X2,not(or(X1,X3))))) ),
inference(spm,[status(thm)],[c_0_56,c_0_29]) ).
cnf(c_0_60,plain,
( ~ theorem(or(X1,X2))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_56,c_0_42]) ).
cnf(c_0_61,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_57,c_0_32]) ).
cnf(c_0_62,negated_conjecture,
( ~ theorem(or(not(not(r)),not(not(or(not(p),not(r))))))
| ~ theorem(or(or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))),p)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
( ~ theorem(or(X3,X1))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_60]) ).
cnf(c_0_64,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_65,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_24,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( ~ theorem(or(p,not(not(or(not(p),not(r))))))
| ~ theorem(or(not(not(r)),not(not(or(not(p),not(r)))))) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
( ~ theorem(or(X1,X2))
| theorem(or(X1,not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_25,c_0_64]) ).
cnf(c_0_68,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_56,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
~ theorem(or(p,not(not(or(not(p),not(r)))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_65])]) ).
cnf(c_0_70,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_24,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_67]),c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL253-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n013.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 00:15:36 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.46 Running first-order theorem proving
% 0.15/0.46 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
% 9.52/2.06 % Version: 3.5.1
% 9.52/2.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 9.52/2.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.52/2.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 9.52/2.06 % Starting new_bool_3 with 300s (1) cores
% 9.52/2.06 % Starting new_bool_1 with 300s (1) cores
% 9.52/2.06 % Starting sh5l with 300s (1) cores
% 9.52/2.06 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3758986 completed with status 0
% 9.52/2.06 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 9.52/2.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 9.52/2.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.52/2.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 9.52/2.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.52/2.06 % No SInE strategy applied
% 9.52/2.06 % Search class: FHUNM-FFSF21-DFFFFFNN
% 9.52/2.06 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 9.52/2.06 % Starting SubtermCWHack with 151s (1) cores
% 9.52/2.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 9.52/2.06 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 9.52/2.06 % Starting new_bool_3 with 329s (1) cores
% 9.52/2.06 % Starting new_bool_1 with 291s (1) cores
% 9.52/2.06 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 3758995 completed with status 0
% 9.52/2.06 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 9.52/2.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 9.52/2.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.52/2.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 9.52/2.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.52/2.06 % No SInE strategy applied
% 9.52/2.06 % Search class: FHUNM-FFSF21-DFFFFFNN
% 9.52/2.06 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 9.52/2.06 % Starting SubtermCWHack with 151s (1) cores
% 9.52/2.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 9.52/2.06 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 9.52/2.06 % Preprocessing time : 0.045 s
% 9.52/2.06
% 9.52/2.06 % Proof found!
% 9.52/2.06 % SZS status Unsatisfiable
% 9.52/2.06 % SZS output start CNFRefutation
% See solution above
% 9.52/2.06 % Parsed axioms : 10
% 9.52/2.06 % Removed by relevancy pruning/SinE : 0
% 9.52/2.06 % Initial clauses : 10
% 9.52/2.06 % Removed in clause preprocessing : 2
% 9.52/2.06 % Initial clauses in saturation : 8
% 9.52/2.06 % Processed clauses : 3128
% 9.52/2.06 % ...of these trivial : 18
% 9.52/2.06 % ...subsumed : 2021
% 9.52/2.06 % ...remaining for further processing : 1089
% 9.52/2.06 % Other redundant clauses eliminated : 0
% 9.52/2.06 % Clauses deleted for lack of memory : 0
% 9.52/2.06 % Backward-subsumed : 107
% 9.52/2.06 % Backward-rewritten : 0
% 9.52/2.06 % Generated clauses : 36732
% 9.52/2.06 % ...of the previous two non-redundant : 36124
% 9.52/2.06 % ...aggressively subsumed : 0
% 9.52/2.06 % Contextual simplify-reflections : 1
% 9.52/2.06 % Paramodulations : 36732
% 9.52/2.06 % Factorizations : 0
% 9.52/2.06 % NegExts : 0
% 9.52/2.06 % Equation resolutions : 0
% 9.52/2.06 % Disequality decompositions : 0
% 9.52/2.06 % Total rewrite steps : 480
% 9.52/2.06 % ...of those cached : 386
% 9.52/2.06 % Propositional unsat checks : 0
% 9.52/2.06 % Propositional check models : 0
% 9.52/2.06 % Propositional check unsatisfiable : 0
% 9.52/2.06 % Propositional clauses : 0
% 9.52/2.06 % Propositional clauses after purity: 0
% 9.52/2.06 % Propositional unsat core size : 0
% 9.52/2.06 % Propositional preprocessing time : 0.000
% 9.52/2.06 % Propositional encoding time : 0.000
% 9.52/2.06 % Propositional solver time : 0.000
% 9.52/2.06 % Success case prop preproc time : 0.000
% 9.52/2.06 % Success case prop encoding time : 0.000
% 9.52/2.06 % Success case prop solver time : 0.000
% 9.52/2.06 % Current number of processed clauses : 982
% 9.52/2.06 % Positive orientable unit clauses : 36
% 9.52/2.06 % Positive unorientable unit clauses: 0
% 9.52/2.06 % Negative unit clauses : 141
% 9.52/2.06 % Non-unit-clauses : 805
% 9.52/2.06 % Current number of unprocessed clauses: 32873
% 9.52/2.06 % ...number of literals in the above : 101184
% 9.52/2.06 % Current number of archived formulas : 0
% 9.52/2.06 % Current number of archived clauses : 109
% 9.52/2.06 % Clause-clause subsumption calls (NU) : 122261
% 9.52/2.06 % Rec. Clause-clause subsumption calls : 109502
% 9.52/2.06 % Non-unit clause-clause subsumptions : 1690
% 9.52/2.06 % Unit Clause-clause subsumption calls : 4237
% 9.52/2.06 % Rewrite failures with RHS unbound : 0
% 9.52/2.06 % BW rewrite match attempts : 1103
% 9.52/2.06 % BW rewrite match successes : 2
% 9.52/2.06 % Condensation attempts : 0
% 9.52/2.06 % Condensation successes : 0
% 9.52/2.06 % Termbank termtop insertions : 639519
% 9.52/2.06 % Search garbage collected termcells : 11
% 9.52/2.06
% 9.52/2.06 % -------------------------------------------------
% 9.52/2.06 % User time : 1.427 s
% 9.52/2.06 % System time : 0.058 s
% 9.52/2.06 % Total time : 1.486 s
% 9.52/2.06 % Maximum resident set size: 3644 pages
% 9.52/2.06
% 9.52/2.06 % -------------------------------------------------
% 9.52/2.06 % User time : 6.416 s
% 9.52/2.06 % System time : 0.300 s
% 9.52/2.06 % Total time : 6.715 s
% 9.52/2.06 % Maximum resident set size: 4608 pages
% 9.52/2.06 % E exiting
%------------------------------------------------------------------------------