%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT013+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:01 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 54 ( 19 unt; 0 def)
% Number of atoms : 190 ( 19 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 217 ( 81 ~; 70 |; 55 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 115 ( 1 sgn 79 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13_FOL,conjecture,
! [X1,X6,X7,X8,X9,X4,X5] :
( ( greater(X7,X6)
& size(X1,X9,X5)
& size(X1,X8,X4)
& complexity(X1,X7,X5)
& complexity(X1,X6,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL) ).
fof(t12_FOL,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( greater(X5,X4)
& complexity(X1,X7,X5)
& complexity(X1,X6,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL) ).
fof(mp15,axiom,
! [X1,X3] :
( organization(X1,X3)
=> time(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp15) ).
fof(mp17,axiom,
! [X1,X4,X5] :
( reorganization_free(X1,X4,X5)
=> reorganization_free(X1,X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp17) ).
fof(mp16,axiom,
! [X4,X5] :
( ( time(X5)
& time(X4) )
=> ( greater(X5,X4)
| X4 = X5
| greater(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp16) ).
fof(t11_FOL,hypothesis,
! [X1,X8,X9,X4,X5] :
( ( greater(X5,X4)
& size(X1,X9,X5)
& size(X1,X8,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_FOL) ).
fof(mp18,axiom,
! [X1,X6,X7,X4,X5] :
( ( X4 = X5
& complexity(X1,X7,X5)
& complexity(X1,X6,X4)
& organization(X1,X5)
& organization(X1,X4) )
=> X6 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp18) ).
fof(mp6_1,axiom,
! [X1,X2] :
~ ( X1 = X2
& greater(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X6,X7,X8,X9,X4,X5] :
( ( greater(X7,X6)
& size(X1,X9,X5)
& size(X1,X8,X4)
& complexity(X1,X7,X5)
& complexity(X1,X6,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X8,X9) ),
inference(assume_negation,[status(cth)],[t13_FOL]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X6,X7,X8,X9,X4,X5] :
( ( greater(X7,X6)
& size(X1,X9,X5)
& size(X1,X8,X4)
& complexity(X1,X7,X5)
& complexity(X1,X6,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( greater(X5,X4)
& complexity(X1,X7,X5)
& complexity(X1,X6,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X6,X7) ),
inference(fof_simplification,[status(thm)],[t12_FOL]) ).
fof(c_0_11,plain,
! [X41,X42] :
( time(X42)
| ~ organization(X41,X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp15])])]) ).
fof(c_0_12,negated_conjecture,
( greater(esk4_0,esk5_0)
& greater(esk3_0,esk2_0)
& size(esk1_0,esk5_0,esk7_0)
& size(esk1_0,esk4_0,esk6_0)
& complexity(esk1_0,esk3_0,esk7_0)
& complexity(esk1_0,esk2_0,esk6_0)
& reorganization_free(esk1_0,esk6_0,esk7_0)
& organization(esk1_0,esk7_0)
& organization(esk1_0,esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_13,hypothesis,
! [X28,X29,X30,X31,X32] :
( ~ greater(X29,X30)
| ~ greater(X32,X31)
| ~ complexity(X28,X30,X32)
| ~ complexity(X28,X29,X31)
| ~ reorganization_free(X28,X31,X32)
| ~ organization(X28,X32)
| ~ organization(X28,X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_14,plain,
! [X38,X39,X40] :
( reorganization_free(X38,X40,X39)
| ~ reorganization_free(X38,X39,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp17])])]) ).
fof(c_0_15,plain,
! [X21,X22] :
( greater(X22,X21)
| X21 = X22
| greater(X21,X22)
| ~ time(X22)
| ~ time(X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp16])])]) ).
cnf(c_0_16,plain,
( ~ organization(X1,X2)
| time(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
organization(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,hypothesis,
( ~ greater(X4,X5)
| ~ greater(X3,X2)
| ~ complexity(X1,X5,X3)
| ~ complexity(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
complexity(esk1_0,esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
organization(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_23,hypothesis,
! [X1,X8,X9,X4,X5] :
( ( greater(X5,X4)
& size(X1,X9,X5)
& size(X1,X8,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[t11_FOL]) ).
cnf(c_0_24,plain,
( ~ time(X2)
| ~ time(X1)
| greater(X2,X1)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
time(esk7_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( ~ greater(esk6_0,X2)
| ~ greater(X1,esk2_0)
| ~ organization(esk1_0,X2)
| ~ reorganization_free(esk1_0,X2,esk6_0)
| ~ complexity(esk1_0,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
reorganization_free(esk1_0,esk7_0,esk6_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_28,hypothesis,
! [X23,X24,X25,X26,X27] :
( ~ greater(X24,X25)
| ~ greater(X27,X26)
| ~ size(X23,X25,X27)
| ~ size(X23,X24,X26)
| ~ reorganization_free(X23,X26,X27)
| ~ organization(X23,X27)
| ~ organization(X23,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ time(X1)
| greater(X1,esk7_0)
| greater(esk7_0,X1)
| X1 = esk7_0 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
time(esk6_0),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_31,negated_conjecture,
( ~ greater(X1,esk2_0)
| ~ greater(esk6_0,esk7_0)
| ~ complexity(esk1_0,X1,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_17])]) ).
cnf(c_0_32,negated_conjecture,
complexity(esk1_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,negated_conjecture,
greater(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,hypothesis,
( ~ greater(X4,X5)
| ~ greater(X3,X2)
| ~ size(X1,X5,X3)
| ~ size(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,negated_conjecture,
size(esk1_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_36,plain,
! [X33,X34,X35,X36,X37] :
( X34 = X35
| X36 != X37
| ~ complexity(X33,X35,X37)
| ~ complexity(X33,X34,X36)
| ~ organization(X33,X37)
| ~ organization(X33,X36) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp18])])]) ).
cnf(c_0_37,negated_conjecture,
( greater(esk7_0,esk6_0)
| greater(esk6_0,esk7_0)
| esk7_0 = esk6_0 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
~ greater(esk6_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_39,negated_conjecture,
( ~ greater(esk7_0,X2)
| ~ greater(X1,esk5_0)
| ~ organization(esk1_0,X2)
| ~ reorganization_free(esk1_0,X2,esk7_0)
| ~ size(esk1_0,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_17])]) ).
cnf(c_0_40,negated_conjecture,
size(esk1_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_41,negated_conjecture,
greater(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_42,plain,
( X2 != X3
| ~ complexity(X1,X5,X3)
| ~ complexity(X1,X4,X2)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| X4 = X5 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( greater(esk7_0,esk6_0)
| esk7_0 = esk6_0 ),
inference(sr,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
~ greater(esk7_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_22]),c_0_20]),c_0_41])]) ).
cnf(c_0_45,plain,
( ~ organization(X3,X4)
| ~ complexity(X3,X1,X4)
| ~ complexity(X3,X2,X4)
| X1 = X2 ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_46,negated_conjecture,
esk7_0 = esk6_0,
inference(sr,[status(thm)],[c_0_43,c_0_44]) ).
fof(c_0_47,plain,
! [X17,X18] :
( X17 != X18
| ~ greater(X17,X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp6_1])])]) ).
cnf(c_0_48,negated_conjecture,
( ~ complexity(esk1_0,X1,esk6_0)
| X1 = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_19]),c_0_20])]) ).
cnf(c_0_49,negated_conjecture,
complexity(esk1_0,esk3_0,esk6_0),
inference(rw,[status(thm)],[c_0_32,c_0_46]) ).
cnf(c_0_50,plain,
( X1 != X2
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_51,negated_conjecture,
esk3_0 = esk2_0,
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_51]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT013+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n013.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 01:20:37 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % sh5l with pid 3850584 completed with status 0
% 0.11/0.45 % Result found by sh5l
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.45 % Search class: FGHSF-FFSM00-SFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 3850591 completed with status 0
% 0.11/0.45 % Result found by SubtermCWHack
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.45 % Search class: FGHSF-FFSM00-SFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Theorem
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 9
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 17
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 17
% 0.11/0.45 % Processed clauses : 48
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 5
% 0.11/0.45 % ...remaining for further processing : 43
% 0.11/0.45 % Other redundant clauses eliminated : 2
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 2
% 0.11/0.45 % Backward-rewritten : 15
% 0.11/0.45 % Generated clauses : 36
% 0.11/0.45 % ...of the previous two non-redundant : 44
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 32
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 2
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 44
% 0.11/0.45 % ...of those cached : 34
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 22
% 0.11/0.45 % Positive orientable unit clauses : 9
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 2
% 0.11/0.45 % Non-unit-clauses : 11
% 0.11/0.45 % Current number of unprocessed clauses: 12
% 0.11/0.45 % ...number of literals in the above : 40
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 19
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 129
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 44
% 0.11/0.45 % Non-unit clause-clause subsumptions : 1
% 0.11/0.45 % Unit Clause-clause subsumption calls : 27
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 2
% 0.11/0.45 % BW rewrite match successes : 2
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 2075
% 0.11/0.45 % Search garbage collected termcells : 346
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.008 s
% 0.11/0.45 % System time : 0.002 s
% 0.11/0.45 % Total time : 0.009 s
% 0.11/0.45 % Maximum resident set size: 3640 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.009 s
% 0.11/0.45 % System time : 0.006 s
% 0.11/0.45 % Total time : 0.015 s
% 0.11/0.45 % Maximum resident set size: 4608 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------