TSTP Solution File: SEU353+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU353+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:26:07 EDT 2023
% Result : Theorem 22.98s 3.86s
% Output : CNFRefutation 22.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 50 ( 19 unt; 0 def)
% Number of atoms : 141 ( 20 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 143 ( 52 ~; 43 |; 27 &)
% ( 6 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-4 aty)
% Number of variables : 73 ( 1 sgn; 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(dt_k6_partfun1,axiom,
! [X1] :
( v1_partfun1(identity_as_relation_of(X1),X1,X1)
& relation_of2_as_subset(identity_as_relation_of(X1),X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.y6L7SZZF15/E---3.1_23891.p',dt_k6_partfun1) ).
fof(redefinition_k6_partfun1,axiom,
! [X1] : identity_as_relation_of(X1) = identity_relation(X1),
file('/export/starexec/sandbox2/tmp/tmp.y6L7SZZF15/E---3.1_23891.p',redefinition_k6_partfun1) ).
fof(t91_tmap_1,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2) = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.y6L7SZZF15/E---3.1_23891.p',t91_tmap_1) ).
fof(d11_grcat_1,axiom,
! [X1] :
( one_sorted_str(X1)
=> identity_on_carrier(X1) = identity_as_relation_of(the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.y6L7SZZF15/E---3.1_23891.p',d11_grcat_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.y6L7SZZF15/E---3.1_23891.p',redefinition_m2_relset_1) ).
fof(redefinition_k8_funct_2,axiom,
! [X1,X2,X3,X4] :
( ( ~ empty(X1)
& function(X3)
& quasi_total(X3,X1,X2)
& relation_of2(X3,X1,X2)
& element(X4,X1) )
=> apply_as_element(X1,X2,X3,X4) = apply(X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.y6L7SZZF15/E---3.1_23891.p',redefinition_k8_funct_2) ).
fof(cc1_funct_2,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> ( ( function(X3)
& v1_partfun1(X3,X1,X2) )
=> ( function(X3)
& quasi_total(X3,X1,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.y6L7SZZF15/E---3.1_23891.p',cc1_funct_2) ).
fof(fc2_funct_1,axiom,
! [X1] :
( relation(identity_relation(X1))
& function(identity_relation(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.y6L7SZZF15/E---3.1_23891.p',fc2_funct_1) ).
fof(d1_struct_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ( empty_carrier(X1)
<=> empty(the_carrier(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.y6L7SZZF15/E---3.1_23891.p',d1_struct_0) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.y6L7SZZF15/E---3.1_23891.p',d2_subset_1) ).
fof(t35_funct_1,lemma,
! [X1,X2] :
( in(X2,X1)
=> apply(identity_relation(X1),X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.y6L7SZZF15/E---3.1_23891.p',t35_funct_1) ).
fof(c_0_11,plain,
! [X715] :
( v1_partfun1(identity_as_relation_of(X715),X715,X715)
& relation_of2_as_subset(identity_as_relation_of(X715),X715,X715) ),
inference(variable_rename,[status(thm)],[dt_k6_partfun1]) ).
fof(c_0_12,plain,
! [X1070] : identity_as_relation_of(X1070) = identity_relation(X1070),
inference(variable_rename,[status(thm)],[redefinition_k6_partfun1]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2) = X2 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t91_tmap_1])]) ).
fof(c_0_14,plain,
! [X120] :
( ~ one_sorted_str(X120)
| identity_on_carrier(X120) = identity_as_relation_of(the_carrier(X120)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d11_grcat_1])]) ).
fof(c_0_15,plain,
! [X1080,X1081,X1082] :
( ( ~ relation_of2_as_subset(X1082,X1080,X1081)
| relation_of2(X1082,X1080,X1081) )
& ( ~ relation_of2(X1082,X1080,X1081)
| relation_of2_as_subset(X1082,X1080,X1081) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
cnf(c_0_16,plain,
relation_of2_as_subset(identity_as_relation_of(X1),X1,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
identity_as_relation_of(X1) = identity_relation(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,negated_conjecture,
( ~ empty_carrier(esk440_0)
& one_sorted_str(esk440_0)
& element(esk441_0,the_carrier(esk440_0))
& apply_as_element(the_carrier(esk440_0),the_carrier(esk440_0),identity_on_carrier(esk440_0),esk441_0) != esk441_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_19,plain,
( identity_on_carrier(X1) = identity_as_relation_of(the_carrier(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X1,X2,X3,X4] :
( ( ~ empty(X1)
& function(X3)
& quasi_total(X3,X1,X2)
& relation_of2(X3,X1,X2)
& element(X4,X1) )
=> apply_as_element(X1,X2,X3,X4) = apply(X3,X4) ),
inference(fof_simplification,[status(thm)],[redefinition_k8_funct_2]) ).
fof(c_0_21,plain,
! [X51,X52,X53] :
( ( function(X53)
| ~ function(X53)
| ~ v1_partfun1(X53,X51,X52)
| ~ relation_of2(X53,X51,X52) )
& ( quasi_total(X53,X51,X52)
| ~ function(X53)
| ~ v1_partfun1(X53,X51,X52)
| ~ relation_of2(X53,X51,X52) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_funct_2])])]) ).
cnf(c_0_22,plain,
v1_partfun1(identity_as_relation_of(X1),X1,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
relation_of2_as_subset(identity_relation(X1),X1,X1),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_25,plain,
! [X805] :
( relation(identity_relation(X805))
& function(identity_relation(X805)) ),
inference(variable_rename,[status(thm)],[fc2_funct_1]) ).
fof(c_0_26,plain,
! [X303] :
( ( ~ empty_carrier(X303)
| empty(the_carrier(X303))
| ~ one_sorted_str(X303) )
& ( ~ empty(the_carrier(X303))
| empty_carrier(X303)
| ~ one_sorted_str(X303) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_struct_0])])]) ).
fof(c_0_27,plain,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
cnf(c_0_28,negated_conjecture,
apply_as_element(the_carrier(esk440_0),the_carrier(esk440_0),identity_on_carrier(esk440_0),esk441_0) != esk441_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,plain,
( identity_on_carrier(X1) = identity_relation(the_carrier(X1))
| ~ one_sorted_str(X1) ),
inference(rw,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_30,negated_conjecture,
one_sorted_str(esk440_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_31,plain,
! [X1076,X1077,X1078,X1079] :
( empty(X1076)
| ~ function(X1078)
| ~ quasi_total(X1078,X1076,X1077)
| ~ relation_of2(X1078,X1076,X1077)
| ~ element(X1079,X1076)
| apply_as_element(X1076,X1077,X1078,X1079) = apply(X1078,X1079) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])]) ).
cnf(c_0_32,plain,
( quasi_total(X1,X2,X3)
| ~ function(X1)
| ~ v1_partfun1(X1,X2,X3)
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
v1_partfun1(identity_relation(X1),X1,X1),
inference(rw,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_34,plain,
relation_of2(identity_relation(X1),X1,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_35,plain,
function(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,negated_conjecture,
~ empty_carrier(esk440_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_37,plain,
( empty_carrier(X1)
| ~ empty(the_carrier(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_38,plain,
! [X379,X380] :
( ( ~ element(X380,X379)
| in(X380,X379)
| empty(X379) )
& ( ~ in(X380,X379)
| element(X380,X379)
| empty(X379) )
& ( ~ element(X380,X379)
| empty(X380)
| ~ empty(X379) )
& ( ~ empty(X380)
| element(X380,X379)
| ~ empty(X379) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])]) ).
cnf(c_0_39,negated_conjecture,
apply_as_element(the_carrier(esk440_0),the_carrier(esk440_0),identity_relation(the_carrier(esk440_0)),esk441_0) != esk441_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_40,plain,
( empty(X1)
| apply_as_element(X1,X3,X2,X4) = apply(X2,X4)
| ~ function(X2)
| ~ quasi_total(X2,X1,X3)
| ~ relation_of2(X2,X1,X3)
| ~ element(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,plain,
quasi_total(identity_relation(X1),X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_42,negated_conjecture,
element(esk441_0,the_carrier(esk440_0)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_43,negated_conjecture,
~ empty(the_carrier(esk440_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_30])]) ).
fof(c_0_44,lemma,
! [X1898,X1899] :
( ~ in(X1899,X1898)
| apply(identity_relation(X1898),X1899) = X1899 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t35_funct_1])]) ).
cnf(c_0_45,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,negated_conjecture,
apply(identity_relation(the_carrier(esk440_0)),esk441_0) != esk441_0,
inference(sr,[status(thm)],[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_39,c_0_40]),c_0_41]),c_0_34]),c_0_35]),c_0_42])]),c_0_43]) ).
cnf(c_0_47,lemma,
( apply(identity_relation(X2),X1) = X1
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_48,negated_conjecture,
in(esk441_0,the_carrier(esk440_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_42]),c_0_43]) ).
cnf(c_0_49,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.19 % Problem : SEU353+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.20 % Command : run_E %s %d THM
% 0.17/0.41 % Computer : n026.cluster.edu
% 0.17/0.41 % Model : x86_64 x86_64
% 0.17/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.41 % Memory : 8042.1875MB
% 0.17/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.41 % CPULimit : 2400
% 0.17/0.41 % WCLimit : 300
% 0.17/0.41 % DateTime : Mon Oct 2 08:58:44 EDT 2023
% 0.17/0.41 % CPUTime :
% 0.23/0.59 Running first-order theorem proving
% 0.23/0.59 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/tmp/tmp.y6L7SZZF15/E---3.1_23891.p
% 22.98/3.86 # Version: 3.1pre001
% 22.98/3.86 # Preprocessing class: FSLMSMSSSSSNFFN.
% 22.98/3.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.98/3.86 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 22.98/3.86 # Starting new_bool_3 with 600s (2) cores
% 22.98/3.86 # Starting new_bool_1 with 600s (2) cores
% 22.98/3.86 # Starting sh5l with 300s (1) cores
% 22.98/3.86 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 23971 completed with status 0
% 22.98/3.86 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 22.98/3.86 # Preprocessing class: FSLMSMSSSSSNFFN.
% 22.98/3.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.98/3.86 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 22.98/3.86 # No SInE strategy applied
% 22.98/3.86 # Search class: FGHSM-SMLM32-MFFFFFNN
% 22.98/3.86 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 22.98/3.86 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 22.98/3.86 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 22.98/3.86 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 68s (1) cores
% 22.98/3.86 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 23981 completed with status 0
% 22.98/3.86 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 22.98/3.86 # Preprocessing class: FSLMSMSSSSSNFFN.
% 22.98/3.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.98/3.86 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 22.98/3.86 # No SInE strategy applied
% 22.98/3.86 # Search class: FGHSM-SMLM32-MFFFFFNN
% 22.98/3.86 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 22.98/3.86 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 22.98/3.86 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 22.98/3.86 # Preprocessing time : 0.043 s
% 22.98/3.86 # Presaturation interreduction done
% 22.98/3.86
% 22.98/3.86 # Proof found!
% 22.98/3.86 # SZS status Theorem
% 22.98/3.86 # SZS output start CNFRefutation
% See solution above
% 22.98/3.86 # Parsed axioms : 665
% 22.98/3.86 # Removed by relevancy pruning/SinE : 0
% 22.98/3.86 # Initial clauses : 2820
% 22.98/3.86 # Removed in clause preprocessing : 58
% 22.98/3.86 # Initial clauses in saturation : 2762
% 22.98/3.86 # Processed clauses : 13817
% 22.98/3.86 # ...of these trivial : 118
% 22.98/3.86 # ...subsumed : 7190
% 22.98/3.86 # ...remaining for further processing : 6509
% 22.98/3.86 # Other redundant clauses eliminated : 1031
% 22.98/3.86 # Clauses deleted for lack of memory : 0
% 22.98/3.86 # Backward-subsumed : 82
% 22.98/3.86 # Backward-rewritten : 75
% 22.98/3.86 # Generated clauses : 42988
% 22.98/3.86 # ...of the previous two non-redundant : 38780
% 22.98/3.86 # ...aggressively subsumed : 0
% 22.98/3.86 # Contextual simplify-reflections : 323
% 22.98/3.86 # Paramodulations : 42181
% 22.98/3.86 # Factorizations : 2
% 22.98/3.86 # NegExts : 0
% 22.98/3.86 # Equation resolutions : 1038
% 22.98/3.86 # Total rewrite steps : 9071
% 22.98/3.86 # Propositional unsat checks : 1
% 22.98/3.86 # Propositional check models : 1
% 22.98/3.86 # Propositional check unsatisfiable : 0
% 22.98/3.86 # Propositional clauses : 0
% 22.98/3.86 # Propositional clauses after purity: 0
% 22.98/3.86 # Propositional unsat core size : 0
% 22.98/3.86 # Propositional preprocessing time : 0.000
% 22.98/3.86 # Propositional encoding time : 0.017
% 22.98/3.86 # Propositional solver time : 0.011
% 22.98/3.86 # Success case prop preproc time : 0.000
% 22.98/3.86 # Success case prop encoding time : 0.000
% 22.98/3.86 # Success case prop solver time : 0.000
% 22.98/3.86 # Current number of processed clauses : 3143
% 22.98/3.86 # Positive orientable unit clauses : 326
% 22.98/3.86 # Positive unorientable unit clauses: 6
% 22.98/3.86 # Negative unit clauses : 592
% 22.98/3.86 # Non-unit-clauses : 2219
% 22.98/3.86 # Current number of unprocessed clauses: 30035
% 22.98/3.86 # ...number of literals in the above : 113739
% 22.98/3.86 # Current number of archived formulas : 0
% 22.98/3.86 # Current number of archived clauses : 2729
% 22.98/3.86 # Clause-clause subsumption calls (NU) : 4812325
% 22.98/3.86 # Rec. Clause-clause subsumption calls : 954791
% 22.98/3.86 # Non-unit clause-clause subsumptions : 3313
% 22.98/3.86 # Unit Clause-clause subsumption calls : 229835
% 22.98/3.86 # Rewrite failures with RHS unbound : 29
% 22.98/3.86 # BW rewrite match attempts : 197
% 22.98/3.86 # BW rewrite match successes : 123
% 22.98/3.86 # Condensation attempts : 0
% 22.98/3.86 # Condensation successes : 0
% 22.98/3.86 # Termbank termtop insertions : 754566
% 22.98/3.86
% 22.98/3.86 # -------------------------------------------------
% 22.98/3.86 # User time : 2.786 s
% 22.98/3.86 # System time : 0.048 s
% 22.98/3.86 # Total time : 2.834 s
% 22.98/3.86 # Maximum resident set size: 9556 pages
% 22.98/3.86
% 22.98/3.86 # -------------------------------------------------
% 22.98/3.86 # User time : 8.136 s
% 22.98/3.86 # System time : 0.154 s
% 22.98/3.86 # Total time : 8.290 s
% 22.98/3.86 # Maximum resident set size: 2608 pages
% 22.98/3.86 % E---3.1 exiting
% 22.98/3.86 % E---3.1 exiting
%------------------------------------------------------------------------------