%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : AGT029^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 : Wed Sep 30 07:44:31 AM UTC 2026
% Result : Theorem 0.07s 0.26s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 43 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 105 ( 18 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 232 ( 36 ~; 29 |; 2 &; 165 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 44 ( 44 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 3 con; 0-3 aty)
% Number of variables : 93 ( 44 ^; 49 !; 0 ?; 93 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_25,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_33,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_34,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_38,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_55,type,
r2: $i > $i > $o ).
thf(decl_57,type,
r4: $i > $i > $o ).
thf(decl_59,type,
john: mu ).
thf(decl_63,type,
good_in_maths: mu > $i > $o ).
thf(decl_64,type,
maths_teacher: mu > $i > $o ).
thf(decl_100,type,
esk32_2: $i > ( $i > $o ) > $i ).
thf(decl_135,type,
esk67_0: $i ).
thf(decl_136,type,
esk68_1: mu > $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p',mor) ).
thf(mexists_ind,axiom,
( mexists_ind
= ( ^ [X11: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X11 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p',mexists_ind) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X8: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X8 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p',mforall_ind) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p',mforall_prop) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p',mvalid) ).
thf(conj,conjecture,
( mvalid
@ ( mexists_ind
@ ^ [X1: mu] : ( mbox @ r2 @ ( good_in_maths @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p',conj) ).
thf(axiom_I_for_r4_r2,axiom,
( mvalid
@ ( mforall_prop
@ ^ [X6: $i > $o] : ( mimplies @ ( mbox @ r4 @ X6 ) @ ( mbox @ r2 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p',axiom_I_for_r4_r2) ).
thf(axiom_r1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( maths_teacher @ X1 ) @ ( mbox @ r4 @ ( good_in_maths @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p',axiom_r1) ).
thf(axiom_a6,axiom,
mvalid @ ( maths_teacher @ john ),
file('/export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p',axiom_a6) ).
thf(c_0_12,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_13,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_14,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_15,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
thf(c_0_16,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_17,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_18,plain,
( mforall_prop
= ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_prop]) ).
thf(c_0_19,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_20,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_21,negated_conjecture,
~ ( mvalid
@ ( mexists_ind
@ ^ [X1: mu] : ( mbox @ r2 @ ( good_in_maths @ X1 ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_22,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_15,c_0_13]),c_0_16]) ).
thf(c_0_23,plain,
! [X143: $i,X142: $i > $o] :
( ~ ! [X140: $i] :
( ~ ( r4 @ X143 @ X140 )
| ( X142 @ X140 ) )
| ! [X141: $i] :
( ~ ( r2 @ X143 @ X141 )
| ( X142 @ X141 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_I_for_r4_r2]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).
thf(c_0_24,negated_conjecture,
~ ! [X312: $i] :
~ ! [X311: mu] :
~ ! [X310: $i] :
( ~ ( r2 @ X312 @ X310 )
| ( good_in_maths @ X311 @ X310 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_21]),c_0_22]),c_0_19]),c_0_20])]) ).
thf(c_0_25,plain,
! [X432: $i,X433: $i > $o,X435: $i] :
( ( ( r4 @ X432 @ ( esk32_2 @ X432 @ X433 ) )
| ~ ( r2 @ X432 @ X435 )
| ( X433 @ X435 ) )
& ( ~ ( X433 @ ( esk32_2 @ X432 @ X433 ) )
| ~ ( r2 @ X432 @ X435 )
| ( X433 @ X435 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])])])]) ).
thf(c_0_26,negated_conjecture,
! [X603: mu] :
( ( r2 @ esk67_0 @ ( esk68_1 @ X603 ) )
& ~ ( good_in_maths @ X603 @ ( esk68_1 @ X603 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
thf(c_0_27,plain,
! [X23: $i,X22: mu] :
( ~ ( maths_teacher @ X22 @ X23 )
| ! [X21: $i] :
( ~ ( r4 @ X23 @ X21 )
| ( good_in_maths @ X22 @ X21 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_r1]),c_0_17]),c_0_16]),c_0_19]),c_0_20])]) ).
thf(c_0_28,plain,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( r4 @ X3 @ ( esk32_2 @ X3 @ X4 ) )
| ( X4 @ X14 )
| ~ ( r2 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_29,negated_conjecture,
! [X1: mu] : ( r2 @ esk67_0 @ ( esk68_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_30,plain,
! [X313: $i,X314: mu,X315: $i] :
( ~ ( maths_teacher @ X314 @ X313 )
| ~ ( r4 @ X313 @ X315 )
| ( good_in_maths @ X314 @ X315 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_27])])]) ).
thf(c_0_31,negated_conjecture,
! [X1: mu] :
~ ( good_in_maths @ X1 @ ( esk68_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_32,negated_conjecture,
! [X4: $i > $o,X1: mu] :
( ( r4 @ esk67_0 @ ( esk32_2 @ esk67_0 @ X4 ) )
| ( X4 @ ( esk68_1 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_33,plain,
! [X3: $i,X1: mu,X14: $i] :
( ( good_in_maths @ X1 @ X14 )
| ~ ( maths_teacher @ X1 @ X3 )
| ~ ( r4 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_34,negated_conjecture,
! [X1: mu] : ( r4 @ esk67_0 @ ( esk32_2 @ esk67_0 @ ( good_in_maths @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_35,plain,
! [X93: $i] : ( maths_teacher @ john @ X93 ),
inference(apply_def,[status(thm)],[axiom_a6,c_0_20]) ).
thf(c_0_36,plain,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( X4 @ X14 )
| ~ ( X4 @ ( esk32_2 @ X3 @ X4 ) )
| ~ ( r2 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_37,negated_conjecture,
! [X2: mu,X1: mu] :
( ( good_in_maths @ X1 @ ( esk32_2 @ esk67_0 @ ( good_in_maths @ X2 ) ) )
| ~ ( maths_teacher @ X1 @ esk67_0 ) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
thf(c_0_38,plain,
! [X385: $i] : ( maths_teacher @ john @ X385 ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
thf(c_0_39,negated_conjecture,
! [X3: $i,X1: mu] :
( ( good_in_maths @ X1 @ X3 )
| ~ ( r2 @ esk67_0 @ X3 )
| ~ ( maths_teacher @ X1 @ esk67_0 ) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
thf(c_0_40,plain,
! [X3: $i] : ( maths_teacher @ john @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
thf(c_0_41,negated_conjecture,
! [X3: $i] :
( ( good_in_maths @ john @ X3 )
| ~ ( r2 @ esk67_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
thf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_41]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : AGT029^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.16 % Computer : n011.cluster.edu
% 0.07/0.16 % Model : x86_64 x86_64
% 0.07/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.16 % Memory : 8046.5625MB
% 0.07/0.16 % OS : Linux 6.8.0-71-generic
% 0.07/0.16 % CPULimit : 300
% 0.07/0.16 % WCLimit : 300
% 0.07/0.16 % DateTime : Tue Sep 29 17:29:39 UTC 2026
% 0.07/0.16 % CPUTime :
% 0.07/0.16 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.20 Running higher-order theorem proving
% 0.07/0.22 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.hUeP8lWRVE/E---3.1_402741.p
% 0.07/0.26 % Version: 3.5.1-ho
% 0.07/0.26 % Preprocessing class: HSLSSMSSMLLNHSN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting almost_fo_3 with 1500s (5) cores
% 0.07/0.26 % Starting sh10 with 300s (1) cores
% 0.07/0.26 % Starting new_ho_16 with 300s (1) cores
% 0.07/0.26 % Starting post_as_ho11 with 300s (1) cores
% 0.07/0.26 % almost_fo_3 with pid 402774 completed with status 0
% 0.07/0.26 % Result found by almost_fo_3
% 0.07/0.26 % Preprocessing class: HSLSSMSSMLLNHSN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting almost_fo_3 with 1500s (5) cores
% 0.07/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26 % No SInE strategy applied
% 0.07/0.26 % Search class: HGUNS-FSLF32-SHSSMMBN
% 0.07/0.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.26 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.26 % Starting almost_fo_3 with 151s (1) cores
% 0.07/0.26 % Starting ehoh_best8_lambda with 136s (1) cores
% 0.07/0.26 % Starting ho_unfolding_6 with 136s (1) cores
% 0.07/0.26 % Starting sh4l with 136s (1) cores
% 0.07/0.26 % SubtermCWHack with pid 402782 completed with status 0
% 0.07/0.26 % Result found by SubtermCWHack
% 0.07/0.26 % Preprocessing class: HSLSSMSSMLLNHSN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting almost_fo_3 with 1500s (5) cores
% 0.07/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26 % No SInE strategy applied
% 0.07/0.26 % Search class: HGUNS-FSLF32-SHSSMMBN
% 0.07/0.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.26 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.26 % Preprocessing time : 0.004 s
% 0.07/0.26
% 0.07/0.26 % Proof found!
% 0.07/0.26 % SZS status Theorem
% 0.07/0.26 % SZS output start CNFRefutation
% See solution above
% 0.07/0.26 % Parsed axioms : 145
% 0.07/0.26 % Removed by relevancy pruning/SinE : 0
% 0.07/0.26 % Initial clauses : 186
% 0.07/0.26 % Removed in clause preprocessing : 47
% 0.07/0.26 % Initial clauses in saturation : 139
% 0.07/0.26 % Processed clauses : 70
% 0.07/0.26 % ...of these trivial : 0
% 0.07/0.26 % ...subsumed : 0
% 0.07/0.26 % ...remaining for further processing : 70
% 0.07/0.26 % Other redundant clauses eliminated : 0
% 0.07/0.26 % Clauses deleted for lack of memory : 0
% 0.07/0.26 % Backward-subsumed : 0
% 0.07/0.26 % Backward-rewritten : 0
% 0.07/0.26 % Generated clauses : 200
% 0.07/0.26 % ...of the previous two non-redundant : 177
% 0.07/0.26 % ...aggressively subsumed : 0
% 0.07/0.26 % Contextual simplify-reflections : 0
% 0.07/0.26 % Paramodulations : 200
% 0.07/0.26 % Factorizations : 0
% 0.07/0.26 % NegExts : 0
% 0.07/0.26 % Equation resolutions : 0
% 0.07/0.26 % Disequality decompositions : 0
% 0.07/0.26 % Total rewrite steps : 23
% 0.07/0.26 % ...of those cached : 10
% 0.07/0.26 % Propositional unsat checks : 0
% 0.07/0.26 % Propositional check models : 0
% 0.07/0.26 % Propositional check unsatisfiable : 0
% 0.07/0.26 % Propositional clauses : 0
% 0.07/0.26 % Propositional clauses after purity: 0
% 0.07/0.26 % Propositional unsat core size : 0
% 0.07/0.26 % Propositional preprocessing time : 0.000
% 0.07/0.26 % Propositional encoding time : 0.000
% 0.07/0.26 % Propositional solver time : 0.000
% 0.07/0.26 % Success case prop preproc time : 0.000
% 0.07/0.26 % Success case prop encoding time : 0.000
% 0.07/0.26 % Success case prop solver time : 0.000
% 0.07/0.26 % Current number of processed clauses : 70
% 0.07/0.26 % Positive orientable unit clauses : 24
% 0.07/0.26 % Positive unorientable unit clauses: 0
% 0.07/0.26 % Negative unit clauses : 1
% 0.07/0.26 % Non-unit-clauses : 45
% 0.07/0.26 % Current number of unprocessed clauses: 226
% 0.07/0.26 % ...number of literals in the above : 699
% 0.07/0.26 % Current number of archived formulas : 0
% 0.07/0.26 % Current number of archived clauses : 0
% 0.07/0.26 % Clause-clause subsumption calls (NU) : 255
% 0.07/0.26 % Rec. Clause-clause subsumption calls : 223
% 0.07/0.26 % Non-unit clause-clause subsumptions : 0
% 0.07/0.26 % Unit Clause-clause subsumption calls : 177
% 0.07/0.26 % Rewrite failures with RHS unbound : 0
% 0.07/0.26 % BW rewrite match attempts : 0
% 0.07/0.26 % BW rewrite match successes : 0
% 0.07/0.26 % Condensation attempts : 0
% 0.07/0.26 % Condensation successes : 0
% 0.07/0.26 % Termbank termtop insertions : 30453
% 0.07/0.26 % Search garbage collected termcells : 13644
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.019 s
% 0.07/0.26 % System time : 0.009 s
% 0.07/0.26 % Total time : 0.028 s
% 0.07/0.26 % Maximum resident set size: 6024 pages
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.069 s
% 0.07/0.26 % System time : 0.028 s
% 0.07/0.26 % Total time : 0.098 s
% 0.07/0.26 % Maximum resident set size: 4864 pages
% 0.07/0.26 % E exiting
%------------------------------------------------------------------------------