%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU682^2 : TPTP v9.3.1. Released v3.7.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 : Wed Sep 30 08:25:01 AM UTC 2026
% Result : Theorem 0.11s 0.24s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 97 ( 0 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 542 ( 46 ~; 60 |; 7 &; 395 @)
% ( 1 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 13 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 95 ( 0 ^; 95 !; 0 ?; 95 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_25,type,
kpair: $i > $i > $i ).
thf(decl_27,type,
breln: $i > $i > $i > $o ).
thf(decl_28,type,
brelnall1: $o ).
thf(decl_29,type,
esk1_4: $i > $i > $i > ( $i > $o ) > $i ).
thf(decl_30,type,
esk2_4: $i > $i > $i > ( $i > $o ) > $i ).
thf(decl_31,type,
esk3_0: $i ).
thf(decl_32,type,
esk4_0: $i ).
thf(decl_33,type,
esk5_0: $i ).
thf(decl_34,type,
epred1_0: $i > $o ).
thf(decl_35,type,
esk6_0: $i ).
thf(brelnall2,conjecture,
( brelnall1
=> ! [X1: $i,X2: $i,X4: $i] :
( ( breln @ X1 @ X2 @ X4 )
=> ! [X5: $i > $o] :
( ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X2 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
=> ( X5 @ ( kpair @ X6 @ X7 ) ) ) ) )
=> ! [X6: $i] :
( ( in @ X6 @ X4 )
=> ( X5 @ X6 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nmtFw94JSp/E---3.1_2173701.p',brelnall2) ).
thf(brelnall1,axiom,
( brelnall1
<=> ! [X1: $i,X2: $i,X4: $i] :
( ( breln @ X1 @ X2 @ X4 )
=> ! [X5: $i > $o] :
( ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X2 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
=> ( X5 @ ( kpair @ X6 @ X7 ) ) ) ) )
=> ! [X6: $i] :
( ( in @ X6 @ X4 )
=> ( X5 @ X6 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nmtFw94JSp/E---3.1_2173701.p',brelnall1) ).
thf(c_0_2,negated_conjecture,
~ ( brelnall1
=> ! [X1: $i,X2: $i,X4: $i] :
( ( breln @ X1 @ X2 @ X4 )
=> ! [X5: $i > $o] :
( ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X2 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
=> ( X5 @ ( kpair @ X6 @ X7 ) ) ) ) )
=> ! [X6: $i] :
( ( in @ X6 @ X4 )
=> ( X5 @ X6 ) ) ) ) ),
inference(assume_negation,[status(cth)],[brelnall2]) ).
thf(c_0_3,negated_conjecture,
~ ( ! [X22: $i,X23: $i,X24: $i] :
( ( breln @ X22 @ X23 @ X24 )
=> ! [X25: $i > $o] :
( ! [X26: $i] :
( ( in @ X26 @ X22 )
=> ! [X27: $i] :
( ( in @ X27 @ X23 )
=> ( ( in @ ( kpair @ X26 @ X27 ) @ X24 )
=> ( X25 @ ( kpair @ X26 @ X27 ) ) ) ) )
=> ! [X28: $i] :
( ( in @ X28 @ X24 )
=> ( X25 @ X28 ) ) ) )
=> ! [X1: $i,X2: $i,X4: $i] :
( ( breln @ X1 @ X2 @ X4 )
=> ! [X5: $i > $o] :
( ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X2 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
=> ( X5 @ ( kpair @ X6 @ X7 ) ) ) ) )
=> ! [X6: $i] :
( ( in @ X6 @ X4 )
=> ( X5 @ X6 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_2,brelnall1]) ).
thf(c_0_4,negated_conjecture,
! [X29: $i,X30: $i,X31: $i,X32: $i > $o,X35: $i,X40: $i,X41: $i] :
( ( ( in @ ( esk1_4 @ X29 @ X30 @ X31 @ X32 ) @ X29 )
| ~ ( in @ X35 @ X31 )
| ( X32 @ X35 )
| ~ ( breln @ X29 @ X30 @ X31 ) )
& ( ( in @ ( esk2_4 @ X29 @ X30 @ X31 @ X32 ) @ X30 )
| ~ ( in @ X35 @ X31 )
| ( X32 @ X35 )
| ~ ( breln @ X29 @ X30 @ X31 ) )
& ( ( in @ ( kpair @ ( esk1_4 @ X29 @ X30 @ X31 @ X32 ) @ ( esk2_4 @ X29 @ X30 @ X31 @ X32 ) ) @ X31 )
| ~ ( in @ X35 @ X31 )
| ( X32 @ X35 )
| ~ ( breln @ X29 @ X30 @ X31 ) )
& ( ~ ( X32 @ ( kpair @ ( esk1_4 @ X29 @ X30 @ X31 @ X32 ) @ ( esk2_4 @ X29 @ X30 @ X31 @ X32 ) ) )
| ~ ( in @ X35 @ X31 )
| ( X32 @ X35 )
| ~ ( breln @ X29 @ X30 @ X31 ) )
& ( breln @ esk3_0 @ esk4_0 @ esk5_0 )
& ( ~ ( in @ X40 @ esk3_0 )
| ~ ( in @ X41 @ esk4_0 )
| ~ ( in @ ( kpair @ X40 @ X41 ) @ esk5_0 )
| ( epred1_0 @ ( kpair @ X40 @ X41 ) ) )
& ( in @ esk6_0 @ esk5_0 )
& ~ ( epred1_0 @ esk6_0 ) ),
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_3])])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X2: $i,X5: $i > $o,X4: $i,X3: $i] :
( ( in @ ( kpair @ ( esk1_4 @ X1 @ X2 @ X3 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ X3 @ X5 ) ) @ X3 )
| ( X5 @ X4 )
| ~ ( in @ X4 @ X3 )
| ~ ( breln @ X1 @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
in @ esk6_0 @ esk5_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i,X5: $i > $o,X4: $i,X3: $i] :
( ( in @ ( esk2_4 @ X1 @ X2 @ X3 @ X5 ) @ X2 )
| ( X5 @ X4 )
| ~ ( in @ X4 @ X3 )
| ~ ( breln @ X1 @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X5: $i > $o,X2: $i] :
( ( in @ ( kpair @ ( esk1_4 @ X1 @ X2 @ esk5_0 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ esk5_0 @ X5 ) ) @ esk5_0 )
| ( X5 @ esk6_0 )
| ~ ( breln @ X1 @ X2 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X11: $i > $o,X5: $i > $o,X4: $i,X3: $i,X2: $i] :
( ( X5 @ ( kpair @ ( esk1_4 @ X1 @ X2 @ esk5_0 @ X11 ) @ ( esk2_4 @ X1 @ X2 @ esk5_0 @ X11 ) ) )
| ( in @ ( esk2_4 @ X3 @ X4 @ esk5_0 @ X5 ) @ X4 )
| ( X11 @ esk6_0 )
| ~ ( breln @ X3 @ X4 @ esk5_0 )
| ~ ( breln @ X1 @ X2 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
breln @ esk3_0 @ esk4_0 @ esk5_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i,X5: $i > $o,X4: $i,X3: $i] :
( ( X5 @ X4 )
| ~ ( X5 @ ( kpair @ ( esk1_4 @ X1 @ X2 @ X3 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ X3 @ X5 ) ) )
| ~ ( in @ X4 @ X3 )
| ~ ( breln @ X1 @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X11: $i > $o,X5: $i > $o,X2: $i] :
( ( X5 @ ( kpair @ ( esk1_4 @ X1 @ X2 @ esk5_0 @ X11 ) @ ( esk2_4 @ X1 @ X2 @ esk5_0 @ X11 ) ) )
| ( in @ ( esk2_4 @ esk3_0 @ esk4_0 @ esk5_0 @ X5 ) @ esk4_0 )
| ( X11 @ esk6_0 )
| ~ ( breln @ X1 @ X2 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i] :
( ( epred1_0 @ ( kpair @ X1 @ X2 ) )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( in @ X2 @ esk4_0 )
| ~ ( in @ ( kpair @ X1 @ X2 ) @ esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_14,negated_conjecture,
! [X5: $i > $o,X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk2_4 @ esk3_0 @ esk4_0 @ esk5_0 @ X5 ) @ esk4_0 )
| ( X5 @ esk6_0 )
| ( X5 @ X1 )
| ~ ( breln @ X2 @ X3 @ esk5_0 )
| ~ ( in @ X1 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X5: $i > $o,X2: $i] :
( ( epred1_0 @ ( kpair @ ( esk1_4 @ X1 @ X2 @ esk5_0 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ esk5_0 @ X5 ) ) )
| ( X5 @ esk6_0 )
| ~ ( in @ ( esk2_4 @ X1 @ X2 @ esk5_0 @ X5 ) @ esk4_0 )
| ~ ( in @ ( esk1_4 @ X1 @ X2 @ esk5_0 @ X5 ) @ esk3_0 )
| ~ ( breln @ X1 @ X2 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
thf(c_0_16,negated_conjecture,
~ ( epred1_0 @ esk6_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_17,negated_conjecture,
! [X5: $i > $o,X1: $i] :
( ( in @ ( esk2_4 @ esk3_0 @ esk4_0 @ esk5_0 @ X5 ) @ esk4_0 )
| ( X5 @ esk6_0 )
| ( X5 @ X1 )
| ~ ( in @ X1 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
thf(c_0_18,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( in @ ( esk2_4 @ X2 @ X3 @ esk5_0 @ epred1_0 ) @ esk4_0 )
| ~ ( in @ ( esk1_4 @ X2 @ X3 @ esk5_0 @ epred1_0 ) @ esk3_0 )
| ~ ( breln @ X2 @ X3 @ esk5_0 )
| ~ ( in @ X1 @ esk5_0 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_16]) ).
thf(c_0_19,negated_conjecture,
! [X5: $i > $o] :
( ( in @ ( esk2_4 @ esk3_0 @ esk4_0 @ esk5_0 @ X5 ) @ esk4_0 )
| ( X5 @ esk6_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_6]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i,X2: $i,X5: $i > $o,X4: $i,X3: $i] :
( ( in @ ( esk1_4 @ X1 @ X2 @ X3 @ X5 ) @ X1 )
| ( X5 @ X4 )
| ~ ( in @ X4 @ X3 )
| ~ ( breln @ X1 @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( in @ ( esk1_4 @ esk3_0 @ esk4_0 @ esk5_0 @ epred1_0 ) @ esk3_0 )
| ~ ( in @ X1 @ esk5_0 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_10])]),c_0_16]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i,X5: $i > $o,X2: $i] :
( ( in @ ( esk1_4 @ X1 @ X2 @ esk5_0 @ X5 ) @ X1 )
| ( X5 @ esk6_0 )
| ~ ( breln @ X1 @ X2 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_6]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( in @ X1 @ esk5_0 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_10])]),c_0_16]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_6]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU682^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.17 % Computer : n013.cluster.edu
% 0.11/0.17 % Model : x86_64 x86_64
% 0.11/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17 % Memory : 8046.5625MB
% 0.11/0.17 % OS : Linux 6.8.0-71-generic
% 0.11/0.17 % CPULimit : 300
% 0.11/0.17 % WCLimit : 300
% 0.11/0.17 % DateTime : Tue Sep 29 14:07:51 UTC 2026
% 0.11/0.17 % CPUTime :
% 0.11/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.20 Running higher-order theorem proving
% 0.11/0.22 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.nmtFw94JSp/E---3.1_2173701.p
% 0.11/0.24 % Version: 3.5.1-ho
% 0.11/0.24 % Preprocessing class: HSSSSMSSSLSNSSA.
% 0.11/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.24 % Starting sh5l with 300s (1) cores
% 0.11/0.24 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.24 % Starting new_bool_2 with 300s (1) cores
% 0.11/0.24 % new_bool_1 with pid 2173716 completed with status 0
% 0.11/0.24 % Result found by new_bool_1
% 0.11/0.24 % Preprocessing class: HSSSSMSSSLSNSSA.
% 0.11/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.24 % Starting sh5l with 300s (1) cores
% 0.11/0.24 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.24 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.24 % Search class: HGUNF-FFSF33-SSSFMMBN
% 0.11/0.24 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.24 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.24 % SubtermCWHack with pid 2173720 completed with status 0
% 0.11/0.24 % Result found by SubtermCWHack
% 0.11/0.24 % Preprocessing class: HSSSSMSSSLSNSSA.
% 0.11/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.24 % Starting sh5l with 300s (1) cores
% 0.11/0.24 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.24 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.24 % Search class: HGUNF-FFSF33-SSSFMMBN
% 0.11/0.24 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.24 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.24 % Preprocessing time : 0.001 s
% 0.11/0.24
% 0.11/0.24 % Proof found!
% 0.11/0.24 % SZS status Theorem
% 0.11/0.24 % SZS output start CNFRefutation
% See solution above
% 0.11/0.24 % Parsed axioms : 9
% 0.11/0.24 % Removed by relevancy pruning/SinE : 7
% 0.11/0.24 % Initial clauses : 8
% 0.11/0.24 % Removed in clause preprocessing : 0
% 0.11/0.24 % Initial clauses in saturation : 8
% 0.11/0.24 % Processed clauses : 48
% 0.11/0.24 % ...of these trivial : 0
% 0.11/0.24 % ...subsumed : 6
% 0.11/0.24 % ...remaining for further processing : 42
% 0.11/0.24 % Other redundant clauses eliminated : 0
% 0.11/0.24 % Clauses deleted for lack of memory : 0
% 0.11/0.24 % Backward-subsumed : 8
% 0.11/0.24 % Backward-rewritten : 0
% 0.11/0.24 % Generated clauses : 75
% 0.11/0.24 % ...of the previous two non-redundant : 69
% 0.11/0.24 % ...aggressively subsumed : 0
% 0.11/0.24 % Contextual simplify-reflections : 0
% 0.11/0.24 % Paramodulations : 75
% 0.11/0.24 % Factorizations : 0
% 0.11/0.24 % NegExts : 0
% 0.11/0.24 % Equation resolutions : 0
% 0.11/0.24 % Disequality decompositions : 0
% 0.11/0.24 % Total rewrite steps : 3
% 0.11/0.24 % ...of those cached : 2
% 0.11/0.24 % Propositional unsat checks : 0
% 0.11/0.24 % Propositional check models : 0
% 0.11/0.24 % Propositional check unsatisfiable : 0
% 0.11/0.24 % Propositional clauses : 0
% 0.11/0.24 % Propositional clauses after purity: 0
% 0.11/0.24 % Propositional unsat core size : 0
% 0.11/0.24 % Propositional preprocessing time : 0.000
% 0.11/0.24 % Propositional encoding time : 0.000
% 0.11/0.24 % Propositional solver time : 0.000
% 0.11/0.24 % Success case prop preproc time : 0.000
% 0.11/0.24 % Success case prop encoding time : 0.000
% 0.11/0.24 % Success case prop solver time : 0.000
% 0.11/0.24 % Current number of processed clauses : 34
% 0.11/0.24 % Positive orientable unit clauses : 2
% 0.11/0.24 % Positive unorientable unit clauses: 0
% 0.11/0.24 % Negative unit clauses : 1
% 0.11/0.24 % Non-unit-clauses : 31
% 0.11/0.24 % Current number of unprocessed clauses: 23
% 0.11/0.24 % ...number of literals in the above : 113
% 0.11/0.24 % Current number of archived formulas : 0
% 0.11/0.24 % Current number of archived clauses : 8
% 0.11/0.24 % Clause-clause subsumption calls (NU) : 223
% 0.11/0.24 % Rec. Clause-clause subsumption calls : 62
% 0.11/0.24 % Non-unit clause-clause subsumptions : 14
% 0.11/0.24 % Unit Clause-clause subsumption calls : 0
% 0.11/0.24 % Rewrite failures with RHS unbound : 0
% 0.11/0.24 % BW rewrite match attempts : 0
% 0.11/0.24 % BW rewrite match successes : 0
% 0.11/0.24 % Condensation attempts : 0
% 0.11/0.24 % Condensation successes : 0
% 0.11/0.24 % Termbank termtop insertions : 3831
% 0.11/0.24 % Search garbage collected termcells : 422
% 0.11/0.24
% 0.11/0.24 % -------------------------------------------------
% 0.11/0.24 % User time : 0.007 s
% 0.11/0.24 % System time : 0.001 s
% 0.11/0.24 % Total time : 0.008 s
% 0.11/0.24 % Maximum resident set size: 3636 pages
% 0.11/0.24
% 0.11/0.24 % -------------------------------------------------
% 0.11/0.24 % User time : 0.008 s
% 0.11/0.24 % System time : 0.006 s
% 0.11/0.24 % Total time : 0.014 s
% 0.11/0.24 % Maximum resident set size: 4864 pages
% 0.11/0.24 % E exiting
%------------------------------------------------------------------------------