TSTP Solution File: RNG125+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG125+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:15:52 EDT 2023
% Result : ContradictoryAxioms 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 15 unt; 0 def)
% Number of atoms : 188 ( 38 equ)
% Maximal formula atoms : 52 ( 4 avg)
% Number of connectives : 251 ( 105 ~; 100 |; 34 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 5 con; 0-4 aty)
% Number of variables : 50 ( 0 sgn; 35 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2273,hypothesis,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/tmp/tmp.25UlVSE5oK/E---3.1_28782.p',m__2273) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.25UlVSE5oK/E---3.1_28782.p',mEOfElem) ).
fof(m__2174,hypothesis,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox/tmp/tmp.25UlVSE5oK/E---3.1_28782.p',m__2174) ).
fof(mDefSSum,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aSet0(X2) )
=> ! [X3] :
( X3 = sdtpldt1(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ? [X5,X6] :
( aElementOf0(X5,X1)
& aElementOf0(X6,X2)
& sdtpldt0(X5,X6) = X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.25UlVSE5oK/E---3.1_28782.p',mDefSSum) ).
fof(mDefPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( aElement0(X4)
& sdtasdt0(X1,X4) = X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.25UlVSE5oK/E---3.1_28782.p',mDefPrIdeal) ).
fof(mDefDvs,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aElement0(X2)
& doDivides0(X2,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.25UlVSE5oK/E---3.1_28782.p',mDefDvs) ).
fof(m__2479,hypothesis,
~ ~ doDivides0(xu,xa),
file('/export/starexec/sandbox/tmp/tmp.25UlVSE5oK/E---3.1_28782.p',m__2479) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox/tmp/tmp.25UlVSE5oK/E---3.1_28782.p',m__2091) ).
fof(m__2612,hypothesis,
~ ~ doDivides0(xu,xb),
file('/export/starexec/sandbox/tmp/tmp.25UlVSE5oK/E---3.1_28782.p',m__2612) ).
fof(m__2383,hypothesis,
~ ( aDivisorOf0(xu,xa)
& aDivisorOf0(xu,xb) ),
file('/export/starexec/sandbox/tmp/tmp.25UlVSE5oK/E---3.1_28782.p',m__2383) ).
fof(c_0_10,hypothesis,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
fof(c_0_11,hypothesis,
! [X112] :
( aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X112,xI)
| X112 = sz00
| ~ iLess0(sbrdtbr0(X112),sbrdtbr0(xu)) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_12,plain,
! [X32,X33] :
( ~ aSet0(X32)
| ~ aElementOf0(X33,X32)
| aElement0(X33) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
cnf(c_0_13,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,hypothesis,
xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_15,plain,
! [X38,X39,X40,X41,X44,X45,X46,X47,X49,X50] :
( ( aSet0(X40)
| X40 != sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( aElementOf0(esk3_4(X38,X39,X40,X41),X38)
| ~ aElementOf0(X41,X40)
| X40 != sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( aElementOf0(esk4_4(X38,X39,X40,X41),X39)
| ~ aElementOf0(X41,X40)
| X40 != sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( sdtpldt0(esk3_4(X38,X39,X40,X41),esk4_4(X38,X39,X40,X41)) = X41
| ~ aElementOf0(X41,X40)
| X40 != sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( ~ aElementOf0(X45,X38)
| ~ aElementOf0(X46,X39)
| sdtpldt0(X45,X46) != X44
| aElementOf0(X44,X40)
| X40 != sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( ~ aElementOf0(esk5_3(X38,X39,X47),X47)
| ~ aElementOf0(X49,X38)
| ~ aElementOf0(X50,X39)
| sdtpldt0(X49,X50) != esk5_3(X38,X39,X47)
| ~ aSet0(X47)
| X47 = sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( aElementOf0(esk6_3(X38,X39,X47),X38)
| aElementOf0(esk5_3(X38,X39,X47),X47)
| ~ aSet0(X47)
| X47 = sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( aElementOf0(esk7_3(X38,X39,X47),X39)
| aElementOf0(esk5_3(X38,X39,X47),X47)
| ~ aSet0(X47)
| X47 = sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) )
& ( sdtpldt0(esk6_3(X38,X39,X47),esk7_3(X38,X39,X47)) = esk5_3(X38,X39,X47)
| aElementOf0(esk5_3(X38,X39,X47),X47)
| ~ aSet0(X47)
| X47 = sdtpldt1(X38,X39)
| ~ aSet0(X38)
| ~ aSet0(X39) ) ),
inference(distribute,[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)],[mDefSSum])])])])])]) ).
cnf(c_0_16,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xu,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( aSet0(X1)
| X1 != sdtpldt1(X2,X3)
| ~ aSet0(X2)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X100,X101,X102,X104,X105,X106,X108] :
( ( aSet0(X101)
| X101 != slsdtgt0(X100)
| ~ aElement0(X100) )
& ( aElement0(esk18_3(X100,X101,X102))
| ~ aElementOf0(X102,X101)
| X101 != slsdtgt0(X100)
| ~ aElement0(X100) )
& ( sdtasdt0(X100,esk18_3(X100,X101,X102)) = X102
| ~ aElementOf0(X102,X101)
| X101 != slsdtgt0(X100)
| ~ aElement0(X100) )
& ( ~ aElement0(X105)
| sdtasdt0(X100,X105) != X104
| aElementOf0(X104,X101)
| X101 != slsdtgt0(X100)
| ~ aElement0(X100) )
& ( ~ aElementOf0(esk19_2(X100,X106),X106)
| ~ aElement0(X108)
| sdtasdt0(X100,X108) != esk19_2(X100,X106)
| ~ aSet0(X106)
| X106 = slsdtgt0(X100)
| ~ aElement0(X100) )
& ( aElement0(esk20_2(X100,X106))
| aElementOf0(esk19_2(X100,X106),X106)
| ~ aSet0(X106)
| X106 = slsdtgt0(X100)
| ~ aElement0(X100) )
& ( sdtasdt0(X100,esk20_2(X100,X106)) = esk19_2(X100,X106)
| aElementOf0(esk19_2(X100,X106),X106)
| ~ aSet0(X106)
| X106 = slsdtgt0(X100)
| ~ aElement0(X100) ) ),
inference(distribute,[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)],[mDefPrIdeal])])])])])]) ).
cnf(c_0_20,hypothesis,
( aElement0(xu)
| ~ aSet0(sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( aSet0(sdtpldt1(X1,X2))
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( aSet0(X1)
| X1 != slsdtgt0(X2)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_23,plain,
! [X90,X91] :
( ( aElement0(X91)
| ~ aDivisorOf0(X91,X90)
| ~ aElement0(X90) )
& ( doDivides0(X91,X90)
| ~ aDivisorOf0(X91,X90)
| ~ aElement0(X90) )
& ( ~ aElement0(X91)
| ~ doDivides0(X91,X90)
| aDivisorOf0(X91,X90)
| ~ aElement0(X90) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDvs])])])]) ).
fof(c_0_24,hypothesis,
doDivides0(xu,xa),
inference(fof_simplification,[status(thm)],[m__2479]) ).
cnf(c_0_25,hypothesis,
( aElement0(xu)
| ~ aSet0(slsdtgt0(xb))
| ~ aSet0(slsdtgt0(xa)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( aSet0(slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_27,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_28,plain,
( aDivisorOf0(X1,X2)
| ~ aElement0(X1)
| ~ doDivides0(X1,X2)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,hypothesis,
doDivides0(xu,xa),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_31,hypothesis,
( aElement0(xu)
| ~ aSet0(slsdtgt0(xa)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
fof(c_0_32,hypothesis,
doDivides0(xu,xb),
inference(fof_simplification,[status(thm)],[m__2612]) ).
fof(c_0_33,hypothesis,
( ~ aDivisorOf0(xu,xa)
| ~ aDivisorOf0(xu,xb) ),
inference(fof_nnf,[status(thm)],[m__2383]) ).
cnf(c_0_34,hypothesis,
( aDivisorOf0(xu,xa)
| ~ aElement0(xu) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_30])]) ).
cnf(c_0_36,hypothesis,
doDivides0(xu,xb),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,hypothesis,
( ~ aDivisorOf0(xu,xa)
| ~ aDivisorOf0(xu,xb) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,hypothesis,
aDivisorOf0(xu,xa),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_39,hypothesis,
( aDivisorOf0(xu,xb)
| ~ aElement0(xu) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_36]),c_0_27])]) ).
cnf(c_0_40,hypothesis,
~ aDivisorOf0(xu,xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_41,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_35])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : RNG125+1 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n024.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 19:36:56 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.15/0.43 Running first-order model finding
% 0.15/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.25UlVSE5oK/E---3.1_28782.p
% 0.15/0.45 # Version: 3.1pre001
% 0.15/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # sh5l with pid 28862 completed with status 8
% 0.15/0.45 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 28859 completed with status 0
% 0.15/0.45 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 # No SInE strategy applied
% 0.15/0.45 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.15/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 811s (1) cores
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.45 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.15/0.45 # G-E--_208_B07_F1_SE_CS_SP_PS_S4d with pid 28870 completed with status 0
% 0.15/0.45 # Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S4d
% 0.15/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 # No SInE strategy applied
% 0.15/0.45 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.15/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 811s (1) cores
% 0.15/0.45 # Preprocessing time : 0.002 s
% 0.15/0.45 # Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 # Proof found!
% 0.15/0.45 # SZS status ContradictoryAxioms
% 0.15/0.45 # SZS output start CNFRefutation
% See solution above
% 0.15/0.46 # Parsed axioms : 50
% 0.15/0.46 # Removed by relevancy pruning/SinE : 0
% 0.15/0.46 # Initial clauses : 115
% 0.15/0.46 # Removed in clause preprocessing : 5
% 0.15/0.46 # Initial clauses in saturation : 110
% 0.15/0.46 # Processed clauses : 202
% 0.15/0.46 # ...of these trivial : 2
% 0.15/0.46 # ...subsumed : 1
% 0.15/0.46 # ...remaining for further processing : 198
% 0.15/0.46 # Other redundant clauses eliminated : 16
% 0.15/0.46 # Clauses deleted for lack of memory : 0
% 0.15/0.46 # Backward-subsumed : 1
% 0.15/0.46 # Backward-rewritten : 8
% 0.15/0.46 # Generated clauses : 67
% 0.15/0.46 # ...of the previous two non-redundant : 52
% 0.15/0.46 # ...aggressively subsumed : 0
% 0.15/0.46 # Contextual simplify-reflections : 1
% 0.15/0.46 # Paramodulations : 53
% 0.15/0.46 # Factorizations : 0
% 0.15/0.46 # NegExts : 0
% 0.15/0.46 # Equation resolutions : 16
% 0.15/0.46 # Total rewrite steps : 71
% 0.15/0.46 # Propositional unsat checks : 0
% 0.15/0.46 # Propositional check models : 0
% 0.15/0.46 # Propositional check unsatisfiable : 0
% 0.15/0.46 # Propositional clauses : 0
% 0.15/0.46 # Propositional clauses after purity: 0
% 0.15/0.46 # Propositional unsat core size : 0
% 0.15/0.46 # Propositional preprocessing time : 0.000
% 0.15/0.46 # Propositional encoding time : 0.000
% 0.15/0.46 # Propositional solver time : 0.000
% 0.15/0.46 # Success case prop preproc time : 0.000
% 0.15/0.46 # Success case prop encoding time : 0.000
% 0.15/0.46 # Success case prop solver time : 0.000
% 0.15/0.46 # Current number of processed clauses : 65
% 0.15/0.46 # Positive orientable unit clauses : 27
% 0.15/0.46 # Positive unorientable unit clauses: 0
% 0.15/0.46 # Negative unit clauses : 4
% 0.15/0.46 # Non-unit-clauses : 34
% 0.15/0.46 # Current number of unprocessed clauses: 70
% 0.15/0.46 # ...number of literals in the above : 297
% 0.15/0.46 # Current number of archived formulas : 0
% 0.15/0.46 # Current number of archived clauses : 119
% 0.15/0.46 # Clause-clause subsumption calls (NU) : 1664
% 0.15/0.46 # Rec. Clause-clause subsumption calls : 431
% 0.15/0.46 # Non-unit clause-clause subsumptions : 3
% 0.15/0.46 # Unit Clause-clause subsumption calls : 5
% 0.15/0.46 # Rewrite failures with RHS unbound : 0
% 0.15/0.46 # BW rewrite match attempts : 4
% 0.15/0.46 # BW rewrite match successes : 4
% 0.15/0.46 # Condensation attempts : 0
% 0.15/0.46 # Condensation successes : 0
% 0.15/0.46 # Termbank termtop insertions : 8551
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.015 s
% 0.15/0.46 # System time : 0.005 s
% 0.15/0.46 # Total time : 0.019 s
% 0.15/0.46 # Maximum resident set size: 2032 pages
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.074 s
% 0.15/0.46 # System time : 0.017 s
% 0.15/0.46 # Total time : 0.090 s
% 0.15/0.46 # Maximum resident set size: 1740 pages
% 0.15/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------