%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV394+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:54:38 PM UTC 2026
% Result : Theorem 0.09s 0.45s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 9 unt; 0 def)
% Number of atoms : 115 ( 10 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 117 ( 45 ~; 42 |; 16 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 6 usr; 2 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 111 ( 10 sgn 75 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l30_co,conjecture,
! [X1,X2,X3,X4] :
( ( ok(remove_cpq(triple(X1,X2,X3),X4))
& check_cpq(remove_cpq(triple(X1,X2,X3),X4)) )
=> ! [X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l30_co) ).
fof(ax43,axiom,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax43) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(ax44,axiom,
! [X1,X2,X3,X4] :
( ( less_than(lookup_slb(X2,X4),X4)
& contains_slb(X2,X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax44) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(l30_li4142,lemma,
! [X1,X2,X3] :
( check_cpq(triple(X1,X2,X3))
<=> ! [X4,X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l30_li4142) ).
fof(l30_li3132,lemma,
! [X1,X2,X3,X4,X5] :
( ( ok(remove_cpq(triple(X1,X2,X3),X4))
& strictly_less_than(X4,X5)
& pair_in_list(X2,X4,X5) )
=> pair_in_list(remove_slb(X2,X4),X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l30_li3132) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X2,X1)
| less_than(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(ax45,axiom,
! [X1,X2,X3,X4] :
( ( strictly_less_than(X4,lookup_slb(X2,X4))
& contains_slb(X2,X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax45) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( ok(remove_cpq(triple(X1,X2,X3),X4))
& check_cpq(remove_cpq(triple(X1,X2,X3),X4)) )
=> ! [X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
inference(assume_negation,[status(cth)],[l30_co]) ).
fof(c_0_10,plain,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
inference(fof_simplification,[status(thm)],[ax43]) ).
fof(c_0_11,plain,
! [X80,X81] :
( ( ok(triple(X80,X81,bad))
| $true )
& ( ~ $true
| ~ ok(triple(X80,X81,bad)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
fof(c_0_12,negated_conjecture,
( ~ less_than(esk7_0,esk6_0)
& pair_in_list(esk4_0,esk6_0,esk7_0)
& ok(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))
& check_cpq(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_13,plain,
! [X89,X90,X91,X92] :
( remove_cpq(triple(X89,X90,X91),X92) = triple(X89,X90,bad)
| contains_slb(X90,X92) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
cnf(c_0_14,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X93,X94,X95,X96] :
( remove_cpq(triple(X93,X94,X95),X96) = triple(remove_pqp(X93,X96),remove_slb(X94,X96),X95)
| ~ less_than(lookup_slb(X94,X96),X96)
| ~ contains_slb(X94,X96) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])])]) ).
cnf(c_0_16,negated_conjecture,
ok(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( remove_cpq(triple(X3,X1,X4),X2) = triple(X3,X1,bad)
| contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
~ ok(triple(X1,X2,bad)),
inference(cn,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(c_0_20,lemma,
! [X119,X120,X121,X122,X123,X124,X125,X128] :
( ( check_cpq(triple(X124,X125,X128))
| ~ less_than(esk2_2(X124,X125),esk1_2(X124,X125)) )
& ( check_cpq(triple(X124,X125,X128))
| pair_in_list(X125,esk1_2(X124,X125),esk2_2(X124,X125)) )
& ( less_than(X123,X122)
| ~ pair_in_list(X120,X122,X123)
| ~ check_cpq(triple(X119,X120,X121)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[l30_li4142])])])])])])]) ).
cnf(c_0_21,negated_conjecture,
check_cpq(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( ~ less_than(lookup_slb(X1,X2),X2)
| ~ contains_slb(X1,X2)
| remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),X4) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
contains_slb(esk4_0,esk6_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
fof(c_0_24,lemma,
! [X129,X130,X131,X132,X133] :
( pair_in_list(remove_slb(X130,X132),X132,X133)
| ~ ok(remove_cpq(triple(X129,X130,X131),X132))
| ~ strictly_less_than(X132,X133)
| ~ pair_in_list(X130,X132,X133) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l30_li3132])])]) ).
fof(c_0_25,plain,
! [X12,X13] :
( ( strictly_less_than(X12,X13)
| less_than(X13,X12)
| ~ less_than(X12,X13) )
& ( ~ strictly_less_than(X12,X13)
| ~ less_than(X13,X12) )
& ( ~ strictly_less_than(X12,X13)
| less_than(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
fof(c_0_26,plain,
! [X9,X10] :
( less_than(X10,X9)
| less_than(X9,X10) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_27,lemma,
( ~ pair_in_list(X2,X4,X5)
| ~ check_cpq(triple(X1,X2,X3))
| less_than(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( ~ less_than(lookup_slb(esk4_0,esk6_0),esk6_0)
| check_cpq(triple(remove_pqp(esk3_0,esk6_0),remove_slb(esk4_0,esk6_0),esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_29,lemma,
( ~ ok(remove_cpq(triple(X4,X1,X5),X2))
| ~ strictly_less_than(X2,X3)
| ~ pair_in_list(X1,X2,X3)
| pair_in_list(remove_slb(X1,X2),X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( ~ less_than(X1,X2)
| strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,lemma,
( ~ less_than(lookup_slb(esk4_0,esk6_0),esk6_0)
| ~ pair_in_list(remove_slb(esk4_0,esk6_0),X2,X1)
| less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( ~ strictly_less_than(esk6_0,X1)
| ~ pair_in_list(esk4_0,esk6_0,X1)
| pair_in_list(remove_slb(esk4_0,esk6_0),esk6_0,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_34,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2) ),
inference(csr,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_35,plain,
! [X97,X98,X99,X100] :
( remove_cpq(triple(X97,X98,X99),X100) = triple(remove_pqp(X97,X100),remove_slb(X98,X100),bad)
| ~ strictly_less_than(X100,lookup_slb(X98,X100))
| ~ contains_slb(X98,X100) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])])]) ).
cnf(c_0_36,negated_conjecture,
( ~ less_than(lookup_slb(esk4_0,esk6_0),esk6_0)
| ~ pair_in_list(esk4_0,esk6_0,X1)
| less_than(X1,esk6_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
pair_in_list(esk4_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_38,negated_conjecture,
~ less_than(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,plain,
( ~ strictly_less_than(X2,lookup_slb(X1,X2))
| ~ contains_slb(X1,X2)
| remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),bad) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
~ less_than(lookup_slb(esk4_0,esk6_0),esk6_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ strictly_less_than(esk6_0,lookup_slb(esk4_0,esk6_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_39]),c_0_23])]),c_0_18]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_34]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV394+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n002.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:47:02 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.39 Running first-order theorem proving
% 0.09/0.39 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.09/0.45 % Version: 3.5.1
% 0.09/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.45 % Starting sh5l with 300s (1) cores
% 0.09/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2912421 completed with status 0
% 0.09/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.09/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.45 % No SInE strategy applied
% 0.09/0.45 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.09/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.09/0.45 % Starting G-E--_107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y with 380s (1) cores
% 0.09/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.09/0.45 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 136s (1) cores
% 0.09/0.45 % G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 2912432 completed with status 0
% 0.09/0.45 % Result found by G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA
% 0.09/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.45 % No SInE strategy applied
% 0.09/0.45 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.09/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.09/0.45 % Starting G-E--_107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y with 380s (1) cores
% 0.09/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.09/0.45 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 136s (1) cores
% 0.09/0.45 % Preprocessing time : 0.002 s
% 0.09/0.45 % Presaturation interreduction done
% 0.09/0.45
% 0.09/0.45 % Proof found!
% 0.09/0.45 % SZS status Theorem
% 0.09/0.45 % SZS output start CNFRefutation
% See solution above
% 0.09/0.45 % Parsed axioms : 44
% 0.09/0.45 % Removed by relevancy pruning/SinE : 0
% 0.09/0.45 % Initial clauses : 60
% 0.09/0.45 % Removed in clause preprocessing : 4
% 0.09/0.45 % Initial clauses in saturation : 56
% 0.09/0.45 % Processed clauses : 399
% 0.09/0.45 % ...of these trivial : 5
% 0.09/0.45 % ...subsumed : 163
% 0.09/0.45 % ...remaining for further processing : 231
% 0.09/0.45 % Other redundant clauses eliminated : 3
% 0.09/0.45 % Clauses deleted for lack of memory : 0
% 0.09/0.45 % Backward-subsumed : 7
% 0.09/0.45 % Backward-rewritten : 0
% 0.09/0.45 % Generated clauses : 855
% 0.09/0.45 % ...of the previous two non-redundant : 786
% 0.09/0.45 % ...aggressively subsumed : 0
% 0.09/0.45 % Contextual simplify-reflections : 3
% 0.09/0.45 % Paramodulations : 849
% 0.09/0.45 % Factorizations : 4
% 0.09/0.45 % NegExts : 0
% 0.09/0.45 % Equation resolutions : 3
% 0.09/0.45 % Disequality decompositions : 0
% 0.09/0.45 % Total rewrite steps : 145
% 0.09/0.45 % ...of those cached : 127
% 0.09/0.45 % Propositional unsat checks : 0
% 0.09/0.45 % Propositional check models : 0
% 0.09/0.45 % Propositional check unsatisfiable : 0
% 0.09/0.45 % Propositional clauses : 0
% 0.09/0.45 % Propositional clauses after purity: 0
% 0.09/0.45 % Propositional unsat core size : 0
% 0.09/0.45 % Propositional preprocessing time : 0.000
% 0.09/0.45 % Propositional encoding time : 0.000
% 0.09/0.45 % Propositional solver time : 0.000
% 0.09/0.45 % Success case prop preproc time : 0.000
% 0.09/0.45 % Success case prop encoding time : 0.000
% 0.09/0.45 % Success case prop solver time : 0.000
% 0.09/0.45 % Current number of processed clauses : 166
% 0.09/0.45 % Positive orientable unit clauses : 22
% 0.09/0.45 % Positive unorientable unit clauses: 1
% 0.09/0.45 % Negative unit clauses : 41
% 0.09/0.45 % Non-unit-clauses : 102
% 0.09/0.45 % Current number of unprocessed clauses: 488
% 0.09/0.45 % ...number of literals in the above : 1278
% 0.09/0.45 % Current number of archived formulas : 0
% 0.09/0.45 % Current number of archived clauses : 65
% 0.09/0.45 % Clause-clause subsumption calls (NU) : 3382
% 0.09/0.45 % Rec. Clause-clause subsumption calls : 3003
% 0.09/0.45 % Non-unit clause-clause subsumptions : 111
% 0.09/0.45 % Unit Clause-clause subsumption calls : 1399
% 0.09/0.45 % Rewrite failures with RHS unbound : 0
% 0.09/0.45 % BW rewrite match attempts : 11
% 0.09/0.45 % BW rewrite match successes : 0
% 0.09/0.45 % Condensation attempts : 0
% 0.09/0.45 % Condensation successes : 0
% 0.09/0.45 % Termbank termtop insertions : 14676
% 0.09/0.45 % Search garbage collected termcells : 735
% 0.09/0.45
% 0.09/0.45 % -------------------------------------------------
% 0.09/0.45 % User time : 0.033 s
% 0.09/0.45 % System time : 0.002 s
% 0.09/0.45 % Total time : 0.035 s
% 0.09/0.45 % Maximum resident set size: 3688 pages
% 0.09/0.45
% 0.09/0.45 % -------------------------------------------------
% 0.09/0.45 % User time : 0.138 s
% 0.09/0.45 % System time : 0.021 s
% 0.09/0.45 % Total time : 0.159 s
% 0.09/0.45 % Maximum resident set size: 4864 pages
% 0.09/0.45 % E exiting
%------------------------------------------------------------------------------