TSTP Solution File: LCL691^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL691^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : Mon May 20 23:53:08 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 29
% Syntax : Number of formulae : 60 ( 34 unt; 17 typ; 0 def)
% Number of atoms : 108 ( 23 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 230 ( 24 ~; 24 |; 5 &; 160 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 92 ( 92 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 4 con; 0-3 aty)
% Number of variables : 98 ( 47 ^ 51 !; 0 ?; 98 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_28,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_29,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_37,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_41,type,
reli: $i > $i > $o ).
thf(decl_42,type,
relr: $i > $i > $o ).
thf(decl_43,type,
cs4_atom: ( $i > $o ) > $i > $o ).
thf(decl_46,type,
cs4_impl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_50,type,
cs4_box: ( $i > $o ) > $i > $o ).
thf(decl_51,type,
cs4_valid: ( $i > $o ) > $o ).
thf(decl_52,type,
esk1_2: ( $i > $o ) > $i > $i ).
thf(decl_53,type,
esk2_2: ( $i > $o ) > $i > $i ).
thf(decl_58,type,
epred1_0: $i > $o ).
thf(decl_59,type,
esk7_0: $i ).
thf(decl_60,type,
esk8_0: $i ).
thf(decl_61,type,
esk9_0: $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mor) ).
thf(cs4_atom,axiom,
( cs4_atom
= ( ^ [X11: $i > $o] : ( mbox @ reli @ X11 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL009^0.ax',cs4_atom) ).
thf(mbox,axiom,
( mbox
= ( ^ [X10: $i > $i > $o,X11: $i > $o,X1: $i] :
! [X12: $i] :
( ( X10 @ X1 @ X12 )
=> ( X11 @ X12 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mbox) ).
thf(cs4_impl,axiom,
( cs4_impl
= ( ^ [X19: $i > $o,X20: $i > $o] : ( mbox @ reli @ ( mimpl @ X19 @ X20 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL009^0.ax',cs4_impl) ).
thf(cs4_box,axiom,
( cs4_box
= ( ^ [X19: $i > $o] : ( mbox @ reli @ ( mbox @ relr @ X19 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL009^0.ax',cs4_box) ).
thf(cs4_valid_def,axiom,
( cs4_valid
= ( ^ [X19: $i > $o] : ( mvalid @ X19 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL009^0.ax',cs4_valid_def) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(cs4_refl,conjecture,
! [X19: $i > $o] : ( cs4_valid @ ( cs4_impl @ ( cs4_box @ ( cs4_atom @ X19 ) ) @ ( cs4_atom @ X19 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cs4_refl) ).
thf(refl_axiom_r,axiom,
! [X19: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ relr @ X19 ) @ X19 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL009^0.ax',refl_axiom_r) ).
thf(refl_axiom_i,axiom,
! [X19: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ reli @ X19 ) @ X19 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL009^0.ax',refl_axiom_i) ).
thf(c_0_12,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_13,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_14,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_15,plain,
( cs4_atom
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X28: $i] :
( ( reli @ Z1 @ X28 )
=> ( Z0 @ X28 ) ) ) ),
inference(fof_simplification,[status(thm)],[cs4_atom]) ).
thf(c_0_16,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X12: $i] :
( ( Z0 @ Z2 @ X12 )
=> ( Z1 @ X12 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_17,plain,
( cs4_impl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X29: $i] :
( ( reli @ Z2 @ X29 )
=> ( ~ ( Z0 @ X29 )
| ( Z1 @ X29 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[cs4_impl]) ).
thf(c_0_18,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_19,plain,
( cs4_box
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X33: $i] :
( ( reli @ Z1 @ X33 )
=> ! [X32: $i] :
( ( relr @ X33 @ X32 )
=> ( Z0 @ X32 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[cs4_box]) ).
thf(c_0_20,plain,
( cs4_valid
= ( ^ [Z0: $i > $o] :
! [X34: $i] : ( Z0 @ X34 ) ) ),
inference(fof_simplification,[status(thm)],[cs4_valid_def]) ).
thf(c_0_21,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_22,plain,
( cs4_atom
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X28: $i] :
( ( reli @ Z1 @ X28 )
=> ( Z0 @ X28 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_23,plain,
( cs4_impl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X29: $i] :
( ( reli @ Z2 @ X29 )
=> ( ~ ( Z0 @ X29 )
| ( Z1 @ X29 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
thf(c_0_24,plain,
( cs4_box
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X33: $i] :
( ( reli @ Z1 @ X33 )
=> ! [X32: $i] :
( ( relr @ X33 @ X32 )
=> ( Z0 @ X32 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_19,c_0_16]) ).
thf(c_0_25,plain,
( cs4_valid
= ( ^ [Z0: $i > $o] :
! [X34: $i] : ( Z0 @ X34 ) ) ),
inference(apply_def,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_26,negated_conjecture,
~ ! [X19: $i > $o,X57: $i,X56: $i] :
( ( reli @ X57 @ X56 )
=> ( ~ ! [X53: $i] :
( ( reli @ X56 @ X53 )
=> ! [X54: $i] :
( ( relr @ X53 @ X54 )
=> ! [X52: $i] :
( ( reli @ X54 @ X52 )
=> ( X19 @ X52 ) ) ) )
| ! [X55: $i] :
( ( reli @ X56 @ X55 )
=> ( X19 @ X55 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cs4_refl]),c_0_22]),c_0_23]),c_0_24]),c_0_25]) ).
thf(c_0_27,plain,
! [X19: $i > $o,X38: $i] :
( ~ ! [X37: $i] :
( ( relr @ X38 @ X37 )
=> ( X19 @ X37 ) )
| ( X19 @ X38 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[refl_axiom_r,c_0_18]),c_0_16]),c_0_21]) ).
thf(c_0_28,plain,
! [X19: $i > $o,X36: $i] :
( ~ ! [X35: $i] :
( ( reli @ X36 @ X35 )
=> ( X19 @ X35 ) )
| ( X19 @ X36 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[refl_axiom_i,c_0_18]),c_0_16]),c_0_21]) ).
thf(c_0_29,negated_conjecture,
! [X83: $i,X84: $i,X85: $i] :
( ( reli @ esk7_0 @ esk8_0 )
& ( ~ ( reli @ esk8_0 @ X83 )
| ~ ( relr @ X83 @ X84 )
| ~ ( reli @ X84 @ X85 )
| ( epred1_0 @ X85 ) )
& ( reli @ esk8_0 @ esk9_0 )
& ~ ( epred1_0 @ esk9_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])])]) ).
thf(c_0_30,plain,
! [X61: $i > $o,X62: $i] :
( ( ( relr @ X62 @ ( esk2_2 @ X61 @ X62 ) )
| ( X61 @ X62 ) )
& ( ~ ( X61 @ ( esk2_2 @ X61 @ X62 ) )
| ( X61 @ X62 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])])]) ).
thf(c_0_31,plain,
! [X58: $i > $o,X59: $i] :
( ( ( reli @ X59 @ ( esk1_2 @ X58 @ X59 ) )
| ( X58 @ X59 ) )
& ( ~ ( X58 @ ( esk1_2 @ X58 @ X59 ) )
| ( X58 @ X59 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])])]) ).
thf(c_0_32,negated_conjecture,
! [X1: $i,X3: $i,X12: $i] :
( ( epred1_0 @ X12 )
| ~ ( reli @ esk8_0 @ X1 )
| ~ ( relr @ X1 @ X3 )
| ~ ( reli @ X3 @ X12 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_33,negated_conjecture,
reli @ esk8_0 @ esk9_0,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_34,negated_conjecture,
~ ( epred1_0 @ esk9_0 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_35,plain,
! [X2: $i > $o,X1: $i] :
( ( X2 @ X1 )
| ~ ( X2 @ ( esk2_2 @ X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_36,plain,
! [X2: $i > $o,X1: $i] :
( ( relr @ X1 @ ( esk2_2 @ X2 @ X1 ) )
| ( X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_37,plain,
! [X2: $i > $o,X1: $i] :
( ( X2 @ X1 )
| ~ ( X2 @ ( esk1_2 @ X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_38,plain,
! [X2: $i > $o,X1: $i] :
( ( reli @ X1 @ ( esk1_2 @ X2 @ X1 ) )
| ( X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_39,negated_conjecture,
! [X1: $i] :
( ~ ( reli @ esk8_0 @ X1 )
| ~ ( relr @ X1 @ esk8_0 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
thf(c_0_40,plain,
! [X1: $i] : ( relr @ X1 @ X1 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
thf(c_0_41,plain,
! [X1: $i] : ( reli @ X1 @ X1 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
thf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : LCL691^1 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n023.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon May 20 02:08:53 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox/solver/bin/eprover-ho --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.21/0.52 # Version: 3.1.0-ho
% 0.21/0.52 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.52 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.52 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.52 # Starting full_lambda_8 with 300s (1) cores
% 0.21/0.52 # post_as_ho11 with pid 1525 completed with status 0
% 0.21/0.52 # Result found by post_as_ho11
% 0.21/0.52 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.52 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.52 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: HGUNF-FFSF22-SHSSMMBN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.52 # new_ho_10 with pid 1530 completed with status 0
% 0.21/0.52 # Result found by new_ho_10
% 0.21/0.52 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.52 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.52 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: HGUNF-FFSF22-SHSSMMBN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 61
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 46
% 0.21/0.52 # Removed in clause preprocessing : 31
% 0.21/0.52 # Initial clauses in saturation : 15
% 0.21/0.52 # Processed clauses : 34
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 34
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 28
% 0.21/0.52 # ...of the previous two non-redundant : 22
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 28
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 1
% 0.21/0.52 # ...of those cached : 0
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 19
% 0.21/0.52 # Positive orientable unit clauses : 4
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 1
% 0.21/0.52 # Non-unit-clauses : 14
% 0.21/0.52 # Current number of unprocessed clauses: 18
% 0.21/0.52 # ...number of literals in the above : 62
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 15
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 124
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 48
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 5
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 15
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 34
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 3973
% 0.21/0.52 # Search garbage collected termcells : 1166
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.009 s
% 0.21/0.52 # System time : 0.001 s
% 0.21/0.52 # Total time : 0.010 s
% 0.21/0.52 # Maximum resident set size: 1876 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.011 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.014 s
% 0.21/0.52 # Maximum resident set size: 1776 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------