TSTP Solution File: NUM620+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM620+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:08:00 EDT 2023
% Result : Theorem 0.16s 0.48s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 12 unt; 0 def)
% Number of atoms : 142 ( 30 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 162 ( 66 ~; 62 |; 22 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn; 24 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
file('/export/starexec/sandbox2/tmp/tmp.E5Rd9Yxt4l/E---3.1_3406.p',m__) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E5Rd9Yxt4l/E---3.1_3406.p',mDefSub) ).
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E5Rd9Yxt4l/E---3.1_3406.p',m__3671) ).
fof(mDefMin,axiom,
! [X1] :
( ( aSubsetOf0(X1,szNzAzT0)
& X1 != slcrc0 )
=> ! [X2] :
( X2 = szmzizndt0(X1)
<=> ( aElementOf0(X2,X1)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E5Rd9Yxt4l/E---3.1_3406.p',mDefMin) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.E5Rd9Yxt4l/E---3.1_3406.p',mNATSet) ).
fof(m__5401,hypothesis,
xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
file('/export/starexec/sandbox2/tmp/tmp.E5Rd9Yxt4l/E---3.1_3406.p',m__5401) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
& szszuzczcdt0(X1) != sz00 ) ),
file('/export/starexec/sandbox2/tmp/tmp.E5Rd9Yxt4l/E---3.1_3406.p',mSuccNum) ).
fof(mCountNFin_01,axiom,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> X1 != slcrc0 ),
file('/export/starexec/sandbox2/tmp/tmp.E5Rd9Yxt4l/E---3.1_3406.p',mCountNFin_01) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E5Rd9Yxt4l/E---3.1_3406.p',mDefEmp) ).
fof(m__5389,hypothesis,
( aElementOf0(xm,szNzAzT0)
& xx = sdtlpdtrp0(xe,xm) ),
file('/export/starexec/sandbox2/tmp/tmp.E5Rd9Yxt4l/E---3.1_3406.p',m__5389) ).
fof(m__5309,hypothesis,
( aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(xn,szNzAzT0)
& sdtlpdtrp0(xe,xn) = xp ),
file('/export/starexec/sandbox2/tmp/tmp.E5Rd9Yxt4l/E---3.1_3406.p',m__5309) ).
fof(c_0_11,negated_conjecture,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_12,plain,
! [X15,X16,X17,X18] :
( ( aSet0(X16)
| ~ aSubsetOf0(X16,X15)
| ~ aSet0(X15) )
& ( ~ aElementOf0(X17,X16)
| aElementOf0(X17,X15)
| ~ aSubsetOf0(X16,X15)
| ~ aSet0(X15) )
& ( aElementOf0(esk2_2(X15,X18),X18)
| ~ aSet0(X18)
| aSubsetOf0(X18,X15)
| ~ aSet0(X15) )
& ( ~ aElementOf0(esk2_2(X15,X18),X15)
| ~ aSet0(X18)
| aSubsetOf0(X18,X15)
| ~ aSet0(X15) ) ),
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)],[mDefSub])])])])])]) ).
fof(c_0_13,negated_conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
fof(c_0_14,hypothesis,
! [X175] :
( ( aSubsetOf0(sdtlpdtrp0(xN,X175),szNzAzT0)
| ~ aElementOf0(X175,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X175))
| ~ aElementOf0(X175,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])]) ).
fof(c_0_15,plain,
! [X86,X87,X88,X89] :
( ( aElementOf0(X87,X86)
| X87 != szmzizndt0(X86)
| ~ aSubsetOf0(X86,szNzAzT0)
| X86 = slcrc0 )
& ( ~ aElementOf0(X88,X86)
| sdtlseqdt0(X87,X88)
| X87 != szmzizndt0(X86)
| ~ aSubsetOf0(X86,szNzAzT0)
| X86 = slcrc0 )
& ( aElementOf0(esk7_2(X86,X89),X86)
| ~ aElementOf0(X89,X86)
| X89 = szmzizndt0(X86)
| ~ aSubsetOf0(X86,szNzAzT0)
| X86 = slcrc0 )
& ( ~ sdtlseqdt0(X89,esk7_2(X86,X89))
| ~ aElementOf0(X89,X86)
| X89 = szmzizndt0(X86)
| ~ aSubsetOf0(X86,szNzAzT0)
| X86 = 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)],[mDefMin])])])])])]) ).
cnf(c_0_16,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_21,plain,
( aElementOf0(X1,X2)
| X2 = slcrc0
| X1 != szmzizndt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
| ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,hypothesis,
( aSet0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,plain,
( X1 = slcrc0
| aElementOf0(szmzizndt0(X1),X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,hypothesis,
xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
inference(split_conjunct,[status(thm)],[m__5401]) ).
cnf(c_0_26,negated_conjecture,
~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,hypothesis,
( aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_28,plain,
! [X54] :
( ( aElementOf0(szszuzczcdt0(X54),szNzAzT0)
| ~ aElementOf0(X54,szNzAzT0) )
& ( szszuzczcdt0(X54) != sz00
| ~ aElementOf0(X54,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccNum])])]) ).
fof(c_0_29,plain,
! [X14] :
( ~ aSet0(X14)
| ~ isCountable0(X14)
| X14 != slcrc0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCountNFin_01])]) ).
fof(c_0_30,plain,
! [X9,X10,X11] :
( ( aSet0(X9)
| X9 != slcrc0 )
& ( ~ aElementOf0(X10,X9)
| X9 != slcrc0 )
& ( ~ aSet0(X11)
| aElementOf0(esk1_1(X11),X11)
| X11 = 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])])])])])]) ).
cnf(c_0_31,hypothesis,
( sdtlpdtrp0(xN,xm) = slcrc0
| aElementOf0(xx,sdtlpdtrp0(xN,xm))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,hypothesis,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5389]) ).
cnf(c_0_33,negated_conjecture,
( ~ aElementOf0(xx,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_36,plain,
( ~ aSet0(X1)
| ~ isCountable0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,hypothesis,
( sdtlpdtrp0(xN,xm) = slcrc0
| aElementOf0(xx,sdtlpdtrp0(xN,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_19]),c_0_32])]) ).
cnf(c_0_39,negated_conjecture,
~ aElementOf0(xx,sdtlpdtrp0(xN,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_40,plain,
( ~ isCountable0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_42,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_43,hypothesis,
sdtlpdtrp0(xN,xm) = slcrc0,
inference(sr,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_45,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_32])]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : NUM620+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 14:14:51 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.E5Rd9Yxt4l/E---3.1_3406.p
% 0.16/0.48 # Version: 3.1pre001
% 0.16/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.48 # Starting sh5l with 300s (1) cores
% 0.16/0.48 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3483 completed with status 0
% 0.16/0.48 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.48 # No SInE strategy applied
% 0.16/0.48 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.16/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.48 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.16/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.16/0.48 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.16/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.16/0.48 # SAT001_MinMin_p005000_rr_RG with pid 3492 completed with status 0
% 0.16/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.48 # No SInE strategy applied
% 0.16/0.48 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.16/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.48 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.16/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.16/0.48 # Preprocessing time : 0.004 s
% 0.16/0.48 # Presaturation interreduction done
% 0.16/0.48
% 0.16/0.48 # Proof found!
% 0.16/0.48 # SZS status Theorem
% 0.16/0.48 # SZS output start CNFRefutation
% See solution above
% 0.16/0.48 # Parsed axioms : 117
% 0.16/0.48 # Removed by relevancy pruning/SinE : 0
% 0.16/0.48 # Initial clauses : 226
% 0.16/0.48 # Removed in clause preprocessing : 7
% 0.16/0.48 # Initial clauses in saturation : 219
% 0.16/0.48 # Processed clauses : 480
% 0.16/0.48 # ...of these trivial : 4
% 0.16/0.48 # ...subsumed : 10
% 0.16/0.48 # ...remaining for further processing : 466
% 0.16/0.48 # Other redundant clauses eliminated : 49
% 0.16/0.48 # Clauses deleted for lack of memory : 0
% 0.16/0.48 # Backward-subsumed : 8
% 0.16/0.48 # Backward-rewritten : 16
% 0.16/0.48 # Generated clauses : 280
% 0.16/0.48 # ...of the previous two non-redundant : 226
% 0.16/0.48 # ...aggressively subsumed : 0
% 0.16/0.48 # Contextual simplify-reflections : 20
% 0.16/0.48 # Paramodulations : 234
% 0.16/0.48 # Factorizations : 0
% 0.16/0.48 # NegExts : 0
% 0.16/0.48 # Equation resolutions : 50
% 0.16/0.48 # Total rewrite steps : 250
% 0.16/0.48 # Propositional unsat checks : 0
% 0.16/0.48 # Propositional check models : 0
% 0.16/0.48 # Propositional check unsatisfiable : 0
% 0.16/0.48 # Propositional clauses : 0
% 0.16/0.48 # Propositional clauses after purity: 0
% 0.16/0.48 # Propositional unsat core size : 0
% 0.16/0.48 # Propositional preprocessing time : 0.000
% 0.16/0.48 # Propositional encoding time : 0.000
% 0.16/0.48 # Propositional solver time : 0.000
% 0.16/0.48 # Success case prop preproc time : 0.000
% 0.16/0.48 # Success case prop encoding time : 0.000
% 0.16/0.48 # Success case prop solver time : 0.000
% 0.16/0.48 # Current number of processed clauses : 184
% 0.16/0.48 # Positive orientable unit clauses : 82
% 0.16/0.48 # Positive unorientable unit clauses: 0
% 0.16/0.48 # Negative unit clauses : 15
% 0.16/0.48 # Non-unit-clauses : 87
% 0.16/0.48 # Current number of unprocessed clauses: 169
% 0.16/0.48 # ...number of literals in the above : 706
% 0.16/0.48 # Current number of archived formulas : 0
% 0.16/0.48 # Current number of archived clauses : 242
% 0.16/0.48 # Clause-clause subsumption calls (NU) : 8807
% 0.16/0.48 # Rec. Clause-clause subsumption calls : 2152
% 0.16/0.48 # Non-unit clause-clause subsumptions : 24
% 0.16/0.48 # Unit Clause-clause subsumption calls : 432
% 0.16/0.48 # Rewrite failures with RHS unbound : 0
% 0.16/0.48 # BW rewrite match attempts : 6
% 0.16/0.48 # BW rewrite match successes : 6
% 0.16/0.48 # Condensation attempts : 0
% 0.16/0.48 # Condensation successes : 0
% 0.16/0.48 # Termbank termtop insertions : 19595
% 0.16/0.48
% 0.16/0.48 # -------------------------------------------------
% 0.16/0.48 # User time : 0.038 s
% 0.16/0.48 # System time : 0.003 s
% 0.16/0.48 # Total time : 0.041 s
% 0.16/0.48 # Maximum resident set size: 2476 pages
% 0.16/0.48
% 0.16/0.48 # -------------------------------------------------
% 0.16/0.48 # User time : 0.154 s
% 0.16/0.48 # System time : 0.014 s
% 0.16/0.48 # Total time : 0.169 s
% 0.16/0.48 # Maximum resident set size: 1816 pages
% 0.16/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------