TSTP Solution File: RNG122+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG122+1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:36:29 EDT 2024
% Result : Theorem 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 49 ( 18 unt; 0 def)
% Number of atoms : 146 ( 35 equ)
% Maximal formula atoms : 29 ( 2 avg)
% Number of connectives : 158 ( 61 ~; 54 |; 30 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefIdeal,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefIdeal) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddComm) ).
fof(m__,conjecture,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__2174,hypothesis,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2174) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddAsso) ).
fof(m__2666,hypothesis,
( aElement0(xq)
& aElement0(xr)
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& ( xr = sz00
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2666) ).
fof(m__2690,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2690) ).
fof(mAddInvr,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtpldt0(X1,smndt0(X1)) = sz00
& sz00 = sdtpldt0(smndt0(X1),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddInvr) ).
fof(m__2091,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(m__2273,hypothesis,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(c_0_13,plain,
! [X62,X63,X64,X65,X66] :
( ( aSet0(X62)
| ~ aIdeal0(X62) )
& ( ~ aElementOf0(X64,X62)
| aElementOf0(sdtpldt0(X63,X64),X62)
| ~ aElementOf0(X63,X62)
| ~ aIdeal0(X62) )
& ( ~ aElement0(X65)
| aElementOf0(sdtasdt0(X65,X63),X62)
| ~ aElementOf0(X63,X62)
| ~ aIdeal0(X62) )
& ( aElementOf0(esk9_1(X66),X66)
| ~ aSet0(X66)
| aIdeal0(X66) )
& ( aElement0(esk11_1(X66))
| aElementOf0(esk10_1(X66),X66)
| ~ aSet0(X66)
| aIdeal0(X66) )
& ( ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66)
| aElementOf0(esk10_1(X66),X66)
| ~ aSet0(X66)
| aIdeal0(X66) )
& ( aElement0(esk11_1(X66))
| ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
| ~ aSet0(X66)
| aIdeal0(X66) )
& ( ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66)
| ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
| ~ aSet0(X66)
| aIdeal0(X66) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[mDefIdeal])])])])])])]) ).
fof(c_0_14,plain,
! [X13,X14] :
( ~ aElement0(X13)
| ~ aElement0(X14)
| sdtpldt0(X13,X14) = sdtpldt0(X14,X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
fof(c_0_15,negated_conjecture,
xr != sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_16,plain,
! [X34,X35] :
( ~ aSet0(X34)
| ~ aElementOf0(X35,X34)
| aElement0(X35) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_17,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_19,plain,
! [X15,X16,X17] :
( ~ aElement0(X15)
| ~ aElement0(X16)
| ~ aElement0(X17)
| sdtpldt0(sdtpldt0(X15,X16),X17) = sdtpldt0(X15,sdtpldt0(X16,X17)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])])]) ).
cnf(c_0_20,hypothesis,
xb = sdtpldt0(sdtasdt0(xq,xu),xr),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_21,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,hypothesis,
aElement0(xr),
inference(split_conjunct,[status(thm)],[m__2666]) ).
fof(c_0_23,negated_conjecture,
xr != sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[m__2690]) ).
cnf(c_0_26,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,hypothesis,
( sdtpldt0(xr,sdtasdt0(xq,xu)) = xb
| ~ aElement0(sdtasdt0(xq,xu)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
fof(c_0_29,plain,
! [X19] :
( ( sdtpldt0(X19,smndt0(X19)) = sz00
| ~ aElement0(X19) )
& ( sz00 = sdtpldt0(smndt0(X19),X19)
| ~ aElement0(X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddInvr])])])]) ).
cnf(c_0_30,negated_conjecture,
xr != sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,hypothesis,
aElement0(smndt0(sdtasdt0(xq,xu))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_32,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_33,hypothesis,
( sdtpldt0(xr,sdtpldt0(sdtasdt0(xq,xu),X1)) = sdtpldt0(xb,X1)
| ~ aElement0(sdtasdt0(xq,xu))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22])]) ).
cnf(c_0_34,plain,
( sdtpldt0(X1,smndt0(X1)) = sz00
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_35,hypothesis,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
cnf(c_0_36,negated_conjecture,
sdtpldt0(xb,smndt0(sdtasdt0(xq,xu))) != xr,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_21]),c_0_31]),c_0_32])]) ).
cnf(c_0_37,hypothesis,
( sdtpldt0(xb,smndt0(sdtasdt0(xq,xu))) = sdtpldt0(xr,sz00)
| ~ aElement0(sdtasdt0(xq,xu)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31])]) ).
fof(c_0_38,plain,
! [X18] :
( ( sdtpldt0(X18,sz00) = X18
| ~ aElement0(X18) )
& ( X18 = sdtpldt0(sz00,X18)
| ~ aElement0(X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])])]) ).
fof(c_0_39,hypothesis,
! [X117] :
( aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X117,xI)
| X117 = sz00
| ~ iLess0(sbrdtbr0(X117),sbrdtbr0(xu)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])]) ).
cnf(c_0_40,negated_conjecture,
( sdtpldt0(xr,sz00) != xr
| ~ aElement0(sdtasdt0(xq,xu)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_42,plain,
! [X11,X12] :
( ~ aElement0(X11)
| ~ aElement0(X12)
| aElement0(sdtasdt0(X11,X12)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_43,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
~ aElement0(sdtasdt0(xq,xu)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_22])]) ).
cnf(c_0_45,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_46,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_43]),c_0_26])]) ).
cnf(c_0_47,hypothesis,
aElement0(xq),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : RNG122+1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 12:28:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.52 Running first-order theorem proving
% 0.19/0.52 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/benchmark/theBenchmark.p
% 0.19/0.56 # Version: 3.1.0
% 0.19/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.56 # Starting sh5l with 300s (1) cores
% 0.19/0.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 30845 completed with status 0
% 0.19/0.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.56 # No SInE strategy applied
% 0.19/0.56 # Search class: FGHSF-FSMM32-MFFFFFNN
% 0.19/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.56 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.19/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.56 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.56 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.56 # Starting sh5l with 136s (1) cores
% 0.19/0.56 # SAT001_CO_MinMin_p005000_rr with pid 30851 completed with status 0
% 0.19/0.56 # Result found by SAT001_CO_MinMin_p005000_rr
% 0.19/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.56 # No SInE strategy applied
% 0.19/0.56 # Search class: FGHSF-FSMM32-MFFFFFNN
% 0.19/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.56 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.19/0.56 # Preprocessing time : 0.004 s
% 0.19/0.56 # Presaturation interreduction done
% 0.19/0.56
% 0.19/0.56 # Proof found!
% 0.19/0.56 # SZS status Theorem
% 0.19/0.56 # SZS output start CNFRefutation
% See solution above
% 0.19/0.56 # Parsed axioms : 54
% 0.19/0.56 # Removed by relevancy pruning/SinE : 0
% 0.19/0.56 # Initial clauses : 122
% 0.19/0.56 # Removed in clause preprocessing : 4
% 0.19/0.56 # Initial clauses in saturation : 118
% 0.19/0.56 # Processed clauses : 313
% 0.19/0.56 # ...of these trivial : 4
% 0.19/0.56 # ...subsumed : 29
% 0.19/0.56 # ...remaining for further processing : 280
% 0.19/0.56 # Other redundant clauses eliminated : 18
% 0.19/0.56 # Clauses deleted for lack of memory : 0
% 0.19/0.56 # Backward-subsumed : 10
% 0.19/0.56 # Backward-rewritten : 2
% 0.19/0.56 # Generated clauses : 469
% 0.19/0.56 # ...of the previous two non-redundant : 406
% 0.19/0.56 # ...aggressively subsumed : 0
% 0.19/0.56 # Contextual simplify-reflections : 2
% 0.19/0.56 # Paramodulations : 453
% 0.19/0.56 # Factorizations : 0
% 0.19/0.56 # NegExts : 0
% 0.19/0.56 # Equation resolutions : 18
% 0.19/0.56 # Disequality decompositions : 0
% 0.19/0.56 # Total rewrite steps : 252
% 0.19/0.56 # ...of those cached : 234
% 0.19/0.56 # Propositional unsat checks : 0
% 0.19/0.56 # Propositional check models : 0
% 0.19/0.56 # Propositional check unsatisfiable : 0
% 0.19/0.56 # Propositional clauses : 0
% 0.19/0.56 # Propositional clauses after purity: 0
% 0.19/0.56 # Propositional unsat core size : 0
% 0.19/0.56 # Propositional preprocessing time : 0.000
% 0.19/0.56 # Propositional encoding time : 0.000
% 0.19/0.56 # Propositional solver time : 0.000
% 0.19/0.56 # Success case prop preproc time : 0.000
% 0.19/0.56 # Success case prop encoding time : 0.000
% 0.19/0.56 # Success case prop solver time : 0.000
% 0.19/0.56 # Current number of processed clauses : 136
% 0.19/0.56 # Positive orientable unit clauses : 38
% 0.19/0.56 # Positive unorientable unit clauses: 0
% 0.19/0.56 # Negative unit clauses : 12
% 0.19/0.56 # Non-unit-clauses : 86
% 0.19/0.56 # Current number of unprocessed clauses: 314
% 0.19/0.56 # ...number of literals in the above : 1502
% 0.19/0.56 # Current number of archived formulas : 0
% 0.19/0.56 # Current number of archived clauses : 130
% 0.19/0.56 # Clause-clause subsumption calls (NU) : 2133
% 0.19/0.56 # Rec. Clause-clause subsumption calls : 546
% 0.19/0.56 # Non-unit clause-clause subsumptions : 26
% 0.19/0.56 # Unit Clause-clause subsumption calls : 47
% 0.19/0.56 # Rewrite failures with RHS unbound : 0
% 0.19/0.56 # BW rewrite match attempts : 4
% 0.19/0.56 # BW rewrite match successes : 2
% 0.19/0.56 # Condensation attempts : 313
% 0.19/0.56 # Condensation successes : 0
% 0.19/0.56 # Termbank termtop insertions : 17906
% 0.19/0.56 # Search garbage collected termcells : 1913
% 0.19/0.56
% 0.19/0.56 # -------------------------------------------------
% 0.19/0.56 # User time : 0.031 s
% 0.19/0.56 # System time : 0.006 s
% 0.19/0.56 # Total time : 0.037 s
% 0.19/0.56 # Maximum resident set size: 2048 pages
% 0.19/0.56
% 0.19/0.56 # -------------------------------------------------
% 0.19/0.56 # User time : 0.125 s
% 0.19/0.56 # System time : 0.027 s
% 0.19/0.56 # Total time : 0.152 s
% 0.19/0.56 # Maximum resident set size: 1760 pages
% 0.19/0.56 % E---3.1 exiting
% 0.19/0.57 % E exiting
%------------------------------------------------------------------------------