%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWB024+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:38:19 PM UTC 2026
% Result : Theorem 0.27s 0.54s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 9 unt; 0 def)
% Number of atoms : 132 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 157 ( 61 ~; 58 |; 31 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-3 aty)
% Number of variables : 65 ( 0 sgn 30 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_char_transitive,axiom,
! [X4] :
( icext(uri_owl_TransitiveProperty,X4)
<=> ( ! [X1,X5,X3] :
( ( iext(X4,X5,X3)
& iext(X4,X1,X5) )
=> iext(X4,X1,X3) )
& ip(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_char_transitive) ).
fof(rdfs_cext_def,axiom,
! [X1,X2] :
( iext(uri_rdf_type,X1,X2)
<=> icext(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdfs_cext_def) ).
fof(testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties,axiom,
? [X9] :
( iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob)
& iext(uri_rdf_type,uri_ex_bob,uri_ex_Person)
& iext(uri_rdf_type,uri_ex_alice,uri_ex_Person)
& iext(uri_owl_minCardinality,X9,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
& iext(uri_owl_onProperty,X9,uri_ex_hasAncestor)
& iext(uri_rdf_type,X9,uri_owl_Restriction)
& iext(uri_rdfs_subClassOf,uri_ex_Person,X9)
& iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties) ).
fof(testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties,conjecture,
? [X8] :
( iext(uri_ex_hasAncestor,uri_ex_alice,X8)
& iext(uri_ex_hasAncestor,uri_ex_bob,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties) ).
fof(owl_restrict_mincard_001,axiom,
! [X3,X4] :
( ( iext(uri_owl_onProperty,X3,X4)
& iext(uri_owl_minCardinality,X3,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)) )
=> ! [X1] :
( icext(X3,X1)
<=> ? [X5] : iext(X4,X1,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_restrict_mincard_001) ).
fof(owl_rdfsext_subclassof,axiom,
! [X6,X7] :
( iext(uri_rdfs_subClassOf,X6,X7)
<=> ( ! [X1] :
( icext(X6,X1)
=> icext(X7,X1) )
& ic(X7)
& ic(X6) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_rdfsext_subclassof) ).
fof(c_0_6,plain,
! [X26,X27,X28,X29,X30] :
( ( icext(uri_owl_TransitiveProperty,X30)
| ~ ip(X30)
| ~ iext(X30,esk4_1(X30),esk6_1(X30)) )
& ( icext(uri_owl_TransitiveProperty,X30)
| ~ ip(X30)
| iext(X30,esk5_1(X30),esk6_1(X30)) )
& ( icext(uri_owl_TransitiveProperty,X30)
| ~ ip(X30)
| iext(X30,esk4_1(X30),esk5_1(X30)) )
& ( ~ icext(uri_owl_TransitiveProperty,X26)
| iext(X26,X27,X29)
| ~ iext(X26,X28,X29)
| ~ iext(X26,X27,X28) )
& ( ~ icext(uri_owl_TransitiveProperty,X26)
| ip(X26) ) ),
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)],[owl_char_transitive])])])])])])]) ).
fof(c_0_7,plain,
! [X11,X12] :
( ( iext(uri_rdf_type,X11,X12)
| ~ icext(X12,X11) )
& ( icext(X12,X11)
| ~ iext(uri_rdf_type,X11,X12) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])]) ).
cnf(c_0_8,plain,
( ~ icext(uri_owl_TransitiveProperty,X1)
| ~ iext(X1,X3,X4)
| ~ iext(X1,X2,X3)
| iext(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ iext(uri_rdf_type,X1,X2)
| icext(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
( iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob)
& iext(uri_rdf_type,uri_ex_bob,uri_ex_Person)
& iext(uri_rdf_type,uri_ex_alice,uri_ex_Person)
& iext(uri_owl_minCardinality,esk2_0,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
& iext(uri_owl_onProperty,esk2_0,uri_ex_hasAncestor)
& iext(uri_rdf_type,esk2_0,uri_owl_Restriction)
& iext(uri_rdfs_subClassOf,uri_ex_Person,esk2_0)
& iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties])]) ).
fof(c_0_11,negated_conjecture,
~ ? [X8] :
( iext(uri_ex_hasAncestor,uri_ex_alice,X8)
& iext(uri_ex_hasAncestor,uri_ex_bob,X8) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties]) ).
cnf(c_0_12,plain,
( ~ iext(X1,X2,X4)
| ~ iext(X1,X4,X3)
| ~ iext(uri_rdf_type,X1,uri_owl_TransitiveProperty)
| iext(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X13,X14,X15,X17,X18] :
( ( ~ iext(uri_owl_onProperty,X13,X14)
| ~ iext(uri_owl_minCardinality,X13,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
| icext(X13,X17)
| ~ iext(X14,X17,X18) )
& ( ~ iext(uri_owl_onProperty,X13,X14)
| ~ iext(uri_owl_minCardinality,X13,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
| iext(X14,X15,esk1_3(X13,X14,X15))
| ~ icext(X13,X15) ) ),
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)],[owl_restrict_mincard_001])])])])])])]) ).
fof(c_0_15,plain,
! [X20,X21,X22,X23,X24] :
( ( iext(uri_rdfs_subClassOf,X23,X24)
| ~ ic(X24)
| ~ ic(X23)
| ~ icext(X24,esk3_2(X23,X24)) )
& ( iext(uri_rdfs_subClassOf,X23,X24)
| ~ ic(X24)
| ~ ic(X23)
| icext(X23,esk3_2(X23,X24)) )
& ( ~ iext(uri_rdfs_subClassOf,X20,X21)
| icext(X21,X22)
| ~ icext(X20,X22) )
& ( ~ iext(uri_rdfs_subClassOf,X20,X21)
| ic(X21) )
& ( ~ iext(uri_rdfs_subClassOf,X20,X21)
| ic(X20) ) ),
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)],[owl_rdfsext_subclassof])])])])])])]) ).
fof(c_0_16,negated_conjecture,
! [X10] :
( ~ iext(uri_ex_hasAncestor,uri_ex_alice,X10)
| ~ iext(uri_ex_hasAncestor,uri_ex_bob,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_17,plain,
( ~ iext(uri_ex_hasAncestor,X1,X3)
| ~ iext(uri_ex_hasAncestor,X3,X2)
| iext(uri_ex_hasAncestor,X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ iext(uri_owl_onProperty,X1,X3)
| ~ iext(uri_owl_minCardinality,X1,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
| ~ icext(X1,X2)
| iext(X3,X2,esk1_3(X1,X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ iext(uri_rdfs_subClassOf,X1,X3)
| ~ icext(X1,X2)
| icext(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
iext(uri_rdfs_subClassOf,uri_ex_Person,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( ~ iext(uri_ex_hasAncestor,uri_ex_alice,X1)
| ~ iext(uri_ex_hasAncestor,uri_ex_bob,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( ~ iext(uri_ex_hasAncestor,X1,X3)
| ~ iext(uri_owl_onProperty,X2,uri_ex_hasAncestor)
| ~ iext(uri_owl_minCardinality,X2,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
| ~ icext(X2,X3)
| iext(uri_ex_hasAncestor,X1,esk1_3(X2,uri_ex_hasAncestor,X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ icext(uri_ex_Person,X1)
| icext(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( ~ iext(uri_ex_hasAncestor,uri_ex_alice,X2)
| ~ iext(uri_owl_onProperty,X1,uri_ex_hasAncestor)
| ~ iext(uri_owl_minCardinality,X1,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
| ~ iext(uri_ex_hasAncestor,uri_ex_bob,esk1_3(X1,uri_ex_hasAncestor,X2))
| ~ icext(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
( ~ icext(X1,X2)
| iext(uri_rdf_type,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,plain,
( ~ iext(uri_rdf_type,X1,uri_ex_Person)
| icext(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_9]) ).
cnf(c_0_28,negated_conjecture,
( ~ iext(uri_owl_onProperty,X1,uri_ex_hasAncestor)
| ~ iext(uri_owl_minCardinality,X1,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
| ~ icext(X1,uri_ex_bob) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_18]),c_0_25])]) ).
cnf(c_0_29,plain,
iext(uri_owl_minCardinality,esk2_0,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
iext(uri_owl_onProperty,esk2_0,uri_ex_hasAncestor),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,plain,
( ~ iext(uri_rdf_type,X1,uri_ex_Person)
| iext(uri_rdf_type,X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
iext(uri_rdf_type,uri_ex_bob,uri_ex_Person),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_33,negated_conjecture,
~ icext(esk2_0,uri_ex_bob),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_34,plain,
iext(uri_rdf_type,uri_ex_bob,esk2_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_9]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWB024+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n019.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 07:40:52 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.50 Running first-order theorem proving
% 0.27/0.50 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.27/0.54 % Version: 3.5.1
% 0.27/0.54 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.27/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.27/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.54 % Starting sh5l with 300s (1) cores
% 0.27/0.54 % sh5l with pid 2055650 completed with status 0
% 0.27/0.54 % Result found by sh5l
% 0.27/0.54 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.27/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.27/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.54 % Starting sh5l with 300s (1) cores
% 0.27/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.27/0.54 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.27/0.54 % Search class: FGHNF-FFSM31-SFFFFFNN
% 0.27/0.54 % partial match(1): FGHNF-FFSM21-SFFFFFNN
% 0.27/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.54 % SubtermCWHack with pid 2055658 completed with status 0
% 0.27/0.54 % Result found by SubtermCWHack
% 0.27/0.54 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.27/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.27/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.54 % Starting sh5l with 300s (1) cores
% 0.27/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.27/0.54 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.27/0.54 % Search class: FGHNF-FFSM31-SFFFFFNN
% 0.27/0.54 % partial match(1): FGHNF-FFSM21-SFFFFFNN
% 0.27/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.54 % Preprocessing time : 0.001 s
% 0.27/0.54
% 0.27/0.54 % Proof found!
% 0.27/0.54 % SZS status Theorem
% 0.27/0.54 % SZS output start CNFRefutation
% See solution above
% 0.27/0.54 % Parsed axioms : 6
% 0.27/0.54 % Removed by relevancy pruning/SinE : 0
% 0.27/0.54 % Initial clauses : 23
% 0.27/0.54 % Removed in clause preprocessing : 0
% 0.27/0.54 % Initial clauses in saturation : 23
% 0.27/0.54 % Processed clauses : 122
% 0.27/0.54 % ...of these trivial : 0
% 0.27/0.54 % ...subsumed : 25
% 0.27/0.54 % ...remaining for further processing : 97
% 0.27/0.54 % Other redundant clauses eliminated : 0
% 0.27/0.54 % Clauses deleted for lack of memory : 0
% 0.27/0.54 % Backward-subsumed : 27
% 0.27/0.54 % Backward-rewritten : 0
% 0.27/0.54 % Generated clauses : 144
% 0.27/0.54 % ...of the previous two non-redundant : 120
% 0.27/0.54 % ...aggressively subsumed : 0
% 0.27/0.54 % Contextual simplify-reflections : 6
% 0.27/0.54 % Paramodulations : 144
% 0.27/0.54 % Factorizations : 0
% 0.27/0.54 % NegExts : 0
% 0.27/0.54 % Equation resolutions : 0
% 0.27/0.54 % Disequality decompositions : 0
% 0.27/0.54 % Total rewrite steps : 24
% 0.27/0.54 % ...of those cached : 16
% 0.27/0.54 % Propositional unsat checks : 0
% 0.27/0.54 % Propositional check models : 0
% 0.27/0.54 % Propositional check unsatisfiable : 0
% 0.27/0.54 % Propositional clauses : 0
% 0.27/0.54 % Propositional clauses after purity: 0
% 0.27/0.54 % Propositional unsat core size : 0
% 0.27/0.54 % Propositional preprocessing time : 0.000
% 0.27/0.54 % Propositional encoding time : 0.000
% 0.27/0.54 % Propositional solver time : 0.000
% 0.27/0.54 % Success case prop preproc time : 0.000
% 0.27/0.54 % Success case prop encoding time : 0.000
% 0.27/0.54 % Success case prop solver time : 0.000
% 0.27/0.54 % Current number of processed clauses : 70
% 0.27/0.54 % Positive orientable unit clauses : 15
% 0.27/0.54 % Positive unorientable unit clauses: 0
% 0.27/0.54 % Negative unit clauses : 3
% 0.27/0.54 % Non-unit-clauses : 52
% 0.27/0.54 % Current number of unprocessed clauses: 9
% 0.27/0.54 % ...number of literals in the above : 58
% 0.27/0.54 % Current number of archived formulas : 0
% 0.27/0.54 % Current number of archived clauses : 27
% 0.27/0.54 % Clause-clause subsumption calls (NU) : 1541
% 0.27/0.54 % Rec. Clause-clause subsumption calls : 665
% 0.27/0.54 % Non-unit clause-clause subsumptions : 57
% 0.27/0.54 % Unit Clause-clause subsumption calls : 70
% 0.27/0.54 % Rewrite failures with RHS unbound : 0
% 0.27/0.54 % BW rewrite match attempts : 4
% 0.27/0.54 % BW rewrite match successes : 0
% 0.27/0.54 % Condensation attempts : 0
% 0.27/0.54 % Condensation successes : 0
% 0.27/0.54 % Termbank termtop insertions : 4039
% 0.27/0.54 % Search garbage collected termcells : 346
% 0.27/0.54
% 0.27/0.54 % -------------------------------------------------
% 0.27/0.54 % User time : 0.011 s
% 0.27/0.54 % System time : 0.005 s
% 0.27/0.54 % Total time : 0.015 s
% 0.27/0.54 % Maximum resident set size: 3644 pages
% 0.27/0.54
% 0.27/0.54 % -------------------------------------------------
% 0.27/0.54 % User time : 0.013 s
% 0.27/0.54 % System time : 0.008 s
% 0.27/0.54 % Total time : 0.021 s
% 0.27/0.54 % Maximum resident set size: 4608 pages
% 0.27/0.54 % E exiting
%------------------------------------------------------------------------------