TSTP Solution File: LCL389-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL389-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 18:12:36 EDT 2023
% Result : Unsatisfiable 15.80s 2.48s
% Output : CNFRefutation 15.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of clauses : 67 ( 30 unt; 0 nHn; 23 RR)
% Number of literals : 115 ( 0 equ; 53 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 156 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.sqJ5Q543nS/E---3.1_10620.p',condensed_detachment) ).
cnf(cn_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.sqJ5Q543nS/E---3.1_10620.p',cn_1) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox/tmp/tmp.sqJ5Q543nS/E---3.1_10620.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/tmp/tmp.sqJ5Q543nS/E---3.1_10620.p',cn_3) ).
cnf(prove_cn_52,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(y,not(z))),implies(x,implies(z,not(y))))),
file('/export/starexec/sandbox/tmp/tmp.sqJ5Q543nS/E---3.1_10620.p',prove_cn_52) ).
cnf(c_0_5,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_6,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
cn_1 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X4,X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X4))
| ~ is_a_theorem(implies(X4,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(implies(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(not(X2),X4),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(implies(not(X1),X1),implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_9]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(not(implies(X1,X3)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_6]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X4,X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(implies(not(X1),X1),X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(X3),X4)))
| ~ is_a_theorem(implies(implies(implies(X2,X5),implies(X1,X5)),X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_6]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_9]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X3),X3)))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_30]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_22,c_0_9]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_35]) ).
cnf(c_0_41,plain,
( is_a_theorem(implies(implies(not(X1),X2),X3))
| ~ is_a_theorem(implies(implies(implies(X2,X1),X1),X3)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_44,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_40]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(implies(not(X1),X4),X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_33,c_0_43]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_44]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,X1)),X3))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(implies(implies(not(not(X1)),X2),X1),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_47]) ).
cnf(c_0_51,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_48]) ).
cnf(c_0_52,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_36,c_0_49]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(implies(not(X1),not(not(X1))),X1)),
inference(spm,[status(thm)],[c_0_41,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(y,not(z))),implies(x,implies(z,not(y))))),
prove_cn_52 ).
cnf(c_0_55,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_51,c_0_6]) ).
cnf(c_0_56,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
~ is_a_theorem(implies(implies(y,not(z)),implies(z,not(y)))),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(not(X3),X1))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_55]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_41,c_0_47]) ).
cnf(c_0_60,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_14,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( ~ is_a_theorem(implies(not(implies(z,not(y))),y))
| ~ is_a_theorem(implies(not(z),implies(z,not(y)))) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_52,c_0_59]) ).
cnf(c_0_63,plain,
is_a_theorem(implies(X1,not(not(implies(X2,X1))))),
inference(spm,[status(thm)],[c_0_52,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
~ is_a_theorem(implies(not(implies(z,not(y))),y)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_65,plain,
is_a_theorem(implies(not(implies(X1,not(X2))),X2)),
inference(spm,[status(thm)],[c_0_14,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL389-1 : TPTP v8.1.2. Released v2.3.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 12:38:48 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.sqJ5Q543nS/E---3.1_10620.p
% 15.80/2.48 # Version: 3.1pre001
% 15.80/2.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 15.80/2.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.80/2.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.80/2.48 # Starting new_bool_3 with 300s (1) cores
% 15.80/2.48 # Starting new_bool_1 with 300s (1) cores
% 15.80/2.48 # Starting sh5l with 300s (1) cores
% 15.80/2.48 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 10754 completed with status 0
% 15.80/2.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 15.80/2.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 15.80/2.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.80/2.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.80/2.48 # No SInE strategy applied
% 15.80/2.48 # Search class: FHUNS-FFSF21-MFFFFFNN
% 15.80/2.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 15.80/2.48 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 15.80/2.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 15.80/2.48 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 15.80/2.48 # Starting new_bool_3 with 136s (1) cores
% 15.80/2.48 # Starting new_bool_1 with 136s (1) cores
% 15.80/2.48 # H----_011_C07_F1_PI_SE_SP_S0V with pid 10764 completed with status 0
% 15.80/2.48 # Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 15.80/2.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 15.80/2.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.80/2.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.80/2.48 # No SInE strategy applied
% 15.80/2.48 # Search class: FHUNS-FFSF21-MFFFFFNN
% 15.80/2.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 15.80/2.48 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 15.80/2.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 15.80/2.48 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 15.80/2.48 # Preprocessing time : 0.001 s
% 15.80/2.48
% 15.80/2.48 # Proof found!
% 15.80/2.48 # SZS status Unsatisfiable
% 15.80/2.48 # SZS output start CNFRefutation
% See solution above
% 15.80/2.48 # Parsed axioms : 5
% 15.80/2.48 # Removed by relevancy pruning/SinE : 0
% 15.80/2.48 # Initial clauses : 5
% 15.80/2.48 # Removed in clause preprocessing : 0
% 15.80/2.48 # Initial clauses in saturation : 5
% 15.80/2.48 # Processed clauses : 39689
% 15.80/2.48 # ...of these trivial : 439
% 15.80/2.48 # ...subsumed : 35995
% 15.80/2.48 # ...remaining for further processing : 3255
% 15.80/2.48 # Other redundant clauses eliminated : 0
% 15.80/2.48 # Clauses deleted for lack of memory : 0
% 15.80/2.48 # Backward-subsumed : 1340
% 15.80/2.48 # Backward-rewritten : 210
% 15.80/2.48 # Generated clauses : 196486
% 15.80/2.48 # ...of the previous two non-redundant : 186418
% 15.80/2.48 # ...aggressively subsumed : 0
% 15.80/2.48 # Contextual simplify-reflections : 0
% 15.80/2.48 # Paramodulations : 196486
% 15.80/2.48 # Factorizations : 0
% 15.80/2.48 # NegExts : 0
% 15.80/2.48 # Equation resolutions : 0
% 15.80/2.48 # Total rewrite steps : 11139
% 15.80/2.48 # Propositional unsat checks : 0
% 15.80/2.48 # Propositional check models : 0
% 15.80/2.48 # Propositional check unsatisfiable : 0
% 15.80/2.48 # Propositional clauses : 0
% 15.80/2.48 # Propositional clauses after purity: 0
% 15.80/2.48 # Propositional unsat core size : 0
% 15.80/2.48 # Propositional preprocessing time : 0.000
% 15.80/2.48 # Propositional encoding time : 0.000
% 15.80/2.48 # Propositional solver time : 0.000
% 15.80/2.48 # Success case prop preproc time : 0.000
% 15.80/2.48 # Success case prop encoding time : 0.000
% 15.80/2.48 # Success case prop solver time : 0.000
% 15.80/2.48 # Current number of processed clauses : 1705
% 15.80/2.48 # Positive orientable unit clauses : 218
% 15.80/2.48 # Positive unorientable unit clauses: 0
% 15.80/2.48 # Negative unit clauses : 90
% 15.80/2.48 # Non-unit-clauses : 1397
% 15.80/2.48 # Current number of unprocessed clauses: 146487
% 15.80/2.48 # ...number of literals in the above : 521674
% 15.80/2.48 # Current number of archived formulas : 0
% 15.80/2.48 # Current number of archived clauses : 1550
% 15.80/2.48 # Clause-clause subsumption calls (NU) : 1176313
% 15.80/2.48 # Rec. Clause-clause subsumption calls : 422317
% 15.80/2.48 # Non-unit clause-clause subsumptions : 30396
% 15.80/2.48 # Unit Clause-clause subsumption calls : 45001
% 15.80/2.48 # Rewrite failures with RHS unbound : 0
% 15.80/2.48 # BW rewrite match attempts : 36218
% 15.80/2.48 # BW rewrite match successes : 31
% 15.80/2.48 # Condensation attempts : 0
% 15.80/2.48 # Condensation successes : 0
% 15.80/2.48 # Termbank termtop insertions : 3123810
% 15.80/2.48
% 15.80/2.48 # -------------------------------------------------
% 15.80/2.48 # User time : 1.844 s
% 15.80/2.48 # System time : 0.071 s
% 15.80/2.48 # Total time : 1.915 s
% 15.80/2.48 # Maximum resident set size: 1592 pages
% 15.80/2.48
% 15.80/2.48 # -------------------------------------------------
% 15.80/2.48 # User time : 9.648 s
% 15.80/2.48 # System time : 0.176 s
% 15.80/2.48 # Total time : 9.824 s
% 15.80/2.48 # Maximum resident set size: 1672 pages
% 15.80/2.48 % E---3.1 exiting
% 15.80/2.48 % E---3.1 exiting
%------------------------------------------------------------------------------