%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC160-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:43:15 PM UTC 2026
% Result : Unsatisfiable 0.44s 0.51s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 18
% Syntax : Number of clauses : 60 ( 27 unt; 3 nHn; 60 RR)
% Number of literals : 161 ( 24 equ; 104 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_16,negated_conjecture,
app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_13,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_14,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_11,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause181,axiom,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(co1_15,negated_conjecture,
ssList(sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_12,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_9,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause114,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause114) ).
cnf(clause121,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ leq(X1,X2)
| X1 = X2
| lt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause121) ).
cnf(co1_17,negated_conjecture,
leq(sk7,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_18,negated_conjecture,
app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk1,
co1_16 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_21,negated_conjecture,
app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk3,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_20 ).
cnf(c_0_23,negated_conjecture,
ssList(sk8),
co1_13 ).
cnf(c_0_24,negated_conjecture,
ssList(sk9),
co1_14 ).
cnf(c_0_25,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(app(app(sk8,app(cons(sk6,nil),sk9)),cons(sk7,nil)),sk10) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_25 ).
cnf(c_0_28,negated_conjecture,
ssItem(sk6),
co1_11 ).
cnf(c_0_29,plain,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
inference(fof_simplification,[status(thm)],[clause181]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(app(app(sk8,cons(sk6,sk9)),cons(sk7,nil)),sk10) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk10),
co1_15 ).
cnf(c_0_32,plain,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
c_0_29 ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| ~ ssList(app(sk8,cons(sk6,sk9)))
| app(app(sk8,cons(sk6,sk9)),app(cons(sk7,nil),sk10)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_30]),c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
ssItem(sk7),
co1_12 ).
cnf(c_0_35,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_36,plain,
( ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssItem(X1)
| ~ ssItem(X2)
| lt(X1,X2) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| ~ ssList(app(sk8,cons(sk6,sk9)))
| app(app(sk8,cons(sk6,sk9)),cons(sk7,sk10)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_27]),c_0_34]),c_0_31])]) ).
cnf(c_0_38,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_39,negated_conjecture,
strictorderedP(sk3),
co1_9 ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| ~ ssList(app(sk8,cons(sk6,sk9)))
| lt(sk6,sk7) ),
inference(cn,[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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_34]),c_0_28]),c_0_38]),c_0_31]),c_0_24]),c_0_23]),c_0_39])]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_40 ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_44,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause114]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(cons(sk6,sk9))
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| lt(sk6,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_23])]) ).
cnf(c_0_46,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_43 ).
cnf(c_0_47,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
c_0_44 ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| lt(sk6,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_28]),c_0_24])]) ).
cnf(c_0_49,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ leq(X1,X2)
| X1 = X2
| lt(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause121]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| ~ lt(sk7,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_28]),c_0_34])]) ).
cnf(c_0_51,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ leq(X1,X2)
| X1 = X2
| lt(X1,X2) ),
c_0_49 ).
cnf(c_0_52,negated_conjecture,
leq(sk7,sk6),
co1_17 ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| sk7 = sk6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_28]),c_0_34])]) ).
cnf(c_0_54,axiom,
ssList(nil),
clause8 ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| sk7 = sk6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_46]),c_0_34]),c_0_54])]) ).
cnf(c_0_56,negated_conjecture,
sk7 = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_46]),c_0_28]),c_0_54])]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ lt(sk6,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_56]),c_0_56])]) ).
cnf(c_0_58,negated_conjecture,
~ ssList(cons(sk6,nil)),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_56]),c_0_56])]),c_0_57]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_46]),c_0_28]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC160-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 08:01:52 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/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.44/0.51 % Version: 3.5.1
% 0.44/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.44/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.44/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.44/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.44/0.51 % Starting sh5l with 300s (1) cores
% 0.44/0.51 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1790697 completed with status 0
% 0.44/0.51 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.44/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.44/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.44/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.44/0.51 % No SInE strategy applied
% 0.44/0.51 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.44/0.51 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.44/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.44/0.51 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.44/0.51 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.44/0.51 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.44/0.51 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1790704 completed with status 0
% 0.44/0.51 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.44/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.44/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.44/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.44/0.51 % No SInE strategy applied
% 0.44/0.51 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.44/0.51 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.44/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.44/0.51 % Preprocessing time : 0.004 s
% 0.44/0.51 % Presaturation interreduction done
% 0.44/0.51
% 0.44/0.51 % Proof found!
% 0.44/0.51 % SZS status Unsatisfiable
% 0.44/0.51 % SZS output start CNFRefutation
% See solution above
% 0.44/0.51 % Parsed axioms : 206
% 0.44/0.51 % Removed by relevancy pruning/SinE : 0
% 0.44/0.51 % Initial clauses : 206
% 0.44/0.51 % Removed in clause preprocessing : 0
% 0.44/0.51 % Initial clauses in saturation : 206
% 0.44/0.51 % Processed clauses : 586
% 0.44/0.51 % ...of these trivial : 8
% 0.44/0.51 % ...subsumed : 47
% 0.44/0.51 % ...remaining for further processing : 531
% 0.44/0.51 % Other redundant clauses eliminated : 74
% 0.44/0.51 % Clauses deleted for lack of memory : 0
% 0.44/0.51 % Backward-subsumed : 40
% 0.44/0.51 % Backward-rewritten : 14
% 0.44/0.51 % Generated clauses : 1389
% 0.44/0.51 % ...of the previous two non-redundant : 1203
% 0.44/0.51 % ...aggressively subsumed : 0
% 0.44/0.51 % Contextual simplify-reflections : 3
% 0.44/0.51 % Paramodulations : 1309
% 0.44/0.51 % Factorizations : 0
% 0.44/0.51 % NegExts : 0
% 0.44/0.51 % Equation resolutions : 79
% 0.44/0.51 % Disequality decompositions : 0
% 0.44/0.51 % Total rewrite steps : 1375
% 0.44/0.51 % ...of those cached : 1250
% 0.44/0.51 % Propositional unsat checks : 0
% 0.44/0.51 % Propositional check models : 0
% 0.44/0.51 % Propositional check unsatisfiable : 0
% 0.44/0.51 % Propositional clauses : 0
% 0.44/0.51 % Propositional clauses after purity: 0
% 0.44/0.51 % Propositional unsat core size : 0
% 0.44/0.51 % Propositional preprocessing time : 0.000
% 0.44/0.51 % Propositional encoding time : 0.000
% 0.44/0.51 % Propositional solver time : 0.000
% 0.44/0.51 % Success case prop preproc time : 0.000
% 0.44/0.51 % Success case prop encoding time : 0.000
% 0.44/0.51 % Success case prop solver time : 0.000
% 0.44/0.51 % Current number of processed clauses : 254
% 0.44/0.51 % Positive orientable unit clauses : 82
% 0.44/0.51 % Positive unorientable unit clauses: 0
% 0.44/0.51 % Negative unit clauses : 7
% 0.44/0.51 % Non-unit-clauses : 165
% 0.44/0.51 % Current number of unprocessed clauses: 1007
% 0.44/0.51 % ...number of literals in the above : 5929
% 0.44/0.51 % Current number of archived formulas : 0
% 0.44/0.51 % Current number of archived clauses : 254
% 0.44/0.51 % Clause-clause subsumption calls (NU) : 20001
% 0.44/0.51 % Rec. Clause-clause subsumption calls : 6323
% 0.44/0.51 % Non-unit clause-clause subsumptions : 50
% 0.44/0.51 % Unit Clause-clause subsumption calls : 819
% 0.44/0.51 % Rewrite failures with RHS unbound : 0
% 0.44/0.51 % BW rewrite match attempts : 4
% 0.44/0.51 % BW rewrite match successes : 4
% 0.44/0.51 % Condensation attempts : 0
% 0.44/0.51 % Condensation successes : 0
% 0.44/0.51 % Termbank termtop insertions : 37982
% 0.44/0.51 % Search garbage collected termcells : 552
% 0.44/0.51
% 0.44/0.51 % -------------------------------------------------
% 0.44/0.51 % User time : 0.068 s
% 0.44/0.51 % System time : 0.010 s
% 0.44/0.51 % Total time : 0.079 s
% 0.44/0.51 % Maximum resident set size: 4076 pages
% 0.44/0.51
% 0.44/0.51 % -------------------------------------------------
% 0.44/0.51 % User time : 0.292 s
% 0.44/0.51 % System time : 0.046 s
% 0.44/0.51 % Total time : 0.338 s
% 0.44/0.51 % Maximum resident set size: 4864 pages
% 0.44/0.51 % E exiting
%------------------------------------------------------------------------------