%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU261+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:28:46 PM UTC 2026
% Result : Theorem 2.97s 1.34s
% Output : CNFRefutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 46 ( 11 unt; 0 def)
% Number of atoms : 201 ( 0 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 250 ( 95 ~; 83 |; 37 &)
% ( 2 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 42 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t53_wellord1,lemma,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( relation_isomorphism(X1,X2,X3)
=> ( ( well_founded_relation(X1)
=> well_founded_relation(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( connected(X1)
=> connected(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( reflexive(X1)
=> reflexive(X2) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t53_wellord1) ).
fof(t54_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( ( relation_isomorphism(X1,X2,X3)
& well_ordering(X1) )
=> well_ordering(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t54_wellord1) ).
fof(d4_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( well_ordering(X1)
<=> ( well_founded_relation(X1)
& connected(X1)
& antisymmetric(X1)
& transitive(X1)
& reflexive(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_wellord1) ).
fof(c_0_3,plain,
! [X1,X2] :
( epred1_2(X2,X1)
<=> ( ( well_founded_relation(X1)
=> well_founded_relation(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( connected(X1)
=> connected(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( reflexive(X1)
=> reflexive(X2) ) ) ),
introduced(definition) ).
fof(c_0_4,lemma,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( relation_isomorphism(X1,X2,X3)
=> epred1_2(X2,X1) ) ) ) ),
inference(apply_def,[status(thm)],[t53_wellord1,c_0_3]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( ( relation_isomorphism(X1,X2,X3)
& well_ordering(X1) )
=> well_ordering(X2) ) ) ) ),
inference(assume_negation,[status(cth)],[t54_wellord1]) ).
fof(c_0_6,plain,
! [X1,X2] :
( epred1_2(X2,X1)
=> ( ( well_founded_relation(X1)
=> well_founded_relation(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( connected(X1)
=> connected(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( reflexive(X1)
=> reflexive(X2) ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_7,lemma,
! [X782,X783,X784] :
( epred1_2(X783,X782)
| ~ relation_isomorphism(X782,X783,X784)
| ~ function(X784)
| ~ relation(X784)
| ~ relation(X783)
| ~ relation(X782) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_8,negated_conjecture,
( ~ well_ordering(esk120_0)
& relation_isomorphism(esk119_0,esk120_0,esk121_0)
& well_ordering(esk119_0)
& function(esk121_0)
& relation(esk121_0)
& relation(esk120_0)
& relation(esk119_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_9,plain,
! [X888,X889] :
( ( ~ epred1_2(X889,X888)
| well_founded_relation(X889)
| ~ well_founded_relation(X888) )
& ( ~ epred1_2(X889,X888)
| antisymmetric(X889)
| ~ antisymmetric(X888) )
& ( ~ epred1_2(X889,X888)
| connected(X889)
| ~ connected(X888) )
& ( ~ epred1_2(X889,X888)
| transitive(X889)
| ~ transitive(X888) )
& ( ~ epred1_2(X889,X888)
| reflexive(X889)
| ~ reflexive(X888) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_10,lemma,
( ~ relation_isomorphism(X1,X2,X3)
| ~ function(X3)
| ~ relation(X3)
| ~ relation(X2)
| ~ relation(X1)
| epred1_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
relation_isomorphism(esk119_0,esk120_0,esk121_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
relation(esk121_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
relation(esk120_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
relation(esk119_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
function(esk121_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_16,plain,
! [X285] :
( ( ~ relation(X285)
| well_ordering(X285)
| ~ well_founded_relation(X285)
| ~ connected(X285)
| ~ antisymmetric(X285)
| ~ transitive(X285)
| ~ reflexive(X285) )
& ( ~ relation(X285)
| ~ well_ordering(X285)
| well_founded_relation(X285) )
& ( ~ relation(X285)
| ~ well_ordering(X285)
| connected(X285) )
& ( ~ relation(X285)
| ~ well_ordering(X285)
| antisymmetric(X285) )
& ( ~ relation(X285)
| ~ well_ordering(X285)
| transitive(X285) )
& ( ~ relation(X285)
| ~ well_ordering(X285)
| reflexive(X285) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_wellord1])])])]) ).
cnf(c_0_17,plain,
( ~ epred1_2(X2,X1)
| ~ connected(X1)
| connected(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
epred1_2(esk120_0,esk119_0),
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_10,c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_19,plain,
( ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1)
| well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( ~ connected(esk119_0)
| connected(esk120_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
~ well_ordering(esk120_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( ~ antisymmetric(esk120_0)
| ~ connected(esk119_0)
| ~ transitive(esk120_0)
| ~ well_founded_relation(esk120_0)
| ~ reflexive(esk120_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13])]),c_0_21]) ).
cnf(c_0_23,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
well_ordering(esk119_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,plain,
( ~ epred1_2(X2,X1)
| ~ well_founded_relation(X1)
| well_founded_relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,plain,
( ~ antisymmetric(esk120_0)
| ~ transitive(esk120_0)
| ~ well_founded_relation(esk120_0)
| ~ reflexive(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_14])]) ).
cnf(c_0_27,plain,
( ~ well_founded_relation(esk119_0)
| well_founded_relation(esk120_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_28,plain,
( ~ antisymmetric(esk120_0)
| ~ transitive(esk120_0)
| ~ well_founded_relation(esk119_0)
| ~ reflexive(esk120_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,plain,
( ~ epred1_2(X2,X1)
| ~ antisymmetric(X1)
| antisymmetric(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,plain,
( ~ antisymmetric(esk120_0)
| ~ transitive(esk120_0)
| ~ reflexive(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24]),c_0_14])]) ).
cnf(c_0_32,plain,
( ~ antisymmetric(esk119_0)
| antisymmetric(esk120_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_18]) ).
cnf(c_0_33,plain,
( ~ antisymmetric(esk119_0)
| ~ transitive(esk120_0)
| ~ reflexive(esk120_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_35,plain,
( ~ epred1_2(X2,X1)
| ~ transitive(X1)
| transitive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_36,plain,
( ~ transitive(esk120_0)
| ~ reflexive(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_24]),c_0_14])]) ).
cnf(c_0_37,plain,
( ~ transitive(esk119_0)
| transitive(esk120_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_18]) ).
cnf(c_0_38,plain,
( ~ transitive(esk119_0)
| ~ reflexive(esk120_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_40,plain,
( ~ epred1_2(X2,X1)
| ~ reflexive(X1)
| reflexive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,plain,
~ reflexive(esk120_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_24]),c_0_14])]) ).
cnf(c_0_42,plain,
( ~ reflexive(esk119_0)
| reflexive(esk120_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_18]) ).
cnf(c_0_43,plain,
~ reflexive(esk119_0),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_45,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_24]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU261+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.66 % Computer : n014.cluster.edu
% 0.22/0.66 % Model : x86_64 x86_64
% 0.22/0.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.66 % Memory : 8046.5625MB
% 0.22/0.66 % OS : Linux 6.8.0-71-generic
% 0.22/0.66 % CPULimit : 300
% 0.22/0.66 % WCLimit : 300
% 0.22/0.66 % DateTime : Mon Sep 21 06:04:35 UTC 2026
% 0.22/0.66 % CPUTime :
% 0.22/0.66 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.74 Running first-order theorem proving
% 0.25/0.74 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
% 2.97/1.34 % Version: 3.5.1
% 2.97/1.34 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.97/1.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.97/1.34 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.97/1.34 % Starting new_bool_3 with 300s (1) cores
% 2.97/1.34 % Starting new_bool_1 with 300s (1) cores
% 2.97/1.34 % Starting sh5l with 300s (1) cores
% 2.97/1.34 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3298519 completed with status 0
% 2.97/1.34 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.97/1.34 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.97/1.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.97/1.34 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.97/1.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.97/1.34 % No SInE strategy applied
% 2.97/1.34 % Search class: FGHSM-FSLM32-MFFFFFNN
% 2.97/1.34 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 2.97/1.34 % Starting SubtermCWHack with 136s (1) cores
% 2.97/1.34 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.97/1.34 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 2.97/1.34 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 2.97/1.34 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 2.97/1.34 % U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 3298528 completed with status 0
% 2.97/1.34 % Result found by U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN
% 2.97/1.34 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.97/1.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.97/1.34 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.97/1.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.97/1.34 % No SInE strategy applied
% 2.97/1.34 % Search class: FGHSM-FSLM32-MFFFFFNN
% 2.97/1.34 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 2.97/1.34 % Starting SubtermCWHack with 136s (1) cores
% 2.97/1.34 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.97/1.34 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 2.97/1.34 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 2.97/1.34 % Preprocessing time : 0.019 s
% 2.97/1.34 % Presaturation interreduction done
% 2.97/1.34
% 2.97/1.34 % Proof found!
% 2.97/1.34 % SZS status Theorem
% 2.97/1.34 % SZS output start CNFRefutation
% See solution above
% 2.97/1.34 % Parsed axioms : 321
% 2.97/1.34 % Removed by relevancy pruning/SinE : 0
% 2.97/1.34 % Initial clauses : 698
% 2.97/1.34 % Removed in clause preprocessing : 30
% 2.97/1.34 % Initial clauses in saturation : 668
% 2.97/1.34 % Processed clauses : 2895
% 2.97/1.34 % ...of these trivial : 20
% 2.97/1.34 % ...subsumed : 1009
% 2.97/1.34 % ...remaining for further processing : 1866
% 2.97/1.34 % Other redundant clauses eliminated : 128
% 2.97/1.34 % Clauses deleted for lack of memory : 0
% 2.97/1.34 % Backward-subsumed : 18
% 2.97/1.34 % Backward-rewritten : 53
% 2.97/1.34 % Generated clauses : 6894
% 2.97/1.34 % ...of the previous two non-redundant : 5460
% 2.97/1.34 % ...aggressively subsumed : 0
% 2.97/1.34 % Contextual simplify-reflections : 24
% 2.97/1.34 % Paramodulations : 6776
% 2.97/1.34 % Factorizations : 0
% 2.97/1.34 % NegExts : 0
% 2.97/1.34 % Equation resolutions : 131
% 2.97/1.34 % Disequality decompositions : 0
% 2.97/1.34 % Total rewrite steps : 3584
% 2.97/1.34 % ...of those cached : 3340
% 2.97/1.34 % Propositional unsat checks : 0
% 2.97/1.34 % Propositional check models : 0
% 2.97/1.34 % Propositional check unsatisfiable : 0
% 2.97/1.34 % Propositional clauses : 0
% 2.97/1.34 % Propositional clauses after purity: 0
% 2.97/1.34 % Propositional unsat core size : 0
% 2.97/1.34 % Propositional preprocessing time : 0.000
% 2.97/1.34 % Propositional encoding time : 0.000
% 2.97/1.34 % Propositional solver time : 0.000
% 2.97/1.34 % Success case prop preproc time : 0.000
% 2.97/1.34 % Success case prop encoding time : 0.000
% 2.97/1.34 % Success case prop solver time : 0.000
% 2.97/1.34 % Current number of processed clauses : 1094
% 2.97/1.34 % Positive orientable unit clauses : 152
% 2.97/1.34 % Positive unorientable unit clauses: 3
% 2.97/1.34 % Negative unit clauses : 69
% 2.97/1.34 % Non-unit-clauses : 870
% 2.97/1.34 % Current number of unprocessed clauses: 3814
% 2.97/1.34 % ...number of literals in the above : 11362
% 2.97/1.34 % Current number of archived formulas : 0
% 2.97/1.34 % Current number of archived clauses : 682
% 2.97/1.34 % Clause-clause subsumption calls (NU) : 243552
% 2.97/1.34 % Rec. Clause-clause subsumption calls : 124699
% 2.97/1.34 % Non-unit clause-clause subsumptions : 871
% 2.97/1.34 % Unit Clause-clause subsumption calls : 12815
% 2.97/1.34 % Rewrite failures with RHS unbound : 0
% 2.97/1.34 % BW rewrite match attempts : 102
% 2.97/1.34 % BW rewrite match successes : 62
% 2.97/1.34 % Condensation attempts : 0
% 2.97/1.34 % Condensation successes : 0
% 2.97/1.34 % Termbank termtop insertions : 124385
% 2.97/1.34 % Search garbage collected termcells : 12131
% 2.97/1.34
% 2.97/1.34 % -------------------------------------------------
% 2.97/1.34 % User time : 0.490 s
% 2.97/1.34 % System time : 0.023 s
% 2.97/1.34 % Total time : 0.513 s
% 2.97/1.34 % Maximum resident set size: 5728 pages
% 2.97/1.34
% 2.97/1.34 % -------------------------------------------------
% 2.97/1.34 % User time : 1.505 s
% 2.97/1.34 % System time : 0.093 s
% 2.97/1.34 % Total time : 1.598 s
% 2.97/1.34 % Maximum resident set size: 5120 pages
% 2.97/1.34 % E exiting
%------------------------------------------------------------------------------