TSTP Solution File: NUM543+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM543+2 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:07:38 EDT 2023
% Result : Theorem 11.39s 1.89s
% Output : CNFRefutation 11.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 8 unt; 0 def)
% Number of atoms : 169 ( 29 equ)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 218 ( 89 ~; 84 |; 31 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 2 sgn; 26 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,szNzAzT0)
& ( ( aSet0(slbdtrb0(X1))
& ! [X2] :
( aElementOf0(X2,slbdtrb0(X1))
<=> ( aElementOf0(X2,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X2),X1) ) ) )
=> ( ! [X2] :
( aElementOf0(X2,xS)
=> aElementOf0(X2,slbdtrb0(X1)) )
| aSubsetOf0(xS,slbdtrb0(X1)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.62pkGWxwFk/E---3.1_32631.p',m__) ).
fof(mDefMax,axiom,
! [X1] :
( ( aSubsetOf0(X1,szNzAzT0)
& isFinite0(X1)
& X1 != slcrc0 )
=> ! [X2] :
( X2 = szmzazxdt0(X1)
<=> ( aElementOf0(X2,X1)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X3,X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.62pkGWxwFk/E---3.1_32631.p',mDefMax) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.62pkGWxwFk/E---3.1_32631.p',mDefEmp) ).
fof(mSuccLess,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X1,X2)
<=> sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.62pkGWxwFk/E---3.1_32631.p',mSuccLess) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
& szszuzczcdt0(X1) != sz00 ) ),
file('/export/starexec/sandbox/tmp/tmp.62pkGWxwFk/E---3.1_32631.p',mSuccNum) ).
fof(m__1986,hypothesis,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isFinite0(xS) ),
file('/export/starexec/sandbox/tmp/tmp.62pkGWxwFk/E---3.1_32631.p',m__1986) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmp.62pkGWxwFk/E---3.1_32631.p',mZeroNum) ).
fof(c_0_7,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,szNzAzT0)
& ( ( aSet0(slbdtrb0(X1))
& ! [X2] :
( aElementOf0(X2,slbdtrb0(X1))
<=> ( aElementOf0(X2,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X2),X1) ) ) )
=> ( ! [X2] :
( aElementOf0(X2,xS)
=> aElementOf0(X2,slbdtrb0(X1)) )
| aSubsetOf0(xS,slbdtrb0(X1)) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,plain,
! [X89,X90,X91,X92] :
( ( aElementOf0(X90,X89)
| X90 != szmzazxdt0(X89)
| ~ aSubsetOf0(X89,szNzAzT0)
| ~ isFinite0(X89)
| X89 = slcrc0 )
& ( ~ aElementOf0(X91,X89)
| sdtlseqdt0(X91,X90)
| X90 != szmzazxdt0(X89)
| ~ aSubsetOf0(X89,szNzAzT0)
| ~ isFinite0(X89)
| X89 = slcrc0 )
& ( aElementOf0(esk8_2(X89,X92),X89)
| ~ aElementOf0(X92,X89)
| X92 = szmzazxdt0(X89)
| ~ aSubsetOf0(X89,szNzAzT0)
| ~ isFinite0(X89)
| X89 = slcrc0 )
& ( ~ sdtlseqdt0(esk8_2(X89,X92),X92)
| ~ aElementOf0(X92,X89)
| X92 = szmzazxdt0(X89)
| ~ aSubsetOf0(X89,szNzAzT0)
| ~ isFinite0(X89)
| X89 = slcrc0 ) ),
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)],[mDefMax])])])])])]) ).
fof(c_0_9,plain,
! [X7,X8,X9] :
( ( aSet0(X7)
| X7 != slcrc0 )
& ( ~ aElementOf0(X8,X7)
| X7 != slcrc0 )
& ( ~ aSet0(X9)
| aElementOf0(esk1_1(X9),X9)
| X9 = slcrc0 ) ),
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)],[mDefEmp])])])])])]) ).
fof(c_0_10,negated_conjecture,
! [X108,X109,X110] :
( ( aSet0(slbdtrb0(X108))
| ~ aElementOf0(X108,szNzAzT0) )
& ( aElementOf0(X109,szNzAzT0)
| ~ aElementOf0(X109,slbdtrb0(X108))
| ~ aElementOf0(X108,szNzAzT0) )
& ( sdtlseqdt0(szszuzczcdt0(X109),X108)
| ~ aElementOf0(X109,slbdtrb0(X108))
| ~ aElementOf0(X108,szNzAzT0) )
& ( ~ aElementOf0(X110,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X110),X108)
| aElementOf0(X110,slbdtrb0(X108))
| ~ aElementOf0(X108,szNzAzT0) )
& ( aElementOf0(esk10_1(X108),xS)
| ~ aElementOf0(X108,szNzAzT0) )
& ( ~ aElementOf0(esk10_1(X108),slbdtrb0(X108))
| ~ aElementOf0(X108,szNzAzT0) )
& ( ~ aSubsetOf0(xS,slbdtrb0(X108))
| ~ aElementOf0(X108,szNzAzT0) ) ),
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)],[c_0_7])])])])])]) ).
fof(c_0_11,plain,
! [X60,X61] :
( ( ~ sdtlseqdt0(X60,X61)
| sdtlseqdt0(szszuzczcdt0(X60),szszuzczcdt0(X61))
| ~ aElementOf0(X60,szNzAzT0)
| ~ aElementOf0(X61,szNzAzT0) )
& ( ~ sdtlseqdt0(szszuzczcdt0(X60),szszuzczcdt0(X61))
| sdtlseqdt0(X60,X61)
| ~ aElementOf0(X60,szNzAzT0)
| ~ aElementOf0(X61,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccLess])])]) ).
fof(c_0_12,plain,
! [X52] :
( ( aElementOf0(szszuzczcdt0(X52),szNzAzT0)
| ~ aElementOf0(X52,szNzAzT0) )
& ( szszuzczcdt0(X52) != sz00
| ~ aElementOf0(X52,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccNum])])]) ).
cnf(c_0_13,plain,
( sdtlseqdt0(X1,X3)
| X2 = slcrc0
| ~ aElementOf0(X1,X2)
| X3 != szmzazxdt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ aElementOf0(X1,X2)
| X2 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,hypothesis,
! [X107] :
( aSet0(xS)
& ( ~ aElementOf0(X107,xS)
| aElementOf0(X107,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isFinite0(xS) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1986])])]) ).
cnf(c_0_16,negated_conjecture,
( aElementOf0(esk10_1(X1),xS)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( aElementOf0(X1,slbdtrb0(X2))
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X2)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2))
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( sdtlseqdt0(X1,X2)
| X2 != szmzazxdt0(X3)
| ~ aSubsetOf0(X3,szNzAzT0)
| ~ isFinite0(X3)
| ~ aElementOf0(X1,X3) ),
inference(csr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,hypothesis,
isFinite0(xS),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( xS != slcrc0
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_24,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_25,negated_conjecture,
( ~ aElementOf0(esk10_1(X1),slbdtrb0(X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,negated_conjecture,
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(X2)))
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_27,hypothesis,
( sdtlseqdt0(X1,X2)
| X2 != szmzazxdt0(xS)
| ~ aElementOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_28,plain,
( aElementOf0(X1,X2)
| X2 = slcrc0
| X1 != szmzazxdt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
xS != slcrc0,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ sdtlseqdt0(esk10_1(szszuzczcdt0(X1)),X1)
| ~ aElementOf0(esk10_1(szszuzczcdt0(X1)),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_19]) ).
cnf(c_0_31,negated_conjecture,
( sdtlseqdt0(esk10_1(X1),X2)
| X2 != szmzazxdt0(xS)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_32,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_33,hypothesis,
( aElementOf0(X1,xS)
| X1 != szmzazxdt0(xS) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_21]),c_0_22])]),c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( X1 != szmzazxdt0(xS)
| ~ aElementOf0(esk10_1(szszuzczcdt0(X1)),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19]) ).
cnf(c_0_35,hypothesis,
( aElementOf0(esk10_1(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_32,c_0_16]) ).
cnf(c_0_36,hypothesis,
aElementOf0(szmzazxdt0(xS),xS),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,hypothesis,
( X1 != szmzazxdt0(xS)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_19]) ).
cnf(c_0_38,hypothesis,
aElementOf0(szmzazxdt0(xS),szNzAzT0),
inference(spm,[status(thm)],[c_0_32,c_0_36]) ).
cnf(c_0_39,hypothesis,
$false,
inference(spm,[status(thm)],[c_0_37,c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM543+2 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 14:32:24 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 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.62pkGWxwFk/E---3.1_32631.p
% 11.39/1.89 # Version: 3.1pre001
% 11.39/1.89 # Preprocessing class: FSLSSMSSSSSNFFN.
% 11.39/1.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.39/1.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.39/1.89 # Starting new_bool_3 with 300s (1) cores
% 11.39/1.89 # Starting new_bool_1 with 300s (1) cores
% 11.39/1.89 # Starting sh5l with 300s (1) cores
% 11.39/1.89 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 32708 completed with status 0
% 11.39/1.89 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 11.39/1.89 # Preprocessing class: FSLSSMSSSSSNFFN.
% 11.39/1.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.39/1.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.39/1.89 # No SInE strategy applied
% 11.39/1.89 # Search class: FGHSF-FFMM31-MFFFFFNN
% 11.39/1.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.39/1.89 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 811s (1) cores
% 11.39/1.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 11.39/1.89 # Starting new_bool_3 with 136s (1) cores
% 11.39/1.89 # Starting new_bool_1 with 136s (1) cores
% 11.39/1.89 # Starting sh5l with 136s (1) cores
% 11.39/1.89 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 32714 completed with status 0
% 11.39/1.89 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 11.39/1.89 # Preprocessing class: FSLSSMSSSSSNFFN.
% 11.39/1.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.39/1.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.39/1.89 # No SInE strategy applied
% 11.39/1.89 # Search class: FGHSF-FFMM31-MFFFFFNN
% 11.39/1.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.39/1.89 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 811s (1) cores
% 11.39/1.89 # Preprocessing time : 0.003 s
% 11.39/1.89
% 11.39/1.89 # Proof found!
% 11.39/1.89 # SZS status Theorem
% 11.39/1.89 # SZS output start CNFRefutation
% See solution above
% 11.39/1.89 # Parsed axioms : 56
% 11.39/1.89 # Removed by relevancy pruning/SinE : 0
% 11.39/1.89 # Initial clauses : 108
% 11.39/1.89 # Removed in clause preprocessing : 6
% 11.39/1.89 # Initial clauses in saturation : 102
% 11.39/1.89 # Processed clauses : 3589
% 11.39/1.89 # ...of these trivial : 30
% 11.39/1.89 # ...subsumed : 1696
% 11.39/1.89 # ...remaining for further processing : 1863
% 11.39/1.89 # Other redundant clauses eliminated : 13
% 11.39/1.89 # Clauses deleted for lack of memory : 0
% 11.39/1.89 # Backward-subsumed : 125
% 11.39/1.89 # Backward-rewritten : 33
% 11.39/1.89 # Generated clauses : 45688
% 11.39/1.89 # ...of the previous two non-redundant : 44615
% 11.39/1.89 # ...aggressively subsumed : 0
% 11.39/1.89 # Contextual simplify-reflections : 659
% 11.39/1.89 # Paramodulations : 45500
% 11.39/1.89 # Factorizations : 71
% 11.39/1.89 # NegExts : 0
% 11.39/1.89 # Equation resolutions : 103
% 11.39/1.89 # Total rewrite steps : 10655
% 11.39/1.89 # Propositional unsat checks : 0
% 11.39/1.89 # Propositional check models : 0
% 11.39/1.89 # Propositional check unsatisfiable : 0
% 11.39/1.89 # Propositional clauses : 0
% 11.39/1.89 # Propositional clauses after purity: 0
% 11.39/1.89 # Propositional unsat core size : 0
% 11.39/1.89 # Propositional preprocessing time : 0.000
% 11.39/1.89 # Propositional encoding time : 0.000
% 11.39/1.89 # Propositional solver time : 0.000
% 11.39/1.89 # Success case prop preproc time : 0.000
% 11.39/1.89 # Success case prop encoding time : 0.000
% 11.39/1.89 # Success case prop solver time : 0.000
% 11.39/1.89 # Current number of processed clauses : 1688
% 11.39/1.89 # Positive orientable unit clauses : 88
% 11.39/1.89 # Positive unorientable unit clauses: 0
% 11.39/1.89 # Negative unit clauses : 54
% 11.39/1.89 # Non-unit-clauses : 1546
% 11.39/1.89 # Current number of unprocessed clauses: 40864
% 11.39/1.89 # ...number of literals in the above : 216721
% 11.39/1.89 # Current number of archived formulas : 0
% 11.39/1.89 # Current number of archived clauses : 172
% 11.39/1.89 # Clause-clause subsumption calls (NU) : 489386
% 11.39/1.89 # Rec. Clause-clause subsumption calls : 79764
% 11.39/1.89 # Non-unit clause-clause subsumptions : 1718
% 11.39/1.89 # Unit Clause-clause subsumption calls : 12187
% 11.39/1.89 # Rewrite failures with RHS unbound : 0
% 11.39/1.89 # BW rewrite match attempts : 42
% 11.39/1.89 # BW rewrite match successes : 18
% 11.39/1.89 # Condensation attempts : 0
% 11.39/1.89 # Condensation successes : 0
% 11.39/1.89 # Termbank termtop insertions : 1265575
% 11.39/1.89
% 11.39/1.89 # -------------------------------------------------
% 11.39/1.89 # User time : 1.378 s
% 11.39/1.89 # System time : 0.029 s
% 11.39/1.89 # Total time : 1.407 s
% 11.39/1.89 # Maximum resident set size: 2068 pages
% 11.39/1.89
% 11.39/1.89 # -------------------------------------------------
% 11.39/1.89 # User time : 6.890 s
% 11.39/1.89 # System time : 0.085 s
% 11.39/1.89 # Total time : 6.975 s
% 11.39/1.89 # Maximum resident set size: 1740 pages
% 11.39/1.89 % E---3.1 exiting
%------------------------------------------------------------------------------