TSTP Solution File: NUM435+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM435+3 : 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:07:07 EDT 2023
% Result : Theorem 0.13s 0.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 50 ( 25 unt; 0 def)
% Number of atoms : 123 ( 34 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 123 ( 50 ~; 40 |; 26 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn; 26 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__1003,hypothesis,
( sdtasdt0(xp,xq) != sz00
& ? [X1] :
( aInteger0(X1)
& sdtasdt0(sdtasdt0(xp,xq),X1) = sdtpldt0(xa,smndt0(xb)) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
file('/export/starexec/sandbox/tmp/tmp.5frCxmCWh3/E---3.1_13636.p',m__1003) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.5frCxmCWh3/E---3.1_13636.p',mIntPlus) ).
fof(mDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.5frCxmCWh3/E---3.1_13636.p',mDivisor) ).
fof(m__1032,hypothesis,
( aInteger0(xm)
& sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox/tmp/tmp.5frCxmCWh3/E---3.1_13636.p',m__1032) ).
fof(m__979,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& xp != sz00
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox/tmp/tmp.5frCxmCWh3/E---3.1_13636.p',m__979) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.5frCxmCWh3/E---3.1_13636.p',mIntNeg) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.5frCxmCWh3/E---3.1_13636.p',mMulComm) ).
fof(m__,conjecture,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
file('/export/starexec/sandbox/tmp/tmp.5frCxmCWh3/E---3.1_13636.p',m__) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3) )
=> sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3) ),
file('/export/starexec/sandbox/tmp/tmp.5frCxmCWh3/E---3.1_13636.p',mMulAsso) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.5frCxmCWh3/E---3.1_13636.p',mIntMult) ).
fof(c_0_10,hypothesis,
( sdtasdt0(xp,xq) != sz00
& aInteger0(esk1_0)
& sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtpldt0(xa,smndt0(xb))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__1003])]) ).
fof(c_0_11,plain,
! [X37,X38] :
( ~ aInteger0(X37)
| ~ aInteger0(X38)
| aInteger0(sdtpldt0(X37,X38)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntPlus])]) ).
fof(c_0_12,plain,
! [X29,X30,X32,X33] :
( ( aInteger0(X30)
| ~ aDivisorOf0(X30,X29)
| ~ aInteger0(X29) )
& ( X30 != sz00
| ~ aDivisorOf0(X30,X29)
| ~ aInteger0(X29) )
& ( aInteger0(esk2_2(X29,X30))
| ~ aDivisorOf0(X30,X29)
| ~ aInteger0(X29) )
& ( sdtasdt0(X30,esk2_2(X29,X30)) = X29
| ~ aDivisorOf0(X30,X29)
| ~ aInteger0(X29) )
& ( ~ aInteger0(X32)
| X32 = sz00
| ~ aInteger0(X33)
| sdtasdt0(X32,X33) != X29
| aDivisorOf0(X32,X29)
| ~ aInteger0(X29) ) ),
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)],[mDivisor])])])])])]) ).
cnf(c_0_13,hypothesis,
aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[m__1032]) ).
cnf(c_0_15,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[m__979]) ).
fof(c_0_17,plain,
! [X45] :
( ~ aInteger0(X45)
| aInteger0(smndt0(X45)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
cnf(c_0_18,plain,
( aInteger0(X1)
| ~ aDivisorOf0(X1,X2)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,hypothesis,
aDivisorOf0(sdtasdt0(xp,xq),sdtasdt0(sdtasdt0(xp,xq),xm)),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,hypothesis,
( aInteger0(sdtasdt0(sdtasdt0(xp,xq),xm))
| ~ aInteger0(smndt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16])]) ).
cnf(c_0_21,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,hypothesis,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[m__979]) ).
cnf(c_0_23,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_24,plain,
! [X24,X25] :
( ~ aInteger0(X24)
| ~ aInteger0(X25)
| sdtasdt0(X24,X25) = sdtasdt0(X25,X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
cnf(c_0_25,hypothesis,
( aInteger0(sdtasdt0(xp,xq))
| ~ aInteger0(sdtasdt0(sdtasdt0(xp,xq),xm)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,hypothesis,
aInteger0(sdtasdt0(sdtasdt0(xp,xq),xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtasdt0(sdtasdt0(xp,xq),xm),
inference(rw,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_28,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,hypothesis,
aInteger0(sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_30,hypothesis,
aInteger0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(esk1_0,sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_32,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__1032]) ).
fof(c_0_33,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_34,plain,
! [X21,X22,X23] :
( ~ aInteger0(X21)
| ~ aInteger0(X22)
| ~ aInteger0(X23)
| sdtasdt0(X21,sdtasdt0(X22,X23)) = sdtasdt0(sdtasdt0(X21,X22),X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).
cnf(c_0_35,hypothesis,
sdtasdt0(esk1_0,sdtasdt0(xp,xq)) = sdtasdt0(xm,sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_31]),c_0_32]),c_0_29])]) ).
fof(c_0_36,plain,
! [X19,X20] :
( ~ aInteger0(X19)
| ~ aInteger0(X20)
| aInteger0(sdtasdt0(X19,X20)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntMult])]) ).
cnf(c_0_37,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(xm,sdtasdt0(xp,xq)),
inference(rw,[status(thm)],[c_0_31,c_0_35]) ).
cnf(c_0_40,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[m__979]) ).
cnf(c_0_41,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[m__979]) ).
cnf(c_0_42,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
sdtasdt0(sdtasdt0(xp,xq),xm) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(rw,[status(thm)],[c_0_37,c_0_14]) ).
cnf(c_0_44,hypothesis,
sdtasdt0(xm,sdtasdt0(xp,xq)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cn,[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_32]),c_0_40]),c_0_41])]) ).
cnf(c_0_45,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(X3,sdtasdt0(X1,X2))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_38]),c_0_42]) ).
cnf(c_0_46,negated_conjecture,
sdtasdt0(xm,sdtasdt0(xp,xq)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_28]),c_0_29]),c_0_32])]) ).
cnf(c_0_47,hypothesis,
sdtasdt0(xq,sdtasdt0(xm,xp)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_40]),c_0_41]),c_0_32])]) ).
cnf(c_0_48,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_46,c_0_44]) ).
cnf(c_0_49,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_28]),c_0_41]),c_0_32])]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.09 % Problem : NUM435+3 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n008.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 13:59:43 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.13/0.39 Running first-order model finding
% 0.13/0.39 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.5frCxmCWh3/E---3.1_13636.p
% 0.13/0.44 # Version: 3.1pre001
% 0.13/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 # Starting sh5l with 300s (1) cores
% 0.13/0.44 # new_bool_1 with pid 13749 completed with status 0
% 0.13/0.44 # Result found by new_bool_1
% 0.13/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.44 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.13/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.13/0.44 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 13756 completed with status 0
% 0.13/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.13/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.44 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.13/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.13/0.44 # Preprocessing time : 0.002 s
% 0.13/0.44 # Presaturation interreduction done
% 0.13/0.44
% 0.13/0.44 # Proof found!
% 0.13/0.44 # SZS status Theorem
% 0.13/0.44 # SZS output start CNFRefutation
% See solution above
% 0.13/0.44 # Parsed axioms : 26
% 0.13/0.44 # Removed by relevancy pruning/SinE : 3
% 0.13/0.44 # Initial clauses : 42
% 0.13/0.44 # Removed in clause preprocessing : 1
% 0.13/0.44 # Initial clauses in saturation : 41
% 0.13/0.44 # Processed clauses : 557
% 0.13/0.44 # ...of these trivial : 33
% 0.13/0.44 # ...subsumed : 145
% 0.13/0.44 # ...remaining for further processing : 379
% 0.13/0.44 # Other redundant clauses eliminated : 2
% 0.13/0.44 # Clauses deleted for lack of memory : 0
% 0.13/0.44 # Backward-subsumed : 5
% 0.13/0.44 # Backward-rewritten : 115
% 0.13/0.44 # Generated clauses : 2712
% 0.13/0.44 # ...of the previous two non-redundant : 2078
% 0.13/0.44 # ...aggressively subsumed : 0
% 0.13/0.44 # Contextual simplify-reflections : 24
% 0.13/0.44 # Paramodulations : 2710
% 0.13/0.44 # Factorizations : 0
% 0.13/0.44 # NegExts : 0
% 0.13/0.44 # Equation resolutions : 2
% 0.13/0.44 # Total rewrite steps : 3976
% 0.13/0.44 # Propositional unsat checks : 0
% 0.13/0.44 # Propositional check models : 0
% 0.13/0.44 # Propositional check unsatisfiable : 0
% 0.13/0.44 # Propositional clauses : 0
% 0.13/0.44 # Propositional clauses after purity: 0
% 0.13/0.44 # Propositional unsat core size : 0
% 0.13/0.44 # Propositional preprocessing time : 0.000
% 0.13/0.44 # Propositional encoding time : 0.000
% 0.13/0.44 # Propositional solver time : 0.000
% 0.13/0.44 # Success case prop preproc time : 0.000
% 0.13/0.44 # Success case prop encoding time : 0.000
% 0.13/0.44 # Success case prop solver time : 0.000
% 0.13/0.44 # Current number of processed clauses : 216
% 0.13/0.44 # Positive orientable unit clauses : 112
% 0.13/0.44 # Positive unorientable unit clauses: 0
% 0.13/0.44 # Negative unit clauses : 4
% 0.13/0.44 # Non-unit-clauses : 100
% 0.13/0.44 # Current number of unprocessed clauses: 1526
% 0.13/0.44 # ...number of literals in the above : 5414
% 0.13/0.44 # Current number of archived formulas : 0
% 0.13/0.44 # Current number of archived clauses : 161
% 0.13/0.44 # Clause-clause subsumption calls (NU) : 2451
% 0.13/0.44 # Rec. Clause-clause subsumption calls : 1545
% 0.13/0.44 # Non-unit clause-clause subsumptions : 172
% 0.13/0.44 # Unit Clause-clause subsumption calls : 27
% 0.13/0.44 # Rewrite failures with RHS unbound : 0
% 0.13/0.44 # BW rewrite match attempts : 109
% 0.13/0.44 # BW rewrite match successes : 54
% 0.13/0.44 # Condensation attempts : 0
% 0.13/0.44 # Condensation successes : 0
% 0.13/0.44 # Termbank termtop insertions : 56612
% 0.13/0.44
% 0.13/0.44 # -------------------------------------------------
% 0.13/0.44 # User time : 0.038 s
% 0.13/0.44 # System time : 0.002 s
% 0.13/0.44 # Total time : 0.040 s
% 0.13/0.44 # Maximum resident set size: 1856 pages
% 0.13/0.44
% 0.13/0.44 # -------------------------------------------------
% 0.13/0.44 # User time : 0.039 s
% 0.13/0.44 # System time : 0.005 s
% 0.13/0.44 # Total time : 0.044 s
% 0.13/0.44 # Maximum resident set size: 1700 pages
% 0.13/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------