TSTP Solution File: NUM514+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM514+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : Sat May 4 09:06:26 EDT 2024
% Result : Theorem 0.35s 0.57s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 23 unt; 0 def)
% Number of atoms : 170 ( 54 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 197 ( 73 ~; 79 |; 30 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 24 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
file('/export/starexec/sandbox/tmp/tmp.D4SQdKvLzd/E---3.1_23384.p',m__) ).
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.D4SQdKvLzd/E---3.1_23384.p',mDefQuot) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.D4SQdKvLzd/E---3.1_23384.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.D4SQdKvLzd/E---3.1_23384.p',mSortsB_02) ).
fof(m__2613,hypothesis,
sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm),
file('/export/starexec/sandbox/tmp/tmp.D4SQdKvLzd/E---3.1_23384.p',m__2613) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmp.D4SQdKvLzd/E---3.1_23384.p',m__1837) ).
fof(m__2306,hypothesis,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
file('/export/starexec/sandbox/tmp/tmp.D4SQdKvLzd/E---3.1_23384.p',m__2306) ).
fof(m__1860,hypothesis,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/tmp/tmp.D4SQdKvLzd/E---3.1_23384.p',m__1860) ).
fof(mDefPrime,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.D4SQdKvLzd/E---3.1_23384.p',mDefPrime) ).
fof(m__2342,hypothesis,
( aNaturalNumber0(xr)
& doDivides0(xr,xk)
& isPrime0(xr) ),
file('/export/starexec/sandbox/tmp/tmp.D4SQdKvLzd/E---3.1_23384.p',m__2342) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/tmp.D4SQdKvLzd/E---3.1_23384.p',mSortsC) ).
fof(c_0_11,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_12,plain,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefQuot]) ).
fof(c_0_13,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X63,X64,X66] :
( ( aNaturalNumber0(esk2_2(X63,X64))
| ~ doDivides0(X63,X64)
| ~ aNaturalNumber0(X63)
| ~ aNaturalNumber0(X64) )
& ( X64 = sdtasdt0(X63,esk2_2(X63,X64))
| ~ doDivides0(X63,X64)
| ~ aNaturalNumber0(X63)
| ~ aNaturalNumber0(X64) )
& ( ~ aNaturalNumber0(X66)
| X64 != sdtasdt0(X63,X66)
| doDivides0(X63,X64)
| ~ aNaturalNumber0(X63)
| ~ aNaturalNumber0(X64) ) ),
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)],[mDefDiv])])])])])]) ).
fof(c_0_15,plain,
! [X7,X8] :
( ~ aNaturalNumber0(X7)
| ~ aNaturalNumber0(X8)
| aNaturalNumber0(sdtasdt0(X7,X8)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_16,plain,
! [X67,X68,X69] :
( ( aNaturalNumber0(X69)
| X69 != sdtsldt0(X68,X67)
| X67 = sz00
| ~ doDivides0(X67,X68)
| ~ aNaturalNumber0(X67)
| ~ aNaturalNumber0(X68) )
& ( X68 = sdtasdt0(X67,X69)
| X69 != sdtsldt0(X68,X67)
| X67 = sz00
| ~ doDivides0(X67,X68)
| ~ aNaturalNumber0(X67)
| ~ aNaturalNumber0(X68) )
& ( ~ aNaturalNumber0(X69)
| X68 != sdtasdt0(X67,X69)
| X69 = sdtsldt0(X68,X67)
| X67 = sz00
| ~ doDivides0(X67,X68)
| ~ aNaturalNumber0(X67)
| ~ aNaturalNumber0(X68) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
cnf(c_0_17,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm),
inference(split_conjunct,[status(thm)],[m__2613]) ).
cnf(c_0_19,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( aNaturalNumber0(X1)
| X3 = sz00
| X1 != sdtsldt0(X2,X3)
| ~ doDivides0(X3,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xp,sdtsldt0(xk,xr))),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_19]),c_0_20]) ).
cnf(c_0_24,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_25,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_26,hypothesis,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[m__2306]) ).
cnf(c_0_27,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[m__1860]) ).
fof(c_0_28,plain,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefPrime]) ).
cnf(c_0_29,negated_conjecture,
~ aNaturalNumber0(sdtsldt0(xk,xr)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_30,hypothesis,
doDivides0(xr,xk),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_31,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_32,hypothesis,
( xp = sz00
| aNaturalNumber0(xk)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_24])]) ).
cnf(c_0_33,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_34,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
fof(c_0_35,plain,
! [X84,X85] :
( ( X84 != sz00
| ~ isPrime0(X84)
| ~ aNaturalNumber0(X84) )
& ( X84 != sz10
| ~ isPrime0(X84)
| ~ aNaturalNumber0(X84) )
& ( ~ aNaturalNumber0(X85)
| ~ doDivides0(X85,X84)
| X85 = sz10
| X85 = X84
| ~ isPrime0(X84)
| ~ aNaturalNumber0(X84) )
& ( aNaturalNumber0(esk3_1(X84))
| X84 = sz00
| X84 = sz10
| isPrime0(X84)
| ~ aNaturalNumber0(X84) )
& ( doDivides0(esk3_1(X84),X84)
| X84 = sz00
| X84 = sz10
| isPrime0(X84)
| ~ aNaturalNumber0(X84) )
& ( esk3_1(X84) != sz10
| X84 = sz00
| X84 = sz10
| isPrime0(X84)
| ~ aNaturalNumber0(X84) )
& ( esk3_1(X84) != X84
| X84 = sz00
| X84 = sz10
| isPrime0(X84)
| ~ aNaturalNumber0(X84) ) ),
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_28])])])])])]) ).
cnf(c_0_36,negated_conjecture,
( xr = sz00
| ~ aNaturalNumber0(xk) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_30]),c_0_31])]) ).
cnf(c_0_37,hypothesis,
( xp = sz00
| aNaturalNumber0(xk) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_20]),c_0_33]),c_0_34])]) ).
cnf(c_0_38,plain,
( X1 != sz00
| ~ isPrime0(X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_40,hypothesis,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_41,negated_conjecture,
( xp = sz00
| xr = sz00 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
~ isPrime0(sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_39])]) ).
cnf(c_0_43,hypothesis,
isPrime0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_44,hypothesis,
xr = sz00,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_45,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM514+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 09:27:57 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.D4SQdKvLzd/E---3.1_23384.p
% 0.35/0.57 # Version: 3.1.0
% 0.35/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.35/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.35/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.35/0.57 # Starting sh5l with 300s (1) cores
% 0.35/0.57 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 23476 completed with status 0
% 0.35/0.57 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.35/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.35/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.35/0.57 # No SInE strategy applied
% 0.35/0.57 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.35/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.35/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.35/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.35/0.57 # Starting new_bool_3 with 136s (1) cores
% 0.35/0.57 # Starting new_bool_1 with 136s (1) cores
% 0.35/0.57 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 23491 completed with status 0
% 0.35/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 0.35/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.35/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.35/0.57 # No SInE strategy applied
% 0.35/0.57 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.35/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.35/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.35/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.35/0.57 # Preprocessing time : 0.002 s
% 0.35/0.57 # Presaturation interreduction done
% 0.35/0.57
% 0.35/0.57 # Proof found!
% 0.35/0.57 # SZS status Theorem
% 0.35/0.57 # SZS output start CNFRefutation
% See solution above
% 0.35/0.57 # Parsed axioms : 56
% 0.35/0.57 # Removed by relevancy pruning/SinE : 0
% 0.35/0.57 # Initial clauses : 102
% 0.35/0.57 # Removed in clause preprocessing : 3
% 0.35/0.57 # Initial clauses in saturation : 99
% 0.35/0.57 # Processed clauses : 360
% 0.35/0.57 # ...of these trivial : 1
% 0.35/0.57 # ...subsumed : 71
% 0.35/0.57 # ...remaining for further processing : 288
% 0.35/0.57 # Other redundant clauses eliminated : 35
% 0.35/0.57 # Clauses deleted for lack of memory : 0
% 0.35/0.57 # Backward-subsumed : 11
% 0.35/0.57 # Backward-rewritten : 30
% 0.35/0.57 # Generated clauses : 1081
% 0.35/0.57 # ...of the previous two non-redundant : 993
% 0.35/0.57 # ...aggressively subsumed : 0
% 0.35/0.57 # Contextual simplify-reflections : 7
% 0.35/0.57 # Paramodulations : 1042
% 0.35/0.57 # Factorizations : 0
% 0.35/0.57 # NegExts : 0
% 0.35/0.57 # Equation resolutions : 39
% 0.35/0.57 # Disequality decompositions : 0
% 0.35/0.57 # Total rewrite steps : 743
% 0.35/0.57 # ...of those cached : 726
% 0.35/0.57 # Propositional unsat checks : 0
% 0.35/0.57 # Propositional check models : 0
% 0.35/0.57 # Propositional check unsatisfiable : 0
% 0.35/0.57 # Propositional clauses : 0
% 0.35/0.57 # Propositional clauses after purity: 0
% 0.35/0.57 # Propositional unsat core size : 0
% 0.35/0.57 # Propositional preprocessing time : 0.000
% 0.35/0.57 # Propositional encoding time : 0.000
% 0.35/0.57 # Propositional solver time : 0.000
% 0.35/0.57 # Success case prop preproc time : 0.000
% 0.35/0.57 # Success case prop encoding time : 0.000
% 0.35/0.57 # Success case prop solver time : 0.000
% 0.35/0.57 # Current number of processed clauses : 145
% 0.35/0.57 # Positive orientable unit clauses : 16
% 0.35/0.57 # Positive unorientable unit clauses: 0
% 0.35/0.57 # Negative unit clauses : 12
% 0.35/0.57 # Non-unit-clauses : 117
% 0.35/0.57 # Current number of unprocessed clauses: 799
% 0.35/0.57 # ...number of literals in the above : 4570
% 0.35/0.57 # Current number of archived formulas : 0
% 0.35/0.57 # Current number of archived clauses : 132
% 0.35/0.57 # Clause-clause subsumption calls (NU) : 2385
% 0.35/0.57 # Rec. Clause-clause subsumption calls : 526
% 0.35/0.57 # Non-unit clause-clause subsumptions : 84
% 0.35/0.57 # Unit Clause-clause subsumption calls : 233
% 0.35/0.57 # Rewrite failures with RHS unbound : 0
% 0.35/0.57 # BW rewrite match attempts : 3
% 0.35/0.57 # BW rewrite match successes : 3
% 0.35/0.57 # Condensation attempts : 0
% 0.35/0.57 # Condensation successes : 0
% 0.35/0.57 # Termbank termtop insertions : 27890
% 0.35/0.57 # Search garbage collected termcells : 1364
% 0.35/0.57
% 0.35/0.57 # -------------------------------------------------
% 0.35/0.57 # User time : 0.041 s
% 0.35/0.57 # System time : 0.010 s
% 0.35/0.57 # Total time : 0.051 s
% 0.35/0.57 # Maximum resident set size: 1976 pages
% 0.35/0.57
% 0.35/0.57 # -------------------------------------------------
% 0.35/0.57 # User time : 0.223 s
% 0.35/0.57 # System time : 0.019 s
% 0.35/0.57 # Total time : 0.243 s
% 0.35/0.57 # Maximum resident set size: 1752 pages
% 0.35/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------