TSTP Solution File: GEO202+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO202+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 17:32:05 EDT 2023
% Result : Theorem 0.53s 0.56s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 55 ( 20 unt; 0 def)
% Number of atoms : 124 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 113 ( 44 ~; 49 |; 8 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn; 59 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& distinct_points(X1,X3)
& convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3)) )
=> ~ distinct_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QT2tMLKx2a/E---3.1_1859.p',con) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QT2tMLKx2a/E---3.1_1859.p',ceq3) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.QT2tMLKx2a/E---3.1_1859.p',apart3) ).
fof(apart5,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QT2tMLKx2a/E---3.1_1859.p',apart5) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.QT2tMLKx2a/E---3.1_1859.p',apart2) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.QT2tMLKx2a/E---3.1_1859.p',apart1) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X1,X3)
| distinct_points(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QT2tMLKx2a/E---3.1_1859.p',apart4) ).
fof(cu1,axiom,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& distinct_lines(X4,X5) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X2,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QT2tMLKx2a/E---3.1_1859.p',cu1) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QT2tMLKx2a/E---3.1_1859.p',ci4) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QT2tMLKx2a/E---3.1_1859.p',ci3) ).
fof(ci1,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.QT2tMLKx2a/E---3.1_1859.p',ci1) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& distinct_points(X1,X3)
& convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3)) )
=> ~ distinct_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_12,plain,
! [X32,X33,X34] :
( ~ convergent_lines(X32,X33)
| distinct_lines(X33,X34)
| convergent_lines(X32,X34) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])]) ).
fof(c_0_13,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& distinct_points(esk1_0,esk3_0)
& convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))
& distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_14,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_15,plain,
! [X39,X40,X41] :
( ~ distinct_lines(X39,X40)
| distinct_lines(X39,X41)
| distinct_lines(X40,X41) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])]) ).
cnf(c_0_16,plain,
( distinct_lines(X2,X3)
| convergent_lines(X1,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
fof(c_0_19,plain,
! [X28] : ~ convergent_lines(X28,X28),
inference(variable_rename,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( distinct_lines(X1,X3)
| distinct_lines(X2,X3)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( convergent_lines(line_connecting(esk1_0,esk2_0),X1)
| distinct_lines(line_connecting(esk1_0,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_22,plain,
! [X38] : ~ distinct_lines(X38,X38),
inference(variable_rename,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( convergent_lines(line_connecting(esk1_0,esk2_0),X1)
| distinct_lines(line_connecting(esk1_0,esk3_0),X2)
| distinct_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_25,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
fof(c_0_26,plain,
! [X10,X11,X12] :
( ~ distinct_points(X10,X11)
| distinct_points(X10,X12)
| distinct_points(X11,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])]) ).
fof(c_0_27,plain,
! [X13,X14,X15,X16] :
( ~ distinct_points(X13,X14)
| ~ distinct_lines(X15,X16)
| apart_point_and_line(X13,X15)
| apart_point_and_line(X13,X16)
| apart_point_and_line(X14,X15)
| apart_point_and_line(X14,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_28,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( distinct_lines(line_connecting(esk1_0,esk2_0),X1)
| distinct_lines(line_connecting(esk1_0,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_30,plain,
! [X9] : ~ distinct_points(X9,X9),
inference(variable_rename,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( distinct_points(X1,X3)
| distinct_points(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_33,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
cnf(c_0_34,plain,
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X4)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X2,X4)
| ~ distinct_points(X1,X2)
| ~ distinct_lines(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),X1)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
fof(c_0_38,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[ci3]) ).
fof(c_0_39,plain,
! [X22,X23] :
( ~ convergent_lines(X22,X23)
| ~ apart_point_and_line(intersection_point(X22,X23),X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])]) ).
cnf(c_0_40,negated_conjecture,
( apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X1,line_connecting(esk1_0,esk3_0))
| apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X2,line_connecting(esk1_0,esk3_0))
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
distinct_points(esk1_0,intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_42,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci1]) ).
fof(c_0_43,plain,
! [X20,X21] :
( ~ convergent_lines(X20,X21)
| ~ apart_point_and_line(intersection_point(X20,X21),X20) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])]) ).
cnf(c_0_44,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk3_0))
| apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
fof(c_0_46,plain,
! [X24,X25] :
( ~ distinct_points(X24,X25)
| ~ apart_point_and_line(X24,line_connecting(X24,X25)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])]) ).
cnf(c_0_47,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_17])]) ).
cnf(c_0_49,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_17])]) ).
cnf(c_0_51,negated_conjecture,
distinct_points(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_52,negated_conjecture,
apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_53,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_52]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : GEO202+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.12/0.36 % Computer : n016.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8042.1875MB
% 0.12/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.36 % CPULimit : 2400
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Tue Oct 3 06:53:07 EDT 2023
% 0.12/0.36 % CPUTime :
% 0.19/0.49 Running first-order theorem proving
% 0.19/0.49 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.QT2tMLKx2a/E---3.1_1859.p
% 0.53/0.56 # Version: 3.1pre001
% 0.53/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.53/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.53/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.53/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.53/0.56 # Starting sh5l with 300s (1) cores
% 0.53/0.56 # new_bool_3 with pid 1941 completed with status 0
% 0.53/0.56 # Result found by new_bool_3
% 0.53/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.53/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.53/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.53/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.53/0.56 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.53/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.53/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.53/0.56 # SAT001_MinMin_p005000_rr_RG with pid 1949 completed with status 0
% 0.53/0.56 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.53/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.53/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.53/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.53/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.53/0.56 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.53/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.53/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.53/0.56 # Preprocessing time : 0.001 s
% 0.53/0.56 # Presaturation interreduction done
% 0.53/0.56
% 0.53/0.56 # Proof found!
% 0.53/0.56 # SZS status Theorem
% 0.53/0.56 # SZS output start CNFRefutation
% See solution above
% 0.53/0.56 # Parsed axioms : 15
% 0.53/0.56 # Removed by relevancy pruning/SinE : 0
% 0.53/0.56 # Initial clauses : 18
% 0.53/0.56 # Removed in clause preprocessing : 0
% 0.53/0.56 # Initial clauses in saturation : 18
% 0.53/0.56 # Processed clauses : 613
% 0.53/0.56 # ...of these trivial : 0
% 0.53/0.56 # ...subsumed : 442
% 0.53/0.56 # ...remaining for further processing : 171
% 0.53/0.56 # Other redundant clauses eliminated : 0
% 0.53/0.56 # Clauses deleted for lack of memory : 0
% 0.53/0.56 # Backward-subsumed : 8
% 0.53/0.56 # Backward-rewritten : 1
% 0.53/0.56 # Generated clauses : 2629
% 0.53/0.56 # ...of the previous two non-redundant : 2398
% 0.53/0.56 # ...aggressively subsumed : 0
% 0.53/0.56 # Contextual simplify-reflections : 0
% 0.53/0.56 # Paramodulations : 2191
% 0.53/0.56 # Factorizations : 438
% 0.53/0.56 # NegExts : 0
% 0.53/0.56 # Equation resolutions : 0
% 0.53/0.56 # Total rewrite steps : 240
% 0.53/0.56 # Propositional unsat checks : 0
% 0.53/0.56 # Propositional check models : 0
% 0.53/0.56 # Propositional check unsatisfiable : 0
% 0.53/0.56 # Propositional clauses : 0
% 0.53/0.56 # Propositional clauses after purity: 0
% 0.53/0.56 # Propositional unsat core size : 0
% 0.53/0.56 # Propositional preprocessing time : 0.000
% 0.53/0.56 # Propositional encoding time : 0.000
% 0.53/0.56 # Propositional solver time : 0.000
% 0.53/0.56 # Success case prop preproc time : 0.000
% 0.53/0.56 # Success case prop encoding time : 0.000
% 0.53/0.56 # Success case prop solver time : 0.000
% 0.53/0.56 # Current number of processed clauses : 144
% 0.53/0.56 # Positive orientable unit clauses : 11
% 0.53/0.56 # Positive unorientable unit clauses: 0
% 0.53/0.56 # Negative unit clauses : 3
% 0.53/0.56 # Non-unit-clauses : 130
% 0.53/0.56 # Current number of unprocessed clauses: 1817
% 0.53/0.56 # ...number of literals in the above : 12970
% 0.53/0.56 # Current number of archived formulas : 0
% 0.53/0.56 # Current number of archived clauses : 27
% 0.53/0.56 # Clause-clause subsumption calls (NU) : 6123
% 0.53/0.56 # Rec. Clause-clause subsumption calls : 2289
% 0.53/0.56 # Non-unit clause-clause subsumptions : 448
% 0.53/0.56 # Unit Clause-clause subsumption calls : 81
% 0.53/0.56 # Rewrite failures with RHS unbound : 0
% 0.53/0.56 # BW rewrite match attempts : 2
% 0.53/0.56 # BW rewrite match successes : 2
% 0.53/0.56 # Condensation attempts : 0
% 0.53/0.56 # Condensation successes : 0
% 0.53/0.56 # Termbank termtop insertions : 46839
% 0.53/0.56
% 0.53/0.56 # -------------------------------------------------
% 0.53/0.56 # User time : 0.064 s
% 0.53/0.56 # System time : 0.001 s
% 0.53/0.56 # Total time : 0.066 s
% 0.53/0.56 # Maximum resident set size: 1704 pages
% 0.53/0.56
% 0.53/0.56 # -------------------------------------------------
% 0.53/0.56 # User time : 0.065 s
% 0.53/0.56 # System time : 0.004 s
% 0.53/0.56 # Total time : 0.069 s
% 0.53/0.56 # Maximum resident set size: 1688 pages
% 0.53/0.56 % E---3.1 exiting
% 0.53/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------