TSTP Solution File: SEU762^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU762^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:01 EDT 2024
% Result : Theorem 0.18s 0.45s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of formulae : 38 ( 9 unt; 13 typ; 0 def)
% Number of atoms : 132 ( 0 equ; 0 cnn)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 539 ( 49 ~; 43 |; 10 &; 383 @)
% ( 4 <=>; 50 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 76 ( 0 ^ 76 !; 0 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
powerset: $i > $i ).
thf(decl_24,type,
subset: $i > $i > $o ).
thf(decl_25,type,
binintersect: $i > $i > $i ).
thf(decl_26,type,
binintersectT_lem: $o ).
thf(decl_27,type,
woz13rule1: $o ).
thf(decl_28,type,
woz13rule2: $o ).
thf(decl_29,type,
woz13rule3: $o ).
thf(decl_30,type,
esk1_0: $i ).
thf(decl_31,type,
esk2_0: $i ).
thf(decl_32,type,
esk3_0: $i ).
thf(decl_33,type,
esk4_0: $i ).
thf(decl_34,type,
esk5_0: $i ).
thf(woz13rule4,conjecture,
( binintersectT_lem
=> ( woz13rule1
=> ( woz13rule2
=> ( woz13rule3
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( ( subset @ X2 @ X4 )
=> ( ( subset @ X3 @ X5 )
=> ( subset @ ( binintersect @ X2 @ X3 ) @ ( binintersect @ X4 @ X5 ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',woz13rule4) ).
thf(woz13rule3,axiom,
( woz13rule3
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ( ( subset @ X2 @ X3 )
=> ( ( subset @ X2 @ X4 )
=> ( subset @ X2 @ ( binintersect @ X3 @ X4 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',woz13rule3) ).
thf(binintersectT_lem,axiom,
( binintersectT_lem
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( in @ ( binintersect @ X2 @ X3 ) @ ( powerset @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectT_lem) ).
thf(woz13rule1,axiom,
( woz13rule1
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ( ( subset @ X2 @ X4 )
=> ( subset @ ( binintersect @ X2 @ X3 ) @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',woz13rule1) ).
thf(woz13rule2,axiom,
( woz13rule2
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ( ( subset @ X3 @ X4 )
=> ( subset @ ( binintersect @ X2 @ X3 ) @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',woz13rule2) ).
thf(c_0_5,negated_conjecture,
~ ( ! [X26: $i,X27: $i] :
( ( in @ X27 @ ( powerset @ X26 ) )
=> ! [X28: $i] :
( ( in @ X28 @ ( powerset @ X26 ) )
=> ( in @ ( binintersect @ X27 @ X28 ) @ ( powerset @ X26 ) ) ) )
=> ( ! [X29: $i,X30: $i] :
( ( in @ X30 @ ( powerset @ X29 ) )
=> ! [X31: $i] :
( ( in @ X31 @ ( powerset @ X29 ) )
=> ! [X32: $i] :
( ( in @ X32 @ ( powerset @ X29 ) )
=> ( ( subset @ X30 @ X32 )
=> ( subset @ ( binintersect @ X30 @ X31 ) @ X32 ) ) ) ) )
=> ( ! [X33: $i,X34: $i] :
( ( in @ X34 @ ( powerset @ X33 ) )
=> ! [X35: $i] :
( ( in @ X35 @ ( powerset @ X33 ) )
=> ! [X36: $i] :
( ( in @ X36 @ ( powerset @ X33 ) )
=> ( ( subset @ X35 @ X36 )
=> ( subset @ ( binintersect @ X34 @ X35 ) @ X36 ) ) ) ) )
=> ( ! [X37: $i,X38: $i] :
( ( in @ X38 @ ( powerset @ X37 ) )
=> ! [X39: $i] :
( ( in @ X39 @ ( powerset @ X37 ) )
=> ! [X40: $i] :
( ( in @ X40 @ ( powerset @ X37 ) )
=> ( ( subset @ X38 @ X39 )
=> ( ( subset @ X38 @ X40 )
=> ( subset @ X38 @ ( binintersect @ X39 @ X40 ) ) ) ) ) ) )
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( ( subset @ X2 @ X4 )
=> ( ( subset @ X3 @ X5 )
=> ( subset @ ( binintersect @ X2 @ X3 ) @ ( binintersect @ X4 @ X5 ) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[woz13rule4]),woz13rule3]),binintersectT_lem]),woz13rule1]),woz13rule2]) ).
thf(c_0_6,negated_conjecture,
! [X41: $i,X42: $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 @ X42 @ ( powerset @ X41 ) )
| ~ ( in @ X43 @ ( powerset @ X41 ) )
| ( in @ ( binintersect @ X42 @ X43 ) @ ( powerset @ X41 ) ) )
& ( ~ ( in @ X45 @ ( powerset @ X44 ) )
| ~ ( in @ X46 @ ( powerset @ X44 ) )
| ~ ( in @ X47 @ ( powerset @ X44 ) )
| ~ ( subset @ X45 @ X47 )
| ( subset @ ( binintersect @ X45 @ X46 ) @ X47 ) )
& ( ~ ( in @ X49 @ ( powerset @ X48 ) )
| ~ ( in @ X50 @ ( powerset @ X48 ) )
| ~ ( in @ X51 @ ( powerset @ X48 ) )
| ~ ( subset @ X50 @ X51 )
| ( subset @ ( binintersect @ X49 @ X50 ) @ X51 ) )
& ( ~ ( in @ X53 @ ( powerset @ X52 ) )
| ~ ( in @ X54 @ ( powerset @ X52 ) )
| ~ ( in @ X55 @ ( powerset @ X52 ) )
| ~ ( subset @ X53 @ X54 )
| ~ ( subset @ X53 @ X55 )
| ( subset @ X53 @ ( binintersect @ X54 @ X55 ) ) )
& ( in @ esk2_0 @ ( powerset @ esk1_0 ) )
& ( in @ esk3_0 @ ( powerset @ esk1_0 ) )
& ( in @ esk4_0 @ ( powerset @ esk1_0 ) )
& ( in @ esk5_0 @ ( powerset @ esk1_0 ) )
& ( subset @ esk2_0 @ esk4_0 )
& ( subset @ esk3_0 @ esk5_0 )
& ~ ( subset @ ( binintersect @ esk2_0 @ esk3_0 ) @ ( binintersect @ esk4_0 @ esk5_0 ) ) ),
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_5])])])])]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X3: $i,X2: $i,X4: $i] :
( ( subset @ X1 @ ( binintersect @ X3 @ X4 ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) )
| ~ ( in @ X4 @ ( powerset @ X2 ) )
| ~ ( subset @ X1 @ X3 )
| ~ ( subset @ X1 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
in @ esk5_0 @ ( powerset @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
~ ( subset @ ( binintersect @ esk2_0 @ esk3_0 ) @ ( binintersect @ esk4_0 @ esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ ( binintersect @ X2 @ esk5_0 ) )
| ~ ( in @ X2 @ ( powerset @ esk1_0 ) )
| ~ ( in @ X1 @ ( powerset @ esk1_0 ) )
| ~ ( subset @ X1 @ esk5_0 )
| ~ ( subset @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
in @ esk4_0 @ ( powerset @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_12,negated_conjecture,
( ~ ( in @ ( binintersect @ esk2_0 @ esk3_0 ) @ ( powerset @ esk1_0 ) )
| ~ ( subset @ ( binintersect @ esk2_0 @ esk3_0 ) @ esk5_0 )
| ~ ( subset @ ( binintersect @ esk2_0 @ esk3_0 ) @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( binintersect @ X1 @ X3 ) @ ( powerset @ X2 ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_14,negated_conjecture,
in @ esk3_0 @ ( powerset @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_15,negated_conjecture,
in @ esk2_0 @ ( powerset @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( subset @ ( binintersect @ X1 @ X3 ) @ X4 )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) )
| ~ ( in @ X4 @ ( powerset @ X2 ) )
| ~ ( subset @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_17,negated_conjecture,
( ~ ( subset @ ( binintersect @ esk2_0 @ esk3_0 ) @ esk5_0 )
| ~ ( subset @ ( binintersect @ esk2_0 @ esk3_0 ) @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ ( binintersect @ X1 @ X2 ) @ esk5_0 )
| ~ ( in @ X2 @ ( powerset @ esk1_0 ) )
| ~ ( in @ X1 @ ( powerset @ esk1_0 ) )
| ~ ( subset @ X2 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
thf(c_0_19,negated_conjecture,
subset @ esk3_0 @ esk5_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i,X3: $i,X2: $i,X4: $i] :
( ( subset @ ( binintersect @ X1 @ X3 ) @ X4 )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) )
| ~ ( in @ X4 @ ( powerset @ X2 ) )
| ~ ( subset @ X1 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_21,negated_conjecture,
~ ( subset @ ( binintersect @ esk2_0 @ esk3_0 ) @ esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14]),c_0_15]),c_0_19])]) ).
thf(c_0_22,negated_conjecture,
! [X2: $i,X1: $i] :
( ( subset @ ( binintersect @ X1 @ X2 ) @ esk4_0 )
| ~ ( in @ X2 @ ( powerset @ esk1_0 ) )
| ~ ( in @ X1 @ ( powerset @ esk1_0 ) )
| ~ ( subset @ X1 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
thf(c_0_23,negated_conjecture,
subset @ esk2_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14]),c_0_15]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU762^2 : TPTP v8.2.0. Released v3.7.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n023.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Sun May 19 16:05:53 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.18/0.44 Running higher-order theorem proving
% 0.18/0.44 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.18/0.45 # Version: 3.1.0-ho
% 0.18/0.45 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.18/0.45 # Starting post_as_ho8 with 300s (1) cores
% 0.18/0.45 # Starting post_as_ho3 with 300s (1) cores
% 0.18/0.45 # Starting post_as_ho2 with 300s (1) cores
% 0.18/0.45 # post_as_ho8 with pid 8024 completed with status 0
% 0.18/0.45 # Result found by post_as_ho8
% 0.18/0.45 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.18/0.45 # Starting post_as_ho8 with 300s (1) cores
% 0.18/0.45 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.18/0.45 # Search class: HHUNF-FFSM21-SFFFMFNN
% 0.18/0.45 # partial match(1): HHUNF-FFSS21-SFFFMFNN
% 0.18/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.45 # new_ho_10 with pid 8027 completed with status 0
% 0.18/0.45 # Result found by new_ho_10
% 0.18/0.45 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.18/0.45 # Starting post_as_ho8 with 300s (1) cores
% 0.18/0.45 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.18/0.45 # Search class: HHUNF-FFSM21-SFFFMFNN
% 0.18/0.45 # partial match(1): HHUNF-FFSS21-SFFFMFNN
% 0.18/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.45 # Preprocessing time : 0.001 s
% 0.18/0.45 # Presaturation interreduction done
% 0.18/0.45
% 0.18/0.45 # Proof found!
% 0.18/0.45 # SZS status Theorem
% 0.18/0.45 # SZS output start CNFRefutation
% See solution above
% 0.18/0.45 # Parsed axioms : 13
% 0.18/0.45 # Removed by relevancy pruning/SinE : 8
% 0.18/0.45 # Initial clauses : 11
% 0.18/0.45 # Removed in clause preprocessing : 0
% 0.18/0.45 # Initial clauses in saturation : 11
% 0.18/0.45 # Processed clauses : 37
% 0.18/0.45 # ...of these trivial : 0
% 0.18/0.45 # ...subsumed : 0
% 0.18/0.45 # ...remaining for further processing : 37
% 0.18/0.45 # Other redundant clauses eliminated : 0
% 0.18/0.45 # Clauses deleted for lack of memory : 0
% 0.18/0.45 # Backward-subsumed : 2
% 0.18/0.45 # Backward-rewritten : 0
% 0.18/0.45 # Generated clauses : 26
% 0.18/0.45 # ...of the previous two non-redundant : 24
% 0.18/0.45 # ...aggressively subsumed : 0
% 0.18/0.45 # Contextual simplify-reflections : 0
% 0.18/0.45 # Paramodulations : 26
% 0.18/0.45 # Factorizations : 0
% 0.18/0.45 # NegExts : 0
% 0.18/0.45 # Equation resolutions : 0
% 0.18/0.45 # Disequality decompositions : 0
% 0.18/0.45 # Total rewrite steps : 11
% 0.18/0.45 # ...of those cached : 6
% 0.18/0.45 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 24
% 0.18/0.46 # Positive orientable unit clauses : 6
% 0.18/0.46 # Positive unorientable unit clauses: 0
% 0.18/0.46 # Negative unit clauses : 2
% 0.18/0.46 # Non-unit-clauses : 16
% 0.18/0.46 # Current number of unprocessed clauses: 9
% 0.18/0.46 # ...number of literals in the above : 47
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 13
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 117
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 25
% 0.18/0.46 # Non-unit clause-clause subsumptions : 1
% 0.18/0.46 # Unit Clause-clause subsumption calls : 3
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 0
% 0.18/0.46 # BW rewrite match successes : 0
% 0.18/0.46 # Condensation attempts : 37
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 3106
% 0.18/0.46 # Search garbage collected termcells : 604
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.006 s
% 0.18/0.46 # System time : 0.002 s
% 0.18/0.46 # Total time : 0.008 s
% 0.18/0.46 # Maximum resident set size: 1972 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.008 s
% 0.18/0.46 # System time : 0.004 s
% 0.18/0.46 # Total time : 0.011 s
% 0.18/0.46 # Maximum resident set size: 1708 pages
% 0.18/0.46 % E---3.1 exiting
% 0.18/0.46 % E exiting
%------------------------------------------------------------------------------