TSTP Solution File: SEU362+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU362+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:10 EDT 2023
% Result : Theorem 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 22 unt; 0 def)
% Number of atoms : 155 ( 8 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 164 ( 61 ~; 56 |; 21 &)
% ( 3 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 72 ( 3 sgn; 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d13_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( rel_str(X2)
=> ( subrelstr(X2,X1)
<=> ( subset(the_carrier(X2),the_carrier(X1))
& subset(the_InternalRel(X2),the_InternalRel(X1)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.teoIXKNKN6/E---3.1_18293.p',d13_yellow_0) ).
fof(dt_m1_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( subrelstr(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.teoIXKNKN6/E---3.1_18293.p',dt_m1_yellow_0) ).
fof(t60_yellow_0,conjecture,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( subrelstr(X2,X1)
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X2))
=> ( ( X5 = X3
& X6 = X4
& related(X2,X5,X6) )
=> related(X1,X3,X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.teoIXKNKN6/E---3.1_18293.p',t60_yellow_0) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.teoIXKNKN6/E---3.1_18293.p',t3_subset) ).
fof(d9_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( related(X1,X2,X3)
<=> in(ordered_pair(X2,X3),the_InternalRel(X1)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.teoIXKNKN6/E---3.1_18293.p',d9_orders_2) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.teoIXKNKN6/E---3.1_18293.p',t4_subset) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.teoIXKNKN6/E---3.1_18293.p',t2_subset) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.teoIXKNKN6/E---3.1_18293.p',t5_subset) ).
fof(c_0_8,plain,
! [X39,X40] :
( ( subset(the_carrier(X40),the_carrier(X39))
| ~ subrelstr(X40,X39)
| ~ rel_str(X40)
| ~ rel_str(X39) )
& ( subset(the_InternalRel(X40),the_InternalRel(X39))
| ~ subrelstr(X40,X39)
| ~ rel_str(X40)
| ~ rel_str(X39) )
& ( ~ subset(the_carrier(X40),the_carrier(X39))
| ~ subset(the_InternalRel(X40),the_InternalRel(X39))
| subrelstr(X40,X39)
| ~ rel_str(X40)
| ~ rel_str(X39) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d13_yellow_0])])])]) ).
fof(c_0_9,plain,
! [X42,X43] :
( ~ rel_str(X42)
| ~ subrelstr(X43,X42)
| rel_str(X43) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_yellow_0])])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( rel_str(X1)
=> ! [X2] :
( subrelstr(X2,X1)
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X2))
=> ( ( X5 = X3
& X6 = X4
& related(X2,X5,X6) )
=> related(X1,X3,X4) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t60_yellow_0]) ).
cnf(c_0_11,plain,
( subset(the_InternalRel(X1),the_InternalRel(X2))
| ~ subrelstr(X1,X2)
| ~ rel_str(X1)
| ~ rel_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( rel_str(X2)
| ~ rel_str(X1)
| ~ subrelstr(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
( rel_str(esk1_0)
& subrelstr(esk2_0,esk1_0)
& element(esk3_0,the_carrier(esk1_0))
& element(esk4_0,the_carrier(esk1_0))
& element(esk5_0,the_carrier(esk2_0))
& element(esk6_0,the_carrier(esk2_0))
& esk5_0 = esk3_0
& esk6_0 = esk4_0
& related(esk2_0,esk5_0,esk6_0)
& ~ related(esk1_0,esk3_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_14,plain,
! [X31,X32] :
( ( ~ element(X31,powerset(X32))
| subset(X31,X32) )
& ( ~ subset(X31,X32)
| element(X31,powerset(X32)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
cnf(c_0_15,plain,
( subset(the_InternalRel(X1),the_InternalRel(X2))
| ~ subrelstr(X1,X2)
| ~ rel_str(X2) ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
subrelstr(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
rel_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X13,X14,X15] :
( ( ~ related(X13,X14,X15)
| in(ordered_pair(X14,X15),the_InternalRel(X13))
| ~ element(X15,the_carrier(X13))
| ~ element(X14,the_carrier(X13))
| ~ rel_str(X13) )
& ( ~ in(ordered_pair(X14,X15),the_InternalRel(X13))
| related(X13,X14,X15)
| ~ element(X15,the_carrier(X13))
| ~ element(X14,the_carrier(X13))
| ~ rel_str(X13) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_orders_2])])])]) ).
fof(c_0_19,plain,
! [X33,X34,X35] :
( ~ in(X33,X34)
| ~ element(X34,powerset(X35))
| element(X33,X35) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
cnf(c_0_20,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
subset(the_InternalRel(esk2_0),the_InternalRel(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,plain,
( in(ordered_pair(X2,X3),the_InternalRel(X1))
| ~ related(X1,X2,X3)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
element(esk6_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
rel_str(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_16]),c_0_17])]) ).
cnf(c_0_25,negated_conjecture,
related(esk2_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,negated_conjecture,
esk5_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,negated_conjecture,
element(esk5_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
element(the_InternalRel(esk2_0),powerset(the_InternalRel(esk1_0))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( in(ordered_pair(X1,esk6_0),the_InternalRel(esk2_0))
| ~ related(esk2_0,X1,esk6_0)
| ~ element(X1,the_carrier(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
related(esk2_0,esk3_0,esk6_0),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
element(esk3_0,the_carrier(esk2_0)),
inference(rw,[status(thm)],[c_0_27,c_0_26]) ).
fof(c_0_33,plain,
! [X29,X30] :
( ~ element(X29,X30)
| empty(X30)
| in(X29,X30) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_34,negated_conjecture,
( element(X1,the_InternalRel(esk1_0))
| ~ in(X1,the_InternalRel(esk2_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
in(ordered_pair(esk3_0,esk6_0),the_InternalRel(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
fof(c_0_36,plain,
! [X36,X37,X38] :
( ~ in(X36,X37)
| ~ element(X37,powerset(X38))
| ~ empty(X38) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
cnf(c_0_37,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
element(ordered_pair(esk3_0,esk6_0),the_InternalRel(esk1_0)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
element(esk4_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_40,negated_conjecture,
esk6_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,negated_conjecture,
~ related(esk1_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_42,plain,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
( related(X3,X1,X2)
| ~ in(ordered_pair(X1,X2),the_InternalRel(X3))
| ~ element(X2,the_carrier(X3))
| ~ element(X1,the_carrier(X3))
| ~ rel_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_44,negated_conjecture,
( empty(the_InternalRel(esk1_0))
| in(ordered_pair(esk3_0,esk6_0),the_InternalRel(esk1_0)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
element(esk6_0,the_carrier(esk1_0)),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_47,negated_conjecture,
~ related(esk1_0,esk3_0,esk6_0),
inference(rw,[status(thm)],[c_0_41,c_0_40]) ).
cnf(c_0_48,negated_conjecture,
( ~ empty(the_InternalRel(esk1_0))
| ~ in(X1,the_InternalRel(esk2_0)) ),
inference(spm,[status(thm)],[c_0_42,c_0_29]) ).
cnf(c_0_49,negated_conjecture,
empty(the_InternalRel(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_17]),c_0_45]),c_0_46])]),c_0_47]) ).
cnf(c_0_50,negated_conjecture,
~ in(X1,the_InternalRel(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_35,c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SEU362+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n015.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 08:33:30 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.18/0.43 Running first-order theorem proving
% 0.18/0.43 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.teoIXKNKN6/E---3.1_18293.p
% 0.18/0.46 # Version: 3.1pre001
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # sh5l with pid 18406 completed with status 0
% 0.18/0.46 # Result found by sh5l
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.46 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.18/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.18/0.46 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 18420 completed with status 0
% 0.18/0.46 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.46 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.18/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Theorem
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 42
% 0.18/0.47 # Removed by relevancy pruning/SinE : 10
% 0.18/0.47 # Initial clauses : 51
% 0.18/0.47 # Removed in clause preprocessing : 0
% 0.18/0.47 # Initial clauses in saturation : 51
% 0.18/0.47 # Processed clauses : 279
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 10
% 0.18/0.47 # ...remaining for further processing : 269
% 0.18/0.47 # Other redundant clauses eliminated : 0
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 3
% 0.18/0.47 # Backward-rewritten : 29
% 0.18/0.47 # Generated clauses : 890
% 0.18/0.47 # ...of the previous two non-redundant : 825
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 2
% 0.18/0.47 # Paramodulations : 889
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 0
% 0.18/0.47 # Total rewrite steps : 178
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 236
% 0.18/0.47 # Positive orientable unit clauses : 116
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 8
% 0.18/0.47 # Non-unit-clauses : 112
% 0.18/0.47 # Current number of unprocessed clauses: 591
% 0.18/0.47 # ...number of literals in the above : 811
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 33
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 2420
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 2017
% 0.18/0.47 # Non-unit clause-clause subsumptions : 9
% 0.18/0.47 # Unit Clause-clause subsumption calls : 1719
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 72
% 0.18/0.47 # BW rewrite match successes : 3
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 13352
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.019 s
% 0.18/0.47 # System time : 0.004 s
% 0.18/0.47 # Total time : 0.023 s
% 0.18/0.47 # Maximum resident set size: 1876 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.020 s
% 0.18/0.47 # System time : 0.006 s
% 0.18/0.47 # Total time : 0.026 s
% 0.18/0.47 # Maximum resident set size: 1708 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------