TSTP Solution File: AGT029^1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : AGT029^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 Jun 24 03:38:37 EDT 2024
% Result : Theorem 0.17s 0.50s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 29
% Syntax : Number of formulae : 59 ( 28 unt; 17 typ; 0 def)
% Number of atoms : 94 ( 18 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 216 ( 34 ~; 27 |; 2 &; 153 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 91 ( 91 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 3 con; 0-3 aty)
% Number of variables : 92 ( 43 ^ 49 !; 0 ?; 92 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_32,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_33,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_37,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
r2: $i > $i > $o ).
thf(decl_56,type,
r4: $i > $i > $o ).
thf(decl_58,type,
john: mu ).
thf(decl_62,type,
good_in_maths: mu > $i > $o ).
thf(decl_63,type,
maths_teacher: mu > $i > $o ).
thf(decl_99,type,
esk32_2: $i > ( $i > $o ) > $i ).
thf(decl_134,type,
esk67_0: $i ).
thf(decl_135,type,
esk68_1: mu > $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p',mor) ).
thf(mexists_ind,axiom,
( mexists_ind
= ( ^ [X11: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X11 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p',mexists_ind) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X8: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X8 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p',mforall_ind) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p',mforall_prop) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p',mvalid) ).
thf(axiom_I_for_r4_r2,axiom,
( mvalid
@ ( mforall_prop
@ ^ [X6: $i > $o] : ( mimplies @ ( mbox @ r4 @ X6 ) @ ( mbox @ r2 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p',axiom_I_for_r4_r2) ).
thf(conj,conjecture,
( mvalid
@ ( mexists_ind
@ ^ [X1: mu] : ( mbox @ r2 @ ( good_in_maths @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p',conj) ).
thf(axiom_r1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( maths_teacher @ X1 ) @ ( mbox @ r4 @ ( good_in_maths @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p',axiom_r1) ).
thf(axiom_a6,axiom,
mvalid @ ( maths_teacher @ john ),
file('/export/starexec/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p',axiom_a6) ).
thf(c_0_12,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
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,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
thf(c_0_16,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_17,plain,
( mimplies
= ( ^ [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_18,plain,
( mforall_prop
= ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_prop]) ).
thf(c_0_19,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_20,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_21,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_15,c_0_13]),c_0_16]) ).
thf(c_0_22,plain,
! [X143: $i,X142: $i > $o] :
( ~ ! [X140: $i] :
( ~ ( r4 @ X143 @ X140 )
| ( X142 @ X140 ) )
| ! [X141: $i] :
( ~ ( r2 @ X143 @ X141 )
| ( X142 @ X141 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_I_for_r4_r2]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).
thf(c_0_23,negated_conjecture,
~ ! [X312: $i] :
~ ! [X311: mu] :
~ ! [X310: $i] :
( ~ ( r2 @ X312 @ X310 )
| ( good_in_maths @ X311 @ X310 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_21]),c_0_19]),c_0_20])]) ).
thf(c_0_24,plain,
! [X432: $i,X433: $i > $o,X435: $i] :
( ( ( r4 @ X432 @ ( esk32_2 @ X432 @ X433 ) )
| ~ ( r2 @ X432 @ X435 )
| ( X433 @ X435 ) )
& ( ~ ( X433 @ ( esk32_2 @ X432 @ X433 ) )
| ~ ( r2 @ X432 @ X435 )
| ( X433 @ X435 ) ) ),
inference(distribute,[status(thm)],[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_22])])])])])]) ).
thf(c_0_25,negated_conjecture,
! [X603: mu] :
( ( r2 @ esk67_0 @ ( esk68_1 @ X603 ) )
& ~ ( good_in_maths @ X603 @ ( esk68_1 @ X603 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).
thf(c_0_26,plain,
! [X23: $i,X22: mu] :
( ~ ( maths_teacher @ X22 @ X23 )
| ! [X21: $i] :
( ~ ( r4 @ X23 @ X21 )
| ( good_in_maths @ X22 @ X21 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_r1]),c_0_17]),c_0_16]),c_0_19]),c_0_20])]) ).
thf(c_0_27,plain,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( X4 @ X14 )
| ~ ( X4 @ ( esk32_2 @ X3 @ X4 ) )
| ~ ( r2 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_28,negated_conjecture,
! [X1: mu] : ( r2 @ esk67_0 @ ( esk68_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_29,plain,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( r4 @ X3 @ ( esk32_2 @ X3 @ X4 ) )
| ( X4 @ X14 )
| ~ ( r2 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_30,plain,
! [X313: $i,X314: mu,X315: $i] :
( ~ ( maths_teacher @ X314 @ X313 )
| ~ ( r4 @ X313 @ X315 )
| ( good_in_maths @ X314 @ X315 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_26])])]) ).
thf(c_0_31,negated_conjecture,
! [X1: mu,X4: $i > $o] :
( ( X4 @ ( esk68_1 @ X1 ) )
| ~ ( X4 @ ( esk32_2 @ esk67_0 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_32,negated_conjecture,
! [X4: $i > $o,X1: mu] :
( ( r4 @ esk67_0 @ ( esk32_2 @ esk67_0 @ X4 ) )
| ( X4 @ ( esk68_1 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
thf(c_0_33,plain,
! [X3: $i,X1: mu,X14: $i] :
( ( good_in_maths @ X1 @ X14 )
| ~ ( maths_teacher @ X1 @ X3 )
| ~ ( r4 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_34,negated_conjecture,
! [X1: mu] : ( r4 @ esk67_0 @ ( esk68_1 @ X1 ) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32])]) ).
thf(c_0_35,plain,
! [X93: $i] : ( maths_teacher @ john @ X93 ),
inference(apply_def,[status(thm)],[axiom_a6,c_0_20]) ).
thf(c_0_36,negated_conjecture,
! [X1: mu] :
~ ( good_in_maths @ X1 @ ( esk68_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_37,negated_conjecture,
! [X2: mu,X1: mu] :
( ( good_in_maths @ X1 @ ( esk68_1 @ X2 ) )
| ~ ( maths_teacher @ X1 @ esk67_0 ) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
thf(c_0_38,plain,
! [X385: $i] : ( maths_teacher @ john @ X385 ),
inference(variable_rename,[status(thm)],[c_0_35]) ).
thf(c_0_39,negated_conjecture,
! [X1: mu] :
~ ( maths_teacher @ X1 @ esk67_0 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
thf(c_0_40,plain,
! [X3: $i] : ( maths_teacher @ john @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
thf(c_0_41,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_39,c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : AGT029^1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.11 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n012.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Wed Jun 19 04:14:09 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.17/0.44 Running higher-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.yF5FYZO7Rs/E---3.1_17319.p
% 0.17/0.50 # Version: 3.2.0-ho
% 0.17/0.50 # Preprocessing class: HSLSSMSSMLLNHSN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting almost_fo_3 with 1500s (5) cores
% 0.17/0.50 # Starting sh10 with 300s (1) cores
% 0.17/0.50 # Starting new_ho_16 with 300s (1) cores
% 0.17/0.50 # Starting post_as_ho11 with 300s (1) cores
% 0.17/0.50 # new_ho_16 with pid 17400 completed with status 8
% 0.17/0.50 # post_as_ho11 with pid 17401 completed with status 0
% 0.17/0.50 # Result found by post_as_ho11
% 0.17/0.50 # Preprocessing class: HSLSSMSSMLLNHSN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting almost_fo_3 with 1500s (5) cores
% 0.17/0.50 # Starting sh10 with 300s (1) cores
% 0.17/0.50 # Starting new_ho_16 with 300s (1) cores
% 0.17/0.50 # Starting post_as_ho11 with 300s (1) cores
% 0.17/0.50 # No SInE strategy applied
% 0.17/0.50 # Search class: HGUNS-FSLF32-SHSSMMBN
% 0.17/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.50 # new_ho_10 with pid 17415 completed with status 0
% 0.17/0.50 # Result found by new_ho_10
% 0.17/0.50 # Preprocessing class: HSLSSMSSMLLNHSN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting almost_fo_3 with 1500s (5) cores
% 0.17/0.50 # Starting sh10 with 300s (1) cores
% 0.17/0.50 # Starting new_ho_16 with 300s (1) cores
% 0.17/0.50 # Starting post_as_ho11 with 300s (1) cores
% 0.17/0.50 # No SInE strategy applied
% 0.17/0.50 # Search class: HGUNS-FSLF32-SHSSMMBN
% 0.17/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.50 # Preprocessing time : 0.003 s
% 0.17/0.50 # Presaturation interreduction done
% 0.17/0.50
% 0.17/0.50 # Proof found!
% 0.17/0.50 # SZS status Theorem
% 0.17/0.50 # SZS output start CNFRefutation
% See solution above
% 0.17/0.50 # Parsed axioms : 145
% 0.17/0.50 # Removed by relevancy pruning/SinE : 0
% 0.17/0.50 # Initial clauses : 186
% 0.17/0.50 # Removed in clause preprocessing : 47
% 0.17/0.50 # Initial clauses in saturation : 139
% 0.17/0.50 # Processed clauses : 275
% 0.17/0.50 # ...of these trivial : 3
% 0.17/0.50 # ...subsumed : 0
% 0.17/0.50 # ...remaining for further processing : 272
% 0.17/0.50 # Other redundant clauses eliminated : 0
% 0.17/0.50 # Clauses deleted for lack of memory : 0
% 0.17/0.50 # Backward-subsumed : 1
% 0.17/0.50 # Backward-rewritten : 0
% 0.17/0.50 # Generated clauses : 659
% 0.17/0.50 # ...of the previous two non-redundant : 623
% 0.17/0.50 # ...aggressively subsumed : 0
% 0.17/0.50 # Contextual simplify-reflections : 0
% 0.17/0.50 # Paramodulations : 659
% 0.17/0.50 # Factorizations : 0
% 0.17/0.50 # NegExts : 0
% 0.17/0.50 # Equation resolutions : 0
% 0.17/0.50 # Disequality decompositions : 0
% 0.17/0.50 # Total rewrite steps : 38
% 0.17/0.50 # ...of those cached : 23
% 0.17/0.50 # Propositional unsat checks : 0
% 0.17/0.50 # Propositional check models : 0
% 0.17/0.50 # Propositional check unsatisfiable : 0
% 0.17/0.50 # Propositional clauses : 0
% 0.17/0.50 # Propositional clauses after purity: 0
% 0.17/0.50 # Propositional unsat core size : 0
% 0.17/0.50 # Propositional preprocessing time : 0.000
% 0.17/0.50 # Propositional encoding time : 0.000
% 0.17/0.50 # Propositional solver time : 0.000
% 0.17/0.50 # Success case prop preproc time : 0.000
% 0.17/0.50 # Success case prop encoding time : 0.000
% 0.17/0.50 # Success case prop solver time : 0.000
% 0.17/0.50 # Current number of processed clauses : 132
% 0.17/0.50 # Positive orientable unit clauses : 23
% 0.17/0.50 # Positive unorientable unit clauses: 0
% 0.17/0.50 # Negative unit clauses : 2
% 0.17/0.50 # Non-unit-clauses : 107
% 0.17/0.50 # Current number of unprocessed clauses: 626
% 0.17/0.50 # ...number of literals in the above : 2218
% 0.17/0.50 # Current number of archived formulas : 0
% 0.17/0.50 # Current number of archived clauses : 140
% 0.17/0.50 # Clause-clause subsumption calls (NU) : 4378
% 0.17/0.50 # Rec. Clause-clause subsumption calls : 2893
% 0.17/0.50 # Non-unit clause-clause subsumptions : 0
% 0.17/0.50 # Unit Clause-clause subsumption calls : 272
% 0.17/0.50 # Rewrite failures with RHS unbound : 0
% 0.17/0.50 # BW rewrite match attempts : 0
% 0.17/0.50 # BW rewrite match successes : 0
% 0.17/0.50 # Condensation attempts : 275
% 0.17/0.50 # Condensation successes : 2
% 0.17/0.50 # Termbank termtop insertions : 42421
% 0.17/0.50 # Search garbage collected termcells : 13645
% 0.17/0.50
% 0.17/0.50 # -------------------------------------------------
% 0.17/0.50 # User time : 0.045 s
% 0.17/0.50 # System time : 0.006 s
% 0.17/0.50 # Total time : 0.051 s
% 0.17/0.50 # Maximum resident set size: 4176 pages
% 0.17/0.50
% 0.17/0.50 # -------------------------------------------------
% 0.17/0.50 # User time : 0.060 s
% 0.17/0.50 # System time : 0.021 s
% 0.17/0.50 # Total time : 0.081 s
% 0.17/0.50 # Maximum resident set size: 1860 pages
% 0.17/0.50 % E---3.1 exiting
% 0.17/0.50 % E exiting
%------------------------------------------------------------------------------