%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG118+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:05:55 PM UTC 2026
% Result : Theorem 0.26s 0.59s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 13 unt; 0 def)
% Number of atoms : 164 ( 39 equ)
% Maximal formula atoms : 29 ( 4 avg)
% Number of connectives : 202 ( 78 ~; 73 |; 39 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 24 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2273,hypothesis,
( ! [X1] :
( ( X1 != sz00
& aElementOf0(X1,xI) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2273) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(mDefIdeal,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) )
& ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) ) ) )
& aSet0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefIdeal) ).
fof(m__,conjecture,
? [X1,X2] :
( ( iLess0(sbrdtbr0(X2),sbrdtbr0(xu))
| X2 = sz00 )
& xb = sdtpldt0(sdtasdt0(X1,xu),X2)
& aElement0(X2)
& aElement0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDivision,axiom,
! [X1,X2] :
( ( X2 != sz00
& aElement0(X2)
& aElement0(X1) )
=> ? [X3,X4] :
( ( X4 != sz00
=> iLess0(sbrdtbr0(X4),sbrdtbr0(X2)) )
& X1 = sdtpldt0(sdtasdt0(X3,X2),X4)
& aElement0(X4)
& aElement0(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDivision) ).
fof(m__2174,hypothesis,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& aIdeal0(xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2174) ).
fof(m__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).
fof(mSortsC,axiom,
aElement0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
fof(c_0_8,hypothesis,
( ! [X1] :
( ( X1 != sz00
& aElementOf0(X1,xI) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
fof(c_0_9,plain,
! [X34,X35] :
( aElement0(X35)
| ~ aElementOf0(X35,X34)
| ~ aSet0(X34) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_10,hypothesis,
! [X117] :
( ( ~ iLess0(sbrdtbr0(X117),sbrdtbr0(xu))
| X117 = sz00
| ~ aElementOf0(X117,xI) )
& xu != sz00
& aElementOf0(xu,xI) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,plain,
! [X62,X63,X64,X65,X66] :
( ( aIdeal0(X66)
| ~ aSet0(X66)
| ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
| ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
| aElement0(esk11_1(X66)) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| aElementOf0(esk10_1(X66),X66)
| ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| aElementOf0(esk10_1(X66),X66)
| aElement0(esk11_1(X66)) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| aElementOf0(esk9_1(X66),X66) )
& ( ~ aIdeal0(X62)
| ~ aElementOf0(X63,X62)
| aElementOf0(sdtasdt0(X65,X63),X62)
| ~ aElement0(X65) )
& ( ~ aIdeal0(X62)
| ~ aElementOf0(X63,X62)
| aElementOf0(sdtpldt0(X63,X64),X62)
| ~ aElementOf0(X64,X62) )
& ( ~ aIdeal0(X62)
| aSet0(X62) ) ),
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)],[mDefIdeal])])])])])])]) ).
fof(c_0_12,negated_conjecture,
~ ? [X1,X2] :
( ( iLess0(sbrdtbr0(X2),sbrdtbr0(xu))
| X2 = sz00 )
& xb = sdtpldt0(sdtasdt0(X1,xu),X2)
& aElement0(X2)
& aElement0(X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_13,plain,
! [X1,X2] :
( ( X2 != sz00
& aElement0(X2)
& aElement0(X1) )
=> ? [X3,X4] :
( ( X4 != sz00
=> iLess0(sbrdtbr0(X4),sbrdtbr0(X2)) )
& X1 = sdtpldt0(sdtasdt0(X3,X2),X4)
& aElement0(X4)
& aElement0(X3) ) ),
inference(fof_simplification,[status(thm)],[mDivision]) ).
cnf(c_0_14,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ aIdeal0(X1)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_18,negated_conjecture,
! [X120,X121] :
( ( xb != sdtpldt0(sdtasdt0(X120,xu),X121)
| ~ aElement0(X121)
| ~ aElement0(X120)
| ~ iLess0(sbrdtbr0(X121),sbrdtbr0(xu)) )
& ( xb != sdtpldt0(sdtasdt0(X120,xu),X121)
| ~ aElement0(X121)
| ~ aElement0(X120)
| X121 != sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_19,plain,
! [X87,X88] :
( ( X88 = sz00
| ~ aElement0(X88)
| ~ aElement0(X87)
| iLess0(sbrdtbr0(esk15_2(X87,X88)),sbrdtbr0(X88))
| esk15_2(X87,X88) = sz00 )
& ( X88 = sz00
| ~ aElement0(X88)
| ~ aElement0(X87)
| X87 = sdtpldt0(sdtasdt0(esk14_2(X87,X88),X88),esk15_2(X87,X88)) )
& ( X88 = sz00
| ~ aElement0(X88)
| ~ aElement0(X87)
| aElement0(esk15_2(X87,X88)) )
& ( X88 = sz00
| ~ aElement0(X88)
| ~ aElement0(X87)
| aElement0(esk14_2(X87,X88)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
cnf(c_0_20,hypothesis,
( ~ aSet0(xI)
| aElement0(xu) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( xb != sdtpldt0(sdtasdt0(X2,xu),X1)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| X2 = sz00
| X1 = sdtpldt0(sdtasdt0(esk14_2(X1,X2),X2),esk15_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,hypothesis,
xu != sz00,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_26,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_27,negated_conjecture,
( ~ aElement0(esk15_2(xb,xu))
| ~ aElement0(esk14_2(xb,xu))
| ~ iLess0(sbrdtbr0(esk15_2(xb,xu)),sbrdtbr0(xu)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25])]),c_0_26])]) ).
cnf(c_0_28,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| X2 = sz00
| aElement0(esk14_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
( ~ aElement0(esk15_2(xb,xu))
| ~ iLess0(sbrdtbr0(esk15_2(xb,xu)),sbrdtbr0(xu)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26]),c_0_25])]),c_0_24]) ).
cnf(c_0_30,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| X2 = sz00
| aElement0(esk15_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,negated_conjecture,
~ iLess0(sbrdtbr0(esk15_2(xb,xu)),sbrdtbr0(xu)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26]),c_0_25])]),c_0_24]) ).
cnf(c_0_32,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| X2 = sz00
| iLess0(sbrdtbr0(esk15_2(X1,X2)),sbrdtbr0(X2))
| esk15_2(X1,X2) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,negated_conjecture,
( xb != sdtpldt0(sdtasdt0(X2,xu),X1)
| ~ aElement0(X1)
| ~ aElement0(X2)
| X1 != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_34,plain,
aElement0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_35,negated_conjecture,
esk15_2(xb,xu) = sz00,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_25])]),c_0_24]) ).
cnf(c_0_36,negated_conjecture,
( ~ aElement0(X1)
| sdtpldt0(sdtasdt0(X1,xu),sz00) != xb ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_33]),c_0_34])]) ).
cnf(c_0_37,negated_conjecture,
sdtpldt0(sdtasdt0(esk14_2(xb,xu),xu),sz00) = xb,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_35]),c_0_26]),c_0_25])]),c_0_24]) ).
cnf(c_0_38,negated_conjecture,
~ aElement0(esk14_2(xb,xu)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_28]),c_0_26]),c_0_25])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG118+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n018.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 04:22:58 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.51 Running first-order theorem proving
% 0.19/0.51 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.26/0.59 % Version: 3.5.1
% 0.26/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.59 % Starting sh5l with 300s (1) cores
% 0.26/0.59 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 957692 completed with status 0
% 0.26/0.59 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.26/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.59 % No SInE strategy applied
% 0.26/0.59 % Search class: FGHSF-FSMM32-MFFFFFNN
% 0.26/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.26/0.59 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.26/0.59 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.59 % Starting new_bool_1 with 136s (1) cores
% 0.26/0.59 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 957699 completed with status 0
% 0.26/0.59 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.26/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.59 % No SInE strategy applied
% 0.26/0.59 % Search class: FGHSF-FSMM32-MFFFFFNN
% 0.26/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.26/0.59 % Preprocessing time : 0.003 s
% 0.26/0.59 % Presaturation interreduction done
% 0.26/0.59
% 0.26/0.59 % Proof found!
% 0.26/0.59 % SZS status Theorem
% 0.26/0.59 % SZS output start CNFRefutation
% See solution above
% 0.26/0.59 % Parsed axioms : 50
% 0.26/0.59 % Removed by relevancy pruning/SinE : 0
% 0.26/0.59 % Initial clauses : 116
% 0.26/0.59 % Removed in clause preprocessing : 4
% 0.26/0.59 % Initial clauses in saturation : 112
% 0.26/0.59 % Processed clauses : 376
% 0.26/0.59 % ...of these trivial : 4
% 0.26/0.59 % ...subsumed : 70
% 0.26/0.59 % ...remaining for further processing : 302
% 0.26/0.59 % Other redundant clauses eliminated : 20
% 0.26/0.59 % Clauses deleted for lack of memory : 0
% 0.26/0.59 % Backward-subsumed : 9
% 0.26/0.59 % Backward-rewritten : 8
% 0.26/0.59 % Generated clauses : 636
% 0.26/0.59 % ...of the previous two non-redundant : 598
% 0.26/0.59 % ...aggressively subsumed : 0
% 0.26/0.59 % Contextual simplify-reflections : 1
% 0.26/0.59 % Paramodulations : 614
% 0.26/0.59 % Factorizations : 4
% 0.26/0.59 % NegExts : 0
% 0.26/0.59 % Equation resolutions : 20
% 0.26/0.59 % Disequality decompositions : 0
% 0.26/0.59 % Total rewrite steps : 327
% 0.26/0.59 % ...of those cached : 310
% 0.26/0.59 % Propositional unsat checks : 0
% 0.26/0.59 % Propositional check models : 0
% 0.26/0.59 % Propositional check unsatisfiable : 0
% 0.26/0.59 % Propositional clauses : 0
% 0.26/0.59 % Propositional clauses after purity: 0
% 0.26/0.59 % Propositional unsat core size : 0
% 0.26/0.59 % Propositional preprocessing time : 0.000
% 0.26/0.59 % Propositional encoding time : 0.000
% 0.26/0.59 % Propositional solver time : 0.000
% 0.26/0.59 % Success case prop preproc time : 0.000
% 0.26/0.59 % Success case prop encoding time : 0.000
% 0.26/0.59 % Success case prop solver time : 0.000
% 0.26/0.59 % Current number of processed clauses : 158
% 0.26/0.59 % Positive orientable unit clauses : 38
% 0.26/0.59 % Positive unorientable unit clauses: 0
% 0.26/0.59 % Negative unit clauses : 17
% 0.26/0.59 % Non-unit-clauses : 103
% 0.26/0.59 % Current number of unprocessed clauses: 439
% 0.26/0.59 % ...number of literals in the above : 2279
% 0.26/0.59 % Current number of archived formulas : 0
% 0.26/0.59 % Current number of archived clauses : 129
% 0.26/0.59 % Clause-clause subsumption calls (NU) : 3194
% 0.26/0.59 % Rec. Clause-clause subsumption calls : 826
% 0.26/0.59 % Non-unit clause-clause subsumptions : 38
% 0.26/0.59 % Unit Clause-clause subsumption calls : 660
% 0.26/0.59 % Rewrite failures with RHS unbound : 0
% 0.26/0.59 % BW rewrite match attempts : 6
% 0.26/0.59 % BW rewrite match successes : 6
% 0.26/0.59 % Condensation attempts : 0
% 0.26/0.59 % Condensation successes : 0
% 0.26/0.59 % Termbank termtop insertions : 19823
% 0.26/0.59 % Search garbage collected termcells : 1953
% 0.26/0.59
% 0.26/0.59 % -------------------------------------------------
% 0.26/0.59 % User time : 0.038 s
% 0.26/0.59 % System time : 0.007 s
% 0.26/0.59 % Total time : 0.045 s
% 0.26/0.59 % Maximum resident set size: 3952 pages
% 0.26/0.59
% 0.26/0.59 % -------------------------------------------------
% 0.26/0.59 % User time : 0.130 s
% 0.26/0.59 % System time : 0.029 s
% 0.26/0.59 % Total time : 0.159 s
% 0.26/0.59 % Maximum resident set size: 4864 pages
% 0.26/0.59 % E exiting
%------------------------------------------------------------------------------