%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT060+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 : n016.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.22s 0.63s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 21 unt; 0 def)
% Number of atoms : 162 ( 41 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 165 ( 52 ~; 52 |; 37 &)
% ( 1 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(assumption_3,conjecture,
! [X1,X5,X4] :
( ( ~ has_immunity(X1,X4)
& has_immunity(X1,X5)
& organization(X1) )
=> greater(hazard_of_mortality(X1,X4),hazard_of_mortality(X1,X5)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_3) ).
fof(assumption_17,axiom,
! [X1,X4] :
( organization(X1)
=> ( ( ~ has_immunity(X1,X4)
=> ( ( ( ~ positional_advantage(X1,X4)
& ~ is_aligned(X1,X4) )
=> hazard_of_mortality(X1,X4) = high )
& ( ( ~ positional_advantage(X1,X4)
& is_aligned(X1,X4) )
=> hazard_of_mortality(X1,X4) = mod2 )
& ( ( positional_advantage(X1,X4)
& ~ is_aligned(X1,X4) )
=> hazard_of_mortality(X1,X4) = mod1 )
& ( ( positional_advantage(X1,X4)
& is_aligned(X1,X4) )
=> hazard_of_mortality(X1,X4) = low ) ) )
& ( has_immunity(X1,X4)
=> hazard_of_mortality(X1,X4) = very_low ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_17) ).
fof(meaning_postulate_greater_transitive,axiom,
! [X1,X2,X3] :
( ( greater(X2,X3)
& greater(X1,X2) )
=> greater(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',meaning_postulate_greater_transitive) ).
fof(assumption_18e,axiom,
greater(mod2,low),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_18e) ).
fof(assumption_18c,axiom,
greater(low,very_low),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_18c) ).
fof(assumption_18d,axiom,
greater(high,mod2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_18d) ).
fof(assumption_18b,axiom,
greater(mod1,low),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_18b) ).
fof(c_0_7,plain,
! [X1,X4] :
( epred1_2(X4,X1)
<=> ( ( ( ~ positional_advantage(X1,X4)
& ~ is_aligned(X1,X4) )
=> hazard_of_mortality(X1,X4) = high )
& ( ( ~ positional_advantage(X1,X4)
& is_aligned(X1,X4) )
=> hazard_of_mortality(X1,X4) = mod2 )
& ( ( positional_advantage(X1,X4)
& ~ is_aligned(X1,X4) )
=> hazard_of_mortality(X1,X4) = mod1 )
& ( ( positional_advantage(X1,X4)
& is_aligned(X1,X4) )
=> hazard_of_mortality(X1,X4) = low ) ) ),
introduced(definition) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X5,X4] :
( ( ~ has_immunity(X1,X4)
& has_immunity(X1,X5)
& organization(X1) )
=> greater(hazard_of_mortality(X1,X4),hazard_of_mortality(X1,X5)) ),
inference(assume_negation,[status(cth)],[assumption_3]) ).
fof(c_0_9,plain,
! [X1,X4] :
( organization(X1)
=> ( ( ~ has_immunity(X1,X4)
=> epred1_2(X4,X1) )
& ( has_immunity(X1,X4)
=> hazard_of_mortality(X1,X4) = very_low ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[assumption_17]),c_0_7]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X5,X4] :
( ( ~ has_immunity(X1,X4)
& has_immunity(X1,X5)
& organization(X1) )
=> greater(hazard_of_mortality(X1,X4),hazard_of_mortality(X1,X5)) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X19,X20] :
( ( ~ organization(X19)
| epred1_2(X20,X19)
| has_immunity(X19,X20) )
& ( ~ organization(X19)
| hazard_of_mortality(X19,X20) = very_low
| ~ has_immunity(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_12,negated_conjecture,
( ~ greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0))
& ~ has_immunity(esk1_0,esk3_0)
& has_immunity(esk1_0,esk2_0)
& organization(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_13,plain,
! [X1,X4] :
( epred1_2(X4,X1)
=> ( ( ( ~ positional_advantage(X1,X4)
& ~ is_aligned(X1,X4) )
=> hazard_of_mortality(X1,X4) = high )
& ( ( ~ positional_advantage(X1,X4)
& is_aligned(X1,X4) )
=> hazard_of_mortality(X1,X4) = mod2 )
& ( ( positional_advantage(X1,X4)
& ~ is_aligned(X1,X4) )
=> hazard_of_mortality(X1,X4) = mod1 )
& ( ( positional_advantage(X1,X4)
& is_aligned(X1,X4) )
=> hazard_of_mortality(X1,X4) = low ) ) ),
inference(split_equiv,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( ~ organization(X1)
| epred1_2(X2,X1)
| has_immunity(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X24,X25] :
( ( ~ epred1_2(X25,X24)
| hazard_of_mortality(X24,X25) = high
| positional_advantage(X24,X25)
| is_aligned(X24,X25) )
& ( ~ epred1_2(X25,X24)
| hazard_of_mortality(X24,X25) = mod2
| positional_advantage(X24,X25)
| ~ is_aligned(X24,X25) )
& ( ~ epred1_2(X25,X24)
| hazard_of_mortality(X24,X25) = mod1
| ~ positional_advantage(X24,X25)
| is_aligned(X24,X25) )
& ( ~ epred1_2(X25,X24)
| hazard_of_mortality(X24,X25) = low
| ~ positional_advantage(X24,X25)
| ~ is_aligned(X24,X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_17,negated_conjecture,
~ has_immunity(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( has_immunity(esk1_0,X1)
| epred1_2(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ epred1_2(X2,X1)
| hazard_of_mortality(X1,X2) = high
| positional_advantage(X1,X2)
| is_aligned(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
epred1_2(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_21,plain,
! [X14,X15,X16] :
( greater(X14,X16)
| ~ greater(X15,X16)
| ~ greater(X14,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[meaning_postulate_greater_transitive])])]) ).
cnf(c_0_22,plain,
( ~ epred1_2(X2,X1)
| ~ positional_advantage(X1,X2)
| hazard_of_mortality(X1,X2) = mod1
| is_aligned(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( is_aligned(esk1_0,esk3_0)
| positional_advantage(esk1_0,esk3_0)
| hazard_of_mortality(esk1_0,esk3_0) = high ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
greater(mod2,low),
inference(split_conjunct,[status(thm)],[assumption_18e]) ).
cnf(c_0_26,plain,
( ~ organization(X1)
| ~ has_immunity(X1,X2)
| hazard_of_mortality(X1,X2) = very_low ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,negated_conjecture,
has_immunity(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_28,plain,
( ~ epred1_2(X2,X1)
| ~ is_aligned(X1,X2)
| hazard_of_mortality(X1,X2) = mod2
| positional_advantage(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,plain,
( is_aligned(esk1_0,esk3_0)
| hazard_of_mortality(esk1_0,esk3_0) = mod1
| hazard_of_mortality(esk1_0,esk3_0) = high ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20])]) ).
cnf(c_0_30,plain,
greater(low,very_low),
inference(split_conjunct,[status(thm)],[assumption_18c]) ).
cnf(c_0_31,plain,
( ~ greater(X1,mod2)
| greater(X1,low) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
greater(high,mod2),
inference(split_conjunct,[status(thm)],[assumption_18d]) ).
cnf(c_0_33,negated_conjecture,
~ greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,negated_conjecture,
hazard_of_mortality(esk1_0,esk2_0) = very_low,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_15])]) ).
cnf(c_0_35,plain,
( ~ epred1_2(X2,X1)
| ~ positional_advantage(X1,X2)
| ~ is_aligned(X1,X2)
| hazard_of_mortality(X1,X2) = low ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_36,plain,
( positional_advantage(esk1_0,esk3_0)
| hazard_of_mortality(esk1_0,esk3_0) = mod2
| hazard_of_mortality(esk1_0,esk3_0) = high
| hazard_of_mortality(esk1_0,esk3_0) = mod1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20])]) ).
cnf(c_0_37,plain,
( ~ greater(X1,low)
| greater(X1,very_low) ),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_38,plain,
greater(high,low),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
~ greater(hazard_of_mortality(esk1_0,esk3_0),very_low),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
( hazard_of_mortality(esk1_0,esk3_0) = low
| hazard_of_mortality(esk1_0,esk3_0) = mod1
| hazard_of_mortality(esk1_0,esk3_0) = high
| hazard_of_mortality(esk1_0,esk3_0) = mod2 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20])]),c_0_29]) ).
cnf(c_0_41,plain,
greater(high,very_low),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( hazard_of_mortality(esk1_0,esk3_0) = mod2
| hazard_of_mortality(esk1_0,esk3_0) = mod1
| hazard_of_mortality(esk1_0,esk3_0) = low ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_43,plain,
greater(mod2,very_low),
inference(spm,[status(thm)],[c_0_37,c_0_25]) ).
cnf(c_0_44,plain,
greater(mod1,low),
inference(split_conjunct,[status(thm)],[assumption_18b]) ).
cnf(c_0_45,negated_conjecture,
( hazard_of_mortality(esk1_0,esk3_0) = low
| hazard_of_mortality(esk1_0,esk3_0) = mod1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_42]),c_0_43])]) ).
cnf(c_0_46,plain,
greater(mod1,very_low),
inference(spm,[status(thm)],[c_0_37,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
hazard_of_mortality(esk1_0,esk3_0) = low,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_45]),c_0_46])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_47]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT060+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.46 % Computer : n016.cluster.edu
% 0.15/0.46 % Model : x86_64 x86_64
% 0.15/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.46 % Memory : 8046.5625MB
% 0.15/0.46 % OS : Linux 6.8.0-71-generic
% 0.15/0.46 % CPULimit : 300
% 0.15/0.47 % WCLimit : 300
% 0.15/0.47 % DateTime : Mon Sep 21 01:29:07 UTC 2026
% 0.15/0.47 % CPUTime :
% 0.15/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.56 Running first-order theorem proving
% 0.22/0.56 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.22/0.63 % Version: 3.5.1
% 0.22/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.63 % Starting sh5l with 300s (1) cores
% 0.22/0.63 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1277443 completed with status 0
% 0.22/0.63 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.63 % No SInE strategy applied
% 0.22/0.63 % Search class: FGHSF-FFSM22-SFFFFFNN
% 0.22/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.22/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.22/0.63 % Starting new_bool_1 with 136s (1) cores
% 0.22/0.63 % new_bool_1 with pid 1277453 completed with status 0
% 0.22/0.63 % Result found by new_bool_1
% 0.22/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.63 % No SInE strategy applied
% 0.22/0.63 % Search class: FGHSF-FFSM22-SFFFFFNN
% 0.22/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.22/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.22/0.63 % Starting new_bool_1 with 136s (1) cores
% 0.22/0.63 % Preprocessing time : 0.001 s
% 0.22/0.63 % Presaturation interreduction done
% 0.22/0.63
% 0.22/0.63 % Proof found!
% 0.22/0.63 % SZS status Theorem
% 0.22/0.63 % SZS output start CNFRefutation
% See solution above
% 0.22/0.63 % Parsed axioms : 13
% 0.22/0.63 % Removed by relevancy pruning/SinE : 0
% 0.22/0.63 % Initial clauses : 26
% 0.22/0.63 % Removed in clause preprocessing : 0
% 0.22/0.63 % Initial clauses in saturation : 26
% 0.22/0.63 % Processed clauses : 210
% 0.22/0.63 % ...of these trivial : 0
% 0.22/0.63 % ...subsumed : 52
% 0.22/0.63 % ...remaining for further processing : 158
% 0.22/0.63 % Other redundant clauses eliminated : 2
% 0.22/0.63 % Clauses deleted for lack of memory : 0
% 0.22/0.63 % Backward-subsumed : 4
% 0.22/0.63 % Backward-rewritten : 42
% 0.22/0.63 % Generated clauses : 360
% 0.22/0.63 % ...of the previous two non-redundant : 322
% 0.22/0.63 % ...aggressively subsumed : 0
% 0.22/0.63 % Contextual simplify-reflections : 1
% 0.22/0.63 % Paramodulations : 350
% 0.22/0.63 % Factorizations : 8
% 0.22/0.63 % NegExts : 0
% 0.22/0.63 % Equation resolutions : 2
% 0.22/0.63 % Disequality decompositions : 0
% 0.22/0.63 % Total rewrite steps : 166
% 0.22/0.63 % ...of those cached : 126
% 0.22/0.63 % Propositional unsat checks : 0
% 0.22/0.63 % Propositional check models : 0
% 0.22/0.63 % Propositional check unsatisfiable : 0
% 0.22/0.63 % Propositional clauses : 0
% 0.22/0.63 % Propositional clauses after purity: 0
% 0.22/0.63 % Propositional unsat core size : 0
% 0.22/0.63 % Propositional preprocessing time : 0.000
% 0.22/0.63 % Propositional encoding time : 0.000
% 0.22/0.63 % Propositional solver time : 0.000
% 0.22/0.63 % Success case prop preproc time : 0.000
% 0.22/0.63 % Success case prop encoding time : 0.000
% 0.22/0.63 % Success case prop solver time : 0.000
% 0.22/0.63 % Current number of processed clauses : 84
% 0.22/0.63 % Positive orientable unit clauses : 43
% 0.22/0.63 % Positive unorientable unit clauses: 0
% 0.22/0.63 % Negative unit clauses : 10
% 0.22/0.63 % Non-unit-clauses : 31
% 0.22/0.63 % Current number of unprocessed clauses: 142
% 0.22/0.63 % ...number of literals in the above : 579
% 0.22/0.63 % Current number of archived formulas : 0
% 0.22/0.63 % Current number of archived clauses : 72
% 0.22/0.63 % Clause-clause subsumption calls (NU) : 1274
% 0.22/0.63 % Rec. Clause-clause subsumption calls : 564
% 0.22/0.63 % Non-unit clause-clause subsumptions : 56
% 0.22/0.63 % Unit Clause-clause subsumption calls : 174
% 0.22/0.63 % Rewrite failures with RHS unbound : 0
% 0.22/0.63 % BW rewrite match attempts : 2
% 0.22/0.63 % BW rewrite match successes : 2
% 0.22/0.63 % Condensation attempts : 0
% 0.22/0.63 % Condensation successes : 0
% 0.22/0.63 % Termbank termtop insertions : 5020
% 0.22/0.63 % Search garbage collected termcells : 262
% 0.22/0.63
% 0.22/0.63 % -------------------------------------------------
% 0.22/0.63 % User time : 0.015 s
% 0.22/0.63 % System time : 0.005 s
% 0.22/0.63 % Total time : 0.021 s
% 0.22/0.63 % Maximum resident set size: 3644 pages
% 0.22/0.63
% 0.22/0.63 % -------------------------------------------------
% 0.22/0.63 % User time : 0.056 s
% 0.22/0.63 % System time : 0.019 s
% 0.22/0.63 % Total time : 0.075 s
% 0.22/0.63 % Maximum resident set size: 4608 pages
% 0.22/0.63 % E exiting
%------------------------------------------------------------------------------