%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PLA009-2 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:58:49 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.46s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of clauses : 64 ( 24 unt; 0 nHn; 58 RR)
% Number of literals : 168 ( 0 equ; 117 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 119 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_D_AB,negated_conjecture,
~ holds(and(clear(d),on(a,b)),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_D_AB) ).
cnf(and_definition,axiom,
( ~ holds(X2,X3)
| ~ holds(X1,X3)
| holds(and(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-0.ax',and_definition) ).
cnf(pickup_3,axiom,
( ~ differ(X1,X3)
| ~ holds(on(X1,X2),X4)
| holds(on(X1,X2),do(pickup(X3),X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-0.ax',pickup_3) ).
cnf(pickup_2,axiom,
( ~ holds(empty,X3)
| ~ holds(clear(X2),X3)
| ~ holds(on(X2,X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-0.ax',pickup_2) ).
cnf(putdown_2,axiom,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(on(X1,X2),do(putdown(X1,X2),X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-0.ax',putdown_2) ).
cnf(putdown_1,axiom,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(empty,do(putdown(X1,X2),X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-0.ax',putdown_1) ).
cnf(putdown_4,axiom,
( ~ holds(on(X1,X2),X5)
| holds(on(X1,X2),do(putdown(X3,X4),X5)) ),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-0.ax',putdown_4) ).
cnf(putdown_5,axiom,
( ~ differ(X1,X3)
| ~ holds(clear(X1),X4)
| holds(clear(X1),do(putdown(X2,X3),X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-0.ax',putdown_5) ).
cnf(pickup_1,axiom,
( ~ differ(X1,table)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2)
| holds(holding(X1),do(pickup(X1),X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-0.ax',pickup_1) ).
cnf(symmetry_of_differ,axiom,
( ~ differ(X2,X1)
| differ(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',symmetry_of_differ) ).
cnf(differ_a_table,axiom,
differ(a,table),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',differ_a_table) ).
cnf(pickup_4,axiom,
( ~ differ(X1,X2)
| ~ holds(clear(X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-0.ax',pickup_4) ).
cnf(differ_a_b,axiom,
differ(a,b),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',differ_a_b) ).
cnf(differ_b_c,axiom,
differ(b,c),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',differ_b_c) ).
cnf(initial_state3,axiom,
holds(on(c,d),s0),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',initial_state3) ).
cnf(differ_a_c,axiom,
differ(a,c),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',differ_a_c) ).
cnf(initial_state5,axiom,
holds(clear(a),s0),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',initial_state5) ).
cnf(initial_state6,axiom,
holds(clear(b),s0),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',initial_state6) ).
cnf(initial_state7,axiom,
holds(clear(c),s0),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',initial_state7) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',initial_state8) ).
cnf(c_0_20,negated_conjecture,
~ holds(and(clear(d),on(a,b)),X1),
inference(fof_simplification,[status(thm)],[prove_D_AB]) ).
cnf(c_0_21,plain,
( ~ holds(X2,X3)
| ~ holds(X1,X3)
| holds(and(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[and_definition]) ).
cnf(c_0_22,negated_conjecture,
~ holds(and(clear(d),on(a,b)),X1),
c_0_20 ).
cnf(c_0_23,plain,
( ~ holds(X2,X3)
| ~ holds(X1,X3)
| holds(and(X1,X2),X3) ),
c_0_21 ).
cnf(c_0_24,plain,
( ~ differ(X1,X3)
| ~ holds(on(X1,X2),X4)
| holds(on(X1,X2),do(pickup(X3),X4)) ),
inference(fof_simplification,[status(thm)],[pickup_3]) ).
cnf(c_0_25,negated_conjecture,
( ~ holds(clear(d),X1)
| ~ holds(on(a,b),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ differ(X1,X3)
| ~ holds(on(X1,X2),X4)
| holds(on(X1,X2),do(pickup(X3),X4)) ),
c_0_24 ).
cnf(c_0_27,plain,
( ~ holds(empty,X3)
| ~ holds(clear(X2),X3)
| ~ holds(on(X2,X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
inference(fof_simplification,[status(thm)],[pickup_2]) ).
cnf(c_0_28,negated_conjecture,
( ~ holds(on(a,b),X2)
| ~ holds(clear(d),do(pickup(X1),X2))
| ~ differ(a,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( ~ holds(empty,X3)
| ~ holds(clear(X2),X3)
| ~ holds(on(X2,X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
c_0_27 ).
cnf(c_0_30,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(on(X1,X2),do(putdown(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[putdown_2]) ).
cnf(c_0_31,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(empty,do(putdown(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[putdown_1]) ).
cnf(c_0_32,negated_conjecture,
( ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ holds(on(X1,d),X2)
| ~ holds(on(a,b),X2)
| ~ differ(a,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(on(X1,X2),do(putdown(X1,X2),X3)) ),
c_0_30 ).
cnf(c_0_34,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(empty,do(putdown(X1,X2),X3)) ),
c_0_31 ).
cnf(c_0_35,plain,
( ~ holds(on(X1,X2),X5)
| holds(on(X1,X2),do(putdown(X3,X4),X5)) ),
inference(fof_simplification,[status(thm)],[putdown_4]) ).
cnf(c_0_36,negated_conjecture,
( ~ holds(clear(b),X2)
| ~ holds(holding(a),X2)
| ~ holds(clear(X1),do(putdown(a,b),X2))
| ~ holds(on(X1,d),do(putdown(a,b),X2))
| ~ differ(a,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
( ~ holds(on(X1,X2),X5)
| holds(on(X1,X2),do(putdown(X3,X4),X5)) ),
c_0_35 ).
cnf(c_0_38,plain,
( ~ differ(X1,X3)
| ~ holds(clear(X1),X4)
| holds(clear(X1),do(putdown(X2,X3),X4)) ),
inference(fof_simplification,[status(thm)],[putdown_5]) ).
cnf(c_0_39,negated_conjecture,
( ~ holds(clear(b),X2)
| ~ holds(holding(a),X2)
| ~ holds(on(X1,d),X2)
| ~ holds(clear(X1),do(putdown(a,b),X2))
| ~ differ(a,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( ~ differ(X1,X3)
| ~ holds(clear(X1),X4)
| holds(clear(X1),do(putdown(X2,X3),X4)) ),
c_0_38 ).
cnf(c_0_41,negated_conjecture,
( ~ holds(clear(X1),X2)
| ~ holds(clear(b),X2)
| ~ holds(holding(a),X2)
| ~ holds(on(X1,d),X2)
| ~ differ(X1,b)
| ~ differ(a,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
( ~ differ(X1,table)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2)
| holds(holding(X1),do(pickup(X1),X2)) ),
inference(fof_simplification,[status(thm)],[pickup_1]) ).
cnf(c_0_43,plain,
( ~ differ(X2,X1)
| differ(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_differ]) ).
cnf(c_0_44,negated_conjecture,
( ~ holds(on(X1,d),X3)
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(b),do(pickup(X2),X3))
| ~ holds(holding(a),do(pickup(X2),X3))
| ~ differ(X1,X2)
| ~ differ(X1,b)
| ~ differ(a,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_26]) ).
cnf(c_0_45,plain,
( ~ differ(X1,table)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2)
| holds(holding(X1),do(pickup(X1),X2)) ),
c_0_42 ).
cnf(c_0_46,axiom,
differ(a,table),
differ_a_table ).
cnf(c_0_47,plain,
( ~ differ(X2,X1)
| differ(X1,X2) ),
c_0_43 ).
cnf(c_0_48,plain,
( ~ differ(X1,X2)
| ~ holds(clear(X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
inference(fof_simplification,[status(thm)],[pickup_4]) ).
cnf(c_0_49,axiom,
differ(a,b),
differ_a_b ).
cnf(c_0_50,negated_conjecture,
( ~ holds(empty,X2)
| ~ holds(clear(a),X2)
| ~ holds(on(X1,d),X2)
| ~ holds(clear(X1),do(pickup(a),X2))
| ~ holds(clear(b),do(pickup(a),X2))
| ~ differ(X1,b)
| ~ differ(a,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),c_0_47]) ).
cnf(c_0_51,plain,
( ~ differ(X1,X2)
| ~ holds(clear(X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
c_0_48 ).
cnf(c_0_52,plain,
differ(b,a),
inference(spm,[status(thm)],[c_0_47,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( ~ holds(empty,X2)
| ~ holds(clear(b),X2)
| ~ holds(clear(a),X2)
| ~ holds(on(X1,d),X2)
| ~ holds(clear(X1),do(pickup(a),X2))
| ~ differ(X1,b)
| ~ differ(a,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_54,axiom,
differ(b,c),
differ_b_c ).
cnf(c_0_55,negated_conjecture,
( ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ holds(clear(b),X2)
| ~ holds(clear(a),X2)
| ~ holds(on(X1,d),X2)
| ~ differ(X1,b)
| ~ differ(a,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_47]) ).
cnf(c_0_56,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_57,axiom,
differ(a,c),
differ_a_c ).
cnf(c_0_58,plain,
differ(c,b),
inference(spm,[status(thm)],[c_0_47,c_0_54]) ).
cnf(c_0_59,axiom,
holds(clear(a),s0),
initial_state5 ).
cnf(c_0_60,axiom,
holds(clear(b),s0),
initial_state6 ).
cnf(c_0_61,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_62,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_63,negated_conjecture,
$false,
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(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58]),c_0_59]),c_0_60]),c_0_61]),c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PLA009-2 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % 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 03:32:24 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.46 % Version: 3.5.1
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 60499 completed with status 0
% 0.10/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.46 % No SInE strategy applied
% 0.10/0.46 % Search class: FHUNF-FFMM21-SFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 60506 completed with status 0
% 0.10/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.46 % No SInE strategy applied
% 0.10/0.46 % Search class: FHUNF-FFMM21-SFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.46 % Preprocessing time : 0.001 s
% 0.10/0.46 % Presaturation interreduction done
% 0.10/0.46
% 0.10/0.46 % Proof found!
% 0.10/0.46 % SZS status Unsatisfiable
% 0.10/0.46 % SZS output start CNFRefutation
% See solution above
% 0.10/0.46 % Parsed axioms : 31
% 0.10/0.46 % Removed by relevancy pruning/SinE : 0
% 0.10/0.46 % Initial clauses : 31
% 0.10/0.46 % Removed in clause preprocessing : 0
% 0.10/0.46 % Initial clauses in saturation : 31
% 0.10/0.46 % Processed clauses : 286
% 0.10/0.46 % ...of these trivial : 0
% 0.10/0.46 % ...subsumed : 34
% 0.10/0.46 % ...remaining for further processing : 252
% 0.10/0.46 % Other redundant clauses eliminated : 0
% 0.10/0.46 % Clauses deleted for lack of memory : 0
% 0.10/0.46 % Backward-subsumed : 8
% 0.10/0.46 % Backward-rewritten : 0
% 0.10/0.46 % Generated clauses : 320
% 0.10/0.46 % ...of the previous two non-redundant : 306
% 0.10/0.46 % ...aggressively subsumed : 0
% 0.10/0.46 % Contextual simplify-reflections : 36
% 0.10/0.46 % Paramodulations : 320
% 0.10/0.46 % Factorizations : 0
% 0.10/0.46 % NegExts : 0
% 0.10/0.46 % Equation resolutions : 0
% 0.10/0.46 % Disequality decompositions : 0
% 0.10/0.46 % Total rewrite steps : 77
% 0.10/0.46 % ...of those cached : 56
% 0.10/0.46 % Propositional unsat checks : 0
% 0.10/0.46 % Propositional check models : 0
% 0.10/0.46 % Propositional check unsatisfiable : 0
% 0.10/0.46 % Propositional clauses : 0
% 0.10/0.46 % Propositional clauses after purity: 0
% 0.10/0.46 % Propositional unsat core size : 0
% 0.10/0.46 % Propositional preprocessing time : 0.000
% 0.10/0.46 % Propositional encoding time : 0.000
% 0.10/0.46 % Propositional solver time : 0.000
% 0.10/0.46 % Success case prop preproc time : 0.000
% 0.10/0.46 % Success case prop encoding time : 0.000
% 0.10/0.46 % Success case prop solver time : 0.000
% 0.10/0.46 % Current number of processed clauses : 213
% 0.10/0.46 % Positive orientable unit clauses : 29
% 0.10/0.46 % Positive unorientable unit clauses: 0
% 0.10/0.46 % Negative unit clauses : 3
% 0.10/0.46 % Non-unit-clauses : 181
% 0.10/0.46 % Current number of unprocessed clauses: 75
% 0.10/0.46 % ...number of literals in the above : 505
% 0.10/0.46 % Current number of archived formulas : 0
% 0.10/0.46 % Current number of archived clauses : 39
% 0.10/0.46 % Clause-clause subsumption calls (NU) : 44102
% 0.10/0.46 % Rec. Clause-clause subsumption calls : 698
% 0.10/0.46 % Non-unit clause-clause subsumptions : 78
% 0.10/0.46 % Unit Clause-clause subsumption calls : 223
% 0.10/0.46 % Rewrite failures with RHS unbound : 0
% 0.10/0.46 % BW rewrite match attempts : 0
% 0.10/0.46 % BW rewrite match successes : 0
% 0.10/0.46 % Condensation attempts : 0
% 0.10/0.46 % Condensation successes : 0
% 0.10/0.46 % Termbank termtop insertions : 13985
% 0.10/0.46 % Search garbage collected termcells : 55
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.019 s
% 0.10/0.46 % System time : 0.004 s
% 0.10/0.46 % Total time : 0.024 s
% 0.10/0.46 % Maximum resident set size: 3660 pages
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.084 s
% 0.10/0.46 % System time : 0.021 s
% 0.10/0.46 % Total time : 0.105 s
% 0.10/0.46 % Maximum resident set size: 4864 pages
% 0.10/0.46 % E exiting
%------------------------------------------------------------------------------