%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM514+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:49:23 PM UTC 2026
% Result : Theorem 0.14s 0.68s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 47 ( 24 unt; 0 def)
% Number of atoms : 171 ( 54 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 198 ( 74 ~; 79 |; 30 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 24 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefQuot) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__2613,hypothesis,
sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2613) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(m__2306,hypothesis,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2306) ).
fof(m__1860,hypothesis,
( doDivides0(xp,sdtasdt0(xn,xm))
& isPrime0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1860) ).
fof(mDefPrime,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( ! [X2] :
( ( doDivides0(X2,X1)
& aNaturalNumber0(X2) )
=> ( X2 = X1
| X2 = sz10 ) )
& X1 != sz10
& X1 != sz00 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPrime) ).
fof(m__2342,hypothesis,
( isPrime0(xr)
& doDivides0(xr,xk)
& aNaturalNumber0(xr) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2342) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(c_0_11,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_12,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefQuot]) ).
fof(c_0_14,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X63,X64,X66] :
( ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| doDivides0(X63,X64)
| X64 != sdtasdt0(X63,X66)
| ~ aNaturalNumber0(X66) )
& ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| ~ doDivides0(X63,X64)
| X64 = sdtasdt0(X63,esk2_2(X63,X64)) )
& ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| ~ doDivides0(X63,X64)
| aNaturalNumber0(esk2_2(X63,X64)) ) ),
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)],[mDefDiv])])])])])]) ).
fof(c_0_16,plain,
! [X7,X8] :
( aNaturalNumber0(sdtasdt0(X7,X8))
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_17,plain,
! [X67,X68,X69] :
( ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 = sdtsldt0(X68,X67)
| X68 != sdtasdt0(X67,X69)
| ~ aNaturalNumber0(X69) )
& ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 != sdtsldt0(X68,X67)
| X68 = sdtasdt0(X67,X69) )
& ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 != sdtsldt0(X68,X67)
| aNaturalNumber0(X69) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
cnf(c_0_18,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm),
inference(split_conjunct,[status(thm)],[m__2613]) ).
cnf(c_0_20,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X1)
| doDivides0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X3,X2)
| X1 != sdtsldt0(X2,X3)
| X3 = sz00
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xp,sdtsldt0(xk,xr))),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,sdtasdt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_20]),c_0_21]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_26,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(sdtsldt0(X2,X1))
| X1 = sz00 ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_27,hypothesis,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[m__2306]) ).
cnf(c_0_28,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[m__1860]) ).
fof(c_0_29,plain,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( ! [X2] :
( ( doDivides0(X2,X1)
& aNaturalNumber0(X2) )
=> ( X2 = X1
| X2 = sz10 ) )
& X1 != sz10
& X1 != sz00 ) ) ),
inference(fof_simplification,[status(thm)],[mDefPrime]) ).
cnf(c_0_30,negated_conjecture,
~ aNaturalNumber0(sdtsldt0(xk,xr)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_31,hypothesis,
doDivides0(xr,xk),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_32,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_33,hypothesis,
( ~ aNaturalNumber0(sdtasdt0(xn,xm))
| aNaturalNumber0(xk)
| xp = sz00 ),
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_25])]) ).
cnf(c_0_34,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_35,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
fof(c_0_36,plain,
! [X84,X85] :
( ( ~ aNaturalNumber0(X84)
| isPrime0(X84)
| X84 = sz10
| X84 = sz00
| esk3_1(X84) != X84 )
& ( ~ aNaturalNumber0(X84)
| isPrime0(X84)
| X84 = sz10
| X84 = sz00
| esk3_1(X84) != sz10 )
& ( ~ aNaturalNumber0(X84)
| isPrime0(X84)
| X84 = sz10
| X84 = sz00
| doDivides0(esk3_1(X84),X84) )
& ( ~ aNaturalNumber0(X84)
| isPrime0(X84)
| X84 = sz10
| X84 = sz00
| aNaturalNumber0(esk3_1(X84)) )
& ( ~ aNaturalNumber0(X84)
| ~ isPrime0(X84)
| X85 = X84
| X85 = sz10
| ~ doDivides0(X85,X84)
| ~ aNaturalNumber0(X85) )
& ( ~ aNaturalNumber0(X84)
| ~ isPrime0(X84)
| X84 != sz10 )
& ( ~ aNaturalNumber0(X84)
| ~ isPrime0(X84)
| X84 != sz00 ) ),
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_29])])])])])]) ).
cnf(c_0_37,negated_conjecture,
( ~ aNaturalNumber0(xk)
| xr = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_31]),c_0_32])]) ).
cnf(c_0_38,hypothesis,
( aNaturalNumber0(xk)
| xp = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_21]),c_0_34]),c_0_35])]) ).
cnf(c_0_39,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_41,hypothesis,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_42,negated_conjecture,
( xr = sz00
| xp = sz00 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
~ isPrime0(sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_39]),c_0_40])]) ).
cnf(c_0_44,hypothesis,
isPrime0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_45,hypothesis,
xr = sz00,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_46,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM514+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.56 % Computer : n014.cluster.edu
% 0.10/0.56 % Model : x86_64 x86_64
% 0.10/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.56 % Memory : 8046.5625MB
% 0.10/0.56 % OS : Linux 6.8.0-71-generic
% 0.10/0.56 % CPULimit : 300
% 0.10/0.56 % WCLimit : 300
% 0.10/0.56 % DateTime : Mon Sep 21 02:37:06 UTC 2026
% 0.10/0.57 % CPUTime :
% 0.10/0.57 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.61 Running first-order theorem proving
% 0.10/0.61 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.14/0.68 % Version: 3.5.1
% 0.14/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.68 % Starting sh5l with 300s (1) cores
% 0.14/0.68 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2963738 completed with status 0
% 0.14/0.68 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.68 % No SInE strategy applied
% 0.14/0.68 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.68 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.14/0.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.14/0.68 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.68 % SAT001_MinMin_p005000_rr_RG with pid 2963746 completed with status 0
% 0.14/0.68 % Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.68 % No SInE strategy applied
% 0.14/0.68 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.68 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.14/0.68 % Preprocessing time : 0.004 s
% 0.14/0.68 % Presaturation interreduction done
% 0.14/0.68
% 0.14/0.68 % Proof found!
% 0.14/0.68 % SZS status Theorem
% 0.14/0.68 % SZS output start CNFRefutation
% See solution above
% 0.14/0.68 % Parsed axioms : 56
% 0.14/0.68 % Removed by relevancy pruning/SinE : 0
% 0.14/0.68 % Initial clauses : 102
% 0.14/0.68 % Removed in clause preprocessing : 3
% 0.14/0.68 % Initial clauses in saturation : 99
% 0.14/0.68 % Processed clauses : 260
% 0.14/0.68 % ...of these trivial : 1
% 0.14/0.68 % ...subsumed : 24
% 0.14/0.68 % ...remaining for further processing : 235
% 0.14/0.68 % Other redundant clauses eliminated : 35
% 0.14/0.68 % Clauses deleted for lack of memory : 0
% 0.14/0.68 % Backward-subsumed : 4
% 0.14/0.68 % Backward-rewritten : 25
% 0.14/0.68 % Generated clauses : 462
% 0.14/0.68 % ...of the previous two non-redundant : 402
% 0.14/0.68 % ...aggressively subsumed : 0
% 0.14/0.68 % Contextual simplify-reflections : 8
% 0.14/0.68 % Paramodulations : 423
% 0.14/0.68 % Factorizations : 0
% 0.14/0.68 % NegExts : 0
% 0.14/0.68 % Equation resolutions : 39
% 0.14/0.68 % Disequality decompositions : 0
% 0.14/0.68 % Total rewrite steps : 278
% 0.14/0.68 % ...of those cached : 263
% 0.14/0.68 % Propositional unsat checks : 0
% 0.14/0.68 % Propositional check models : 0
% 0.14/0.68 % Propositional check unsatisfiable : 0
% 0.14/0.68 % Propositional clauses : 0
% 0.14/0.68 % Propositional clauses after purity: 0
% 0.14/0.68 % Propositional unsat core size : 0
% 0.14/0.68 % Propositional preprocessing time : 0.000
% 0.14/0.68 % Propositional encoding time : 0.000
% 0.14/0.68 % Propositional solver time : 0.000
% 0.14/0.68 % Success case prop preproc time : 0.000
% 0.14/0.68 % Success case prop encoding time : 0.000
% 0.14/0.68 % Success case prop solver time : 0.000
% 0.14/0.68 % Current number of processed clauses : 104
% 0.14/0.68 % Positive orientable unit clauses : 16
% 0.14/0.68 % Positive unorientable unit clauses: 0
% 0.14/0.68 % Negative unit clauses : 12
% 0.14/0.68 % Non-unit-clauses : 76
% 0.14/0.68 % Current number of unprocessed clauses: 310
% 0.14/0.68 % ...number of literals in the above : 1472
% 0.14/0.68 % Current number of archived formulas : 0
% 0.14/0.68 % Current number of archived clauses : 120
% 0.14/0.68 % Clause-clause subsumption calls (NU) : 994
% 0.14/0.68 % Rec. Clause-clause subsumption calls : 317
% 0.14/0.68 % Non-unit clause-clause subsumptions : 31
% 0.14/0.68 % Unit Clause-clause subsumption calls : 84
% 0.14/0.68 % Rewrite failures with RHS unbound : 0
% 0.14/0.68 % BW rewrite match attempts : 3
% 0.14/0.68 % BW rewrite match successes : 3
% 0.14/0.68 % Condensation attempts : 0
% 0.14/0.68 % Condensation successes : 0
% 0.14/0.68 % Termbank termtop insertions : 15012
% 0.14/0.68 % Search garbage collected termcells : 1362
% 0.14/0.68
% 0.14/0.68 % -------------------------------------------------
% 0.14/0.68 % User time : 0.036 s
% 0.14/0.68 % System time : 0.009 s
% 0.14/0.68 % Total time : 0.045 s
% 0.14/0.68 % Maximum resident set size: 3896 pages
% 0.14/0.68
% 0.14/0.68 % -------------------------------------------------
% 0.14/0.68 % User time : 0.137 s
% 0.14/0.68 % System time : 0.027 s
% 0.14/0.68 % Total time : 0.164 s
% 0.14/0.68 % Maximum resident set size: 4608 pages
% 0.14/0.68 % E exiting
%------------------------------------------------------------------------------