TSTP Solution File: SEU821^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU821^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:30:34 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 30 ( 12 unt; 11 typ; 0 def)
% Number of atoms : 215 ( 25 equ; 0 cnn)
% Maximal formula atoms : 28 ( 11 avg)
% Number of connectives : 561 ( 34 ~; 47 |; 50 &; 347 @)
% ( 1 <=>; 82 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 94 ( 8 ^ 79 !; 7 ?; 94 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
powerset: $i > $i ).
thf(decl_24,type,
nonempty: $i > $o ).
thf(decl_25,type,
transitiveset: $i > $o ).
thf(decl_26,type,
stricttotalorderedByIn: $i > $o ).
thf(decl_27,type,
wellorderedByIn: $i > $o ).
thf(decl_28,type,
ordinal: $i > $o ).
thf(decl_29,type,
epred1_1: $i > $o ).
thf(decl_30,type,
esk1_0: $i ).
thf(decl_31,type,
esk2_0: $i ).
thf(decl_32,type,
esk3_2: $i > $i > $i ).
thf(wellorderedByIn,axiom,
( wellorderedByIn
= ( ^ [X1: $i] :
( ( stricttotalorderedByIn @ X1 )
& ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( ( nonempty @ X3 )
=> ? [X2: $i] :
( ( in @ X2 @ X3 )
& ! [X4: $i] :
( ( in @ X4 @ X3 )
=> ( ( X2 = X4 )
| ( in @ X2 @ X4 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wellorderedByIn) ).
thf(stricttotalorderedByIn,axiom,
( stricttotalorderedByIn
= ( ^ [X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( ( in @ X2 @ X3 )
& ( in @ X3 @ X4 ) )
=> ( in @ X2 @ X4 ) ) ) ) )
& ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( X3 = X4 )
| ( in @ X3 @ X4 )
| ( in @ X4 @ X3 ) ) ) )
& ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ~ ( in @ X3 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',stricttotalorderedByIn) ).
thf(ordinal,axiom,
( ordinal
= ( ^ [X2: $i] :
( ( transitiveset @ X2 )
& ( wellorderedByIn @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordinal) ).
thf(ordinalIrrefl,conjecture,
! [X3: $i] :
( ( ordinal @ X3 )
=> ! [X1: $i] :
( ( in @ X1 @ X3 )
=> ~ ( in @ X1 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordinalIrrefl) ).
thf(c_0_4,plain,
( wellorderedByIn
= ( ^ [Z0: $i] :
( ! [X7: $i] :
( ( in @ X7 @ Z0 )
=> ! [X8: $i] :
( ( in @ X8 @ Z0 )
=> ! [X9: $i] :
( ( in @ X9 @ Z0 )
=> ( ( ( in @ X7 @ X8 )
& ( in @ X8 @ X9 ) )
=> ( in @ X7 @ X9 ) ) ) ) )
& ! [X10: $i] :
( ( in @ X10 @ Z0 )
=> ! [X11: $i] :
( ( in @ X11 @ Z0 )
=> ( ( X10 = X11 )
| ( in @ X10 @ X11 )
| ( in @ X11 @ X10 ) ) ) )
& ! [X12: $i] :
( ( in @ X12 @ Z0 )
=> ~ ( in @ X12 @ X12 ) )
& ! [X3: $i] :
( ( in @ X3 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X3 )
=> ? [X2: $i] :
( ( in @ X2 @ X3 )
& ! [X4: $i] :
( ( in @ X4 @ X3 )
=> ( ( X2 = X4 )
| ( in @ X2 @ X4 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[wellorderedByIn]) ).
thf(c_0_5,plain,
( stricttotalorderedByIn
= ( ^ [Z0: $i] :
( ! [X2: $i] :
( ( in @ X2 @ Z0 )
=> ! [X3: $i] :
( ( in @ X3 @ Z0 )
=> ! [X4: $i] :
( ( in @ X4 @ Z0 )
=> ( ( ( in @ X2 @ X3 )
& ( in @ X3 @ X4 ) )
=> ( in @ X2 @ X4 ) ) ) ) )
& ! [X3: $i] :
( ( in @ X3 @ Z0 )
=> ! [X4: $i] :
( ( in @ X4 @ Z0 )
=> ( ( X3 = X4 )
| ( in @ X3 @ X4 )
| ( in @ X4 @ X3 ) ) ) )
& ! [X3: $i] :
( ( in @ X3 @ Z0 )
=> ~ ( in @ X3 @ X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[stricttotalorderedByIn]) ).
thf(c_0_6,plain,
( ordinal
= ( ^ [Z0: $i] :
( ( transitiveset @ Z0 )
& ! [X13: $i] :
( ( in @ X13 @ Z0 )
=> ! [X14: $i] :
( ( in @ X14 @ Z0 )
=> ! [X15: $i] :
( ( in @ X15 @ Z0 )
=> ( ( ( in @ X13 @ X14 )
& ( in @ X14 @ X15 ) )
=> ( in @ X13 @ X15 ) ) ) ) )
& ! [X16: $i] :
( ( in @ X16 @ Z0 )
=> ! [X17: $i] :
( ( in @ X17 @ Z0 )
=> ( ( X16 = X17 )
| ( in @ X16 @ X17 )
| ( in @ X17 @ X16 ) ) ) )
& ! [X18: $i] :
( ( in @ X18 @ Z0 )
=> ~ ( in @ X18 @ X18 ) )
& ! [X19: $i] :
( ( in @ X19 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X19 )
=> ? [X20: $i] :
( ( in @ X20 @ X19 )
& ! [X21: $i] :
( ( in @ X21 @ X19 )
=> ( ( X20 = X21 )
| ( in @ X20 @ X21 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ordinal]) ).
thf(c_0_7,plain,
( wellorderedByIn
= ( ^ [Z0: $i] :
( ! [X7: $i] :
( ( in @ X7 @ Z0 )
=> ! [X8: $i] :
( ( in @ X8 @ Z0 )
=> ! [X9: $i] :
( ( in @ X9 @ Z0 )
=> ( ( ( in @ X7 @ X8 )
& ( in @ X8 @ X9 ) )
=> ( in @ X7 @ X9 ) ) ) ) )
& ! [X10: $i] :
( ( in @ X10 @ Z0 )
=> ! [X11: $i] :
( ( in @ X11 @ Z0 )
=> ( ( X10 = X11 )
| ( in @ X10 @ X11 )
| ( in @ X11 @ X10 ) ) ) )
& ! [X12: $i] :
( ( in @ X12 @ Z0 )
=> ~ ( in @ X12 @ X12 ) )
& ! [X3: $i] :
( ( in @ X3 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X3 )
=> ? [X2: $i] :
( ( in @ X2 @ X3 )
& ! [X4: $i] :
( ( in @ X4 @ X3 )
=> ( ( X2 = X4 )
| ( in @ X2 @ X4 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,plain,
! [X3: $i] :
( ( epred1_1 @ X3 )
<=> ( ( transitiveset @ X3 )
& ! [X22: $i] :
( ( in @ X22 @ X3 )
=> ! [X23: $i] :
( ( in @ X23 @ X3 )
=> ! [X24: $i] :
( ( in @ X24 @ X3 )
=> ( ( ( in @ X22 @ X23 )
& ( in @ X23 @ X24 ) )
=> ( in @ X22 @ X24 ) ) ) ) )
& ! [X25: $i] :
( ( in @ X25 @ X3 )
=> ! [X26: $i] :
( ( in @ X26 @ X3 )
=> ( ( X25 = X26 )
| ( in @ X25 @ X26 )
| ( in @ X26 @ X25 ) ) ) )
& ! [X27: $i] :
( ( in @ X27 @ X3 )
=> ~ ( in @ X27 @ X27 ) )
& ! [X28: $i] :
( ( in @ X28 @ ( powerset @ X3 ) )
=> ( ( nonempty @ X28 )
=> ? [X29: $i] :
( ( in @ X29 @ X28 )
& ! [X30: $i] :
( ( in @ X30 @ X28 )
=> ( ( X29 = X30 )
| ( in @ X29 @ X30 ) ) ) ) ) ) ) ),
introduced(definition) ).
thf(c_0_9,plain,
( ordinal
= ( ^ [Z0: $i] :
( ( transitiveset @ Z0 )
& ! [X13: $i] :
( ( in @ X13 @ Z0 )
=> ! [X14: $i] :
( ( in @ X14 @ Z0 )
=> ! [X15: $i] :
( ( in @ X15 @ Z0 )
=> ( ( ( in @ X13 @ X14 )
& ( in @ X14 @ X15 ) )
=> ( in @ X13 @ X15 ) ) ) ) )
& ! [X16: $i] :
( ( in @ X16 @ Z0 )
=> ! [X17: $i] :
( ( in @ X17 @ Z0 )
=> ( ( X16 = X17 )
| ( in @ X16 @ X17 )
| ( in @ X17 @ X16 ) ) ) )
& ! [X18: $i] :
( ( in @ X18 @ Z0 )
=> ~ ( in @ X18 @ X18 ) )
& ! [X19: $i] :
( ( in @ X19 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X19 )
=> ? [X20: $i] :
( ( in @ X20 @ X19 )
& ! [X21: $i] :
( ( in @ X21 @ X19 )
=> ( ( X20 = X21 )
| ( in @ X20 @ X21 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,plain,
! [X3: $i] :
( ( epred1_1 @ X3 )
=> ( ( transitiveset @ X3 )
& ! [X22: $i] :
( ( in @ X22 @ X3 )
=> ! [X23: $i] :
( ( in @ X23 @ X3 )
=> ! [X24: $i] :
( ( in @ X24 @ X3 )
=> ( ( ( in @ X22 @ X23 )
& ( in @ X23 @ X24 ) )
=> ( in @ X22 @ X24 ) ) ) ) )
& ! [X25: $i] :
( ( in @ X25 @ X3 )
=> ! [X26: $i] :
( ( in @ X26 @ X3 )
=> ( ( X25 = X26 )
| ( in @ X25 @ X26 )
| ( in @ X26 @ X25 ) ) ) )
& ! [X27: $i] :
( ( in @ X27 @ X3 )
=> ~ ( in @ X27 @ X27 ) )
& ! [X28: $i] :
( ( in @ X28 @ ( powerset @ X3 ) )
=> ( ( nonempty @ X28 )
=> ? [X29: $i] :
( ( in @ X29 @ X28 )
& ! [X30: $i] :
( ( in @ X30 @ X28 )
=> ( ( X29 = X30 )
| ( in @ X29 @ X30 ) ) ) ) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
~ ! [X3: $i] :
( ( epred1_1 @ X3 )
=> ! [X1: $i] :
( ( in @ X1 @ X3 )
=> ~ ( in @ X1 @ X1 ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[ordinalIrrefl]),c_0_9])]),c_0_8]) ).
thf(c_0_12,plain,
! [X33: $i,X34: $i,X35: $i,X36: $i,X37: $i,X38: $i,X39: $i,X40: $i,X42: $i] :
( ( ( transitiveset @ X33 )
| ~ ( epred1_1 @ X33 ) )
& ( ~ ( in @ X34 @ X33 )
| ~ ( in @ X35 @ X33 )
| ~ ( in @ X36 @ X33 )
| ~ ( in @ X34 @ X35 )
| ~ ( in @ X35 @ X36 )
| ( in @ X34 @ X36 )
| ~ ( epred1_1 @ X33 ) )
& ( ~ ( in @ X37 @ X33 )
| ~ ( in @ X38 @ X33 )
| ( X37 = X38 )
| ( in @ X37 @ X38 )
| ( in @ X38 @ X37 )
| ~ ( epred1_1 @ X33 ) )
& ( ~ ( in @ X39 @ X33 )
| ~ ( in @ X39 @ X39 )
| ~ ( epred1_1 @ X33 ) )
& ( ( in @ ( esk3_2 @ X33 @ X40 ) @ X40 )
| ~ ( nonempty @ X40 )
| ~ ( in @ X40 @ ( powerset @ X33 ) )
| ~ ( epred1_1 @ X33 ) )
& ( ~ ( in @ X42 @ X40 )
| ( ( esk3_2 @ X33 @ X40 )
= X42 )
| ( in @ ( esk3_2 @ X33 @ X40 ) @ X42 )
| ~ ( nonempty @ X40 )
| ~ ( in @ X40 @ ( powerset @ X33 ) )
| ~ ( epred1_1 @ X33 ) ) ),
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_10])])])])])]) ).
thf(c_0_13,negated_conjecture,
( ( epred1_1 @ esk1_0 )
& ( in @ esk2_0 @ esk1_0 )
& ( in @ esk2_0 @ esk2_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
thf(c_0_14,plain,
! [X1: $i,X2: $i] :
( ~ ( in @ X1 @ X2 )
| ~ ( in @ X1 @ X1 )
| ~ ( epred1_1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,negated_conjecture,
in @ esk2_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,negated_conjecture,
in @ esk2_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,negated_conjecture,
epred1_1 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU821^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 15:58:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.51 # Starting post_as_ho5 with 300s (1) cores
% 0.21/0.51 # Starting sh4l with 300s (1) cores
% 0.21/0.51 # Starting ho_unfolding_2 with 300s (1) cores
% 0.21/0.51 # ho_unfolding_3 with pid 12257 completed with status 0
% 0.21/0.51 # Result found by ho_unfolding_3
% 0.21/0.51 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHSF-FFSS21-SSFFMFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.51 # Starting ho_unfolding_3 with 151s (1) cores
% 0.21/0.51 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.21/0.51 # Starting lpo1_def_fix with 136s (1) cores
% 0.21/0.51 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.21/0.51 # ho_unfolding_3 with pid 12271 completed with status 0
% 0.21/0.51 # Result found by ho_unfolding_3
% 0.21/0.51 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHSF-FFSS21-SSFFMFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.51 # Starting ho_unfolding_3 with 151s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 11
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 16
% 0.21/0.51 # Removed in clause preprocessing : 7
% 0.21/0.51 # Initial clauses in saturation : 9
% 0.21/0.51 # Processed clauses : 14
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 14
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 2
% 0.21/0.51 # ...of the previous two non-redundant : 1
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 2
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 3
% 0.21/0.51 # ...of those cached : 1
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 5
% 0.21/0.51 # Positive orientable unit clauses : 3
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 0
% 0.21/0.51 # Non-unit-clauses : 2
% 0.21/0.51 # Current number of unprocessed clauses: 4
% 0.21/0.51 # ...number of literals in the above : 23
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 9
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 34
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 2
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 0
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 14
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 1522
% 0.21/0.51 # Search garbage collected termcells : 301
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.007 s
% 0.21/0.51 # System time : 0.001 s
% 0.21/0.51 # Total time : 0.008 s
% 0.21/0.51 # Maximum resident set size: 1844 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.014 s
% 0.21/0.51 # System time : 0.006 s
% 0.21/0.51 # Total time : 0.019 s
% 0.21/0.51 # Maximum resident set size: 1708 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------