%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC031-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:44:37 PM UTC 2026
% Result : Unsatisfiable 0.14s 10.54s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 20
% Syntax : Number of clauses : 69 ( 18 unt; 17 nHn; 69 RR)
% Number of literals : 189 ( 53 equ; 118 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_10,negated_conjecture,
( nil = sk1
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_9,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause84,axiom,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause84) ).
cnf(co1_7,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause56,axiom,
( ~ ssList(X1)
| segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause178,axiom,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(co1_13,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause113,axiom,
( ~ ssItem(X2)
| ~ ssList(X1)
| nil != X1
| totalorderedP(cons(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause113) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause60,axiom,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_20,negated_conjecture,
( nil = sk1
| nil = sk2 ),
co1_10 ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_23,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_25,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause84]) ).
cnf(c_0_27,negated_conjecture,
frontsegP(sk4,sk3),
co1_7 ).
cnf(c_0_28,negated_conjecture,
( sk3 = nil
| sk4 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
c_0_23 ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_24 ).
cnf(c_0_31,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
c_0_26 ).
cnf(c_0_33,negated_conjecture,
( frontsegP(nil,sk3)
| sk3 = nil ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_35,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_36,negated_conjecture,
( nil != sk2
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_37,negated_conjecture,
( ~ totalorderedP(X1)
| ~ ssList(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| X1 = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_38,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31])]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_34 ).
cnf(c_0_40,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| nil != X1
| totalorderedP(cons(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause113]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_43,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
c_0_35 ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_47,negated_conjecture,
( nil != sk2
| nil != sk1 ),
c_0_36 ).
cnf(c_0_48,negated_conjecture,
( ~ totalorderedP(X1)
| ~ ssList(X1)
| ~ frontsegP(sk4,X1)
| X1 = nil ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_38]),c_0_39]) ).
cnf(c_0_49,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| nil != X1
| totalorderedP(cons(X2,X1)) ),
c_0_40 ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_41 ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_42 ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ~ frontsegP(X2,X3)
| frontsegP(cons(X1,X2),cons(X1,X3)) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_44 ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_45 ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_46 ).
cnf(c_0_56,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_57,negated_conjecture,
( sk4 != nil
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_21]),c_0_22]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ frontsegP(sk4,cons(X2,X1))
| nil != X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51]) ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(tl(X1),X2)
| frontsegP(X1,cons(hd(X1),X2))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55]) ).
cnf(c_0_60,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_56,c_0_22]) ).
cnf(c_0_61,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_38])]) ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(hd(sk4))
| ~ frontsegP(tl(sk4),X1)
| nil != X1 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]),c_0_61]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
c_0_62 ).
cnf(c_0_65,axiom,
ssList(nil),
clause8 ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).
cnf(c_0_67,negated_conjecture,
~ ssItem(hd(sk4)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_54]),c_0_60])]),c_0_61]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_55]),c_0_60])]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC031-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/10.38 % Computer : n020.cluster.edu
% 0.11/10.38 % Model : x86_64 x86_64
% 0.11/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38 % Memory : 8046.5625MB
% 0.11/10.38 % OS : Linux 6.8.0-71-generic
% 0.11/10.38 % CPULimit : 300
% 0.11/10.38 % WCLimit : 300
% 0.11/10.38 % DateTime : Mon Sep 21 07:51:44 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/10.43 Running first-order theorem proving
% 0.14/10.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/benchmark/theBenchmark.p
% 0.14/10.54 % Version: 3.5.1
% 0.14/10.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/10.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/10.54 % Starting new_bool_3 with 300s (1) cores
% 0.14/10.54 % Starting new_bool_1 with 300s (1) cores
% 0.14/10.54 % Starting sh5l with 300s (1) cores
% 0.14/10.54 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2418901 completed with status 0
% 0.14/10.54 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/10.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/10.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/10.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/10.54 % No SInE strategy applied
% 0.14/10.54 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/10.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/10.54 % Starting SubtermCWHack with 136s (1) cores
% 0.14/10.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/10.54 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/10.54 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/10.54 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/10.54 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 2418909 completed with status 0
% 0.14/10.54 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.14/10.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/10.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/10.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/10.54 % No SInE strategy applied
% 0.14/10.54 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/10.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/10.54 % Starting SubtermCWHack with 136s (1) cores
% 0.14/10.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/10.54 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/10.54 % Preprocessing time : 0.002 s
% 0.14/10.54 % Presaturation interreduction done
% 0.14/10.54
% 0.14/10.54 % Proof found!
% 0.14/10.54 % SZS status Unsatisfiable
% 0.14/10.54 % SZS output start CNFRefutation
% See solution above
% 0.14/10.54 % Parsed axioms : 198
% 0.14/10.54 % Removed by relevancy pruning/SinE : 0
% 0.14/10.54 % Initial clauses : 198
% 0.14/10.54 % Removed in clause preprocessing : 2
% 0.14/10.54 % Initial clauses in saturation : 196
% 0.14/10.54 % Processed clauses : 1336
% 0.14/10.54 % ...of these trivial : 42
% 0.14/10.54 % ...subsumed : 605
% 0.14/10.54 % ...remaining for further processing : 689
% 0.14/10.54 % Other redundant clauses eliminated : 131
% 0.14/10.54 % Clauses deleted for lack of memory : 0
% 0.14/10.54 % Backward-subsumed : 8
% 0.14/10.54 % Backward-rewritten : 15
% 0.14/10.54 % Generated clauses : 4214
% 0.14/10.54 % ...of the previous two non-redundant : 3682
% 0.14/10.54 % ...aggressively subsumed : 0
% 0.14/10.54 % Contextual simplify-reflections : 88
% 0.14/10.54 % Paramodulations : 4046
% 0.14/10.54 % Factorizations : 0
% 0.14/10.54 % NegExts : 0
% 0.14/10.54 % Equation resolutions : 157
% 0.14/10.54 % Disequality decompositions : 0
% 0.14/10.54 % Total rewrite steps : 2652
% 0.14/10.54 % ...of those cached : 2470
% 0.14/10.54 % Propositional unsat checks : 0
% 0.14/10.54 % Propositional check models : 0
% 0.14/10.54 % Propositional check unsatisfiable : 0
% 0.14/10.54 % Propositional clauses : 0
% 0.14/10.54 % Propositional clauses after purity: 0
% 0.14/10.54 % Propositional unsat core size : 0
% 0.14/10.54 % Propositional preprocessing time : 0.000
% 0.14/10.54 % Propositional encoding time : 0.000
% 0.14/10.54 % Propositional solver time : 0.000
% 0.14/10.54 % Success case prop preproc time : 0.000
% 0.14/10.54 % Success case prop encoding time : 0.000
% 0.14/10.54 % Success case prop solver time : 0.000
% 0.14/10.54 % Current number of processed clauses : 465
% 0.14/10.54 % Positive orientable unit clauses : 63
% 0.14/10.54 % Positive unorientable unit clauses: 0
% 0.14/10.54 % Negative unit clauses : 9
% 0.14/10.54 % Non-unit-clauses : 393
% 0.14/10.54 % Current number of unprocessed clauses: 2638
% 0.14/10.54 % ...number of literals in the above : 18307
% 0.14/10.54 % Current number of archived formulas : 0
% 0.14/10.54 % Current number of archived clauses : 215
% 0.14/10.54 % Clause-clause subsumption calls (NU) : 47595
% 0.14/10.54 % Rec. Clause-clause subsumption calls : 7372
% 0.14/10.54 % Non-unit clause-clause subsumptions : 572
% 0.14/10.54 % Unit Clause-clause subsumption calls : 970
% 0.14/10.54 % Rewrite failures with RHS unbound : 0
% 0.14/10.54 % BW rewrite match attempts : 4
% 0.14/10.54 % BW rewrite match successes : 4
% 0.14/10.54 % Condensation attempts : 0
% 0.14/10.54 % Condensation successes : 0
% 0.14/10.54 % Termbank termtop insertions : 84915
% 0.14/10.54 % Search garbage collected termcells : 543
% 0.14/10.54
% 0.14/10.54 % -------------------------------------------------
% 0.14/10.54 % User time : 0.083 s
% 0.14/10.54 % System time : 0.008 s
% 0.14/10.54 % Total time : 0.091 s
% 0.14/10.54 % Maximum resident set size: 4068 pages
% 0.14/10.54
% 0.14/10.54 % -------------------------------------------------
% 0.14/10.54 % User time : 0.407 s
% 0.14/10.54 % System time : 0.039 s
% 0.14/10.54 % Total time : 0.446 s
% 0.14/10.54 % Maximum resident set size: 4864 pages
% 0.14/10.54 % E exiting
%------------------------------------------------------------------------------