TSTP Solution File: SYO113^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO113^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 08:44:41 EDT 2024
% Result : Theorem 0.22s 0.48s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 184 ( 0 equ; 0 cnn)
% Maximal formula atoms : 52 ( 4 avg)
% Number of connectives : 465 ( 76 ~; 85 |; 43 &; 242 @)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 5 con; 0-1 aty)
% Number of variables : 40 ( 0 ^ 40 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cNUMBER: $i > $o ).
thf(decl_23,type,
cODD: $i > $o ).
thf(decl_24,type,
cEVEN: $i > $o ).
thf(decl_25,type,
cS: $i > $i ).
thf(decl_26,type,
c0: $i ).
thf(decl_27,type,
epred1_0: $o ).
thf(decl_28,type,
esk1_0: $i ).
thf(decl_29,type,
esk2_0: $i ).
thf(cTHM350,conjecture,
( ( ( cEVEN @ c0 )
& ! [X1: $i] :
( ( cEVEN @ X1 )
=> ( cEVEN @ ( cS @ ( cS @ X1 ) ) ) )
& ( cODD @ ( cS @ c0 ) )
& ! [X1: $i] :
( ( cODD @ X1 )
=> ( cODD @ ( cS @ ( cS @ X1 ) ) ) )
& ( ( ( cNUMBER @ c0 )
& ( cNUMBER @ ( cS @ c0 ) )
& ! [X2: $i] :
( ( ( cNUMBER @ X2 )
& ( cNUMBER @ ( cS @ X2 ) ) )
=> ( ( cNUMBER @ ( cS @ X2 ) )
& ( cNUMBER @ ( cS @ ( cS @ X2 ) ) ) ) ) )
=> ! [X2: $i] :
( ( cNUMBER @ X2 )
& ( cNUMBER @ ( cS @ X2 ) ) ) )
& ! [X1: $i] :
( ( cNUMBER @ X1 )
<=> ( ( cEVEN @ X1 )
| ( cODD @ X1 ) ) ) )
=> ! [X1: $i] : ( cNUMBER @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM350) ).
thf(c_0_1,plain,
( epred1_0
<=> ( ( cEVEN @ c0 )
& ! [X1: $i] :
( ( cEVEN @ X1 )
=> ( cEVEN @ ( cS @ ( cS @ X1 ) ) ) )
& ( cODD @ ( cS @ c0 ) )
& ! [X1: $i] :
( ( cODD @ X1 )
=> ( cODD @ ( cS @ ( cS @ X1 ) ) ) )
& ( ( ( cNUMBER @ c0 )
& ( cNUMBER @ ( cS @ c0 ) )
& ! [X2: $i] :
( ( ( cNUMBER @ X2 )
& ( cNUMBER @ ( cS @ X2 ) ) )
=> ( ( cNUMBER @ ( cS @ X2 ) )
& ( cNUMBER @ ( cS @ ( cS @ X2 ) ) ) ) ) )
=> ! [X2: $i] :
( ( cNUMBER @ X2 )
& ( cNUMBER @ ( cS @ X2 ) ) ) )
& ! [X1: $i] :
( ( cNUMBER @ X1 )
<=> ( ( cEVEN @ X1 )
| ( cODD @ X1 ) ) ) ) ),
introduced(definition) ).
thf(c_0_2,plain,
( epred1_0
=> ( ( cEVEN @ c0 )
& ! [X1: $i] :
( ( cEVEN @ X1 )
=> ( cEVEN @ ( cS @ ( cS @ X1 ) ) ) )
& ( cODD @ ( cS @ c0 ) )
& ! [X1: $i] :
( ( cODD @ X1 )
=> ( cODD @ ( cS @ ( cS @ X1 ) ) ) )
& ( ( ( cNUMBER @ c0 )
& ( cNUMBER @ ( cS @ c0 ) )
& ! [X2: $i] :
( ( ( cNUMBER @ X2 )
& ( cNUMBER @ ( cS @ X2 ) ) )
=> ( ( cNUMBER @ ( cS @ X2 ) )
& ( cNUMBER @ ( cS @ ( cS @ X2 ) ) ) ) ) )
=> ! [X2: $i] :
( ( cNUMBER @ X2 )
& ( cNUMBER @ ( cS @ X2 ) ) ) )
& ! [X1: $i] :
( ( cNUMBER @ X1 )
<=> ( ( cEVEN @ X1 )
| ( cODD @ X1 ) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
~ ( epred1_0
=> ! [X1: $i] : ( cNUMBER @ X1 ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM350]),c_0_1]) ).
thf(c_0_4,plain,
! [X10: $i,X11: $i,X13: $i,X14: $i] :
( ( ( cEVEN @ c0 )
| ~ epred1_0 )
& ( ~ ( cEVEN @ X10 )
| ( cEVEN @ ( cS @ ( cS @ X10 ) ) )
| ~ epred1_0 )
& ( ( cODD @ ( cS @ c0 ) )
| ~ epred1_0 )
& ( ~ ( cODD @ X11 )
| ( cODD @ ( cS @ ( cS @ X11 ) ) )
| ~ epred1_0 )
& ( ( cNUMBER @ X13 )
| ( cNUMBER @ esk2_0 )
| ~ ( cNUMBER @ c0 )
| ~ ( cNUMBER @ ( cS @ c0 ) )
| ~ epred1_0 )
& ( ( cNUMBER @ ( cS @ X13 ) )
| ( cNUMBER @ esk2_0 )
| ~ ( cNUMBER @ c0 )
| ~ ( cNUMBER @ ( cS @ c0 ) )
| ~ epred1_0 )
& ( ( cNUMBER @ X13 )
| ( cNUMBER @ ( cS @ esk2_0 ) )
| ~ ( cNUMBER @ c0 )
| ~ ( cNUMBER @ ( cS @ c0 ) )
| ~ epred1_0 )
& ( ( cNUMBER @ ( cS @ X13 ) )
| ( cNUMBER @ ( cS @ esk2_0 ) )
| ~ ( cNUMBER @ c0 )
| ~ ( cNUMBER @ ( cS @ c0 ) )
| ~ epred1_0 )
& ( ( cNUMBER @ X13 )
| ~ ( cNUMBER @ ( cS @ esk2_0 ) )
| ~ ( cNUMBER @ ( cS @ ( cS @ esk2_0 ) ) )
| ~ ( cNUMBER @ c0 )
| ~ ( cNUMBER @ ( cS @ c0 ) )
| ~ epred1_0 )
& ( ( cNUMBER @ ( cS @ X13 ) )
| ~ ( cNUMBER @ ( cS @ esk2_0 ) )
| ~ ( cNUMBER @ ( cS @ ( cS @ esk2_0 ) ) )
| ~ ( cNUMBER @ c0 )
| ~ ( cNUMBER @ ( cS @ c0 ) )
| ~ epred1_0 )
& ( ~ ( cNUMBER @ X14 )
| ( cEVEN @ X14 )
| ( cODD @ X14 )
| ~ epred1_0 )
& ( ~ ( cEVEN @ X14 )
| ( cNUMBER @ X14 )
| ~ epred1_0 )
& ( ~ ( cODD @ X14 )
| ( cNUMBER @ X14 )
| ~ epred1_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_2])])])])])]) ).
thf(c_0_5,negated_conjecture,
( epred1_0
& ~ ( cNUMBER @ esk1_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_6,plain,
! [X1: $i] :
( ( cNUMBER @ X1 )
| ( cNUMBER @ ( cS @ esk2_0 ) )
| ~ ( cNUMBER @ c0 )
| ~ ( cNUMBER @ ( cS @ c0 ) )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X1: $i] :
( ( cNUMBER @ X1 )
| ~ ( cODD @ X1 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_9,plain,
( ( cODD @ ( cS @ c0 ) )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_10,plain,
! [X1: $i] :
( ( cNUMBER @ X1 )
| ~ ( cEVEN @ X1 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,plain,
( ( cEVEN @ c0 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,plain,
! [X1: $i] :
( ( cODD @ ( cS @ ( cS @ X1 ) ) )
| ~ ( cODD @ X1 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_13,plain,
! [X1: $i] :
( ( cEVEN @ ( cS @ ( cS @ X1 ) ) )
| ~ ( cEVEN @ X1 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_14,plain,
! [X1: $i] :
( ( cNUMBER @ X1 )
| ~ ( cNUMBER @ ( cS @ esk2_0 ) )
| ~ ( cNUMBER @ ( cS @ ( cS @ esk2_0 ) ) )
| ~ ( cNUMBER @ c0 )
| ~ ( cNUMBER @ ( cS @ c0 ) )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_15,plain,
( ( cNUMBER @ ( cS @ esk2_0 ) )
| ~ ( cNUMBER @ ( cS @ c0 ) )
| ~ ( cNUMBER @ c0 ) ),
inference(condense,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])])]) ).
thf(c_0_16,plain,
! [X1: $i] :
( ( cNUMBER @ X1 )
| ~ ( cODD @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).
thf(c_0_17,plain,
cODD @ ( cS @ c0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_7])]) ).
thf(c_0_18,plain,
! [X1: $i] :
( ( cNUMBER @ X1 )
| ~ ( cEVEN @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7])]) ).
thf(c_0_19,plain,
cEVEN @ c0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7])]) ).
thf(c_0_20,plain,
! [X1: $i] :
( ( cODD @ ( cS @ ( cS @ X1 ) ) )
| ~ ( cODD @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_7])]) ).
thf(c_0_21,plain,
! [X1: $i] :
( ( cEVEN @ X1 )
| ( cODD @ X1 )
| ~ ( cNUMBER @ X1 )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_22,plain,
! [X1: $i] :
( ( cEVEN @ ( cS @ ( cS @ X1 ) ) )
| ~ ( cEVEN @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_7])]) ).
thf(c_0_23,plain,
! [X1: $i] :
( ( cNUMBER @ X1 )
| ( cNUMBER @ esk2_0 )
| ~ ( cNUMBER @ c0 )
| ~ ( cNUMBER @ ( cS @ c0 ) )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_24,plain,
! [X1: $i] :
( ( cNUMBER @ X1 )
| ~ ( cNUMBER @ ( cS @ ( cS @ esk2_0 ) ) )
| ~ ( cNUMBER @ ( cS @ c0 ) )
| ~ ( cNUMBER @ c0 ) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_7])]),c_0_15]) ).
thf(c_0_25,plain,
cNUMBER @ ( cS @ c0 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_26,plain,
cNUMBER @ c0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_27,plain,
! [X1: $i] :
( ( cNUMBER @ ( cS @ ( cS @ X1 ) ) )
| ~ ( cODD @ X1 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
thf(c_0_28,plain,
! [X1: $i] :
( ( cEVEN @ X1 )
| ( cODD @ X1 )
| ~ ( cNUMBER @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_7])]) ).
thf(c_0_29,plain,
! [X1: $i] :
( ( cNUMBER @ ( cS @ ( cS @ X1 ) ) )
| ~ ( cEVEN @ X1 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
thf(c_0_30,plain,
( ( cNUMBER @ esk2_0 )
| ~ ( cNUMBER @ ( cS @ c0 ) )
| ~ ( cNUMBER @ c0 ) ),
inference(condense,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_7])])]) ).
thf(c_0_31,plain,
! [X1: $i] :
( ( cNUMBER @ X1 )
| ~ ( cNUMBER @ ( cS @ ( cS @ esk2_0 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
thf(c_0_32,plain,
! [X1: $i] :
( ( cNUMBER @ ( cS @ ( cS @ X1 ) ) )
| ~ ( cNUMBER @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
thf(c_0_33,plain,
cNUMBER @ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_25]),c_0_26])]) ).
thf(c_0_34,negated_conjecture,
~ ( cNUMBER @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_35,plain,
! [X1: $i] : ( cNUMBER @ X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
thf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO113^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n022.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 10:22:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.47 Running higher-order theorem proving
% 0.22/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.22/0.48 # Version: 3.1.0-ho
% 0.22/0.48 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.22/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.48 # Starting full_lambda_5 with 300s (1) cores
% 0.22/0.48 # Starting new_ho_10_unif with 300s (1) cores
% 0.22/0.48 # new_bool_1 with pid 2148 completed with status 0
% 0.22/0.48 # Result found by new_bool_1
% 0.22/0.48 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.22/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.48 # Search class: HGUNF-FFSF11-SFFFFFNN
% 0.22/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.48 # Starting new_ho_10 with 181s (1) cores
% 0.22/0.48 # new_ho_10 with pid 2152 completed with status 0
% 0.22/0.48 # Result found by new_ho_10
% 0.22/0.48 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.22/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.48 # Search class: HGUNF-FFSF11-SFFFFFNN
% 0.22/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.48 # Starting new_ho_10 with 181s (1) cores
% 0.22/0.48 # Preprocessing time : 0.001 s
% 0.22/0.48 # Presaturation interreduction done
% 0.22/0.48
% 0.22/0.48 # Proof found!
% 0.22/0.48 # SZS status Theorem
% 0.22/0.48 # SZS output start CNFRefutation
% See solution above
% 0.22/0.48 # Parsed axioms : 6
% 0.22/0.48 # Removed by relevancy pruning/SinE : 5
% 0.22/0.48 # Initial clauses : 15
% 0.22/0.48 # Removed in clause preprocessing : 0
% 0.22/0.48 # Initial clauses in saturation : 15
% 0.22/0.48 # Processed clauses : 35
% 0.22/0.48 # ...of these trivial : 0
% 0.22/0.48 # ...subsumed : 3
% 0.22/0.48 # ...remaining for further processing : 32
% 0.22/0.48 # Other redundant clauses eliminated : 0
% 0.22/0.48 # Clauses deleted for lack of memory : 0
% 0.22/0.48 # Backward-subsumed : 0
% 0.22/0.48 # Backward-rewritten : 14
% 0.22/0.48 # Generated clauses : 10
% 0.22/0.48 # ...of the previous two non-redundant : 10
% 0.22/0.48 # ...aggressively subsumed : 0
% 0.22/0.48 # Contextual simplify-reflections : 2
% 0.22/0.48 # Paramodulations : 10
% 0.22/0.48 # Factorizations : 0
% 0.22/0.48 # NegExts : 0
% 0.22/0.48 # Equation resolutions : 0
% 0.22/0.48 # Disequality decompositions : 0
% 0.22/0.48 # Total rewrite steps : 35
% 0.22/0.48 # ...of those cached : 22
% 0.22/0.48 # Propositional unsat checks : 0
% 0.22/0.48 # Propositional check models : 0
% 0.22/0.48 # Propositional check unsatisfiable : 0
% 0.22/0.48 # Propositional clauses : 0
% 0.22/0.48 # Propositional clauses after purity: 0
% 0.22/0.48 # Propositional unsat core size : 0
% 0.22/0.48 # Propositional preprocessing time : 0.000
% 0.22/0.48 # Propositional encoding time : 0.000
% 0.22/0.48 # Propositional solver time : 0.000
% 0.22/0.48 # Success case prop preproc time : 0.000
% 0.22/0.48 # Success case prop encoding time : 0.000
% 0.22/0.48 # Success case prop solver time : 0.000
% 0.22/0.48 # Current number of processed clauses : 6
% 0.22/0.48 # Positive orientable unit clauses : 4
% 0.22/0.48 # Positive unorientable unit clauses: 0
% 0.22/0.48 # Negative unit clauses : 0
% 0.22/0.48 # Non-unit-clauses : 2
% 0.22/0.48 # Current number of unprocessed clauses: 1
% 0.22/0.48 # ...number of literals in the above : 2
% 0.22/0.48 # Current number of archived formulas : 0
% 0.22/0.48 # Current number of archived clauses : 26
% 0.22/0.48 # Clause-clause subsumption calls (NU) : 17
% 0.22/0.48 # Rec. Clause-clause subsumption calls : 16
% 0.22/0.48 # Non-unit clause-clause subsumptions : 8
% 0.22/0.48 # Unit Clause-clause subsumption calls : 0
% 0.22/0.48 # Rewrite failures with RHS unbound : 0
% 0.22/0.48 # BW rewrite match attempts : 11
% 0.22/0.48 # BW rewrite match successes : 9
% 0.22/0.48 # Condensation attempts : 38
% 0.22/0.48 # Condensation successes : 3
% 0.22/0.48 # Termbank termtop insertions : 1407
% 0.22/0.48 # Search garbage collected termcells : 264
% 0.22/0.48
% 0.22/0.48 # -------------------------------------------------
% 0.22/0.48 # User time : 0.004 s
% 0.22/0.48 # System time : 0.002 s
% 0.22/0.48 # Total time : 0.006 s
% 0.22/0.48 # Maximum resident set size: 1784 pages
% 0.22/0.48
% 0.22/0.48 # -------------------------------------------------
% 0.22/0.48 # User time : 0.004 s
% 0.22/0.48 # System time : 0.005 s
% 0.22/0.48 # Total time : 0.009 s
% 0.22/0.48 # Maximum resident set size: 1700 pages
% 0.22/0.48 % E---3.1 exiting
% 0.22/0.49 % E exiting
%------------------------------------------------------------------------------