%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG080+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:05:46 PM UTC 2026
% Result : Theorem 4.95s 6.13s
% Output : CNFRefutation 4.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 49 ( 30 unt; 0 def)
% Number of atoms : 94 ( 56 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 67 ( 22 ~; 14 |; 25 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 13 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSPN,axiom,
! [X1,X2] :
( ( aVector0(X2)
& aVector0(X1) )
=> ( ( aDimensionOf0(X2) != sz00
& aDimensionOf0(X1) = aDimensionOf0(X2) )
=> sdtasasdt0(X1,X2) = sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2)))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSPN) ).
fof(m__1692,hypothesis,
aDimensionOf0(xs) != sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1692) ).
fof(m__,conjecture,
sdtlseqdt0(sdtasdt0(sdtasasdt0(xs,xt),sdtasasdt0(xs,xt)),sdtasdt0(sdtasasdt0(xs,xs),sdtasasdt0(xt,xt))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__1709,hypothesis,
( xp = sziznziztdt0(xs)
& ! [X1] :
( aNaturalNumber0(X1)
=> sdtlbdtrb0(xp,X1) = sdtlbdtrb0(xs,X1) )
& szszuzczcdt0(aDimensionOf0(xp)) = aDimensionOf0(xs)
& aVector0(xp) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1709) ).
fof(m__1726,hypothesis,
( xq = sziznziztdt0(xt)
& ! [X1] :
( aNaturalNumber0(X1)
=> sdtlbdtrb0(xq,X1) = sdtlbdtrb0(xt,X1) )
& szszuzczcdt0(aDimensionOf0(xq)) = aDimensionOf0(xt)
& aVector0(xq) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1726) ).
fof(m__1766,hypothesis,
( xB = sdtlbdtrb0(xt,aDimensionOf0(xt))
& aScalar0(xB) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1766) ).
fof(m__1678_01,hypothesis,
aDimensionOf0(xs) = aDimensionOf0(xt),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1678_01) ).
fof(m__1746,hypothesis,
( xA = sdtlbdtrb0(xs,aDimensionOf0(xs))
& aScalar0(xA) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1746) ).
fof(m__1678,hypothesis,
( aVector0(xt)
& aVector0(xs) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1678) ).
fof(m__1783,hypothesis,
( xC = sdtasasdt0(xp,xp)
& aScalar0(xC) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1783) ).
fof(m__1837,hypothesis,
( xF = sdtasdt0(xA,xA)
& aScalar0(xF) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1837) ).
fof(m__1820,hypothesis,
( xE = sdtasasdt0(xp,xq)
& aScalar0(xE) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1820) ).
fof(m__1873,hypothesis,
( xH = sdtasdt0(xA,xB)
& aScalar0(xH) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1873) ).
fof(m__1800,hypothesis,
( xD = sdtasasdt0(xq,xq)
& aScalar0(xD) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1800) ).
fof(m__1854,hypothesis,
( xG = sdtasdt0(xB,xB)
& aScalar0(xG) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1854) ).
fof(m__2733,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xE,xH),sdtpldt0(xE,xH)),sdtasdt0(sdtpldt0(xC,xF),sdtpldt0(xD,xG))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2733) ).
fof(c_0_16,plain,
! [X1,X2] :
( ( aVector0(X2)
& aVector0(X1) )
=> ( ( aDimensionOf0(X2) != sz00
& aDimensionOf0(X1) = aDimensionOf0(X2) )
=> sdtasasdt0(X1,X2) = sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2)))) ) ),
inference(fof_simplification,[status(thm)],[mDefSPN]) ).
fof(c_0_17,hypothesis,
aDimensionOf0(xs) != sz00,
inference(fof_simplification,[status(thm)],[m__1692]) ).
fof(c_0_18,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtasasdt0(xs,xt),sdtasasdt0(xs,xt)),sdtasdt0(sdtasasdt0(xs,xs),sdtasasdt0(xt,xt))),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_19,plain,
! [X41,X42] :
( sdtasasdt0(X41,X42) = sdtpldt0(sdtasasdt0(sziznziztdt0(X41),sziznziztdt0(X42)),sdtasdt0(sdtlbdtrb0(X41,aDimensionOf0(X41)),sdtlbdtrb0(X42,aDimensionOf0(X42))))
| aDimensionOf0(X42) = sz00
| aDimensionOf0(X41) != aDimensionOf0(X42)
| ~ aVector0(X42)
| ~ aVector0(X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_20,hypothesis,
! [X7] :
( xp = sziznziztdt0(xs)
& ( sdtlbdtrb0(xp,X7) = sdtlbdtrb0(xs,X7)
| ~ aNaturalNumber0(X7) )
& szszuzczcdt0(aDimensionOf0(xp)) = aDimensionOf0(xs)
& aVector0(xp) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1709])])])]) ).
fof(c_0_21,hypothesis,
aDimensionOf0(xs) != sz00,
inference(fof_nnf,[status(thm)],[c_0_17]) ).
fof(c_0_22,hypothesis,
! [X8] :
( xq = sziznziztdt0(xt)
& ( sdtlbdtrb0(xq,X8) = sdtlbdtrb0(xt,X8)
| ~ aNaturalNumber0(X8) )
& szszuzczcdt0(aDimensionOf0(xq)) = aDimensionOf0(xt)
& aVector0(xq) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1726])])])]) ).
cnf(c_0_23,hypothesis,
xB = sdtlbdtrb0(xt,aDimensionOf0(xt)),
inference(split_conjunct,[status(thm)],[m__1766]) ).
cnf(c_0_24,hypothesis,
aDimensionOf0(xs) = aDimensionOf0(xt),
inference(split_conjunct,[status(thm)],[m__1678_01]) ).
fof(c_0_25,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtasasdt0(xs,xt),sdtasasdt0(xs,xt)),sdtasdt0(sdtasasdt0(xs,xs),sdtasasdt0(xt,xt))),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( aDimensionOf0(X1) != aDimensionOf0(X2)
| ~ aVector0(X2)
| ~ aVector0(X1)
| sdtasasdt0(X1,X2) = sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2))))
| aDimensionOf0(X2) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,hypothesis,
xA = sdtlbdtrb0(xs,aDimensionOf0(xs)),
inference(split_conjunct,[status(thm)],[m__1746]) ).
cnf(c_0_28,hypothesis,
xp = sziznziztdt0(xs),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,hypothesis,
aVector0(xs),
inference(split_conjunct,[status(thm)],[m__1678]) ).
cnf(c_0_30,hypothesis,
aDimensionOf0(xs) != sz00,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,hypothesis,
xq = sziznziztdt0(xt),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,hypothesis,
sdtlbdtrb0(xt,aDimensionOf0(xs)) = xB,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,hypothesis,
aVector0(xt),
inference(split_conjunct,[status(thm)],[m__1678]) ).
fof(c_0_34,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtasasdt0(xs,xt),sdtasasdt0(xs,xt)),sdtasdt0(sdtasasdt0(xs,xs),sdtasasdt0(xt,xt))),
inference(fof_nnf,[status(thm)],[c_0_25]) ).
cnf(c_0_35,hypothesis,
( ~ aVector0(X1)
| aDimensionOf0(X1) != aDimensionOf0(xs)
| sdtpldt0(sdtasasdt0(sziznziztdt0(X1),xp),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),xA)) = sdtasasdt0(X1,xs) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_36,hypothesis,
xC = sdtasasdt0(xp,xp),
inference(split_conjunct,[status(thm)],[m__1783]) ).
cnf(c_0_37,hypothesis,
xF = sdtasdt0(xA,xA),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_38,hypothesis,
( ~ aVector0(X1)
| aDimensionOf0(X1) != aDimensionOf0(xs)
| sdtpldt0(sdtasasdt0(sziznziztdt0(X1),xq),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),xB)) = sdtasasdt0(X1,xt) ),
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_26,c_0_24]),c_0_31]),c_0_32]),c_0_33])]),c_0_30]) ).
cnf(c_0_39,hypothesis,
xE = sdtasasdt0(xp,xq),
inference(split_conjunct,[status(thm)],[m__1820]) ).
cnf(c_0_40,hypothesis,
xH = sdtasdt0(xA,xB),
inference(split_conjunct,[status(thm)],[m__1873]) ).
cnf(c_0_41,hypothesis,
xD = sdtasasdt0(xq,xq),
inference(split_conjunct,[status(thm)],[m__1800]) ).
cnf(c_0_42,hypothesis,
xG = sdtasdt0(xB,xB),
inference(split_conjunct,[status(thm)],[m__1854]) ).
cnf(c_0_43,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtasasdt0(xs,xt),sdtasasdt0(xs,xt)),sdtasdt0(sdtasasdt0(xs,xs),sdtasasdt0(xt,xt))),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,hypothesis,
sdtasasdt0(xs,xs) = sdtpldt0(xC,xF),
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_35,c_0_27]),c_0_28]),c_0_36]),c_0_37]),c_0_29])]) ).
cnf(c_0_45,hypothesis,
sdtasasdt0(xs,xt) = sdtpldt0(xE,xH),
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_27]),c_0_28]),c_0_39]),c_0_40]),c_0_29])]) ).
cnf(c_0_46,hypothesis,
sdtasasdt0(xt,xt) = sdtpldt0(xD,xG),
inference(cn,[status(thm)],[inference(rw,[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_24]),c_0_31]),c_0_41]),c_0_32]),c_0_42]),c_0_33])]) ).
cnf(c_0_47,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xE,xH),sdtpldt0(xE,xH)),sdtasdt0(sdtpldt0(xC,xF),sdtpldt0(xD,xG))),
inference(split_conjunct,[status(thm)],[m__2733]) ).
cnf(c_0_48,negated_conjecture,
$false,
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_43,c_0_44]),c_0_45]),c_0_45]),c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG080+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.39 % Computer : n002.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Mon Sep 21 04:21:23 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.44 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/benchmark/theBenchmark.p
% 4.95/6.13 % Version: 3.5.1
% 4.95/6.13 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.95/6.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.95/6.13 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.95/6.13 % Starting new_bool_3 with 300s (1) cores
% 4.95/6.13 % Starting new_bool_1 with 300s (1) cores
% 4.95/6.13 % Starting sh5l with 300s (1) cores
% 4.95/6.13 % new_bool_1 with pid 2414527 completed with status 0
% 4.95/6.13 % Result found by new_bool_1
% 4.95/6.13 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.95/6.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.95/6.13 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.95/6.13 % Starting new_bool_3 with 300s (1) cores
% 4.95/6.13 % Starting new_bool_1 with 300s (1) cores
% 4.95/6.13 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.95/6.13 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.95/6.13 % Search class: FGHSF-FFMM21-MFFFFFNN
% 4.95/6.13 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.95/6.13 % Starting SubtermCWHack with 31s (1) cores
% 4.95/6.13 % SubtermCWHack with pid 2414531 completed with status 0
% 4.95/6.13 % Result found by SubtermCWHack
% 4.95/6.13 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.95/6.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.95/6.13 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.95/6.13 % Starting new_bool_3 with 300s (1) cores
% 4.95/6.13 % Starting new_bool_1 with 300s (1) cores
% 4.95/6.13 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.95/6.13 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.95/6.13 % Search class: FGHSF-FFMM21-MFFFFFNN
% 4.95/6.13 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.95/6.13 % Starting SubtermCWHack with 31s (1) cores
% 4.95/6.13 % Preprocessing time : 0.002 s
% 4.95/6.13
% 4.95/6.13 % Proof found!
% 4.95/6.13 % SZS status Theorem
% 4.95/6.13 % SZS output start CNFRefutation
% See solution above
% 4.95/6.13 % Parsed axioms : 59
% 4.95/6.13 % Removed by relevancy pruning/SinE : 4
% 4.95/6.13 % Initial clauses : 85
% 4.95/6.13 % Removed in clause preprocessing : 5
% 4.95/6.13 % Initial clauses in saturation : 80
% 4.95/6.13 % Processed clauses : 3675
% 4.95/6.13 % ...of these trivial : 204
% 4.95/6.13 % ...subsumed : 1359
% 4.95/6.13 % ...remaining for further processing : 2112
% 4.95/6.13 % Other redundant clauses eliminated : 7
% 4.95/6.13 % Clauses deleted for lack of memory : 0
% 4.95/6.13 % Backward-subsumed : 84
% 4.95/6.13 % Backward-rewritten : 28
% 4.95/6.13 % Generated clauses : 34891
% 4.95/6.13 % ...of the previous two non-redundant : 32889
% 4.95/6.13 % ...aggressively subsumed : 0
% 4.95/6.13 % Contextual simplify-reflections : 58
% 4.95/6.13 % Paramodulations : 34873
% 4.95/6.13 % Factorizations : 0
% 4.95/6.13 % NegExts : 0
% 4.95/6.13 % Equation resolutions : 18
% 4.95/6.13 % Disequality decompositions : 0
% 4.95/6.13 % Total rewrite steps : 30318
% 4.95/6.13 % ...of those cached : 29900
% 4.95/6.13 % Propositional unsat checks : 0
% 4.95/6.13 % Propositional check models : 0
% 4.95/6.13 % Propositional check unsatisfiable : 0
% 4.95/6.13 % Propositional clauses : 0
% 4.95/6.13 % Propositional clauses after purity: 0
% 4.95/6.13 % Propositional unsat core size : 0
% 4.95/6.13 % Propositional preprocessing time : 0.000
% 4.95/6.13 % Propositional encoding time : 0.000
% 4.95/6.13 % Propositional solver time : 0.000
% 4.95/6.13 % Success case prop preproc time : 0.000
% 4.95/6.13 % Success case prop encoding time : 0.000
% 4.95/6.13 % Success case prop solver time : 0.000
% 4.95/6.13 % Current number of processed clauses : 1997
% 4.95/6.13 % Positive orientable unit clauses : 575
% 4.95/6.13 % Positive unorientable unit clauses: 0
% 4.95/6.13 % Negative unit clauses : 3
% 4.95/6.13 % Non-unit-clauses : 1419
% 4.95/6.13 % Current number of unprocessed clauses: 29181
% 4.95/6.13 % ...number of literals in the above : 117231
% 4.95/6.13 % Current number of archived formulas : 0
% 4.95/6.13 % Current number of archived clauses : 112
% 4.95/6.13 % Clause-clause subsumption calls (NU) : 306923
% 4.95/6.13 % Rec. Clause-clause subsumption calls : 161534
% 4.95/6.13 % Non-unit clause-clause subsumptions : 1498
% 4.95/6.13 % Unit Clause-clause subsumption calls : 24886
% 4.95/6.13 % Rewrite failures with RHS unbound : 0
% 4.95/6.13 % BW rewrite match attempts : 6838
% 4.95/6.13 % BW rewrite match successes : 15
% 4.95/6.13 % Condensation attempts : 0
% 4.95/6.13 % Condensation successes : 0
% 4.95/6.13 % Termbank termtop insertions : 654420
% 4.95/6.13 % Search garbage collected termcells : 905
% 4.95/6.13
% 4.95/6.13 % -------------------------------------------------
% 4.95/6.13 % User time : 0.623 s
% 4.95/6.13 % System time : 0.037 s
% 4.95/6.13 % Total time : 0.660 s
% 4.95/6.13 % Maximum resident set size: 3960 pages
% 4.95/6.13
% 4.95/6.13 % -------------------------------------------------
% 4.95/6.13 % User time : 0.626 s
% 4.95/6.13 % System time : 0.041 s
% 4.95/6.13 % Total time : 0.667 s
% 4.95/6.13 % Maximum resident set size: 4608 pages
% 4.95/6.13 % E exiting
%------------------------------------------------------------------------------