TSTP Solution File: RNG109+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG109+4 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 02:36:25 EDT 2024
% Result : Theorem 0.67s 0.58s
% Output : CNFRefutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 182 ( 64 equ)
% Maximal formula atoms : 33 ( 5 avg)
% Number of connectives : 208 ( 62 ~; 62 |; 68 &)
% ( 7 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 38 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( ( ! [X2] :
( aElementOf0(X2,slsdtgt0(xa))
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = X2 ) )
=> ( ! [X2] :
( aElementOf0(X2,slsdtgt0(xb))
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X2 ) )
=> ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ) ) )
& X1 != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2203,hypothesis,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = sz00 )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = xa )
& aElementOf0(xa,slsdtgt0(xa))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = sz00 )
& aElementOf0(sz00,slsdtgt0(xb))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = xb )
& aElementOf0(xb,slsdtgt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2203) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__2174,hypothesis,
( aSet0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
& aIdeal0(xI)
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xa,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xb,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,xI)
<=> ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 ) )
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2174) ).
fof(m__2110,hypothesis,
( xa != sz00
| xb != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2110) ).
fof(c_0_7,negated_conjecture,
~ ? [X1] :
( ( ! [X2] :
( aElementOf0(X2,slsdtgt0(xa))
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = X2 ) )
=> ( ! [X2] :
( aElementOf0(X2,slsdtgt0(xb))
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X2 ) )
=> ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ) ) )
& X1 != sz00 ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_8,negated_conjecture,
! [X143,X144,X146,X147,X148,X150,X151,X152,X153] :
( ( aElement0(esk32_2(X143,X144))
| ~ aElementOf0(X144,slsdtgt0(xa))
| X143 = sz00 )
& ( sdtasdt0(xa,esk32_2(X143,X144)) = X144
| ~ aElementOf0(X144,slsdtgt0(xa))
| X143 = sz00 )
& ( ~ aElement0(X147)
| sdtasdt0(xa,X147) != X146
| aElementOf0(X146,slsdtgt0(xa))
| X143 = sz00 )
& ( aElement0(esk33_2(X143,X148))
| ~ aElementOf0(X148,slsdtgt0(xb))
| X143 = sz00 )
& ( sdtasdt0(xb,esk33_2(X143,X148)) = X148
| ~ aElementOf0(X148,slsdtgt0(xb))
| X143 = sz00 )
& ( ~ aElement0(X151)
| sdtasdt0(xb,X151) != X150
| aElementOf0(X150,slsdtgt0(xb))
| X143 = sz00 )
& ( ~ aElementOf0(X152,slsdtgt0(xa))
| ~ aElementOf0(X153,slsdtgt0(xb))
| sdtpldt0(X152,X153) != X143
| X143 = sz00 )
& ( ~ aElementOf0(X143,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
| X143 = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])])]) ).
cnf(c_0_9,negated_conjecture,
( X3 = sz00
| ~ aElementOf0(X1,slsdtgt0(xa))
| ~ aElementOf0(X2,slsdtgt0(xb))
| sdtpldt0(X1,X2) != X3 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_10,hypothesis,
( aElement0(esk28_0)
& sdtasdt0(xa,esk28_0) = sz00
& aElementOf0(sz00,slsdtgt0(xa))
& aElement0(esk29_0)
& sdtasdt0(xa,esk29_0) = xa
& aElementOf0(xa,slsdtgt0(xa))
& aElement0(esk30_0)
& sdtasdt0(xb,esk30_0) = sz00
& aElementOf0(sz00,slsdtgt0(xb))
& aElement0(esk31_0)
& sdtasdt0(xb,esk31_0) = xb
& aElementOf0(xb,slsdtgt0(xb)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2203])]) ).
fof(c_0_11,plain,
! [X18] :
( ( sdtpldt0(X18,sz00) = X18
| ~ aElement0(X18) )
& ( X18 = sdtpldt0(sz00,X18)
| ~ aElement0(X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])])]) ).
cnf(c_0_12,negated_conjecture,
( sdtpldt0(X1,X2) = sz00
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
aElementOf0(xb,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
( sdtpldt0(X1,xb) = sz00
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_17,hypothesis,
aElementOf0(sz00,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X11,X12] :
( ~ aElement0(X11)
| ~ aElement0(X12)
| aElement0(sdtasdt0(X11,X12)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_19,hypothesis,
! [X122,X123,X124,X125,X127,X128,X129,X131,X132,X133,X136,X137,X138] :
( aSet0(xI)
& ( ~ aElementOf0(X123,xI)
| aElementOf0(sdtpldt0(X122,X123),xI)
| ~ aElementOf0(X122,xI) )
& ( ~ aElement0(X124)
| aElementOf0(sdtasdt0(X124,X122),xI)
| ~ aElementOf0(X122,xI) )
& aIdeal0(xI)
& ( aElement0(esk24_1(X125))
| ~ aElementOf0(X125,slsdtgt0(xa)) )
& ( sdtasdt0(xa,esk24_1(X125)) = X125
| ~ aElementOf0(X125,slsdtgt0(xa)) )
& ( ~ aElement0(X128)
| sdtasdt0(xa,X128) != X127
| aElementOf0(X127,slsdtgt0(xa)) )
& ( aElement0(esk25_1(X129))
| ~ aElementOf0(X129,slsdtgt0(xb)) )
& ( sdtasdt0(xb,esk25_1(X129)) = X129
| ~ aElementOf0(X129,slsdtgt0(xb)) )
& ( ~ aElement0(X132)
| sdtasdt0(xb,X132) != X131
| aElementOf0(X131,slsdtgt0(xb)) )
& ( aElementOf0(esk26_1(X133),slsdtgt0(xa))
| ~ aElementOf0(X133,xI) )
& ( aElementOf0(esk27_1(X133),slsdtgt0(xb))
| ~ aElementOf0(X133,xI) )
& ( sdtpldt0(esk26_1(X133),esk27_1(X133)) = X133
| ~ aElementOf0(X133,xI) )
& ( ~ aElementOf0(X137,slsdtgt0(xa))
| ~ aElementOf0(X138,slsdtgt0(xb))
| sdtpldt0(X137,X138) != X136
| aElementOf0(X136,xI) )
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2174])])])])])])]) ).
fof(c_0_20,hypothesis,
( xa != sz00
| xb != sz00 ),
inference(fof_simplification,[status(thm)],[m__2110]) ).
cnf(c_0_21,hypothesis,
sz00 = xb,
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])]) ).
cnf(c_0_22,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,hypothesis,
( sdtasdt0(xa,esk24_1(X1)) = X1
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_26,hypothesis,
( aElement0(esk24_1(X1))
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_27,hypothesis,
( xa != sz00
| xb != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_20]) ).
cnf(c_0_28,hypothesis,
( sdtpldt0(X1,xb) = xb
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(rw,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_29,plain,
( sdtpldt0(X1,xb) = X1
| ~ aElement0(X1) ),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_30,hypothesis,
( aElement0(X1)
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_31,hypothesis,
( xa != sz00
| xb != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,hypothesis,
( X1 = xb
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_33,hypothesis,
aElementOf0(xa,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,hypothesis,
xb != xa,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_21]),c_0_21])]) ).
cnf(c_0_35,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : RNG109+4 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n004.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 : Sat May 18 12:20:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/solver/bin/eprover --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.67/0.58 # Version: 3.1.0
% 0.67/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.67/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.67/0.58 # Starting sh5l with 300s (1) cores
% 0.67/0.58 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 8064 completed with status 0
% 0.67/0.58 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.67/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.58 # No SInE strategy applied
% 0.67/0.58 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.67/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.67/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.67/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.67/0.58 # Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.67/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 136s (1) cores
% 0.67/0.58 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.67/0.58 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8071 completed with status 0
% 0.67/0.58 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.67/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.58 # No SInE strategy applied
% 0.67/0.58 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.67/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.67/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.67/0.58 # Preprocessing time : 0.003 s
% 0.67/0.58 # Presaturation interreduction done
% 0.67/0.58
% 0.67/0.58 # Proof found!
% 0.67/0.58 # SZS status Theorem
% 0.67/0.58 # SZS output start CNFRefutation
% See solution above
% 0.67/0.58 # Parsed axioms : 44
% 0.67/0.58 # Removed by relevancy pruning/SinE : 0
% 0.67/0.58 # Initial clauses : 169
% 0.67/0.58 # Removed in clause preprocessing : 4
% 0.67/0.58 # Initial clauses in saturation : 165
% 0.67/0.58 # Processed clauses : 525
% 0.67/0.58 # ...of these trivial : 18
% 0.67/0.58 # ...subsumed : 66
% 0.67/0.58 # ...remaining for further processing : 441
% 0.67/0.58 # Other redundant clauses eliminated : 157
% 0.67/0.58 # Clauses deleted for lack of memory : 0
% 0.67/0.58 # Backward-subsumed : 5
% 0.67/0.58 # Backward-rewritten : 48
% 0.67/0.58 # Generated clauses : 1733
% 0.67/0.58 # ...of the previous two non-redundant : 1290
% 0.67/0.58 # ...aggressively subsumed : 0
% 0.67/0.58 # Contextual simplify-reflections : 5
% 0.67/0.58 # Paramodulations : 1578
% 0.67/0.58 # Factorizations : 0
% 0.67/0.58 # NegExts : 0
% 0.67/0.58 # Equation resolutions : 157
% 0.67/0.58 # Disequality decompositions : 0
% 0.67/0.58 # Total rewrite steps : 1524
% 0.67/0.58 # ...of those cached : 1475
% 0.67/0.58 # Propositional unsat checks : 0
% 0.67/0.58 # Propositional check models : 0
% 0.67/0.58 # Propositional check unsatisfiable : 0
% 0.67/0.58 # Propositional clauses : 0
% 0.67/0.58 # Propositional clauses after purity: 0
% 0.67/0.58 # Propositional unsat core size : 0
% 0.67/0.58 # Propositional preprocessing time : 0.000
% 0.67/0.58 # Propositional encoding time : 0.000
% 0.67/0.58 # Propositional solver time : 0.000
% 0.67/0.58 # Success case prop preproc time : 0.000
% 0.67/0.58 # Success case prop encoding time : 0.000
% 0.67/0.58 # Success case prop solver time : 0.000
% 0.67/0.58 # Current number of processed clauses : 206
% 0.67/0.58 # Positive orientable unit clauses : 44
% 0.67/0.58 # Positive unorientable unit clauses: 0
% 0.67/0.58 # Negative unit clauses : 2
% 0.67/0.58 # Non-unit-clauses : 160
% 0.67/0.58 # Current number of unprocessed clauses: 1011
% 0.67/0.58 # ...number of literals in the above : 4437
% 0.67/0.58 # Current number of archived formulas : 0
% 0.67/0.58 # Current number of archived clauses : 215
% 0.67/0.58 # Clause-clause subsumption calls (NU) : 5921
% 0.67/0.58 # Rec. Clause-clause subsumption calls : 1975
% 0.67/0.58 # Non-unit clause-clause subsumptions : 63
% 0.67/0.58 # Unit Clause-clause subsumption calls : 125
% 0.67/0.58 # Rewrite failures with RHS unbound : 0
% 0.67/0.58 # BW rewrite match attempts : 10
% 0.67/0.58 # BW rewrite match successes : 10
% 0.67/0.58 # Condensation attempts : 0
% 0.67/0.58 # Condensation successes : 0
% 0.67/0.58 # Termbank termtop insertions : 35804
% 0.67/0.58 # Search garbage collected termcells : 2605
% 0.67/0.58
% 0.67/0.58 # -------------------------------------------------
% 0.67/0.58 # User time : 0.060 s
% 0.67/0.58 # System time : 0.008 s
% 0.67/0.58 # Total time : 0.068 s
% 0.67/0.58 # Maximum resident set size: 2220 pages
% 0.67/0.58
% 0.67/0.58 # -------------------------------------------------
% 0.67/0.58 # User time : 0.260 s
% 0.67/0.58 # System time : 0.020 s
% 0.67/0.58 # Total time : 0.280 s
% 0.67/0.58 # Maximum resident set size: 1764 pages
% 0.67/0.58 % E---3.1 exiting
% 0.67/0.58 % E exiting
%------------------------------------------------------------------------------