%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT058+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:26:57 PM UTC 2026
% Result : Theorem 0.07s 0.35s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 51 ( 13 unt; 0 def)
% Number of atoms : 166 ( 26 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 168 ( 53 ~; 65 |; 33 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(lemma_10,conjecture,
! [X1] :
( ( greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& ? [X5] : age(X1,X5) = zero
& organization(X1) )
=> ~ ( robust_position(X1)
& fragile_position(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_10) ).
fof(definition_4,axiom,
! [X1] :
( robust_position(X1)
<=> ! [X4] :
( ( greater(age(X1,X4),tau)
=> positional_advantage(X1,X4) )
& ( smaller_or_equal(age(X1,X4),tau)
=> ~ positional_advantage(X1,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_4) ).
fof(definition_3,axiom,
! [X1] :
( fragile_position(X1)
<=> ! [X4] :
( ( greater(age(X1,X4),sigma)
=> ~ positional_advantage(X1,X4) )
& ( smaller_or_equal(age(X1,X4),sigma)
=> positional_advantage(X1,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_3) ).
fof(definition_greater_or_equal,axiom,
! [X1,X2] :
( greater_or_equal(X1,X2)
<=> ( X1 = X2
| greater(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_greater_or_equal) ).
fof(definition_smaller_or_equal,axiom,
! [X1,X2] :
( smaller_or_equal(X1,X2)
<=> ( X1 = X2
| smaller(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_smaller_or_equal) ).
fof(definition_smaller,axiom,
! [X1,X2] :
( smaller(X1,X2)
<=> greater(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_smaller) ).
fof(meaning_postulate_greater_comparable,axiom,
! [X1,X2] :
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_comparable) ).
fof(meaning_postulate_greater_strict,axiom,
! [X1,X2] :
~ ( greater(X2,X1)
& greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_strict) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ( greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& ? [X5] : age(X1,X5) = zero
& organization(X1) )
=> ~ ( robust_position(X1)
& fragile_position(X1) ) ),
inference(assume_negation,[status(cth)],[lemma_10]) ).
fof(c_0_9,plain,
! [X1] :
( robust_position(X1)
<=> ! [X4] :
( ( greater(age(X1,X4),tau)
=> positional_advantage(X1,X4) )
& ( smaller_or_equal(age(X1,X4),tau)
=> ~ positional_advantage(X1,X4) ) ) ),
inference(fof_simplification,[status(thm)],[definition_4]) ).
fof(c_0_10,plain,
! [X1] :
( fragile_position(X1)
<=> ! [X4] :
( ( greater(age(X1,X4),sigma)
=> ~ positional_advantage(X1,X4) )
& ( smaller_or_equal(age(X1,X4),sigma)
=> positional_advantage(X1,X4) ) ) ),
inference(fof_simplification,[status(thm)],[definition_3]) ).
fof(c_0_11,plain,
! [X20,X21] :
( ( greater_or_equal(X20,X21)
| X20 != X21 )
& ( greater_or_equal(X20,X21)
| ~ greater(X20,X21) )
& ( X20 = X21
| greater(X20,X21)
| ~ greater_or_equal(X20,X21) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_greater_or_equal])])])]) ).
fof(c_0_12,negated_conjecture,
( robust_position(esk1_0)
& fragile_position(esk1_0)
& greater_or_equal(tau,zero)
& greater_or_equal(sigma,zero)
& age(esk1_0,esk2_0) = zero
& organization(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_13,plain,
! [X8,X9,X10,X11] :
( ( robust_position(X11)
| positional_advantage(X11,esk3_1(X11))
| ~ positional_advantage(X11,esk4_1(X11)) )
& ( robust_position(X11)
| positional_advantage(X11,esk3_1(X11))
| greater(age(X11,esk4_1(X11)),tau) )
& ( robust_position(X11)
| smaller_or_equal(age(X11,esk3_1(X11)),tau)
| ~ positional_advantage(X11,esk4_1(X11)) )
& ( robust_position(X11)
| smaller_or_equal(age(X11,esk3_1(X11)),tau)
| greater(age(X11,esk4_1(X11)),tau) )
& ( ~ robust_position(X8)
| positional_advantage(X8,X10)
| ~ greater(age(X8,X10),tau) )
& ( ~ robust_position(X8)
| ~ positional_advantage(X8,X9)
| ~ smaller_or_equal(age(X8,X9),tau) ) ),
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)],[c_0_9])])])])])])]) ).
fof(c_0_14,plain,
! [X27,X28] :
( ( smaller_or_equal(X27,X28)
| X27 != X28 )
& ( smaller_or_equal(X27,X28)
| ~ smaller(X27,X28) )
& ( X27 = X28
| smaller(X27,X28)
| ~ smaller_or_equal(X27,X28) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller_or_equal])])])]) ).
fof(c_0_15,plain,
! [X29,X30] :
( ( smaller(X29,X30)
| ~ greater(X30,X29) )
& ( greater(X30,X29)
| ~ smaller(X29,X30) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller])])]) ).
fof(c_0_16,plain,
! [X14,X15,X16,X17] :
( ( fragile_position(X17)
| ~ positional_advantage(X17,esk5_1(X17))
| positional_advantage(X17,esk6_1(X17)) )
& ( fragile_position(X17)
| ~ positional_advantage(X17,esk5_1(X17))
| greater(age(X17,esk6_1(X17)),sigma) )
& ( fragile_position(X17)
| smaller_or_equal(age(X17,esk5_1(X17)),sigma)
| positional_advantage(X17,esk6_1(X17)) )
& ( fragile_position(X17)
| smaller_or_equal(age(X17,esk5_1(X17)),sigma)
| greater(age(X17,esk6_1(X17)),sigma) )
& ( ~ fragile_position(X14)
| ~ positional_advantage(X14,X16)
| ~ greater(age(X14,X16),sigma) )
& ( ~ fragile_position(X14)
| positional_advantage(X14,X15)
| ~ smaller_or_equal(age(X14,X15),sigma) ) ),
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)],[c_0_10])])])])])])]) ).
fof(c_0_17,plain,
! [X31,X32] :
( greater(X31,X32)
| X31 = X32
| smaller(X31,X32) ),
inference(variable_rename,[status(thm)],[meaning_postulate_greater_comparable]) ).
fof(c_0_18,plain,
! [X22,X23] :
( ~ greater(X23,X22)
| ~ greater(X22,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[meaning_postulate_greater_strict])])]) ).
cnf(c_0_19,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
greater_or_equal(sigma,zero),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( ~ robust_position(X1)
| ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
age(esk1_0,esk2_0) = zero,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
robust_position(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,plain,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,plain,
( ~ greater(X1,X2)
| smaller(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( ~ fragile_position(X1)
| ~ smaller_or_equal(age(X1,X2),sigma)
| positional_advantage(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
fragile_position(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_28,plain,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,negated_conjecture,
( greater(sigma,zero)
| zero = sigma ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_31,negated_conjecture,
( ~ smaller_or_equal(zero,tau)
| ~ positional_advantage(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_32,plain,
( ~ greater(X2,X1)
| smaller_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( ~ smaller_or_equal(zero,sigma)
| positional_advantage(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_27])]) ).
cnf(c_0_34,plain,
( smaller_or_equal(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( ~ greater(zero,sigma)
| zero = sigma ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( ~ greater(tau,zero)
| ~ positional_advantage(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( positional_advantage(esk1_0,esk2_0)
| zero = sigma ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_38,negated_conjecture,
greater_or_equal(tau,zero),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,negated_conjecture,
( ~ greater(tau,zero)
| zero = sigma ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( greater(tau,zero)
| zero = tau ),
inference(spm,[status(thm)],[c_0_19,c_0_38]) ).
cnf(c_0_41,plain,
( X1 != X2
| smaller_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_42,negated_conjecture,
( zero = sigma
| zero = tau ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_44,negated_conjecture,
zero = sigma,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_42]),c_0_43])]),c_0_37]) ).
cnf(c_0_45,negated_conjecture,
age(esk1_0,esk2_0) = sigma,
inference(rw,[status(thm)],[c_0_22,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
positional_advantage(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_44]),c_0_43])]) ).
cnf(c_0_47,negated_conjecture,
~ smaller_or_equal(sigma,tau),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_45]),c_0_23]),c_0_46])]) ).
cnf(c_0_48,negated_conjecture,
~ greater(tau,sigma),
inference(spm,[status(thm)],[c_0_47,c_0_32]) ).
cnf(c_0_49,negated_conjecture,
tau = sigma,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_44]),c_0_44]),c_0_48]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_49]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT058+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Mon Sep 21 01:23:38 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.07/0.35 % Version: 3.5.1
% 0.07/0.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.35 % Starting sh5l with 300s (1) cores
% 0.07/0.35 % new_bool_3 with pid 1301890 completed with status 0
% 0.07/0.35 % Result found by new_bool_3
% 0.07/0.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.35 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.07/0.35 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.35 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.35 % SubtermCWHack with pid 1301895 completed with status 0
% 0.07/0.35 % Result found by SubtermCWHack
% 0.07/0.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.35 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.07/0.35 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.35 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.35 % Preprocessing time : 0.001 s
% 0.07/0.35
% 0.07/0.35 % Proof found!
% 0.07/0.35 % SZS status Theorem
% 0.07/0.35 % SZS output start CNFRefutation
% See solution above
% 0.07/0.35 % Parsed axioms : 9
% 0.07/0.35 % Removed by relevancy pruning/SinE : 0
% 0.07/0.35 % Initial clauses : 29
% 0.07/0.35 % Removed in clause preprocessing : 0
% 0.07/0.35 % Initial clauses in saturation : 29
% 0.07/0.35 % Processed clauses : 89
% 0.07/0.35 % ...of these trivial : 0
% 0.07/0.35 % ...subsumed : 21
% 0.07/0.35 % ...remaining for further processing : 68
% 0.07/0.35 % Other redundant clauses eliminated : 2
% 0.07/0.35 % Clauses deleted for lack of memory : 0
% 0.07/0.35 % Backward-subsumed : 1
% 0.07/0.35 % Backward-rewritten : 35
% 0.07/0.35 % Generated clauses : 119
% 0.07/0.35 % ...of the previous two non-redundant : 115
% 0.07/0.35 % ...aggressively subsumed : 0
% 0.07/0.35 % Contextual simplify-reflections : 2
% 0.07/0.35 % Paramodulations : 114
% 0.07/0.35 % Factorizations : 3
% 0.07/0.35 % NegExts : 0
% 0.07/0.35 % Equation resolutions : 2
% 0.07/0.35 % Disequality decompositions : 0
% 0.07/0.35 % Total rewrite steps : 66
% 0.07/0.35 % ...of those cached : 57
% 0.07/0.35 % Propositional unsat checks : 0
% 0.07/0.35 % Propositional check models : 0
% 0.07/0.35 % Propositional check unsatisfiable : 0
% 0.07/0.35 % Propositional clauses : 0
% 0.07/0.35 % Propositional clauses after purity: 0
% 0.07/0.35 % Propositional unsat core size : 0
% 0.07/0.35 % Propositional preprocessing time : 0.000
% 0.07/0.35 % Propositional encoding time : 0.000
% 0.07/0.35 % Propositional solver time : 0.000
% 0.07/0.35 % Success case prop preproc time : 0.000
% 0.07/0.35 % Success case prop encoding time : 0.000
% 0.07/0.35 % Success case prop solver time : 0.000
% 0.07/0.35 % Current number of processed clauses : 30
% 0.07/0.35 % Positive orientable unit clauses : 9
% 0.07/0.35 % Positive unorientable unit clauses: 0
% 0.07/0.35 % Negative unit clauses : 1
% 0.07/0.35 % Non-unit-clauses : 20
% 0.07/0.35 % Current number of unprocessed clauses: 51
% 0.07/0.35 % ...number of literals in the above : 172
% 0.07/0.35 % Current number of archived formulas : 0
% 0.07/0.35 % Current number of archived clauses : 36
% 0.07/0.35 % Clause-clause subsumption calls (NU) : 315
% 0.07/0.35 % Rec. Clause-clause subsumption calls : 290
% 0.07/0.35 % Non-unit clause-clause subsumptions : 16
% 0.07/0.35 % Unit Clause-clause subsumption calls : 42
% 0.07/0.35 % Rewrite failures with RHS unbound : 0
% 0.07/0.35 % BW rewrite match attempts : 4
% 0.07/0.35 % BW rewrite match successes : 2
% 0.07/0.35 % Condensation attempts : 0
% 0.07/0.35 % Condensation successes : 0
% 0.07/0.35 % Termbank termtop insertions : 2790
% 0.07/0.35 % Search garbage collected termcells : 422
% 0.07/0.35
% 0.07/0.35 % -------------------------------------------------
% 0.07/0.35 % User time : 0.005 s
% 0.07/0.35 % System time : 0.001 s
% 0.07/0.35 % Total time : 0.006 s
% 0.07/0.35 % Maximum resident set size: 3644 pages
% 0.07/0.35
% 0.07/0.35 % -------------------------------------------------
% 0.07/0.35 % User time : 0.007 s
% 0.07/0.35 % System time : 0.003 s
% 0.07/0.35 % Total time : 0.010 s
% 0.07/0.35 % Maximum resident set size: 4608 pages
% 0.07/0.35 % E exiting
%------------------------------------------------------------------------------