TSTP Solution File: NUM479+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n028.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:19 EDT 2023
% Result : Theorem 1.02s 0.54s
% Output : CNFRefutation 1.02s
% 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/sandbox/tmp/tmp.iPrH0FOXbt/E---3.1_8737.p',mMulAsso) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.iPrH0FOXbt/E---3.1_8737.p',mMulComm) ).
fof(m__,conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
file('/export/starexec/sandbox/tmp/tmp.iPrH0FOXbt/E---3.1_8737.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.iPrH0FOXbt/E---3.1_8737.p',mDefQuot) ).
fof(m__1524,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox/tmp/tmp.iPrH0FOXbt/E---3.1_8737.p',m__1524) ).
fof(m__1553,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/tmp/tmp.iPrH0FOXbt/E---3.1_8737.p',m__1553) ).
fof(m__1524_04,hypothesis,
( xl != sz00
& doDivides0(xl,xm) ),
file('/export/starexec/sandbox/tmp/tmp.iPrH0FOXbt/E---3.1_8737.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/sandbox/tmp/tmp.iPrH0FOXbt/E---3.1_8737.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.iPrH0FOXbt/E---3.1_8737.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/sandbox/tmp/tmp.iPrH0FOXbt/E---3.1_8737.p',mDivTrans) ).
fof(c_0_10,plain,
! [X8,X9,X10] :
( ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X9)
| ~ aNaturalNumber0(X10)
| sdtasdt0(sdtasdt0(X8,X9),X10) = sdtasdt0(X8,sdtasdt0(X9,X10)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).
fof(c_0_11,plain,
! [X6,X7] :
( ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X7)
| sdtasdt0(X6,X7) = sdtasdt0(X7,X6) ),
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,
! [X30,X31,X32] :
( ( aNaturalNumber0(X32)
| X32 != sdtsldt0(X31,X30)
| X30 = sz00
| ~ doDivides0(X30,X31)
| ~ aNaturalNumber0(X30)
| ~ aNaturalNumber0(X31) )
& ( X31 = sdtasdt0(X30,X32)
| X32 != sdtsldt0(X31,X30)
| X30 = sz00
| ~ doDivides0(X30,X31)
| ~ aNaturalNumber0(X30)
| ~ aNaturalNumber0(X31) )
& ( ~ aNaturalNumber0(X32)
| X31 != sdtasdt0(X30,X32)
| X32 = sdtsldt0(X31,X30)
| X30 = sz00
| ~ doDivides0(X30,X31)
| ~ aNaturalNumber0(X30)
| ~ aNaturalNumber0(X31) ) ),
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,
! [X26,X27,X29] :
( ( aNaturalNumber0(esk1_2(X26,X27))
| ~ doDivides0(X26,X27)
| ~ aNaturalNumber0(X26)
| ~ aNaturalNumber0(X27) )
& ( X27 = sdtasdt0(X26,esk1_2(X26,X27))
| ~ doDivides0(X26,X27)
| ~ aNaturalNumber0(X26)
| ~ aNaturalNumber0(X27) )
& ( ~ aNaturalNumber0(X29)
| X27 != sdtasdt0(X26,X29)
| doDivides0(X26,X27)
| ~ aNaturalNumber0(X26)
| ~ aNaturalNumber0(X27) ) ),
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,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| aNaturalNumber0(sdtasdt0(X4,X5)) ),
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,
! [X70,X71,X72] :
( ~ aNaturalNumber0(X70)
| ~ aNaturalNumber0(X71)
| ~ aNaturalNumber0(X72)
| ~ doDivides0(X70,X71)
| ~ doDivides0(X71,X72)
| doDivides0(X70,X72) ),
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.05/0.10 % Problem : NUM479+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n028.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:19:51 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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.iPrH0FOXbt/E---3.1_8737.p
% 1.02/0.54 # Version: 3.1pre001
% 1.02/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.02/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.02/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.02/0.54 # Starting new_bool_3 with 300s (1) cores
% 1.02/0.54 # Starting new_bool_1 with 300s (1) cores
% 1.02/0.54 # Starting sh5l with 300s (1) cores
% 1.02/0.54 # sh5l with pid 8817 completed with status 0
% 1.02/0.54 # Result found by sh5l
% 1.02/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.02/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.02/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.02/0.54 # Starting new_bool_3 with 300s (1) cores
% 1.02/0.54 # Starting new_bool_1 with 300s (1) cores
% 1.02/0.54 # Starting sh5l with 300s (1) cores
% 1.02/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.02/0.54 # Search class: FGUSF-FFMM22-MFFFFFNN
% 1.02/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.02/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.02/0.54 # SAT001_MinMin_p005000_rr_RG with pid 8818 completed with status 0
% 1.02/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.02/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.02/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.02/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.02/0.54 # Starting new_bool_3 with 300s (1) cores
% 1.02/0.54 # Starting new_bool_1 with 300s (1) cores
% 1.02/0.54 # Starting sh5l with 300s (1) cores
% 1.02/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.02/0.54 # Search class: FGUSF-FFMM22-MFFFFFNN
% 1.02/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.02/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.02/0.54 # Preprocessing time : 0.002 s
% 1.02/0.54 # Presaturation interreduction done
% 1.02/0.54
% 1.02/0.54 # Proof found!
% 1.02/0.54 # SZS status Theorem
% 1.02/0.54 # SZS output start CNFRefutation
% See solution above
% 1.02/0.54 # Parsed axioms : 39
% 1.02/0.54 # Removed by relevancy pruning/SinE : 3
% 1.02/0.54 # Initial clauses : 60
% 1.02/0.54 # Removed in clause preprocessing : 2
% 1.02/0.54 # Initial clauses in saturation : 58
% 1.02/0.54 # Processed clauses : 1273
% 1.02/0.54 # ...of these trivial : 4
% 1.02/0.54 # ...subsumed : 849
% 1.02/0.54 # ...remaining for further processing : 420
% 1.02/0.54 # Other redundant clauses eliminated : 78
% 1.02/0.54 # Clauses deleted for lack of memory : 0
% 1.02/0.54 # Backward-subsumed : 26
% 1.02/0.54 # Backward-rewritten : 8
% 1.02/0.54 # Generated clauses : 5001
% 1.02/0.54 # ...of the previous two non-redundant : 4253
% 1.02/0.54 # ...aggressively subsumed : 0
% 1.02/0.54 # Contextual simplify-reflections : 31
% 1.02/0.54 # Paramodulations : 4914
% 1.02/0.54 # Factorizations : 0
% 1.02/0.54 # NegExts : 0
% 1.02/0.54 # Equation resolutions : 87
% 1.02/0.54 # Total rewrite steps : 4358
% 1.02/0.54 # Propositional unsat checks : 0
% 1.02/0.54 # Propositional check models : 0
% 1.02/0.54 # Propositional check unsatisfiable : 0
% 1.02/0.54 # Propositional clauses : 0
% 1.02/0.54 # Propositional clauses after purity: 0
% 1.02/0.54 # Propositional unsat core size : 0
% 1.02/0.54 # Propositional preprocessing time : 0.000
% 1.02/0.54 # Propositional encoding time : 0.000
% 1.02/0.54 # Propositional solver time : 0.000
% 1.02/0.54 # Success case prop preproc time : 0.000
% 1.02/0.54 # Success case prop encoding time : 0.000
% 1.02/0.54 # Success case prop solver time : 0.000
% 1.02/0.54 # Current number of processed clauses : 327
% 1.02/0.54 # Positive orientable unit clauses : 24
% 1.02/0.54 # Positive unorientable unit clauses: 0
% 1.02/0.54 # Negative unit clauses : 6
% 1.02/0.54 # Non-unit-clauses : 297
% 1.02/0.54 # Current number of unprocessed clauses: 3047
% 1.02/0.54 # ...number of literals in the above : 17133
% 1.02/0.54 # Current number of archived formulas : 0
% 1.02/0.54 # Current number of archived clauses : 87
% 1.02/0.54 # Clause-clause subsumption calls (NU) : 14506
% 1.02/0.54 # Rec. Clause-clause subsumption calls : 5354
% 1.02/0.54 # Non-unit clause-clause subsumptions : 819
% 1.02/0.54 # Unit Clause-clause subsumption calls : 233
% 1.02/0.54 # Rewrite failures with RHS unbound : 0
% 1.02/0.54 # BW rewrite match attempts : 8
% 1.02/0.54 # BW rewrite match successes : 8
% 1.02/0.54 # Condensation attempts : 0
% 1.02/0.54 # Condensation successes : 0
% 1.02/0.54 # Termbank termtop insertions : 88884
% 1.02/0.54
% 1.02/0.54 # -------------------------------------------------
% 1.02/0.54 # User time : 0.110 s
% 1.02/0.54 # System time : 0.003 s
% 1.02/0.54 # Total time : 0.113 s
% 1.02/0.54 # Maximum resident set size: 1876 pages
% 1.02/0.55
% 1.02/0.55 # -------------------------------------------------
% 1.02/0.55 # User time : 0.112 s
% 1.02/0.55 # System time : 0.005 s
% 1.02/0.55 # Total time : 0.117 s
% 1.02/0.55 # Maximum resident set size: 1732 pages
% 1.02/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------