%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM558+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 : n004.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:33 PM UTC 2026
% Result : Theorem 0.24s 0.60s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 209 ( 37 equ)
% Maximal formula atoms : 67 ( 6 avg)
% Number of connectives : 253 ( 74 ~; 72 |; 86 &)
% ( 4 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 32 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2202_02,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202_02) ).
fof(m__2227,hypothesis,
( ~ ( ! [X1] :
( ( ( sbrdtbr0(X1) = xk
& ( aSubsetOf0(X1,xS)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
=> aElementOf0(X1,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(X1,slbdtsldtrb0(xS,xk))
=> ( sbrdtbr0(X1) = xk
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
=> ( slbdtsldtrb0(xS,xk) = slcrc0
| ~ ? [X1] : aElementOf0(X1,slbdtsldtrb0(xS,xk)) ) )
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xS,xk))
=> aElementOf0(X1,slbdtsldtrb0(xT,xk)) )
& ! [X1] :
( ( ( sbrdtbr0(X1) = xk
& ( aSubsetOf0(X1,xT)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xT) )
& aSet0(X1) ) ) )
=> aElementOf0(X1,slbdtsldtrb0(xT,xk)) )
& ( aElementOf0(X1,slbdtsldtrb0(xT,xk))
=> ( sbrdtbr0(X1) = xk
& aSubsetOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xT) )
& aSet0(X1) ) ) )
& aSet0(slbdtsldtrb0(xT,xk))
& ! [X1] :
( ( ( sbrdtbr0(X1) = xk
& ( aSubsetOf0(X1,xS)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
=> aElementOf0(X1,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(X1,slbdtsldtrb0(xS,xk))
=> ( sbrdtbr0(X1) = xk
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
& aSet0(slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2227) ).
fof(m__2357,hypothesis,
( xP = sdtpldt0(sdtmndt0(xQ,xy),xx)
& ! [X1] :
( aElementOf0(X1,xP)
<=> ( ( X1 = xx
| aElementOf0(X1,sdtmndt0(xQ,xy)) )
& aElement0(X1) ) )
& aSet0(xP)
& ! [X1] :
( aElementOf0(X1,sdtmndt0(xQ,xy))
<=> ( X1 != xy
& aElementOf0(X1,xQ)
& aElement0(X1) ) )
& aSet0(sdtmndt0(xQ,xy)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2357) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__,conjecture,
aElementOf0(xx,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2378,hypothesis,
( aElementOf0(xP,slbdtsldtrb0(xS,xk))
& sbrdtbr0(xP) = xk
& aSubsetOf0(xP,xS)
& ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xS) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2378) ).
fof(m__2256,hypothesis,
aElementOf0(xx,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2256) ).
fof(c_0_7,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_simplification,[status(thm)],[m__2202_02]) ).
fof(c_0_8,hypothesis,
! [X5,X6,X7,X9,X10,X11,X13,X14,X15,X16] :
( slbdtsldtrb0(xS,xk) != slcrc0
& aElementOf0(esk4_0,slbdtsldtrb0(xS,xk))
& ( aElementOf0(X16,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X16) != xk
| ~ aSubsetOf0(X16,xS) )
& ( aElementOf0(X16,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X16) != xk
| ~ aSet0(X16)
| ~ aElementOf0(esk3_1(X16),xS) )
& ( aElementOf0(X16,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X16) != xk
| ~ aSet0(X16)
| aElementOf0(esk3_1(X16),X16) )
& ( ~ aElementOf0(X14,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X14) = xk )
& ( ~ aElementOf0(X14,slbdtsldtrb0(xS,xk))
| aSubsetOf0(X14,xS) )
& ( ~ aElementOf0(X14,slbdtsldtrb0(xS,xk))
| aElementOf0(X15,xS)
| ~ aElementOf0(X15,X14) )
& ( ~ aElementOf0(X14,slbdtsldtrb0(xS,xk))
| aSet0(X14) )
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& ( aElementOf0(X13,slbdtsldtrb0(xT,xk))
| ~ aElementOf0(X13,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(X11,slbdtsldtrb0(xT,xk))
| sbrdtbr0(X11) != xk
| ~ aSubsetOf0(X11,xT) )
& ( aElementOf0(X11,slbdtsldtrb0(xT,xk))
| sbrdtbr0(X11) != xk
| ~ aSet0(X11)
| ~ aElementOf0(esk2_1(X11),xT) )
& ( aElementOf0(X11,slbdtsldtrb0(xT,xk))
| sbrdtbr0(X11) != xk
| ~ aSet0(X11)
| aElementOf0(esk2_1(X11),X11) )
& ( ~ aElementOf0(X9,slbdtsldtrb0(xT,xk))
| sbrdtbr0(X9) = xk )
& ( ~ aElementOf0(X9,slbdtsldtrb0(xT,xk))
| aSubsetOf0(X9,xT) )
& ( ~ aElementOf0(X9,slbdtsldtrb0(xT,xk))
| aElementOf0(X10,xT)
| ~ aElementOf0(X10,X9) )
& ( ~ aElementOf0(X9,slbdtsldtrb0(xT,xk))
| aSet0(X9) )
& aSet0(slbdtsldtrb0(xT,xk))
& ( aElementOf0(X7,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X7) != xk
| ~ aSubsetOf0(X7,xS) )
& ( aElementOf0(X7,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X7) != xk
| ~ aSet0(X7)
| ~ aElementOf0(esk1_1(X7),xS) )
& ( aElementOf0(X7,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X7) != xk
| ~ aSet0(X7)
| aElementOf0(esk1_1(X7),X7) )
& ( ~ aElementOf0(X5,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X5) = xk )
& ( ~ aElementOf0(X5,slbdtsldtrb0(xS,xk))
| aSubsetOf0(X5,xS) )
& ( ~ aElementOf0(X5,slbdtsldtrb0(xS,xk))
| aElementOf0(X6,xS)
| ~ aElementOf0(X6,X5) )
& ( ~ aElementOf0(X5,slbdtsldtrb0(xS,xk))
| aSet0(X5) )
& aSet0(slbdtsldtrb0(xS,xk)) ),
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)],[m__2227])])])])])])]) ).
fof(c_0_9,hypothesis,
( xP = sdtpldt0(sdtmndt0(xQ,xy),xx)
& ! [X1] :
( aElementOf0(X1,xP)
<=> ( ( X1 = xx
| aElementOf0(X1,sdtmndt0(xQ,xy)) )
& aElement0(X1) ) )
& aSet0(xP)
& ! [X1] :
( aElementOf0(X1,sdtmndt0(xQ,xy))
<=> ( X1 != xy
& aElementOf0(X1,xQ)
& aElement0(X1) ) )
& aSet0(sdtmndt0(xQ,xy)) ),
inference(fof_simplification,[status(thm)],[m__2357]) ).
fof(c_0_10,plain,
! [X70,X71] :
( aElement0(X71)
| ~ aElementOf0(X71,X70)
| ~ aSet0(X70) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_11,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
fof(c_0_12,negated_conjecture,
~ aElementOf0(xx,xT),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_13,hypothesis,
( ~ aElementOf0(X2,slbdtsldtrb0(xT,xk))
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
( ~ aElementOf0(X1,slbdtsldtrb0(xS,xk))
| aElementOf0(X1,slbdtsldtrb0(xT,xk)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,hypothesis,
! [X22] :
( aElementOf0(xP,slbdtsldtrb0(xS,xk))
& sbrdtbr0(xP) = xk
& aSubsetOf0(xP,xS)
& ( aElementOf0(X22,xS)
| ~ aElementOf0(X22,xP) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2378])])])]) ).
fof(c_0_16,hypothesis,
! [X20,X21] :
( xP = sdtpldt0(sdtmndt0(xQ,xy),xx)
& ( aElementOf0(X21,xP)
| ~ aElement0(X21)
| X21 != xx )
& ( aElementOf0(X21,xP)
| ~ aElement0(X21)
| ~ aElementOf0(X21,sdtmndt0(xQ,xy)) )
& ( ~ aElementOf0(X21,xP)
| X21 = xx
| aElementOf0(X21,sdtmndt0(xQ,xy)) )
& ( ~ aElementOf0(X21,xP)
| aElement0(X21) )
& aSet0(xP)
& ( aElementOf0(X20,sdtmndt0(xQ,xy))
| X20 = xy
| ~ aElementOf0(X20,xQ)
| ~ aElement0(X20) )
& ( ~ aElementOf0(X20,sdtmndt0(xQ,xy))
| X20 != xy )
& ( ~ aElementOf0(X20,sdtmndt0(xQ,xy))
| aElementOf0(X20,xQ) )
& ( ~ aElementOf0(X20,sdtmndt0(xQ,xy))
| aElement0(X20) )
& aSet0(sdtmndt0(xQ,xy)) ),
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_9])])])])]) ).
cnf(c_0_17,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,hypothesis,
aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[m__2256]) ).
cnf(c_0_19,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_20,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
cnf(c_0_21,hypothesis,
( ~ aElementOf0(X1,X2)
| ~ aElementOf0(X2,slbdtsldtrb0(xS,xk))
| aElementOf0(X1,xT) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,hypothesis,
( ~ aElement0(X1)
| X1 != xx
| aElementOf0(X1,xP) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
fof(c_0_25,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_nnf,[status(thm)],[c_0_20]) ).
cnf(c_0_26,hypothesis,
( ~ aElementOf0(X1,xP)
| aElementOf0(X1,xT) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,hypothesis,
aElementOf0(xx,xP),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_23]),c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
~ aElementOf0(xx,xT),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM558+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n004.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 02:39:49 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.51 Running first-order theorem proving
% 0.24/0.51 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.60 % Version: 3.5.1
% 0.24/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.60 % Starting sh5l with 300s (1) cores
% 0.24/0.60 % new_bool_1 with pid 2074777 completed with status 0
% 0.24/0.60 % Result found by new_bool_1
% 0.24/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.60 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.24/0.60 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.60 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.60 % SubtermCWHack with pid 2074780 completed with status 0
% 0.24/0.60 % Result found by SubtermCWHack
% 0.24/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.60 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.24/0.60 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.60 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.60 % Preprocessing time : 0.004 s
% 0.24/0.60
% 0.24/0.60 % Proof found!
% 0.24/0.60 % SZS status Theorem
% 0.24/0.60 % SZS output start CNFRefutation
% See solution above
% 0.24/0.60 % Parsed axioms : 72
% 0.24/0.60 % Removed by relevancy pruning/SinE : 5
% 0.24/0.60 % Initial clauses : 159
% 0.24/0.60 % Removed in clause preprocessing : 5
% 0.24/0.60 % Initial clauses in saturation : 154
% 0.24/0.60 % Processed clauses : 191
% 0.24/0.60 % ...of these trivial : 3
% 0.24/0.60 % ...subsumed : 28
% 0.24/0.60 % ...remaining for further processing : 160
% 0.24/0.60 % Other redundant clauses eliminated : 13
% 0.24/0.60 % Clauses deleted for lack of memory : 0
% 0.24/0.60 % Backward-subsumed : 3
% 0.24/0.60 % Backward-rewritten : 2
% 0.24/0.60 % Generated clauses : 181
% 0.24/0.60 % ...of the previous two non-redundant : 130
% 0.24/0.60 % ...aggressively subsumed : 0
% 0.24/0.60 % Contextual simplify-reflections : 2
% 0.24/0.60 % Paramodulations : 167
% 0.24/0.60 % Factorizations : 0
% 0.24/0.60 % NegExts : 0
% 0.24/0.60 % Equation resolutions : 14
% 0.24/0.60 % Disequality decompositions : 0
% 0.24/0.60 % Total rewrite steps : 153
% 0.24/0.60 % ...of those cached : 123
% 0.24/0.60 % Propositional unsat checks : 0
% 0.24/0.60 % Propositional check models : 0
% 0.24/0.60 % Propositional check unsatisfiable : 0
% 0.24/0.60 % Propositional clauses : 0
% 0.24/0.60 % Propositional clauses after purity: 0
% 0.24/0.60 % Propositional unsat core size : 0
% 0.24/0.60 % Propositional preprocessing time : 0.000
% 0.24/0.60 % Propositional encoding time : 0.000
% 0.24/0.60 % Propositional solver time : 0.000
% 0.24/0.60 % Success case prop preproc time : 0.000
% 0.24/0.60 % Success case prop encoding time : 0.000
% 0.24/0.60 % Success case prop solver time : 0.000
% 0.24/0.60 % Current number of processed clauses : 145
% 0.24/0.60 % Positive orientable unit clauses : 42
% 0.24/0.60 % Positive unorientable unit clauses: 0
% 0.24/0.60 % Negative unit clauses : 10
% 0.24/0.60 % Non-unit-clauses : 93
% 0.24/0.60 % Current number of unprocessed clauses: 91
% 0.24/0.60 % ...number of literals in the above : 409
% 0.24/0.60 % Current number of archived formulas : 0
% 0.24/0.60 % Current number of archived clauses : 5
% 0.24/0.60 % Clause-clause subsumption calls (NU) : 667
% 0.24/0.60 % Rec. Clause-clause subsumption calls : 550
% 0.24/0.60 % Non-unit clause-clause subsumptions : 26
% 0.24/0.60 % Unit Clause-clause subsumption calls : 61
% 0.24/0.60 % Rewrite failures with RHS unbound : 0
% 0.24/0.60 % BW rewrite match attempts : 1
% 0.24/0.60 % BW rewrite match successes : 1
% 0.24/0.60 % Condensation attempts : 0
% 0.24/0.60 % Condensation successes : 0
% 0.24/0.60 % Termbank termtop insertions : 13642
% 0.24/0.60 % Search garbage collected termcells : 2609
% 0.24/0.60
% 0.24/0.60 % -------------------------------------------------
% 0.24/0.60 % User time : 0.032 s
% 0.24/0.60 % System time : 0.005 s
% 0.24/0.60 % Total time : 0.037 s
% 0.24/0.60 % Maximum resident set size: 3976 pages
% 0.24/0.60
% 0.24/0.60 % -------------------------------------------------
% 0.24/0.60 % User time : 0.037 s
% 0.24/0.60 % System time : 0.011 s
% 0.24/0.60 % Total time : 0.048 s
% 0.24/0.60 % Maximum resident set size: 4864 pages
% 0.24/0.60 % E exiting
%------------------------------------------------------------------------------