TSTP Solution File: NUM479+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM479+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 18:55:57 EDT 2023
% Result : Theorem 0.16s 0.53s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 11 unt; 0 def)
% Number of atoms : 157 ( 37 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 206 ( 91 ~; 87 |; 18 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn; 31 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.jEdA8Ta2Cf/E---3.1_25985.p',mMulAsso) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.jEdA8Ta2Cf/E---3.1_25985.p',mMulComm) ).
fof(m__,conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
file('/export/starexec/sandbox2/tmp/tmp.jEdA8Ta2Cf/E---3.1_25985.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/sandbox2/tmp/tmp.jEdA8Ta2Cf/E---3.1_25985.p',mDefQuot) ).
fof(m__1524,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox2/tmp/tmp.jEdA8Ta2Cf/E---3.1_25985.p',m__1524) ).
fof(m__1553,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox2/tmp/tmp.jEdA8Ta2Cf/E---3.1_25985.p',m__1553) ).
fof(m__1524_04,hypothesis,
( xl != sz00
& doDivides0(xl,xm) ),
file('/export/starexec/sandbox2/tmp/tmp.jEdA8Ta2Cf/E---3.1_25985.p',m__1524_04) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jEdA8Ta2Cf/E---3.1_25985.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.jEdA8Ta2Cf/E---3.1_25985.p',mSortsB_02) ).
fof(mDivTrans,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( doDivides0(X1,X2)
& doDivides0(X2,X3) )
=> doDivides0(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jEdA8Ta2Cf/E---3.1_25985.p',mDivTrans) ).
fof(c_0_10,plain,
! [X16,X17,X18] :
( ~ aNaturalNumber0(X16)
| ~ aNaturalNumber0(X17)
| ~ aNaturalNumber0(X18)
| sdtasdt0(sdtasdt0(X16,X17),X18) = sdtasdt0(X16,sdtasdt0(X17,X18)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).
fof(c_0_11,plain,
! [X14,X15] :
( ~ aNaturalNumber0(X14)
| ~ aNaturalNumber0(X15)
| sdtasdt0(X14,X15) = sdtasdt0(X15,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
fof(c_0_12,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_13,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X64,X65,X66] :
( ( aNaturalNumber0(X66)
| X66 != sdtsldt0(X65,X64)
| X64 = sz00
| ~ doDivides0(X64,X65)
| ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X65) )
& ( X65 = sdtasdt0(X64,X66)
| X66 != sdtsldt0(X65,X64)
| X64 = sz00
| ~ doDivides0(X64,X65)
| ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X65) )
& ( ~ aNaturalNumber0(X66)
| X65 != sdtasdt0(X64,X66)
| X66 = sdtsldt0(X65,X64)
| X64 = sz00
| ~ doDivides0(X64,X65)
| ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X65) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefQuot])])])]) ).
cnf(c_0_16,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X2,sdtasdt0(X1,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1524]) ).
cnf(c_0_19,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1553]) ).
cnf(c_0_20,plain,
( X1 = sdtasdt0(X2,X3)
| X2 = sz00
| X3 != sdtsldt0(X1,X2)
| ~ doDivides0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( sdtasdt0(xn,sdtasdt0(xl,sdtsldt0(xm,xl))) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))
| ~ aNaturalNumber0(sdtsldt0(xm,xl)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
| X1 = sz00
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_23,hypothesis,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[m__1524_04]) ).
cnf(c_0_24,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1524]) ).
cnf(c_0_25,hypothesis,
xl != sz00,
inference(split_conjunct,[status(thm)],[m__1524_04]) ).
cnf(c_0_26,negated_conjecture,
( sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) != sdtasdt0(xn,xm)
| ~ aNaturalNumber0(sdtsldt0(xm,xl)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_18]),c_0_24])]),c_0_25]) ).
cnf(c_0_27,plain,
( aNaturalNumber0(X1)
| X3 = sz00
| X1 != sdtsldt0(X2,X3)
| ~ doDivides0(X3,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_28,plain,
! [X60,X61,X63] :
( ( aNaturalNumber0(esk2_2(X60,X61))
| ~ doDivides0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) )
& ( X61 = sdtasdt0(X60,esk2_2(X60,X61))
| ~ doDivides0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) )
& ( ~ aNaturalNumber0(X63)
| X61 != sdtasdt0(X60,X63)
| doDivides0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) ) ),
inference(distribute,[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_29,plain,
! [X6,X7] :
( ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X7)
| aNaturalNumber0(sdtasdt0(X6,X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_30,negated_conjecture,
( ~ doDivides0(xl,sdtasdt0(xn,xm))
| ~ aNaturalNumber0(sdtsldt0(xm,xl))
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_18])]),c_0_25]) ).
cnf(c_0_31,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_27]) ).
fof(c_0_32,plain,
! [X67,X68,X69] :
( ~ aNaturalNumber0(X67)
| ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X69)
| ~ doDivides0(X67,X68)
| ~ doDivides0(X68,X69)
| doDivides0(X67,X69) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivTrans])]) ).
cnf(c_0_33,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( ~ doDivides0(xl,sdtasdt0(xn,xm))
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_23]),c_0_18]),c_0_24])]),c_0_25]) ).
cnf(c_0_36,plain,
( doDivides0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X2)
| ~ doDivides0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_33]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( ~ doDivides0(xl,sdtasdt0(xm,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_14]),c_0_24]),c_0_19])]) ).
cnf(c_0_39,plain,
( doDivides0(X1,sdtasdt0(X2,X3))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_34]) ).
cnf(c_0_40,negated_conjecture,
~ aNaturalNumber0(sdtasdt0(xm,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_23]),c_0_24]),c_0_18]),c_0_19])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_34]),c_0_19]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM479+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 14:01:31 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.jEdA8Ta2Cf/E---3.1_25985.p
% 0.16/0.53 # Version: 3.1pre001
% 0.16/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.53 # Starting sh5l with 300s (1) cores
% 0.16/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 26063 completed with status 0
% 0.16/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.53 # No SInE strategy applied
% 0.16/0.53 # Search class: FGUSF-FFMM22-MFFFFFNN
% 0.16/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.53 # Starting sh5l with 136s (1) cores
% 0.16/0.53 # SAT001_MinMin_p005000_rr_RG with pid 26068 completed with status 0
% 0.16/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.53 # No SInE strategy applied
% 0.16/0.53 # Search class: FGUSF-FFMM22-MFFFFFNN
% 0.16/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.53 # Preprocessing time : 0.002 s
% 0.16/0.53 # Presaturation interreduction done
% 0.16/0.53
% 0.16/0.53 # Proof found!
% 0.16/0.53 # SZS status Theorem
% 0.16/0.53 # SZS output start CNFRefutation
% See solution above
% 0.16/0.53 # Parsed axioms : 39
% 0.16/0.53 # Removed by relevancy pruning/SinE : 0
% 0.16/0.53 # Initial clauses : 65
% 0.16/0.53 # Removed in clause preprocessing : 3
% 0.16/0.53 # Initial clauses in saturation : 62
% 0.16/0.53 # Processed clauses : 1141
% 0.16/0.53 # ...of these trivial : 5
% 0.16/0.53 # ...subsumed : 717
% 0.16/0.53 # ...remaining for further processing : 419
% 0.16/0.53 # Other redundant clauses eliminated : 56
% 0.16/0.53 # Clauses deleted for lack of memory : 0
% 0.16/0.53 # Backward-subsumed : 28
% 0.16/0.53 # Backward-rewritten : 8
% 0.16/0.53 # Generated clauses : 4489
% 0.16/0.53 # ...of the previous two non-redundant : 3842
% 0.16/0.53 # ...aggressively subsumed : 0
% 0.16/0.53 # Contextual simplify-reflections : 32
% 0.16/0.53 # Paramodulations : 4427
% 0.16/0.53 # Factorizations : 0
% 0.16/0.53 # NegExts : 0
% 0.16/0.53 # Equation resolutions : 62
% 0.16/0.53 # Total rewrite steps : 4131
% 0.16/0.53 # Propositional unsat checks : 0
% 0.16/0.53 # Propositional check models : 0
% 0.16/0.53 # Propositional check unsatisfiable : 0
% 0.16/0.53 # Propositional clauses : 0
% 0.16/0.53 # Propositional clauses after purity: 0
% 0.16/0.53 # Propositional unsat core size : 0
% 0.16/0.53 # Propositional preprocessing time : 0.000
% 0.16/0.53 # Propositional encoding time : 0.000
% 0.16/0.53 # Propositional solver time : 0.000
% 0.16/0.53 # Success case prop preproc time : 0.000
% 0.16/0.53 # Success case prop encoding time : 0.000
% 0.16/0.53 # Success case prop solver time : 0.000
% 0.16/0.53 # Current number of processed clauses : 317
% 0.16/0.53 # Positive orientable unit clauses : 29
% 0.16/0.53 # Positive unorientable unit clauses: 0
% 0.16/0.53 # Negative unit clauses : 7
% 0.16/0.53 # Non-unit-clauses : 281
% 0.16/0.53 # Current number of unprocessed clauses: 2785
% 0.16/0.53 # ...number of literals in the above : 15234
% 0.16/0.53 # Current number of archived formulas : 0
% 0.16/0.53 # Current number of archived clauses : 93
% 0.16/0.53 # Clause-clause subsumption calls (NU) : 14705
% 0.16/0.53 # Rec. Clause-clause subsumption calls : 5444
% 0.16/0.53 # Non-unit clause-clause subsumptions : 691
% 0.16/0.53 # Unit Clause-clause subsumption calls : 407
% 0.16/0.53 # Rewrite failures with RHS unbound : 0
% 0.16/0.53 # BW rewrite match attempts : 8
% 0.16/0.53 # BW rewrite match successes : 8
% 0.16/0.53 # Condensation attempts : 0
% 0.16/0.53 # Condensation successes : 0
% 0.16/0.53 # Termbank termtop insertions : 81273
% 0.16/0.53
% 0.16/0.53 # -------------------------------------------------
% 0.16/0.53 # User time : 0.090 s
% 0.16/0.53 # System time : 0.009 s
% 0.16/0.53 # Total time : 0.099 s
% 0.16/0.53 # Maximum resident set size: 1908 pages
% 0.16/0.53
% 0.16/0.53 # -------------------------------------------------
% 0.16/0.53 # User time : 0.462 s
% 0.16/0.53 # System time : 0.018 s
% 0.16/0.53 # Total time : 0.480 s
% 0.16/0.53 # Maximum resident set size: 1732 pages
% 0.16/0.53 % E---3.1 exiting
% 0.16/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------