↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : PRO010+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.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 01:59:32 PM UTC 2026

% Result   : Theorem 0.21s 5.52s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   36 (  12 unt;   0 def)
%            Number of atoms       :  144 (  10 equ)
%            Maximal formula atoms :   28 (   4 avg)
%            Number of connectives :  160 (  52   ~;  59   |;  39   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   6 con; 0-2 aty)
%            Number of variables   :   62 (   3 sgn  27   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ! [X110] :
      ( occurrence_of(X110,tptp0)
     => ? [X111,X112] :
          ( ( occurrence_of(X112,tptp2)
           => ~ ? [X114] :
                  ( min_precedes(X111,X114,tptp0)
                  & occurrence_of(X114,tptp1) ) )
          & ( occurrence_of(X112,tptp1)
           => ~ ? [X113] :
                  ( min_precedes(X111,X113,tptp0)
                  & occurrence_of(X113,tptp2) ) )
          & leaf_occ(X112,X110) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(sos_35,axiom,
    ! [X106] :
      ( occurrence_of(X106,tptp0)
     => ? [X107,X108,X109] :
          ( leaf_occ(X109,X106)
          & next_subocc(X108,X109,tptp0)
          & ( occurrence_of(X109,tptp2)
            | occurrence_of(X109,tptp1) )
          & next_subocc(X107,X108,tptp0)
          & occurrence_of(X108,tptp4)
          & root_occ(X107,X106)
          & occurrence_of(X107,tptp3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_35) ).

fof(sos_02,axiom,
    ! [X5,X6,X7] :
      ( ( occurrence_of(X5,X7)
        & occurrence_of(X5,X6) )
     => X6 = X7 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).

fof(sos_34,axiom,
    ! [X103,X104] :
      ( leaf_occ(X103,X104)
    <=> ? [X105] :
          ( leaf(X103,X105)
          & subactivity_occurrence(X103,X104)
          & occurrence_of(X104,X105) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_34) ).

fof(sos_21,axiom,
    ! [X57,X58] :
      ( leaf(X57,X58)
    <=> ( ~ ? [X60] : min_precedes(X57,X60,X58)
        & ( ? [X59] : min_precedes(X59,X57,X58)
          | root(X57,X58) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_21) ).

fof(sos_47,axiom,
    tptp1 != tptp2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_47) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X110] :
        ( occurrence_of(X110,tptp0)
       => ? [X111,X112] :
            ( ( occurrence_of(X112,tptp2)
             => ~ ? [X114] :
                    ( min_precedes(X111,X114,tptp0)
                    & occurrence_of(X114,tptp1) ) )
            & ( occurrence_of(X112,tptp1)
             => ~ ? [X113] :
                    ( min_precedes(X111,X113,tptp0)
                    & occurrence_of(X113,tptp2) ) )
            & leaf_occ(X112,X110) ) ),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_7,plain,
    ! [X237] :
      ( ( ~ occurrence_of(X237,tptp0)
        | leaf_occ(esk18_1(X237),X237) )
      & ( ~ occurrence_of(X237,tptp0)
        | next_subocc(esk17_1(X237),esk18_1(X237),tptp0) )
      & ( ~ occurrence_of(X237,tptp0)
        | occurrence_of(esk18_1(X237),tptp2)
        | occurrence_of(esk18_1(X237),tptp1) )
      & ( ~ occurrence_of(X237,tptp0)
        | next_subocc(esk16_1(X237),esk17_1(X237),tptp0) )
      & ( ~ occurrence_of(X237,tptp0)
        | occurrence_of(esk17_1(X237),tptp4) )
      & ( ~ occurrence_of(X237,tptp0)
        | root_occ(esk16_1(X237),X237) )
      & ( ~ occurrence_of(X237,tptp0)
        | occurrence_of(esk16_1(X237),tptp3) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_35])])])])]) ).

fof(c_0_8,negated_conjecture,
    ! [X242,X243] :
      ( ( ~ leaf_occ(X243,esk19_0)
        | min_precedes(X242,esk20_2(X242,X243),tptp0)
        | min_precedes(X242,esk21_2(X242,X243),tptp0) )
      & ( ~ leaf_occ(X243,esk19_0)
        | min_precedes(X242,esk20_2(X242,X243),tptp0)
        | occurrence_of(esk21_2(X242,X243),tptp1) )
      & ( ~ leaf_occ(X243,esk19_0)
        | min_precedes(X242,esk20_2(X242,X243),tptp0)
        | occurrence_of(X243,tptp2) )
      & ( ~ leaf_occ(X243,esk19_0)
        | occurrence_of(esk20_2(X242,X243),tptp2)
        | min_precedes(X242,esk21_2(X242,X243),tptp0) )
      & ( ~ leaf_occ(X243,esk19_0)
        | occurrence_of(esk20_2(X242,X243),tptp2)
        | occurrence_of(esk21_2(X242,X243),tptp1) )
      & ( ~ leaf_occ(X243,esk19_0)
        | occurrence_of(esk20_2(X242,X243),tptp2)
        | occurrence_of(X243,tptp2) )
      & ( ~ leaf_occ(X243,esk19_0)
        | occurrence_of(X243,tptp1)
        | min_precedes(X242,esk21_2(X242,X243),tptp0) )
      & ( ~ leaf_occ(X243,esk19_0)
        | occurrence_of(X243,tptp1)
        | occurrence_of(esk21_2(X242,X243),tptp1) )
      & ( ~ leaf_occ(X243,esk19_0)
        | occurrence_of(X243,tptp1)
        | occurrence_of(X243,tptp2) )
      & occurrence_of(esk19_0,tptp0) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])]) ).

fof(c_0_9,plain,
    ! [X119,X120,X121] :
      ( X120 = X121
      | ~ occurrence_of(X119,X121)
      | ~ occurrence_of(X119,X120) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).

fof(c_0_10,plain,
    ! [X231,X232,X234,X235,X236] :
      ( ( leaf_occ(X234,X235)
        | ~ leaf(X234,X236)
        | ~ subactivity_occurrence(X234,X235)
        | ~ occurrence_of(X235,X236) )
      & ( ~ leaf_occ(X231,X232)
        | leaf(X231,esk15_2(X231,X232)) )
      & ( ~ leaf_occ(X231,X232)
        | subactivity_occurrence(X231,X232) )
      & ( ~ leaf_occ(X231,X232)
        | occurrence_of(X232,esk15_2(X231,X232)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_34])])])])])])]) ).

cnf(c_0_11,plain,
    ( ~ occurrence_of(X1,tptp0)
    | leaf_occ(esk18_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    occurrence_of(esk19_0,tptp0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( ~ occurrence_of(X1,X3)
    | ~ occurrence_of(X1,X2)
    | X2 = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    ( ~ leaf_occ(X2,X1)
    | occurrence_of(X1,esk15_2(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    leaf_occ(esk18_1(esk19_0),esk19_0),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

fof(c_0_16,plain,
    ! [X171,X172,X174,X175,X176,X177] :
      ( ( leaf(X175,X176)
        | min_precedes(X175,esk7_2(X175,X176),X176)
        | ~ min_precedes(X177,X175,X176) )
      & ( leaf(X175,X176)
        | min_precedes(X175,esk7_2(X175,X176),X176)
        | ~ root(X175,X176) )
      & ( ~ leaf(X171,X172)
        | ~ min_precedes(X171,X174,X172) )
      & ( ~ leaf(X171,X172)
        | min_precedes(esk6_2(X171,X172),X171,X172)
        | root(X171,X172) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])])])])]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ leaf_occ(X2,esk19_0)
    | occurrence_of(X2,tptp1)
    | min_precedes(X1,esk21_2(X1,X2),tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ occurrence_of(esk19_0,X1)
    | X1 = tptp0 ),
    inference(spm,[status(thm)],[c_0_13,c_0_12]) ).

cnf(c_0_19,negated_conjecture,
    occurrence_of(esk19_0,esk15_2(esk18_1(esk19_0),esk19_0)),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,plain,
    ( ~ leaf(X1,X3)
    | ~ min_precedes(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    ( occurrence_of(esk18_1(esk19_0),tptp1)
    | min_precedes(X1,esk21_2(X1,esk18_1(esk19_0)),tptp0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_15]) ).

cnf(c_0_22,plain,
    ( ~ leaf_occ(X1,X2)
    | leaf(X1,esk15_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_23,negated_conjecture,
    esk15_2(esk18_1(esk19_0),esk19_0) = tptp0,
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ leaf_occ(X1,esk19_0)
    | min_precedes(X2,esk20_2(X2,X1),tptp0)
    | occurrence_of(X1,tptp2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ leaf(X1,tptp0)
    | occurrence_of(esk18_1(esk19_0),tptp1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    leaf(esk18_1(esk19_0),tptp0),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    ( occurrence_of(esk18_1(esk19_0),tptp2)
    | min_precedes(X1,esk20_2(X1,esk18_1(esk19_0)),tptp0) ),
    inference(spm,[status(thm)],[c_0_24,c_0_15]) ).

fof(c_0_28,plain,
    tptp1 != tptp2,
    inference(fof_simplification,[status(thm)],[sos_47]) ).

cnf(c_0_29,negated_conjecture,
    occurrence_of(esk18_1(esk19_0),tptp1),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ leaf(X1,tptp0)
    | occurrence_of(esk18_1(esk19_0),tptp2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_27]) ).

fof(c_0_31,plain,
    tptp1 != tptp2,
    inference(fof_nnf,[status(thm)],[c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ occurrence_of(esk18_1(esk19_0),X1)
    | X1 = tptp1 ),
    inference(spm,[status(thm)],[c_0_13,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    occurrence_of(esk18_1(esk19_0),tptp2),
    inference(spm,[status(thm)],[c_0_30,c_0_26]) ).

cnf(c_0_34,plain,
    tptp1 != tptp2,
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : PRO010+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.44  % Computer : n016.cluster.edu
% 0.18/5.44  % Model    : x86_64 x86_64
% 0.18/5.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.44  % Memory   : 8046.5625MB
% 0.18/5.44  % OS       : Linux 6.8.0-71-generic
% 0.18/5.44  % CPULimit : 300
% 0.18/5.44  % WCLimit  : 300
% 0.18/5.44  % DateTime : Mon Sep 21 03:47:14 UTC 2026
% 0.18/5.44  % CPUTime  : 
% 0.18/5.44  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.48  Running first-order theorem proving
% 0.18/5.48  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/benchmark/theBenchmark.p
% 0.21/5.52  % Version: 3.5.1
% 0.21/5.52  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/5.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.52  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/5.52  % Starting new_bool_3 with 300s (1) cores
% 0.21/5.52  % Starting new_bool_1 with 300s (1) cores
% 0.21/5.52  % Starting sh5l with 300s (1) cores
% 0.21/5.52  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1475107 completed with status 0
% 0.21/5.52  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/5.52  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/5.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.52  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/5.52  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/5.52  % No SInE strategy applied
% 0.21/5.52  % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.21/5.52  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/5.52  % Starting SubtermCWHack with 136s (1) cores
% 0.21/5.52  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/5.52  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.21/5.52  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.21/5.52  % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/5.52  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 1475115 completed with status 0
% 0.21/5.52  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.21/5.52  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/5.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.52  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/5.52  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/5.52  % No SInE strategy applied
% 0.21/5.52  % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.21/5.52  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/5.52  % Starting SubtermCWHack with 136s (1) cores
% 0.21/5.52  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/5.52  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.21/5.52  % Preprocessing time       : 0.001 s
% 0.21/5.52  % Presaturation interreduction done
% 0.21/5.52  
% 0.21/5.52  % Proof found!
% 0.21/5.52  % SZS status Theorem
% 0.21/5.52  % SZS output start CNFRefutation
% See solution above
% 0.21/5.52  % Parsed axioms                        : 49
% 0.21/5.52  % Removed by relevancy pruning/SinE    : 0
% 0.21/5.52  % Initial clauses                      : 95
% 0.21/5.52  % Removed in clause preprocessing      : 0
% 0.21/5.52  % Initial clauses in saturation        : 95
% 0.21/5.52  % Processed clauses                    : 372
% 0.21/5.52  % ...of these trivial                  : 3
% 0.21/5.52  % ...subsumed                          : 22
% 0.21/5.52  % ...remaining for further processing  : 347
% 0.21/5.52  % Other redundant clauses eliminated   : 0
% 0.21/5.52  % Clauses deleted for lack of memory   : 0
% 0.21/5.52  % Backward-subsumed                    : 4
% 0.21/5.52  % Backward-rewritten                   : 30
% 0.21/5.52  % Generated clauses                    : 484
% 0.21/5.52  % ...of the previous two non-redundant : 403
% 0.21/5.52  % ...aggressively subsumed             : 0
% 0.21/5.52  % Contextual simplify-reflections      : 2
% 0.21/5.52  % Paramodulations                      : 484
% 0.21/5.52  % Factorizations                       : 0
% 0.21/5.52  % NegExts                              : 0
% 0.21/5.52  % Equation resolutions                 : 0
% 0.21/5.52  % Disequality decompositions           : 0
% 0.21/5.52  % Total rewrite steps                  : 175
% 0.21/5.52  % ...of those cached                   : 124
% 0.21/5.52  % Propositional unsat checks           : 0
% 0.21/5.52  %    Propositional check models        : 0
% 0.21/5.52  %    Propositional check unsatisfiable : 0
% 0.21/5.52  %    Propositional clauses             : 0
% 0.21/5.52  %    Propositional clauses after purity: 0
% 0.21/5.52  %    Propositional unsat core size     : 0
% 0.21/5.52  %    Propositional preprocessing time  : 0.000
% 0.21/5.52  %    Propositional encoding time       : 0.000
% 0.21/5.52  %    Propositional solver time         : 0.000
% 0.21/5.52  %    Success case prop preproc time    : 0.000
% 0.21/5.52  %    Success case prop encoding time   : 0.000
% 0.21/5.52  %    Success case prop solver time     : 0.000
% 0.21/5.52  % Current number of processed clauses  : 218
% 0.21/5.52  %    Positive orientable unit clauses  : 85
% 0.21/5.52  %    Positive unorientable unit clauses: 0
% 0.21/5.52  %    Negative unit clauses             : 22
% 0.21/5.52  %    Non-unit-clauses                  : 111
% 0.21/5.52  % Current number of unprocessed clauses: 196
% 0.21/5.52  % ...number of literals in the above   : 422
% 0.21/5.52  % Current number of archived formulas  : 0
% 0.21/5.52  % Current number of archived clauses   : 129
% 0.21/5.52  % Clause-clause subsumption calls (NU) : 4955
% 0.21/5.52  % Rec. Clause-clause subsumption calls : 3321
% 0.21/5.52  % Non-unit clause-clause subsumptions  : 9
% 0.21/5.52  % Unit Clause-clause subsumption calls : 432
% 0.21/5.52  % Rewrite failures with RHS unbound    : 0
% 0.21/5.52  % BW rewrite match attempts            : 13
% 0.21/5.52  % BW rewrite match successes           : 13
% 0.21/5.52  % Condensation attempts                : 0
% 0.21/5.52  % Condensation successes               : 0
% 0.21/5.52  % Termbank termtop insertions          : 13520
% 0.21/5.52  % Search garbage collected termcells   : 1396
% 0.21/5.52  
% 0.21/5.52  % -------------------------------------------------
% 0.21/5.52  % User time                : 0.018 s
% 0.21/5.52  % System time              : 0.005 s
% 0.21/5.52  % Total time               : 0.023 s
% 0.21/5.52  % Maximum resident set size: 3948 pages
% 0.21/5.52  
% 0.21/5.52  % -------------------------------------------------
% 0.21/5.52  % User time                : 0.070 s
% 0.21/5.52  % System time              : 0.019 s
% 0.21/5.52  % Total time               : 0.088 s
% 0.21/5.52  % Maximum resident set size: 4864 pages
% 0.21/5.52  % E exiting
%------------------------------------------------------------------------------