%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM501+3 : 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 : n012.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:20 PM UTC 2026
% Result : Theorem 0.61s 0.52s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 11 unt; 0 def)
% Number of atoms : 175 ( 54 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 203 ( 65 ~; 63 |; 65 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn 28 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
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(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
fof(m__1860,hypothesis,
( doDivides0(xp,sdtasdt0(xn,xm))
& ? [X1] :
( sdtasdt0(xn,xm) = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) )
& isPrime0(xp)
& ! [X1] :
( ( ( doDivides0(X1,xp)
| ? [X2] :
( xp = sdtasdt0(X1,X2)
& aNaturalNumber0(X2) ) )
& aNaturalNumber0(X1) )
=> ( X1 = xp
| X1 = sz10 ) )
& xp != sz10
& xp != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1860) ).
fof(m__,conjecture,
( doDivides0(xr,sdtasdt0(xn,xm))
| ? [X1] :
( sdtasdt0(xn,xm) = sdtasdt0(xr,X1)
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDivTrans,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X2,X3)
& doDivides0(X1,X2) )
=> doDivides0(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivTrans) ).
fof(m__2306,hypothesis,
( xk = sdtsldt0(sdtasdt0(xn,xm),xp)
& sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
& aNaturalNumber0(xk) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2306) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(m__2342,hypothesis,
( isPrime0(xr)
& ! [X1] :
( ( ( doDivides0(X1,xr)
| ? [X2] :
( xr = sdtasdt0(X1,X2)
& aNaturalNumber0(X2) ) )
& aNaturalNumber0(X1) )
=> ( X1 = xr
| X1 = sz10 ) )
& xr != sz10
& xr != sz00
& doDivides0(xr,xk)
& ? [X1] :
( xk = sdtasdt0(xr,X1)
& aNaturalNumber0(X1) )
& aNaturalNumber0(xr) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2342) ).
fof(c_0_9,plain,
! [X65,X66,X68] :
( ( ~ aNaturalNumber0(X66)
| ~ aNaturalNumber0(X65)
| doDivides0(X65,X66)
| X66 != sdtasdt0(X65,X68)
| ~ aNaturalNumber0(X68) )
& ( ~ aNaturalNumber0(X66)
| ~ aNaturalNumber0(X65)
| ~ doDivides0(X65,X66)
| X66 = sdtasdt0(X65,esk2_2(X65,X66)) )
& ( ~ aNaturalNumber0(X66)
| ~ aNaturalNumber0(X65)
| ~ doDivides0(X65,X66)
| aNaturalNumber0(esk2_2(X65,X66)) ) ),
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_10,plain,
! [X9,X10] :
( aNaturalNumber0(sdtasdt0(X9,X10))
| ~ aNaturalNumber0(X10)
| ~ aNaturalNumber0(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_11,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X1)
| doDivides0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X17,X18] :
( sdtasdt0(X17,X18) = sdtasdt0(X18,X17)
| ~ aNaturalNumber0(X18)
| ~ aNaturalNumber0(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
fof(c_0_14,hypothesis,
( doDivides0(xp,sdtasdt0(xn,xm))
& ? [X1] :
( sdtasdt0(xn,xm) = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) )
& isPrime0(xp)
& ! [X1] :
( ( ( doDivides0(X1,xp)
| ? [X2] :
( xp = sdtasdt0(X1,X2)
& aNaturalNumber0(X2) ) )
& aNaturalNumber0(X1) )
=> ( X1 = xp
| X1 = sz10 ) )
& xp != sz10
& xp != sz00 ),
inference(fof_simplification,[status(thm)],[m__1860]) ).
cnf(c_0_15,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,sdtasdt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_12]) ).
cnf(c_0_16,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,hypothesis,
! [X99,X100] :
( doDivides0(xp,sdtasdt0(xn,xm))
& sdtasdt0(xn,xm) = sdtasdt0(xp,esk9_0)
& aNaturalNumber0(esk9_0)
& isPrime0(xp)
& ( X99 = xp
| X99 = sz10
| ~ aNaturalNumber0(X99)
| ~ doDivides0(X99,xp) )
& ( X99 = xp
| X99 = sz10
| ~ aNaturalNumber0(X99)
| xp != sdtasdt0(X99,X100)
| ~ aNaturalNumber0(X100) )
& xp != sz10
& xp != 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_14])])])])])]) ).
fof(c_0_18,negated_conjecture,
~ ( doDivides0(xr,sdtasdt0(xn,xm))
| ? [X1] :
( sdtasdt0(xn,xm) = sdtasdt0(xr,X1)
& aNaturalNumber0(X1) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_19,plain,
! [X72,X73,X74] :
( doDivides0(X72,X74)
| ~ doDivides0(X73,X74)
| ~ doDivides0(X72,X73)
| ~ aNaturalNumber0(X74)
| ~ aNaturalNumber0(X73)
| ~ aNaturalNumber0(X72) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivTrans])])]) ).
cnf(c_0_20,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,sdtasdt0(X2,X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,hypothesis,
sdtasdt0(xn,xm) = sdtasdt0(xp,xk),
inference(split_conjunct,[status(thm)],[m__2306]) ).
cnf(c_0_22,hypothesis,
aNaturalNumber0(xk),
inference(split_conjunct,[status(thm)],[m__2306]) ).
cnf(c_0_23,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_24,hypothesis,
sdtasdt0(xn,xm) = sdtasdt0(xp,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_26,hypothesis,
( isPrime0(xr)
& ! [X1] :
( ( ( doDivides0(X1,xr)
| ? [X2] :
( xr = sdtasdt0(X1,X2)
& aNaturalNumber0(X2) ) )
& aNaturalNumber0(X1) )
=> ( X1 = xr
| X1 = sz10 ) )
& xr != sz10
& xr != sz00
& doDivides0(xr,xk)
& ? [X1] :
( xk = sdtasdt0(xr,X1)
& aNaturalNumber0(X1) )
& aNaturalNumber0(xr) ),
inference(fof_simplification,[status(thm)],[m__2342]) ).
fof(c_0_27,negated_conjecture,
! [X109] :
( ~ doDivides0(xr,sdtasdt0(xn,xm))
& ( sdtasdt0(xn,xm) != sdtasdt0(xr,X109)
| ~ aNaturalNumber0(X109) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
cnf(c_0_28,plain,
( ~ doDivides0(X2,X3)
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,hypothesis,
doDivides0(xk,sdtasdt0(xn,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_30,hypothesis,
aNaturalNumber0(sdtasdt0(xn,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_24]),c_0_25]),c_0_23])]) ).
fof(c_0_31,hypothesis,
! [X107,X108] :
( isPrime0(xr)
& ( X107 = xr
| X107 = sz10
| ~ aNaturalNumber0(X107)
| ~ doDivides0(X107,xr) )
& ( X107 = xr
| X107 = sz10
| ~ aNaturalNumber0(X107)
| xr != sdtasdt0(X107,X108)
| ~ aNaturalNumber0(X108) )
& xr != sz10
& xr != sz00
& doDivides0(xr,xk)
& xk = sdtasdt0(xr,esk12_0)
& aNaturalNumber0(esk12_0)
& aNaturalNumber0(xr) ),
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_26])])])])])]) ).
cnf(c_0_32,negated_conjecture,
~ doDivides0(xr,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,hypothesis,
( ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,xk)
| doDivides0(X1,sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_22])]) ).
cnf(c_0_34,hypothesis,
doDivides0(xr,xk),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM501+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n012.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Mon Sep 21 02:35:06 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 Running first-order theorem proving
% 0.12/0.38 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.61/0.52 % Version: 3.5.1
% 0.61/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.61/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.61/0.52 % Starting sh5l with 300s (1) cores
% 0.61/0.52 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1386067 completed with status 0
% 0.61/0.52 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.61/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/0.52 % No SInE strategy applied
% 0.61/0.52 % Search class: FGHSF-FSLM32-SFFFFFNN
% 0.61/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.61/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.61/0.52 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.61/0.52 % Starting new_bool_3 with 136s (1) cores
% 0.61/0.52 % Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 0.61/0.52 % U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with pid 1386076 completed with status 0
% 0.61/0.52 % Result found by U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1
% 0.61/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/0.52 % No SInE strategy applied
% 0.61/0.52 % Search class: FGHSF-FSLM32-SFFFFFNN
% 0.61/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.61/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.61/0.52 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.61/0.52 % Starting new_bool_3 with 136s (1) cores
% 0.61/0.52 % Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 0.61/0.52 % Preprocessing time : 0.004 s
% 0.61/0.52 % Presaturation interreduction done
% 0.61/0.52
% 0.61/0.52 % Proof found!
% 0.61/0.52 % SZS status Theorem
% 0.61/0.52 % SZS output start CNFRefutation
% See solution above
% 0.61/0.52 % Parsed axioms : 49
% 0.61/0.52 % Removed by relevancy pruning/SinE : 0
% 0.61/0.52 % Initial clauses : 237
% 0.61/0.52 % Removed in clause preprocessing : 3
% 0.61/0.52 % Initial clauses in saturation : 234
% 0.61/0.52 % Processed clauses : 724
% 0.61/0.52 % ...of these trivial : 10
% 0.61/0.52 % ...subsumed : 143
% 0.61/0.52 % ...remaining for further processing : 571
% 0.61/0.52 % Other redundant clauses eliminated : 11
% 0.61/0.52 % Clauses deleted for lack of memory : 0
% 0.61/0.52 % Backward-subsumed : 17
% 0.61/0.52 % Backward-rewritten : 7
% 0.61/0.52 % Generated clauses : 918
% 0.61/0.52 % ...of the previous two non-redundant : 807
% 0.61/0.52 % ...aggressively subsumed : 0
% 0.61/0.52 % Contextual simplify-reflections : 6
% 0.61/0.52 % Paramodulations : 905
% 0.61/0.52 % Factorizations : 2
% 0.61/0.52 % NegExts : 0
% 0.61/0.52 % Equation resolutions : 11
% 0.61/0.52 % Disequality decompositions : 0
% 0.61/0.52 % Total rewrite steps : 400
% 0.61/0.52 % ...of those cached : 340
% 0.61/0.52 % Propositional unsat checks : 0
% 0.61/0.52 % Propositional check models : 0
% 0.61/0.52 % Propositional check unsatisfiable : 0
% 0.61/0.52 % Propositional clauses : 0
% 0.61/0.52 % Propositional clauses after purity: 0
% 0.61/0.52 % Propositional unsat core size : 0
% 0.61/0.52 % Propositional preprocessing time : 0.000
% 0.61/0.52 % Propositional encoding time : 0.000
% 0.61/0.52 % Propositional solver time : 0.000
% 0.61/0.52 % Success case prop preproc time : 0.000
% 0.61/0.52 % Success case prop encoding time : 0.000
% 0.61/0.52 % Success case prop solver time : 0.000
% 0.61/0.52 % Current number of processed clauses : 309
% 0.61/0.52 % Positive orientable unit clauses : 85
% 0.61/0.52 % Positive unorientable unit clauses: 0
% 0.61/0.52 % Negative unit clauses : 19
% 0.61/0.52 % Non-unit-clauses : 205
% 0.61/0.52 % Current number of unprocessed clauses: 511
% 0.61/0.52 % ...number of literals in the above : 2880
% 0.61/0.52 % Current number of archived formulas : 0
% 0.61/0.52 % Current number of archived clauses : 251
% 0.61/0.52 % Clause-clause subsumption calls (NU) : 29635
% 0.61/0.52 % Rec. Clause-clause subsumption calls : 4648
% 0.61/0.52 % Non-unit clause-clause subsumptions : 140
% 0.61/0.52 % Unit Clause-clause subsumption calls : 1520
% 0.61/0.52 % Rewrite failures with RHS unbound : 0
% 0.61/0.52 % BW rewrite match attempts : 15
% 0.61/0.52 % BW rewrite match successes : 15
% 0.61/0.52 % Condensation attempts : 0
% 0.61/0.52 % Condensation successes : 0
% 0.61/0.52 % Termbank termtop insertions : 33051
% 0.61/0.52 % Search garbage collected termcells : 2399
% 0.61/0.52
% 0.61/0.52 % -------------------------------------------------
% 0.61/0.52 % User time : 0.067 s
% 0.61/0.52 % System time : 0.006 s
% 0.61/0.52 % Total time : 0.073 s
% 0.61/0.52 % Maximum resident set size: 3904 pages
% 0.61/0.52
% 0.61/0.52 % -------------------------------------------------
% 0.61/0.52 % User time : 0.261 s
% 0.61/0.52 % System time : 0.023 s
% 0.61/0.52 % Total time : 0.283 s
% 0.61/0.52 % Maximum resident set size: 4608 pages
% 0.61/0.52 % E exiting
%------------------------------------------------------------------------------