%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC232+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 : n001.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:34 PM UTC 2026
% Result : Theorem 0.24s 0.54s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 215 ( 56 equ)
% Maximal formula atoms : 46 ( 5 avg)
% Number of connectives : 283 ( 104 ~; 100 |; 47 &)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-3 aty)
% Number of variables : 82 ( 0 sgn 43 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( ? [X12] :
( lt(X9,X12)
& memberP(X11,X12)
& memberP(X10,X12)
& ~ leq(X9,X12)
& ssItem(X12) )
| app(app(X10,cons(X9,nil)),X11) != X3 ) ) ) )
& nil != X3 )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( lt(X5,X8)
| ~ leq(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( ? [X12] :
( lt(X9,X12)
& memberP(X11,X12)
& memberP(X10,X12)
& ~ leq(X9,X12)
& ssItem(X12) )
| app(app(X10,cons(X9,nil)),X11) != X3 ) ) ) )
& nil != X3 )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( lt(X5,X8)
| ~ leq(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_8,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( ? [X12] :
( lt(X9,X12)
& memberP(X11,X12)
& memberP(X10,X12)
& ~ leq(X9,X12)
& ssItem(X12) )
| app(app(X10,cons(X9,nil)),X11) != X3 ) ) ) )
& nil != X3 )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( lt(X5,X8)
| ~ leq(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X163] :
( ~ memberP(nil,X163)
| ~ ssItem(X163) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,negated_conjecture,
! [X261,X262,X263,X268] :
( ( nil = esk50_0
| ~ lt(esk53_0,X268)
| ~ memberP(esk55_0,X268)
| ~ memberP(esk54_0,X268)
| leq(esk53_0,X268)
| ~ ssItem(X268) )
& ( nil = esk50_0
| app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk50_0 )
& ( nil = esk50_0
| ssList(esk55_0) )
& ( nil = esk50_0
| ssList(esk54_0) )
& ( nil = esk50_0
| ssItem(esk53_0) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X263)
| ~ lt(X261,esk52_3(X261,X262,X263)) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X263)
| leq(X261,esk52_3(X261,X262,X263)) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X263)
| memberP(X263,esk52_3(X261,X262,X263)) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X263)
| memberP(X262,esk52_3(X261,X262,X263)) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X263)
| ssItem(esk52_3(X261,X262,X263)) )
& nil != esk48_0
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).
cnf(c_0_12,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| memberP(X1,esk52_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_15,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(esk52_3(X1,nil,X2))
| ~ ssList(X2)
| app(app(nil,cons(X1,nil)),X2) != esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_16,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ssItem(esk52_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X141] :
( app(nil,X141) = X141
| ~ ssList(X141) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(nil,cons(X1,nil)),X2) != esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14])]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X226,X227] :
( cons(X227,X226) = app(cons(X227,nil),X226)
| ~ ssItem(X227)
| ~ ssList(X226) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| app(cons(X1,nil),X2) != esk48_0 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X117,X118] :
( ssList(cons(X118,X117))
| ~ ssItem(X118)
| ~ ssList(X117) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| cons(X1,X2) != esk48_0 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_26,plain,
! [X125] :
( ( ~ ssList(X125)
| nil = X125
| cons(esk45_1(X125),esk44_1(X125)) = X125 )
& ( ~ ssList(X125)
| nil = X125
| ssItem(esk45_1(X125)) )
& ( ~ ssList(X125)
| nil = X125
| ssList(esk44_1(X125)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,X2) != esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14])]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk45_1(X1),esk44_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssItem(esk45_1(esk48_0))
| ~ ssList(esk44_1(esk48_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28])]),c_0_29])]),c_0_30]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk45_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
~ ssList(esk44_1(esk48_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29])]),c_0_30]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk44_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29])]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC232+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.10/0.37 % Computer : n001.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 08:12:58 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.41 Running first-order theorem proving
% 0.10/0.41 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.24/0.54 % Version: 3.5.1
% 0.24/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.54 % Starting sh5l with 300s (1) cores
% 0.24/0.54 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2641981 completed with status 0
% 0.24/0.54 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.24/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.54 % No SInE strategy applied
% 0.24/0.54 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.24/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.54 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.24/0.54 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.24/0.54 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2641990 completed with status 0
% 0.24/0.54 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.24/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.54 % No SInE strategy applied
% 0.24/0.54 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.24/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.54 % Preprocessing time : 0.004 s
% 0.24/0.54 % Presaturation interreduction done
% 0.24/0.54
% 0.24/0.54 % Proof found!
% 0.24/0.54 % SZS status Theorem
% 0.24/0.54 % SZS output start CNFRefutation
% See solution above
% 0.24/0.54 % Parsed axioms : 96
% 0.24/0.54 % Removed by relevancy pruning/SinE : 0
% 0.24/0.54 % Initial clauses : 207
% 0.24/0.54 % Removed in clause preprocessing : 2
% 0.24/0.54 % Initial clauses in saturation : 205
% 0.24/0.54 % Processed clauses : 760
% 0.24/0.54 % ...of these trivial : 2
% 0.24/0.54 % ...subsumed : 155
% 0.24/0.54 % ...remaining for further processing : 603
% 0.24/0.54 % Other redundant clauses eliminated : 96
% 0.24/0.54 % Clauses deleted for lack of memory : 0
% 0.24/0.54 % Backward-subsumed : 61
% 0.24/0.54 % Backward-rewritten : 2
% 0.24/0.54 % Generated clauses : 1394
% 0.24/0.54 % ...of the previous two non-redundant : 1197
% 0.24/0.54 % ...aggressively subsumed : 0
% 0.24/0.54 % Contextual simplify-reflections : 30
% 0.24/0.54 % Paramodulations : 1295
% 0.24/0.54 % Factorizations : 0
% 0.24/0.54 % NegExts : 0
% 0.24/0.54 % Equation resolutions : 101
% 0.24/0.54 % Disequality decompositions : 0
% 0.24/0.54 % Total rewrite steps : 849
% 0.24/0.54 % ...of those cached : 828
% 0.24/0.54 % Propositional unsat checks : 0
% 0.24/0.54 % Propositional check models : 0
% 0.24/0.54 % Propositional check unsatisfiable : 0
% 0.24/0.54 % Propositional clauses : 0
% 0.24/0.54 % Propositional clauses after purity: 0
% 0.24/0.54 % Propositional unsat core size : 0
% 0.24/0.54 % Propositional preprocessing time : 0.000
% 0.24/0.54 % Propositional encoding time : 0.000
% 0.24/0.54 % Propositional solver time : 0.000
% 0.24/0.54 % Success case prop preproc time : 0.000
% 0.24/0.54 % Success case prop encoding time : 0.000
% 0.24/0.54 % Success case prop solver time : 0.000
% 0.24/0.54 % Current number of processed clauses : 318
% 0.24/0.54 % Positive orientable unit clauses : 24
% 0.24/0.54 % Positive unorientable unit clauses: 0
% 0.24/0.54 % Negative unit clauses : 7
% 0.24/0.54 % Non-unit-clauses : 287
% 0.24/0.54 % Current number of unprocessed clauses: 784
% 0.24/0.54 % ...number of literals in the above : 5288
% 0.24/0.54 % Current number of archived formulas : 0
% 0.24/0.54 % Current number of archived clauses : 262
% 0.24/0.54 % Clause-clause subsumption calls (NU) : 33076
% 0.24/0.54 % Rec. Clause-clause subsumption calls : 8932
% 0.24/0.54 % Non-unit clause-clause subsumptions : 200
% 0.24/0.54 % Unit Clause-clause subsumption calls : 239
% 0.24/0.54 % Rewrite failures with RHS unbound : 0
% 0.24/0.54 % BW rewrite match attempts : 2
% 0.24/0.54 % BW rewrite match successes : 2
% 0.24/0.54 % Condensation attempts : 0
% 0.24/0.54 % Condensation successes : 0
% 0.24/0.54 % Termbank termtop insertions : 46572
% 0.24/0.54 % Search garbage collected termcells : 4508
% 0.24/0.54
% 0.24/0.54 % -------------------------------------------------
% 0.24/0.54 % User time : 0.096 s
% 0.24/0.54 % System time : 0.005 s
% 0.24/0.54 % Total time : 0.100 s
% 0.24/0.54 % Maximum resident set size: 4276 pages
% 0.24/0.54
% 0.24/0.54 % -------------------------------------------------
% 0.24/0.54 % User time : 0.348 s
% 0.24/0.54 % System time : 0.024 s
% 0.24/0.54 % Total time : 0.372 s
% 0.24/0.54 % Maximum resident set size: 4864 pages
% 0.24/0.54 % E exiting
%------------------------------------------------------------------------------