TSTP Solution File: GRP499-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP499-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:48:44 EDT 2023
% Result : Unsatisfiable 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 3
% Syntax : Number of clauses : 51 ( 51 unt; 0 nHn; 6 RR)
% Number of literals : 51 ( 50 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 14 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 156 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X3))),double_divide(X4,double_divide(X2,X4))))) = X3,
file('/export/starexec/sandbox/tmp/tmp.W6kisYINRV/E---3.1_32257.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/tmp/tmp.W6kisYINRV/E---3.1_32257.p',prove_these_axioms_1) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.W6kisYINRV/E---3.1_32257.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X3))),double_divide(X4,double_divide(X2,X4))))) = X3,
single_axiom ).
cnf(c_0_4,plain,
double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X1,X2)),double_divide(X3,double_divide(inverse(X4),X3))))) = inverse(double_divide(inverse(double_divide(X4,double_divide(X5,X2))),double_divide(X6,double_divide(X5,X6)))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(double_divide(inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),X3)))),double_divide(X4,double_divide(X2,X4)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
double_divide(inverse(inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),X3))))),inverse(double_divide(X3,double_divide(X4,double_divide(X5,X4))))) = double_divide(X2,X5),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
double_divide(inverse(inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),inverse(double_divide(X3,double_divide(X4,double_divide(inverse(X3),X5))))))))),X5) = double_divide(X2,X4),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
double_divide(inverse(inverse(double_divide(inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),X3)))),double_divide(X4,double_divide(X2,inverse(X3)))))),X5) = double_divide(X4,X5),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X1,double_divide(inverse(X2),X3))),double_divide(inverse(double_divide(inverse(double_divide(X2,double_divide(X4,X5))),double_divide(X6,double_divide(X4,X6)))),X5)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_10,plain,
double_divide(X1,inverse(inverse(double_divide(inverse(double_divide(X2,double_divide(X3,double_divide(inverse(X2),X4)))),double_divide(X5,double_divide(X3,inverse(X4))))))) = double_divide(X1,X5),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).
cnf(c_0_11,plain,
double_divide(inverse(inverse(double_divide(X1,double_divide(X2,X3)))),inverse(double_divide(inverse(double_divide(inverse(double_divide(X1,double_divide(a1,X3))),double_divide(a1,double_divide(a1,a1)))),double_divide(X4,double_divide(inverse(X5),X4))))) = inverse(double_divide(inverse(double_divide(X5,double_divide(X6,double_divide(X7,double_divide(X2,X7))))),double_divide(X8,double_divide(X6,X8)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_4]) ).
cnf(c_0_12,plain,
inverse(inverse(double_divide(inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),X3)))),double_divide(X4,double_divide(X2,inverse(X3)))))) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_9]) ).
cnf(c_0_13,plain,
double_divide(inverse(inverse(double_divide(X1,double_divide(X2,inverse(double_divide(inverse(double_divide(inverse(double_divide(X1,X3)),double_divide(X4,X3))),double_divide(X5,double_divide(X4,X5)))))))),X6) = double_divide(X2,X6),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_14,plain,
inverse(double_divide(inverse(double_divide(X1,double_divide(X2,double_divide(X3,double_divide(X4,X3))))),double_divide(X5,double_divide(X2,X5)))) = double_divide(X4,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_5]),c_0_6]) ).
cnf(c_0_15,plain,
inverse(inverse(double_divide(X1,double_divide(X2,inverse(double_divide(inverse(double_divide(inverse(double_divide(X1,X3)),double_divide(X4,X3))),double_divide(X5,double_divide(X4,X5)))))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_12]) ).
cnf(c_0_16,plain,
inverse(double_divide(inverse(double_divide(X1,double_divide(inverse(X2),X3))),double_divide(inverse(double_divide(inverse(double_divide(X2,double_divide(X4,X5))),double_divide(X6,double_divide(X4,X6)))),X5))) = inverse(double_divide(inverse(double_divide(X1,double_divide(a1,X3))),double_divide(a1,double_divide(a1,a1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_9]),c_0_4]) ).
cnf(c_0_17,plain,
double_divide(inverse(X1),double_divide(X2,inverse(X1))) = double_divide(X3,double_divide(X2,X3)),
inference(spm,[status(thm)],[c_0_3,c_0_14]) ).
cnf(c_0_18,plain,
inverse(inverse(double_divide(X1,double_divide(X2,inverse(double_divide(inverse(double_divide(inverse(double_divide(X1,double_divide(a1,X3))),double_divide(a1,double_divide(a1,a1)))),double_divide(X4,double_divide(X3,X4)))))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_5]) ).
cnf(c_0_19,plain,
double_divide(X1,double_divide(X2,X1)) = double_divide(X3,double_divide(X2,X3)),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_20,plain,
inverse(inverse(double_divide(X1,inverse(double_divide(inverse(double_divide(X2,double_divide(X3,double_divide(a1,double_divide(a1,a1))))),double_divide(X4,double_divide(X3,X4))))))) = inverse(inverse(double_divide(X1,double_divide(a1,inverse(X2))))),
inference(spm,[status(thm)],[c_0_18,c_0_4]) ).
cnf(c_0_21,plain,
double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X2,double_divide(X3,X2))),double_divide(X4,double_divide(X3,X4))))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_19]) ).
cnf(c_0_22,plain,
inverse(inverse(double_divide(inverse(inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),inverse(double_divide(X3,double_divide(X4,double_divide(a1,double_divide(a1,a1)))))))))),double_divide(a1,inverse(X3))))) = inverse(inverse(double_divide(X2,X4))),
inference(spm,[status(thm)],[c_0_20,c_0_6]) ).
cnf(c_0_23,plain,
double_divide(inverse(X1),double_divide(X2,inverse(double_divide(X3,double_divide(X2,X3))))) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_24,plain,
inverse(inverse(double_divide(inverse(X1),inverse(X2)))) = inverse(inverse(inverse(double_divide(X2,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_25,plain,
inverse(double_divide(inverse(X1),inverse(X2))) = inverse(inverse(double_divide(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24]),c_0_21]) ).
cnf(c_0_26,plain,
double_divide(inverse(X1),inverse(X2)) = inverse(double_divide(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_25]),c_0_21]) ).
cnf(c_0_27,plain,
inverse(double_divide(double_divide(inverse(double_divide(double_divide(X1,X2),X1)),X2),X3)) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_26]),c_0_26]),c_0_26]),c_0_26]) ).
cnf(c_0_28,plain,
inverse(double_divide(double_divide(X1,inverse(X1)),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_23]) ).
cnf(c_0_29,plain,
inverse(double_divide(inverse(double_divide(inverse(X1),X1)),X2)) = X2,
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_30,plain,
inverse(inverse(double_divide(X1,double_divide(inverse(X2),X2)))) = inverse(X1),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_31,plain,
inverse(inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X3,X4)),double_divide(X5,X4)))))))) = inverse(inverse(double_divide(X3,double_divide(X2,X5)))),
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_32,plain,
inverse(double_divide(X1,double_divide(inverse(X2),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_30]),c_0_23]) ).
cnf(c_0_33,plain,
inverse(inverse(double_divide(inverse(inverse(double_divide(X1,double_divide(X2,X3)))),double_divide(a1,inverse(inverse(double_divide(X1,double_divide(a1,double_divide(a1,a1))))))))) = inverse(inverse(double_divide(X2,X3))),
inference(spm,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_34,plain,
double_divide(inverse(double_divide(inverse(double_divide(X1,double_divide(a1,X2))),double_divide(a1,double_divide(a1,a1)))),inverse(double_divide(inverse(double_divide(double_divide(inverse(double_divide(X1,double_divide(X3,X2))),double_divide(X4,double_divide(X3,X4))),double_divide(X5,X6))),double_divide(X7,double_divide(X5,X7))))) = X6,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_4]) ).
cnf(c_0_35,plain,
inverse(double_divide(inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),X2)))),double_divide(X3,double_divide(X4,X3)))) = X4,
inference(spm,[status(thm)],[c_0_5,c_0_19]) ).
cnf(c_0_36,plain,
double_divide(inverse(X1),double_divide(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_32]) ).
cnf(c_0_37,plain,
inverse(inverse(double_divide(inverse(inverse(double_divide(X1,X2))),double_divide(a1,inverse(inverse(double_divide(X1,double_divide(a1,double_divide(a1,a1))))))))) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_29]) ).
cnf(c_0_39,plain,
inverse(inverse(double_divide(inverse(X1),double_divide(a1,inverse(a1))))) = inverse(inverse(double_divide(X2,double_divide(X1,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_35]) ).
cnf(c_0_40,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_38]) ).
cnf(c_0_41,plain,
double_divide(inverse(X1),double_divide(a1,inverse(a1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_40]),c_0_38]) ).
cnf(c_0_42,plain,
double_divide(double_divide(a1,inverse(a1)),X1) = inverse(X1),
inference(spm,[status(thm)],[c_0_38,c_0_41]) ).
cnf(c_0_43,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_44,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_45,plain,
double_divide(inverse(X1),X1) = double_divide(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_42]),c_0_40]) ).
cnf(c_0_46,negated_conjecture,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_44]) ).
cnf(c_0_47,plain,
inverse(double_divide(a1,inverse(a1))) = double_divide(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_45]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
inverse(double_divide(b1,inverse(b1))) != double_divide(a1,inverse(a1)),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
inverse(double_divide(X1,inverse(X1))) = double_divide(a1,inverse(a1)),
inference(spm,[status(thm)],[c_0_26,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP499-1 : TPTP v8.1.2. Released v2.6.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:23:24 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.W6kisYINRV/E---3.1_32257.p
% 0.20/0.62 # Version: 3.1pre001
% 0.20/0.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.62 # Starting sh5l with 300s (1) cores
% 0.20/0.62 # sh5l with pid 32416 completed with status 0
% 0.20/0.62 # Result found by sh5l
% 0.20/0.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.62 # Starting sh5l with 300s (1) cores
% 0.20/0.62 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.62 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.20/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.62 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.62 # SAT001_MinMin_p005000_rr_RG with pid 32423 completed with status 0
% 0.20/0.62 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.62 # Starting sh5l with 300s (1) cores
% 0.20/0.62 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.62 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.20/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.62 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.62 # Preprocessing time : 0.001 s
% 0.20/0.62 # Presaturation interreduction done
% 0.20/0.62
% 0.20/0.62 # Proof found!
% 0.20/0.62 # SZS status Unsatisfiable
% 0.20/0.62 # SZS output start CNFRefutation
% See solution above
% 0.20/0.62 # Parsed axioms : 3
% 0.20/0.62 # Removed by relevancy pruning/SinE : 0
% 0.20/0.62 # Initial clauses : 3
% 0.20/0.62 # Removed in clause preprocessing : 0
% 0.20/0.62 # Initial clauses in saturation : 3
% 0.20/0.62 # Processed clauses : 169
% 0.20/0.62 # ...of these trivial : 27
% 0.20/0.62 # ...subsumed : 64
% 0.20/0.62 # ...remaining for further processing : 78
% 0.20/0.62 # Other redundant clauses eliminated : 0
% 0.20/0.62 # Clauses deleted for lack of memory : 0
% 0.20/0.62 # Backward-subsumed : 2
% 0.20/0.62 # Backward-rewritten : 47
% 0.20/0.62 # Generated clauses : 6373
% 0.20/0.62 # ...of the previous two non-redundant : 5730
% 0.20/0.62 # ...aggressively subsumed : 0
% 0.20/0.62 # Contextual simplify-reflections : 0
% 0.20/0.62 # Paramodulations : 6373
% 0.20/0.62 # Factorizations : 0
% 0.20/0.62 # NegExts : 0
% 0.20/0.62 # Equation resolutions : 0
% 0.20/0.62 # Total rewrite steps : 3244
% 0.20/0.62 # Propositional unsat checks : 0
% 0.20/0.62 # Propositional check models : 0
% 0.20/0.62 # Propositional check unsatisfiable : 0
% 0.20/0.62 # Propositional clauses : 0
% 0.20/0.62 # Propositional clauses after purity: 0
% 0.20/0.62 # Propositional unsat core size : 0
% 0.20/0.62 # Propositional preprocessing time : 0.000
% 0.20/0.62 # Propositional encoding time : 0.000
% 0.20/0.62 # Propositional solver time : 0.000
% 0.20/0.62 # Success case prop preproc time : 0.000
% 0.20/0.62 # Success case prop encoding time : 0.000
% 0.20/0.62 # Success case prop solver time : 0.000
% 0.20/0.62 # Current number of processed clauses : 26
% 0.20/0.62 # Positive orientable unit clauses : 22
% 0.20/0.62 # Positive unorientable unit clauses: 4
% 0.20/0.62 # Negative unit clauses : 0
% 0.20/0.62 # Non-unit-clauses : 0
% 0.20/0.62 # Current number of unprocessed clauses: 5482
% 0.20/0.62 # ...number of literals in the above : 5482
% 0.20/0.62 # Current number of archived formulas : 0
% 0.20/0.62 # Current number of archived clauses : 52
% 0.20/0.62 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.62 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.62 # Non-unit clause-clause subsumptions : 0
% 0.20/0.62 # Unit Clause-clause subsumption calls : 108
% 0.20/0.62 # Rewrite failures with RHS unbound : 0
% 0.20/0.62 # BW rewrite match attempts : 823
% 0.20/0.62 # BW rewrite match successes : 91
% 0.20/0.62 # Condensation attempts : 0
% 0.20/0.62 # Condensation successes : 0
% 0.20/0.62 # Termbank termtop insertions : 168708
% 0.20/0.62
% 0.20/0.62 # -------------------------------------------------
% 0.20/0.62 # User time : 0.121 s
% 0.20/0.62 # System time : 0.004 s
% 0.20/0.62 # Total time : 0.125 s
% 0.20/0.62 # Maximum resident set size: 1424 pages
% 0.20/0.62
% 0.20/0.62 # -------------------------------------------------
% 0.20/0.62 # User time : 0.123 s
% 0.20/0.62 # System time : 0.005 s
% 0.20/0.62 # Total time : 0.128 s
% 0.20/0.62 # Maximum resident set size: 1672 pages
% 0.20/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------