TSTP Solution File: RNG073+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG073+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:15:00 EDT 2023
% Result : Theorem 0.21s 0.64s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 47 ( 18 unt; 0 def)
% Number of atoms : 124 ( 33 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 133 ( 56 ~; 53 |; 17 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 14 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDistr,axiom,
! [X1,X2,X3] :
( ( aScalar0(X1)
& aScalar0(X2)
& aScalar0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)) ) ),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',mDistr) ).
fof(mLEASm,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',mLEASm) ).
fof(mSumSc,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',mSumSc) ).
fof(mMulSc,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',mMulSc) ).
fof(m__1911,hypothesis,
( aScalar0(xP)
& xP = sdtasdt0(xE,xH) ),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',m__1911) ).
fof(m__1873,hypothesis,
( aScalar0(xH)
& xH = sdtasdt0(xA,xB) ),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',m__1873) ).
fof(m__1820,hypothesis,
( aScalar0(xE)
& xE = sdtasasdt0(xp,xq) ),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',m__1820) ).
fof(m__2405,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',m__2405) ).
fof(m__2654,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',m__2654) ).
fof(mSqrt,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> ( ( sdtlseqdt0(sz0z00,X1)
& sdtlseqdt0(sz0z00,X2)
& sdtasdt0(X1,X1) = sdtasdt0(X2,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',mSqrt) ).
fof(m__2628,hypothesis,
( sdtlseqdt0(sz0z00,sdtpldt0(xR,xS))
& sdtlseqdt0(sz0z00,sdtpldt0(xP,xP)) ),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',m__2628) ).
fof(m__,conjecture,
sdtpldt0(xR,xS) = sdtpldt0(xP,xP),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',m__) ).
fof(m__1930,hypothesis,
( aScalar0(xS)
& xS = sdtasdt0(xF,xD) ),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',m__1930) ).
fof(m__1892,hypothesis,
( aScalar0(xR)
& xR = sdtasdt0(xC,xG) ),
file('/export/starexec/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p',m__1892) ).
fof(c_0_14,plain,
! [X44,X45,X46] :
( ( sdtasdt0(X44,sdtpldt0(X45,X46)) = sdtpldt0(sdtasdt0(X44,X45),sdtasdt0(X44,X46))
| ~ aScalar0(X44)
| ~ aScalar0(X45)
| ~ aScalar0(X46) )
& ( sdtasdt0(sdtpldt0(X44,X45),X46) = sdtpldt0(sdtasdt0(X44,X46),sdtasdt0(X45,X46))
| ~ aScalar0(X44)
| ~ aScalar0(X45)
| ~ aScalar0(X46) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDistr])])]) ).
fof(c_0_15,plain,
! [X9,X10] :
( ~ aScalar0(X9)
| ~ aScalar0(X10)
| ~ sdtlseqdt0(X9,X10)
| ~ sdtlseqdt0(X10,X9)
| X9 = X10 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEASm])]) ).
fof(c_0_16,plain,
! [X39,X40] :
( ~ aScalar0(X39)
| ~ aScalar0(X40)
| aScalar0(sdtpldt0(X39,X40)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSumSc])]) ).
fof(c_0_17,plain,
! [X20,X21] :
( ~ aScalar0(X20)
| ~ aScalar0(X21)
| aScalar0(sdtasdt0(X20,X21)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulSc])]) ).
cnf(c_0_18,plain,
( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
xP = sdtasdt0(xE,xH),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_20,hypothesis,
aScalar0(xH),
inference(split_conjunct,[status(thm)],[m__1873]) ).
cnf(c_0_21,hypothesis,
aScalar0(xE),
inference(split_conjunct,[status(thm)],[m__1820]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),
inference(split_conjunct,[status(thm)],[m__2405]) ).
cnf(c_0_24,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(split_conjunct,[status(thm)],[m__2654]) ).
fof(c_0_25,plain,
! [X58,X59] :
( ~ aScalar0(X58)
| ~ aScalar0(X59)
| ~ sdtlseqdt0(sz0z00,X58)
| ~ sdtlseqdt0(sz0z00,X59)
| sdtasdt0(X58,X58) != sdtasdt0(X59,X59)
| X58 = X59 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSqrt])]) ).
cnf(c_0_26,plain,
( aScalar0(sdtpldt0(X1,X2))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( aScalar0(sdtasdt0(X1,X2))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,hypothesis,
( sdtpldt0(sdtasdt0(xE,X1),xP) = sdtasdt0(xE,sdtpldt0(X1,xH))
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_29,hypothesis,
( sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)) = sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))
| ~ aScalar0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)))
| ~ aScalar0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))) ),
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,plain,
( X1 = X2
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ sdtlseqdt0(sz0z00,X1)
| ~ sdtlseqdt0(sz0z00,X2)
| sdtasdt0(X1,X1) != sdtasdt0(X2,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,hypothesis,
sdtlseqdt0(sz0z00,sdtpldt0(xP,xP)),
inference(split_conjunct,[status(thm)],[m__2628]) ).
cnf(c_0_32,plain,
( aScalar0(sdtasdt0(X1,sdtpldt0(X2,X3)))
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_18]),c_0_27]),c_0_27]) ).
cnf(c_0_33,hypothesis,
sdtasdt0(xE,sdtpldt0(xH,xH)) = sdtpldt0(xP,xP),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_19]),c_0_20])]) ).
cnf(c_0_34,hypothesis,
( sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)) = sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))
| ~ aScalar0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_35,hypothesis,
( X1 = sdtpldt0(xP,xP)
| sdtasdt0(X1,X1) != sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))
| ~ sdtlseqdt0(sz0z00,X1)
| ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,hypothesis,
aScalar0(sdtpldt0(xP,xP)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_20]),c_0_21])]) ).
cnf(c_0_37,hypothesis,
( sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)) = sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP)) ),
inference(spm,[status(thm)],[c_0_34,c_0_27]) ).
fof(c_0_38,negated_conjecture,
sdtpldt0(xR,xS) != sdtpldt0(xP,xP),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_39,hypothesis,
( X1 = sdtpldt0(xP,xP)
| sdtasdt0(X1,X1) != sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))
| ~ sdtlseqdt0(sz0z00,X1)
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_40,hypothesis,
( sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)) = sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_36])]) ).
cnf(c_0_41,hypothesis,
sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
inference(split_conjunct,[status(thm)],[m__2628]) ).
cnf(c_0_42,negated_conjecture,
sdtpldt0(xR,xS) != sdtpldt0(xP,xP),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,hypothesis,
~ aScalar0(sdtpldt0(xR,xS)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),c_0_42]) ).
cnf(c_0_44,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_45,hypothesis,
aScalar0(xR),
inference(split_conjunct,[status(thm)],[m__1892]) ).
cnf(c_0_46,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_26]),c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : RNG073+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 19:59:14 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.MjTN7kGZcW/E---3.1_24592.p
% 0.21/0.64 # Version: 3.1pre001
% 0.21/0.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.64 # Starting sh5l with 300s (1) cores
% 0.21/0.64 # new_bool_1 with pid 24672 completed with status 0
% 0.21/0.64 # Result found by new_bool_1
% 0.21/0.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.64 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.21/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.64 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24677 completed with status 0
% 0.21/0.64 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.64 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.21/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.64 # Preprocessing time : 0.002 s
% 0.21/0.64 # Presaturation interreduction done
% 0.21/0.64
% 0.21/0.64 # Proof found!
% 0.21/0.64 # SZS status Theorem
% 0.21/0.64 # SZS output start CNFRefutation
% See solution above
% 0.21/0.65 # Parsed axioms : 64
% 0.21/0.65 # Removed by relevancy pruning/SinE : 4
% 0.21/0.65 # Initial clauses : 87
% 0.21/0.65 # Removed in clause preprocessing : 5
% 0.21/0.65 # Initial clauses in saturation : 82
% 0.21/0.65 # Processed clauses : 1339
% 0.21/0.65 # ...of these trivial : 22
% 0.21/0.65 # ...subsumed : 627
% 0.21/0.65 # ...remaining for further processing : 690
% 0.21/0.65 # Other redundant clauses eliminated : 3
% 0.21/0.65 # Clauses deleted for lack of memory : 0
% 0.21/0.65 # Backward-subsumed : 42
% 0.21/0.65 # Backward-rewritten : 43
% 0.21/0.65 # Generated clauses : 4752
% 0.21/0.65 # ...of the previous two non-redundant : 4486
% 0.21/0.65 # ...aggressively subsumed : 0
% 0.21/0.65 # Contextual simplify-reflections : 31
% 0.21/0.65 # Paramodulations : 4742
% 0.21/0.65 # Factorizations : 0
% 0.21/0.65 # NegExts : 0
% 0.21/0.65 # Equation resolutions : 10
% 0.21/0.65 # Total rewrite steps : 4430
% 0.21/0.65 # Propositional unsat checks : 0
% 0.21/0.65 # Propositional check models : 0
% 0.21/0.65 # Propositional check unsatisfiable : 0
% 0.21/0.65 # Propositional clauses : 0
% 0.21/0.65 # Propositional clauses after purity: 0
% 0.21/0.65 # Propositional unsat core size : 0
% 0.21/0.65 # Propositional preprocessing time : 0.000
% 0.21/0.65 # Propositional encoding time : 0.000
% 0.21/0.65 # Propositional solver time : 0.000
% 0.21/0.65 # Success case prop preproc time : 0.000
% 0.21/0.65 # Success case prop encoding time : 0.000
% 0.21/0.65 # Success case prop solver time : 0.000
% 0.21/0.65 # Current number of processed clauses : 520
% 0.21/0.65 # Positive orientable unit clauses : 113
% 0.21/0.65 # Positive unorientable unit clauses: 0
% 0.21/0.65 # Negative unit clauses : 6
% 0.21/0.65 # Non-unit-clauses : 401
% 0.21/0.65 # Current number of unprocessed clauses: 3266
% 0.21/0.65 # ...number of literals in the above : 15236
% 0.21/0.65 # Current number of archived formulas : 0
% 0.21/0.65 # Current number of archived clauses : 167
% 0.21/0.65 # Clause-clause subsumption calls (NU) : 32909
% 0.21/0.65 # Rec. Clause-clause subsumption calls : 17415
% 0.21/0.65 # Non-unit clause-clause subsumptions : 652
% 0.21/0.65 # Unit Clause-clause subsumption calls : 625
% 0.21/0.65 # Rewrite failures with RHS unbound : 0
% 0.21/0.65 # BW rewrite match attempts : 12
% 0.21/0.65 # BW rewrite match successes : 9
% 0.21/0.65 # Condensation attempts : 0
% 0.21/0.65 # Condensation successes : 0
% 0.21/0.65 # Termbank termtop insertions : 98556
% 0.21/0.65
% 0.21/0.65 # -------------------------------------------------
% 0.21/0.65 # User time : 0.108 s
% 0.21/0.65 # System time : 0.009 s
% 0.21/0.65 # Total time : 0.117 s
% 0.21/0.65 # Maximum resident set size: 2016 pages
% 0.21/0.65
% 0.21/0.65 # -------------------------------------------------
% 0.21/0.65 # User time : 0.110 s
% 0.21/0.65 # System time : 0.011 s
% 0.21/0.65 # Total time : 0.121 s
% 0.21/0.65 # Maximum resident set size: 1744 pages
% 0.21/0.65 % E---3.1 exiting
% 0.21/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------