TSTP Solution File: SEU649^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU649^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:28:50 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of formulae : 40 ( 6 unt; 12 typ; 0 def)
% Number of atoms : 113 ( 50 equ; 0 cnn)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 468 ( 27 ~; 45 |; 9 &; 356 @)
% ( 5 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 75 ( 0 ^ 75 !; 0 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
setadjoin: $i > $i > $i ).
thf(decl_25,type,
setext: $o ).
thf(decl_26,type,
setadjoinIL: $o ).
thf(decl_27,type,
uniqinunit: $o ).
thf(decl_28,type,
eqinunit: $o ).
thf(decl_29,type,
upairset2E: $o ).
thf(decl_30,type,
esk1_2: $i > $i > $i ).
thf(decl_31,type,
esk2_2: $i > $i > $i ).
thf(decl_32,type,
esk3_0: $i ).
thf(decl_33,type,
esk4_0: $i ).
thf(setukpairinjR11,conjecture,
( setext
=> ( setadjoinIL
=> ( uniqinunit
=> ( eqinunit
=> ( upairset2E
=> ! [X3: $i,X4: $i] :
( ( X3 = X4 )
=> ( ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) )
= ( setadjoin @ X3 @ emptyset ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjR11) ).
thf(setext,axiom,
( setext
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) )
=> ( ! [X3: $i] :
( ( in @ X3 @ X2 )
=> ( in @ X3 @ X1 ) )
=> ( X1 = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setext) ).
thf(setadjoinIL,axiom,
( setadjoinIL
<=> ! [X3: $i,X4: $i] : ( in @ X3 @ ( setadjoin @ X3 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinIL) ).
thf(uniqinunit,axiom,
( uniqinunit
<=> ! [X3: $i,X4: $i] :
( ( in @ X3 @ ( setadjoin @ X4 @ emptyset ) )
=> ( X3 = X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit) ).
thf(eqinunit,axiom,
( eqinunit
<=> ! [X3: $i,X4: $i] :
( ( X3 = X4 )
=> ( in @ X3 @ ( setadjoin @ X4 @ emptyset ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eqinunit) ).
thf(upairset2E,axiom,
( upairset2E
<=> ! [X3: $i,X4: $i,X5: $i] :
( ( in @ X5 @ ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) ) )
=> ( ( X5 = X3 )
| ( X5 = X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upairset2E) ).
thf(c_0_6,negated_conjecture,
~ ( ! [X21: $i,X22: $i] :
( ! [X23: $i] :
( ( in @ X23 @ X21 )
=> ( in @ X23 @ X22 ) )
=> ( ! [X24: $i] :
( ( in @ X24 @ X22 )
=> ( in @ X24 @ X21 ) )
=> ( X21 = X22 ) ) )
=> ( ! [X25: $i,X26: $i] : ( in @ X25 @ ( setadjoin @ X25 @ X26 ) )
=> ( ! [X27: $i,X28: $i] :
( ( in @ X27 @ ( setadjoin @ X28 @ emptyset ) )
=> ( X27 = X28 ) )
=> ( ! [X29: $i,X30: $i] :
( ( X29 = X30 )
=> ( in @ X29 @ ( setadjoin @ X30 @ emptyset ) ) )
=> ( ! [X31: $i,X32: $i,X33: $i] :
( ( in @ X33 @ ( setadjoin @ X31 @ ( setadjoin @ X32 @ emptyset ) ) )
=> ( ( X33 = X31 )
| ( X33 = X32 ) ) )
=> ! [X3: $i,X4: $i] :
( ( X3 = X4 )
=> ( ( setadjoin @ X3 @ ( setadjoin @ X4 @ emptyset ) )
= ( setadjoin @ X3 @ emptyset ) ) ) ) ) ) ) ),
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)],[inference(assume_negation,[status(cth)],[setukpairinjR11]),setext]),setadjoinIL]),uniqinunit]),eqinunit]),upairset2E]) ).
thf(c_0_7,negated_conjecture,
! [X34: $i,X35: $i,X38: $i,X39: $i,X40: $i,X41: $i,X42: $i,X43: $i,X44: $i,X45: $i,X46: $i] :
( ( ( in @ ( esk2_2 @ X34 @ X35 ) @ X35 )
| ( X34 = X35 )
| ( in @ ( esk1_2 @ X34 @ X35 ) @ X34 ) )
& ( ~ ( in @ ( esk2_2 @ X34 @ X35 ) @ X34 )
| ( X34 = X35 )
| ( in @ ( esk1_2 @ X34 @ X35 ) @ X34 ) )
& ( ( in @ ( esk2_2 @ X34 @ X35 ) @ X35 )
| ( X34 = X35 )
| ~ ( in @ ( esk1_2 @ X34 @ X35 ) @ X35 ) )
& ( ~ ( in @ ( esk2_2 @ X34 @ X35 ) @ X34 )
| ( X34 = X35 )
| ~ ( in @ ( esk1_2 @ X34 @ X35 ) @ X35 ) )
& ( in @ X38 @ ( setadjoin @ X38 @ X39 ) )
& ( ~ ( in @ X40 @ ( setadjoin @ X41 @ emptyset ) )
| ( X40 = X41 ) )
& ( ( X42 != X43 )
| ( in @ X42 @ ( setadjoin @ X43 @ emptyset ) ) )
& ( ~ ( in @ X46 @ ( setadjoin @ X44 @ ( setadjoin @ X45 @ emptyset ) ) )
| ( X46 = X44 )
| ( X46 = X45 ) )
& ( esk3_0 = esk4_0 )
& ( ( setadjoin @ esk3_0 @ ( setadjoin @ esk4_0 @ emptyset ) )
!= ( setadjoin @ esk3_0 @ emptyset ) ) ),
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_6])])])])])]) ).
thf(c_0_8,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_7]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk2_2 @ X1 @ X2 ) @ X2 )
| ( X1 = X2 )
| ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( ( esk2_2 @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
= X3 )
| ( ( esk2_2 @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
= X2 )
| ( X1
= ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
| ( in @ ( esk1_2 @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i,X1: $i] :
( ( X1 = X2 )
| ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 )
| ~ ( in @ ( esk2_2 @ X1 @ X2 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( esk2_2 @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ( X1
= ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ( in @ ( esk1_2 @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) ) @ X1 ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_10])]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk2_2 @ X1 @ X2 ) @ X2 )
| ( X1 = X2 )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_15,negated_conjecture,
! [X2: $i,X1: $i] :
( ( X1
= ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ( in @ ( esk1_2 @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) ) @ X1 )
| ~ ( in @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( ( esk2_2 @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
= X3 )
| ( ( esk2_2 @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
= X2 )
| ( X1
= ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
| ~ ( in @ ( esk1_2 @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) ) @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) ) ),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
= X1 )
| ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ( in @ ( esk2_2 @ X1 @ X2 ) @ X1 )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_19,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( esk2_2 @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_20,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) ) @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_21,negated_conjecture,
( ( setadjoin @ esk3_0 @ ( setadjoin @ esk4_0 @ emptyset ) )
!= ( setadjoin @ esk3_0 @ emptyset ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_22,negated_conjecture,
esk3_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_23,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( setadjoin @ X1 @ emptyset )
= ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_25,negated_conjecture,
( ( setadjoin @ esk3_0 @ ( setadjoin @ esk3_0 @ emptyset ) )
!= ( setadjoin @ esk3_0 @ emptyset ) ),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i] :
( ( setadjoin @ X1 @ ( setadjoin @ X1 @ emptyset ) )
= ( setadjoin @ X1 @ emptyset ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_24])]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU649^2 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 18:17:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.19/0.49 # Version: 3.1.0-ho
% 0.19/0.49 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.19/0.49 # Starting post_as_ho8 with 300s (1) cores
% 0.19/0.49 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.49 # Starting post_as_ho2 with 300s (1) cores
% 0.19/0.49 # lpo6_lambda_fix with pid 24492 completed with status 0
% 0.19/0.49 # Result found by lpo6_lambda_fix
% 0.19/0.49 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: HGUSF-FFSF22-SFFFMFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting new_ho_10 with 811s (1) cores
% 0.19/0.49 # Starting lpo6_lambda_fix with 151s (1) cores
% 0.19/0.49 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.19/0.49 # Starting lpo1_def_fix with 136s (1) cores
% 0.19/0.49 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.19/0.49 # lpo6_lambda_fix with pid 24498 completed with status 0
% 0.19/0.49 # Result found by lpo6_lambda_fix
% 0.19/0.49 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: HGUSF-FFSF22-SFFFMFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting new_ho_10 with 811s (1) cores
% 0.19/0.49 # Starting lpo6_lambda_fix with 151s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 14
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 18
% 0.19/0.49 # Removed in clause preprocessing : 8
% 0.19/0.49 # Initial clauses in saturation : 10
% 0.19/0.49 # Processed clauses : 33
% 0.19/0.49 # ...of these trivial : 1
% 0.19/0.49 # ...subsumed : 4
% 0.19/0.49 # ...remaining for further processing : 28
% 0.19/0.49 # Other redundant clauses eliminated : 3
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 2
% 0.19/0.49 # Backward-rewritten : 5
% 0.19/0.49 # Generated clauses : 54
% 0.19/0.49 # ...of the previous two non-redundant : 41
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 49
% 0.19/0.49 # Factorizations : 2
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 3
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 25
% 0.19/0.49 # ...of those cached : 18
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 20
% 0.19/0.49 # Positive orientable unit clauses : 3
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 0
% 0.19/0.49 # Non-unit-clauses : 17
% 0.19/0.49 # Current number of unprocessed clauses: 14
% 0.19/0.49 # ...number of literals in the above : 59
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 7
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 178
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 131
% 0.19/0.49 # Non-unit clause-clause subsumptions : 6
% 0.19/0.49 # Unit Clause-clause subsumption calls : 7
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 4
% 0.19/0.49 # BW rewrite match successes : 2
% 0.19/0.49 # Condensation attempts : 33
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 2990
% 0.19/0.49 # Search garbage collected termcells : 404
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.009 s
% 0.19/0.49 # System time : 0.001 s
% 0.19/0.49 # Total time : 0.010 s
% 0.19/0.49 # Maximum resident set size: 1820 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.029 s
% 0.19/0.49 # System time : 0.004 s
% 0.19/0.49 # Total time : 0.034 s
% 0.19/0.49 # Maximum resident set size: 1704 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------