%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU807^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 : n006.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:27:52 AM UTC 2026
% Result : Theorem 0.10s 0.24s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 124 ( 32 equ; 0 cnn)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 419 ( 48 ~; 43 |; 12 &; 281 @)
% ( 7 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 105 ( 0 ^; 99 !; 6 ?; 105 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
emptyset: $i ).
thf(decl_25,type,
setadjoin: $i > $i > $i ).
thf(decl_26,type,
foundationAx: $o ).
thf(decl_27,type,
setadjoinIL: $o ).
thf(decl_28,type,
setadjoinIR: $o ).
thf(decl_29,type,
in__Cong: $o ).
thf(decl_30,type,
upairset2E: $o ).
thf(decl_31,type,
esk1_1: $i > $i ).
thf(decl_32,type,
esk2_0: $i ).
thf(decl_33,type,
esk3_0: $i ).
thf(notinself2,conjecture,
( foundationAx
=> ( setadjoinIL
=> ( setadjoinIR
=> ( in__Cong
=> ( upairset2E
=> ! [X1: $i,X3: $i] :
( ( in @ X1 @ X3 )
=> ~ ( in @ X3 @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Sr8ztF10ai/E---3.1_808294.p',notinself2) ).
thf(foundationAx,axiom,
( foundationAx
<=> ! [X1: $i] :
( ? [X2: $i] : ( in @ X2 @ X1 )
=> ? [X3: $i] :
( ( in @ X3 @ X1 )
& ~ ? [X2: $i] :
( ( in @ X2 @ X3 )
& ( in @ X2 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Sr8ztF10ai/E---3.1_808294.p',foundationAx) ).
thf(setadjoinIL,axiom,
( setadjoinIL
<=> ! [X2: $i,X4: $i] : ( in @ X2 @ ( setadjoin @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Sr8ztF10ai/E---3.1_808294.p',setadjoinIL) ).
thf(setadjoinIR,axiom,
( setadjoinIR
<=> ! [X2: $i,X1: $i,X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ X4 @ ( setadjoin @ X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Sr8ztF10ai/E---3.1_808294.p',setadjoinIR) ).
thf(in__Cong,axiom,
( in__Cong
<=> ! [X1: $i,X3: $i] :
( ( X1 = X3 )
=> ! [X2: $i,X4: $i] :
( ( X2 = X4 )
=> ( ( in @ X2 @ X1 )
<=> ( in @ X4 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Sr8ztF10ai/E---3.1_808294.p',in__Cong) ).
thf(upairset2E,axiom,
( upairset2E
<=> ! [X2: $i,X4: $i,X5: $i] :
( ( in @ X5 @ ( setadjoin @ X2 @ ( setadjoin @ X4 @ emptyset ) ) )
=> ( ( X5 = X2 )
| ( X5 = X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Sr8ztF10ai/E---3.1_808294.p',upairset2E) ).
thf(c_0_6,negated_conjecture,
~ ( foundationAx
=> ( setadjoinIL
=> ( setadjoinIR
=> ( in__Cong
=> ( upairset2E
=> ! [X1: $i,X3: $i] :
( ( in @ X1 @ X3 )
=> ~ ( in @ X3 @ X1 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[notinself2]) ).
thf(c_0_7,negated_conjecture,
~ ( ! [X24: $i] :
( ? [X25: $i] : ( in @ X25 @ X24 )
=> ? [X26: $i] :
( ( in @ X26 @ X24 )
& ~ ? [X27: $i] :
( ( in @ X27 @ X26 )
& ( in @ X27 @ X24 ) ) ) )
=> ( ! [X28: $i,X29: $i] : ( in @ X28 @ ( setadjoin @ X28 @ X29 ) )
=> ( ! [X30: $i,X31: $i,X32: $i] :
( ( in @ X32 @ X31 )
=> ( in @ X32 @ ( setadjoin @ X30 @ X31 ) ) )
=> ( ! [X33: $i,X34: $i] :
( ( X33 = X34 )
=> ! [X35: $i,X36: $i] :
( ( X35 = X36 )
=> ( ( in @ X35 @ X33 )
<=> ( in @ X36 @ X34 ) ) ) )
=> ( ! [X37: $i,X38: $i,X39: $i] :
( ( in @ X39 @ ( setadjoin @ X37 @ ( setadjoin @ X38 @ emptyset ) ) )
=> ( ( X39 = X37 )
| ( X39 = X38 ) ) )
=> ! [X1: $i,X3: $i] :
( ( in @ X1 @ X3 )
=> ~ ( in @ X3 @ X1 ) ) ) ) ) ) ),
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(apply_def,[status(thm)],[c_0_6,foundationAx]),setadjoinIL]),setadjoinIR]),in__Cong]),upairset2E])]) ).
thf(c_0_8,negated_conjecture,
! [X40: $i,X41: $i,X43: $i,X44: $i,X45: $i,X46: $i,X47: $i,X48: $i,X49: $i,X50: $i,X51: $i,X52: $i,X53: $i,X54: $i,X55: $i] :
( ( ( in @ ( esk1_1 @ X40 ) @ X40 )
| ~ ( in @ X41 @ X40 ) )
& ( ~ ( in @ X43 @ ( esk1_1 @ X40 ) )
| ~ ( in @ X43 @ X40 )
| ~ ( in @ X41 @ X40 ) )
& ( in @ X44 @ ( setadjoin @ X44 @ X45 ) )
& ( ~ ( in @ X48 @ X47 )
| ( in @ X48 @ ( setadjoin @ X46 @ X47 ) ) )
& ( ~ ( in @ X51 @ X49 )
| ( in @ X52 @ X50 )
| ( X51 != X52 )
| ( X49 != X50 ) )
& ( ~ ( in @ X52 @ X50 )
| ( in @ X51 @ X49 )
| ( X51 != X52 )
| ( X49 != X50 ) )
& ( ~ ( in @ X55 @ ( setadjoin @ X53 @ ( setadjoin @ X54 @ emptyset ) ) )
| ( X55 = X53 )
| ( X55 = X54 ) )
& ( in @ esk2_0 @ esk3_0 )
& ( in @ esk3_0 @ esk2_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_7])])])])])]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_1 @ X1 ) @ X1 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( X1 = X2 )
| ( X1 = X3 )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i] : ( in @ ( esk1_1 @ ( setadjoin @ X1 @ X2 ) ) @ ( setadjoin @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ~ ( in @ X1 @ ( esk1_1 @ X2 ) )
| ~ ( in @ X1 @ X2 )
| ~ ( in @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X1 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ X1 @ ( setadjoin @ X3 @ X2 ) )
| ~ ( in @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_16,negated_conjecture,
! [X2: $i,X4: $i,X3: $i,X1: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ~ ( in @ X3 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X4 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X4 @ X1 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( X1 = X2 )
| ( X1 = X3 )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ emptyset ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
thf(c_0_18,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ~ ( in @ X3 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
thf(c_0_19,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ emptyset ) )
= X2 )
| ( ( esk1_1 @ ( setadjoin @ X1 @ emptyset ) )
= X1 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i,X4: $i,X3: $i,X2: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X1 )
| ~ ( in @ X3 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X4 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X4 @ X2 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_21,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ~ ( in @ X3 @ ( setadjoin @ X2 @ emptyset ) )
| ~ ( in @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i] :
( ( esk1_1 @ ( setadjoin @ X1 @ emptyset ) )
= X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_19])]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X1 )
| ~ ( in @ X3 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X3 @ X2 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
thf(c_0_24,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ~ ( in @ X2 @ X1 ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_12]),c_0_22]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i,X2: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X1 )
| ~ ( in @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_10]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ~ ( in @ X1 @ ( setadjoin @ X2 @ emptyset ) )
| ~ ( in @ X3 @ ( setadjoin @ X2 @ emptyset ) )
| ~ ( in @ X3 @ X2 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ( in @ X2 @ X1 )
| ~ ( in @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_28,negated_conjecture,
in @ esk3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_29,negated_conjecture,
in @ esk2_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_30,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( in @ X1 @ ( setadjoin @ X2 @ emptyset ) )
| ~ ( in @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_12]) ).
thf(c_0_31,negated_conjecture,
esk2_0 = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
thf(c_0_32,negated_conjecture,
! [X1: $i] :
~ ( in @ X1 @ X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_12]),c_0_22]) ).
thf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU807^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.16 % Computer : n006.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 14:32:39 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 Running higher-order theorem proving
% 0.10/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.Sr8ztF10ai/E---3.1_808294.p
% 0.10/0.24 % Version: 3.5.1-ho
% 0.10/0.24 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.10/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.10/0.24 % Starting post_as_ho8 with 300s (1) cores
% 0.10/0.24 % Starting post_as_ho3 with 300s (1) cores
% 0.10/0.24 % Starting post_as_ho2 with 300s (1) cores
% 0.10/0.24 % lpo6_lambda_fix with pid 808307 completed with status 0
% 0.10/0.24 % Result found by lpo6_lambda_fix
% 0.10/0.24 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.10/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.10/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.10/0.24 % No SInE strategy applied
% 0.10/0.24 % Search class: HGHSF-FFSF21-SFFFMFNN
% 0.10/0.24 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.24 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.24 % Starting lpo6_lambda_fix with 151s (1) cores
% 0.10/0.24 % Starting sh5l with 136s (1) cores
% 0.10/0.24 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.10/0.24 % Starting lpo1_def_fix with 136s (1) cores
% 0.10/0.24 % SubtermCWHack with pid 808312 completed with status 0
% 0.10/0.24 % Result found by SubtermCWHack
% 0.10/0.24 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.10/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.10/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.10/0.24 % No SInE strategy applied
% 0.10/0.24 % Search class: HGHSF-FFSF21-SFFFMFNN
% 0.10/0.24 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.24 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.24 % Preprocessing time : 0.001 s
% 0.10/0.24
% 0.10/0.24 % Proof found!
% 0.10/0.24 % SZS status Theorem
% 0.10/0.24 % SZS output start CNFRefutation
% See solution above
% 0.10/0.24 % Parsed axioms : 14
% 0.10/0.24 % Removed by relevancy pruning/SinE : 0
% 0.10/0.24 % Initial clauses : 17
% 0.10/0.24 % Removed in clause preprocessing : 10
% 0.10/0.24 % Initial clauses in saturation : 7
% 0.10/0.24 % Processed clauses : 57
% 0.10/0.24 % ...of these trivial : 2
% 0.10/0.24 % ...subsumed : 13
% 0.10/0.24 % ...remaining for further processing : 42
% 0.10/0.24 % Other redundant clauses eliminated : 4
% 0.10/0.24 % Clauses deleted for lack of memory : 0
% 0.10/0.24 % Backward-subsumed : 4
% 0.10/0.24 % Backward-rewritten : 4
% 0.10/0.24 % Generated clauses : 116
% 0.10/0.24 % ...of the previous two non-redundant : 98
% 0.10/0.24 % ...aggressively subsumed : 0
% 0.10/0.24 % Contextual simplify-reflections : 0
% 0.10/0.24 % Paramodulations : 107
% 0.10/0.24 % Factorizations : 5
% 0.10/0.24 % NegExts : 0
% 0.10/0.24 % Equation resolutions : 4
% 0.10/0.24 % Disequality decompositions : 0
% 0.10/0.24 % Total rewrite steps : 23
% 0.10/0.24 % ...of those cached : 10
% 0.10/0.24 % Propositional unsat checks : 0
% 0.10/0.24 % Propositional check models : 0
% 0.10/0.24 % Propositional check unsatisfiable : 0
% 0.10/0.24 % Propositional clauses : 0
% 0.10/0.24 % Propositional clauses after purity: 0
% 0.10/0.24 % Propositional unsat core size : 0
% 0.10/0.24 % Propositional preprocessing time : 0.000
% 0.10/0.24 % Propositional encoding time : 0.000
% 0.10/0.24 % Propositional solver time : 0.000
% 0.10/0.24 % Success case prop preproc time : 0.000
% 0.10/0.24 % Success case prop encoding time : 0.000
% 0.10/0.24 % Success case prop solver time : 0.000
% 0.10/0.24 % Current number of processed clauses : 34
% 0.10/0.24 % Positive orientable unit clauses : 6
% 0.10/0.24 % Positive unorientable unit clauses: 0
% 0.10/0.24 % Negative unit clauses : 8
% 0.10/0.24 % Non-unit-clauses : 20
% 0.10/0.24 % Current number of unprocessed clauses: 28
% 0.10/0.24 % ...number of literals in the above : 82
% 0.10/0.24 % Current number of archived formulas : 0
% 0.10/0.24 % Current number of archived clauses : 8
% 0.10/0.24 % Clause-clause subsumption calls (NU) : 207
% 0.10/0.24 % Rec. Clause-clause subsumption calls : 173
% 0.10/0.24 % Non-unit clause-clause subsumptions : 9
% 0.10/0.24 % Unit Clause-clause subsumption calls : 12
% 0.10/0.24 % Rewrite failures with RHS unbound : 0
% 0.10/0.24 % BW rewrite match attempts : 3
% 0.10/0.24 % BW rewrite match successes : 2
% 0.10/0.24 % Condensation attempts : 0
% 0.10/0.24 % Condensation successes : 0
% 0.10/0.24 % Termbank termtop insertions : 2840
% 0.10/0.24 % Search garbage collected termcells : 462
% 0.10/0.24
% 0.10/0.24 % -------------------------------------------------
% 0.10/0.24 % User time : 0.005 s
% 0.10/0.24 % System time : 0.003 s
% 0.10/0.24 % Total time : 0.008 s
% 0.10/0.24 % Maximum resident set size: 3640 pages
% 0.10/0.24
% 0.10/0.24 % -------------------------------------------------
% 0.10/0.24 % User time : 0.013 s
% 0.10/0.24 % System time : 0.012 s
% 0.10/0.24 % Total time : 0.026 s
% 0.10/0.24 % Maximum resident set size: 4864 pages
% 0.10/0.24 % E exiting
%------------------------------------------------------------------------------