TSTP Solution File: PRO014+3 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : PRO014+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n017.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 : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 13:06:09 EDT 2023

% Result   : Theorem 1.03s 1.14s
% Output   : CNFRefutation 1.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   56
% Syntax   : Number of formulae    :  144 (  32 unt;  43 typ;   0 def)
%            Number of atoms       :  383 (   7 equ)
%            Maximal formula atoms :   36 (   3 avg)
%            Number of connectives :  456 ( 174   ~; 188   |;  78   &)
%                                         (   4 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   72 (  36   >;  36   *;   0   +;   0  <<)
%            Number of predicates  :   19 (  17 usr;   1 prp; 0-3 aty)
%            Number of functors    :   26 (  26 usr;   7 con; 0-4 aty)
%            Number of variables   :  172 (   3 sgn;  87   !;  16   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    occurrence_of: ( $i * $i ) > $o ).

tff(decl_23,type,
    activity: $i > $o ).

tff(decl_24,type,
    activity_occurrence: $i > $o ).

tff(decl_25,type,
    subactivity: ( $i * $i ) > $o ).

tff(decl_26,type,
    earlier: ( $i * $i ) > $o ).

tff(decl_27,type,
    arboreal: $i > $o ).

tff(decl_28,type,
    atomic: $i > $o ).

tff(decl_29,type,
    legal: $i > $o ).

tff(decl_30,type,
    precedes: ( $i * $i ) > $o ).

tff(decl_31,type,
    min_precedes: ( $i * $i * $i ) > $o ).

tff(decl_32,type,
    atocc: ( $i * $i ) > $o ).

tff(decl_33,type,
    root: ( $i * $i ) > $o ).

tff(decl_34,type,
    leaf: ( $i * $i ) > $o ).

tff(decl_35,type,
    next_subocc: ( $i * $i * $i ) > $o ).

tff(decl_36,type,
    subactivity_occurrence: ( $i * $i ) > $o ).

tff(decl_37,type,
    root_occ: ( $i * $i ) > $o ).

tff(decl_38,type,
    leaf_occ: ( $i * $i ) > $o ).

tff(decl_39,type,
    tptp0: $i ).

tff(decl_40,type,
    tptp3: $i ).

tff(decl_41,type,
    tptp4: $i ).

tff(decl_42,type,
    tptp2: $i ).

tff(decl_43,type,
    tptp1: $i ).

tff(decl_44,type,
    esk1_1: $i > $i ).

tff(decl_45,type,
    esk2_3: ( $i * $i * $i ) > $i ).

tff(decl_46,type,
    esk3_3: ( $i * $i * $i ) > $i ).

tff(decl_47,type,
    esk4_2: ( $i * $i ) > $i ).

tff(decl_48,type,
    esk5_3: ( $i * $i * $i ) > $i ).

tff(decl_49,type,
    esk6_2: ( $i * $i ) > $i ).

tff(decl_50,type,
    esk7_2: ( $i * $i ) > $i ).

tff(decl_51,type,
    esk8_3: ( $i * $i * $i ) > $i ).

tff(decl_52,type,
    esk9_2: ( $i * $i ) > $i ).

tff(decl_53,type,
    esk10_3: ( $i * $i * $i ) > $i ).

tff(decl_54,type,
    esk11_2: ( $i * $i ) > $i ).

tff(decl_55,type,
    esk12_2: ( $i * $i ) > $i ).

tff(decl_56,type,
    esk13_4: ( $i * $i * $i * $i ) > $i ).

tff(decl_57,type,
    esk14_2: ( $i * $i ) > $i ).

tff(decl_58,type,
    esk15_2: ( $i * $i ) > $i ).

tff(decl_59,type,
    esk16_2: ( $i * $i ) > $i ).

tff(decl_60,type,
    esk17_1: $i > $i ).

tff(decl_61,type,
    esk18_1: $i > $i ).

tff(decl_62,type,
    esk19_1: $i > $i ).

tff(decl_63,type,
    esk20_0: $i ).

tff(decl_64,type,
    esk21_0: $i ).

fof(sos_49,axiom,
    ! [X162,X163] :
      ( ( occurrence_of(X163,tptp0)
        & subactivity_occurrence(X162,X163)
        & arboreal(X162)
        & ~ leaf_occ(X162,X163) )
     => ? [X164,X165,X166] :
          ( occurrence_of(X164,tptp3)
          & next_subocc(X162,X164,tptp0)
          & occurrence_of(X165,tptp4)
          & next_subocc(X164,X165,tptp0)
          & ( occurrence_of(X166,tptp2)
            | occurrence_of(X166,tptp1) )
          & next_subocc(X165,X166,tptp0)
          & leaf(X166,tptp0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_49) ).

fof(goals,conjecture,
    ! [X167,X168] :
      ( ( occurrence_of(X168,tptp0)
        & subactivity_occurrence(X167,X168)
        & arboreal(X167)
        & ~ leaf_occ(X167,X168) )
     => ? [X169,X170] :
          ( occurrence_of(X169,tptp3)
          & next_subocc(X167,X169,tptp0)
          & ( occurrence_of(X170,tptp2)
            | occurrence_of(X170,tptp1) )
          & min_precedes(X169,X170,tptp0)
          & leaf(X170,tptp0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(sos_45,axiom,
    ! [X146,X147] :
      ( ( leaf(X146,X147)
        & ~ atomic(X147) )
     => ? [X148] :
          ( occurrence_of(X148,X147)
          & leaf_occ(X146,X148) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_45) ).

fof(sos_22,axiom,
    ! [X61,X62,X63] :
      ( next_subocc(X61,X62,X63)
    <=> ( min_precedes(X61,X62,X63)
        & ~ ? [X64] :
              ( min_precedes(X61,X64,X63)
              & min_precedes(X64,X62,X63) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).

fof(sos_51,axiom,
    ~ atomic(tptp0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_51) ).

fof(sos_29,axiom,
    ! [X84,X85,X86,X87] :
      ( ( min_precedes(X84,X85,X86)
        & occurrence_of(X87,X86)
        & subactivity_occurrence(X85,X87) )
     => subactivity_occurrence(X84,X87) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_29) ).

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

fof(sos_43,axiom,
    ! [X139,X140,X141,X142] :
      ( ( occurrence_of(X140,X139)
        & subactivity_occurrence(X141,X140)
        & leaf_occ(X142,X140)
        & arboreal(X141)
        & ~ min_precedes(X141,X142,X139) )
     => X142 = X141 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_43) ).

fof(sos_15,axiom,
    ! [X39,X40,X41] :
      ( min_precedes(X39,X40,X41)
     => precedes(X39,X40) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_15) ).

fof(sos_10,axiom,
    ! [X22,X23] :
      ( precedes(X22,X23)
    <=> ( earlier(X22,X23)
        & legal(X23) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10) ).

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

fof(sos_05,axiom,
    ! [X11,X12,X13] :
      ( ( earlier(X11,X12)
        & earlier(X12,X13) )
     => earlier(X11,X13) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).

fof(sos_18,axiom,
    ! [X46,X47,X48,X49] :
      ( ( min_precedes(X46,X47,X49)
        & min_precedes(X46,X48,X49)
        & precedes(X47,X48) )
     => min_precedes(X47,X48,X49) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_18) ).

fof(c_0_13,plain,
    ! [X162,X163] :
      ( ( occurrence_of(X163,tptp0)
        & subactivity_occurrence(X162,X163)
        & arboreal(X162)
        & ~ leaf_occ(X162,X163) )
     => ? [X164,X165,X166] :
          ( occurrence_of(X164,tptp3)
          & next_subocc(X162,X164,tptp0)
          & occurrence_of(X165,tptp4)
          & next_subocc(X164,X165,tptp0)
          & ( occurrence_of(X166,tptp2)
            | occurrence_of(X166,tptp1) )
          & next_subocc(X165,X166,tptp0)
          & leaf(X166,tptp0) ) ),
    inference(fof_simplification,[status(thm)],[sos_49]) ).

fof(c_0_14,negated_conjecture,
    ~ ! [X167,X168] :
        ( ( occurrence_of(X168,tptp0)
          & subactivity_occurrence(X167,X168)
          & arboreal(X167)
          & ~ leaf_occ(X167,X168) )
       => ? [X169,X170] :
            ( occurrence_of(X169,tptp3)
            & next_subocc(X167,X169,tptp0)
            & ( occurrence_of(X170,tptp2)
              | occurrence_of(X170,tptp1) )
            & min_precedes(X169,X170,tptp0)
            & leaf(X170,tptp0) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).

fof(c_0_15,plain,
    ! [X349,X350] :
      ( ( occurrence_of(esk17_1(X349),tptp3)
        | ~ occurrence_of(X350,tptp0)
        | ~ subactivity_occurrence(X349,X350)
        | ~ arboreal(X349)
        | leaf_occ(X349,X350) )
      & ( next_subocc(X349,esk17_1(X349),tptp0)
        | ~ occurrence_of(X350,tptp0)
        | ~ subactivity_occurrence(X349,X350)
        | ~ arboreal(X349)
        | leaf_occ(X349,X350) )
      & ( occurrence_of(esk18_1(X349),tptp4)
        | ~ occurrence_of(X350,tptp0)
        | ~ subactivity_occurrence(X349,X350)
        | ~ arboreal(X349)
        | leaf_occ(X349,X350) )
      & ( next_subocc(esk17_1(X349),esk18_1(X349),tptp0)
        | ~ occurrence_of(X350,tptp0)
        | ~ subactivity_occurrence(X349,X350)
        | ~ arboreal(X349)
        | leaf_occ(X349,X350) )
      & ( occurrence_of(esk19_1(X349),tptp2)
        | occurrence_of(esk19_1(X349),tptp1)
        | ~ occurrence_of(X350,tptp0)
        | ~ subactivity_occurrence(X349,X350)
        | ~ arboreal(X349)
        | leaf_occ(X349,X350) )
      & ( next_subocc(esk18_1(X349),esk19_1(X349),tptp0)
        | ~ occurrence_of(X350,tptp0)
        | ~ subactivity_occurrence(X349,X350)
        | ~ arboreal(X349)
        | leaf_occ(X349,X350) )
      & ( leaf(esk19_1(X349),tptp0)
        | ~ occurrence_of(X350,tptp0)
        | ~ subactivity_occurrence(X349,X350)
        | ~ arboreal(X349)
        | leaf_occ(X349,X350) ) ),
    inference(distribute,[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)],[c_0_13])])])])])]) ).

fof(c_0_16,negated_conjecture,
    ! [X356,X357] :
      ( occurrence_of(esk21_0,tptp0)
      & subactivity_occurrence(esk20_0,esk21_0)
      & arboreal(esk20_0)
      & ~ leaf_occ(esk20_0,esk21_0)
      & ( ~ occurrence_of(X357,tptp2)
        | ~ occurrence_of(X356,tptp3)
        | ~ next_subocc(esk20_0,X356,tptp0)
        | ~ min_precedes(X356,X357,tptp0)
        | ~ leaf(X357,tptp0) )
      & ( ~ occurrence_of(X357,tptp1)
        | ~ occurrence_of(X356,tptp3)
        | ~ next_subocc(esk20_0,X356,tptp0)
        | ~ min_precedes(X356,X357,tptp0)
        | ~ leaf(X357,tptp0) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).

cnf(c_0_17,plain,
    ( next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    occurrence_of(esk21_0,tptp0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_19,plain,
    ( next_subocc(esk18_1(X1),esk19_1(X1),tptp0)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_20,plain,
    ! [X146,X147] :
      ( ( leaf(X146,X147)
        & ~ atomic(X147) )
     => ? [X148] :
          ( occurrence_of(X148,X147)
          & leaf_occ(X146,X148) ) ),
    inference(fof_simplification,[status(thm)],[sos_45]) ).

cnf(c_0_21,plain,
    ( leaf(esk19_1(X1),tptp0)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,plain,
    ( next_subocc(X1,esk17_1(X1),tptp0)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_23,plain,
    ! [X235,X236,X237,X238,X239,X240,X241] :
      ( ( min_precedes(X235,X236,X237)
        | ~ next_subocc(X235,X236,X237) )
      & ( ~ min_precedes(X235,X238,X237)
        | ~ min_precedes(X238,X236,X237)
        | ~ next_subocc(X235,X236,X237) )
      & ( min_precedes(X239,esk8_3(X239,X240,X241),X241)
        | ~ min_precedes(X239,X240,X241)
        | next_subocc(X239,X240,X241) )
      & ( min_precedes(esk8_3(X239,X240,X241),X240,X241)
        | ~ min_precedes(X239,X240,X241)
        | next_subocc(X239,X240,X241) ) ),
    inference(distribute,[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_22])])])])])]) ).

cnf(c_0_24,negated_conjecture,
    ( leaf_occ(X1,esk21_0)
    | next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk21_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_25,negated_conjecture,
    subactivity_occurrence(esk20_0,esk21_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_26,negated_conjecture,
    arboreal(esk20_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_27,negated_conjecture,
    ~ leaf_occ(esk20_0,esk21_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_28,negated_conjecture,
    ( leaf_occ(X1,esk21_0)
    | next_subocc(esk18_1(X1),esk19_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk21_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_18]) ).

fof(c_0_29,plain,
    ! [X333,X334] :
      ( ( occurrence_of(esk16_2(X333,X334),X334)
        | ~ leaf(X333,X334)
        | atomic(X334) )
      & ( leaf_occ(X333,esk16_2(X333,X334))
        | ~ leaf(X333,X334)
        | atomic(X334) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).

cnf(c_0_30,negated_conjecture,
    ( leaf_occ(X1,esk21_0)
    | leaf(esk19_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk21_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_18]) ).

fof(c_0_31,plain,
    ~ atomic(tptp0),
    inference(fof_simplification,[status(thm)],[sos_51]) ).

cnf(c_0_32,negated_conjecture,
    ( leaf_occ(X1,esk21_0)
    | next_subocc(X1,esk17_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk21_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_18]) ).

fof(c_0_33,plain,
    ! [X265,X266,X267,X268] :
      ( ~ min_precedes(X265,X266,X267)
      | ~ occurrence_of(X268,X267)
      | ~ subactivity_occurrence(X266,X268)
      | subactivity_occurrence(X265,X268) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])]) ).

cnf(c_0_34,plain,
    ( min_precedes(X1,X2,X3)
    | ~ next_subocc(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_35,negated_conjecture,
    next_subocc(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),c_0_27]) ).

cnf(c_0_36,negated_conjecture,
    next_subocc(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_26])]),c_0_27]) ).

fof(c_0_37,plain,
    ! [X287,X288,X290,X291,X292] :
      ( ( occurrence_of(X288,esk15_2(X287,X288))
        | ~ leaf_occ(X287,X288) )
      & ( subactivity_occurrence(X287,X288)
        | ~ leaf_occ(X287,X288) )
      & ( leaf(X287,esk15_2(X287,X288))
        | ~ leaf_occ(X287,X288) )
      & ( ~ occurrence_of(X291,X292)
        | ~ subactivity_occurrence(X290,X291)
        | ~ leaf(X290,X292)
        | leaf_occ(X290,X291) ) ),
    inference(distribute,[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_38,plain,
    ( leaf_occ(X1,esk16_2(X1,X2))
    | atomic(X2)
    | ~ leaf(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_39,negated_conjecture,
    leaf(esk19_1(esk20_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_25]),c_0_26])]),c_0_27]) ).

cnf(c_0_40,plain,
    ~ atomic(tptp0),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_41,negated_conjecture,
    next_subocc(esk20_0,esk17_1(esk20_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_26])]),c_0_27]) ).

cnf(c_0_42,plain,
    ( subactivity_occurrence(X1,X4)
    | ~ min_precedes(X1,X2,X3)
    | ~ occurrence_of(X4,X3)
    | ~ subactivity_occurrence(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_43,negated_conjecture,
    min_precedes(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_44,plain,
    ( occurrence_of(esk16_2(X1,X2),X2)
    | atomic(X2)
    | ~ leaf(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_45,negated_conjecture,
    min_precedes(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
    inference(spm,[status(thm)],[c_0_34,c_0_36]) ).

cnf(c_0_46,plain,
    ( subactivity_occurrence(X1,X2)
    | ~ leaf_occ(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_47,negated_conjecture,
    leaf_occ(esk19_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).

fof(c_0_48,plain,
    ! [X139,X140,X141,X142] :
      ( ( occurrence_of(X140,X139)
        & subactivity_occurrence(X141,X140)
        & leaf_occ(X142,X140)
        & arboreal(X141)
        & ~ min_precedes(X141,X142,X139) )
     => X142 = X141 ),
    inference(fof_simplification,[status(thm)],[sos_43]) ).

cnf(c_0_49,negated_conjecture,
    min_precedes(esk20_0,esk17_1(esk20_0),tptp0),
    inference(spm,[status(thm)],[c_0_34,c_0_41]) ).

cnf(c_0_50,negated_conjecture,
    ( subactivity_occurrence(esk17_1(esk20_0),X1)
    | ~ subactivity_occurrence(esk18_1(esk20_0),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_51,negated_conjecture,
    occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),tptp0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39]),c_0_40]) ).

cnf(c_0_52,negated_conjecture,
    ( subactivity_occurrence(esk18_1(esk20_0),X1)
    | ~ subactivity_occurrence(esk19_1(esk20_0),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_42,c_0_45]) ).

cnf(c_0_53,negated_conjecture,
    subactivity_occurrence(esk19_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

fof(c_0_54,plain,
    ! [X326,X327,X328,X329] :
      ( ~ occurrence_of(X327,X326)
      | ~ subactivity_occurrence(X328,X327)
      | ~ leaf_occ(X329,X327)
      | ~ arboreal(X328)
      | min_precedes(X328,X329,X326)
      | X329 = X328 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])]) ).

cnf(c_0_55,negated_conjecture,
    ( subactivity_occurrence(esk20_0,X1)
    | ~ subactivity_occurrence(esk17_1(esk20_0),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_42,c_0_49]) ).

cnf(c_0_56,negated_conjecture,
    ( subactivity_occurrence(esk17_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0))
    | ~ subactivity_occurrence(esk18_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_57,negated_conjecture,
    subactivity_occurrence(esk18_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_51]),c_0_53])]) ).

fof(c_0_58,plain,
    ! [X209,X210,X211] :
      ( ~ min_precedes(X209,X210,X211)
      | precedes(X209,X210) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_15])]) ).

cnf(c_0_59,plain,
    ( min_precedes(X3,X4,X2)
    | X4 = X3
    | ~ occurrence_of(X1,X2)
    | ~ subactivity_occurrence(X3,X1)
    | ~ leaf_occ(X4,X1)
    | ~ arboreal(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_54]) ).

cnf(c_0_60,negated_conjecture,
    ( subactivity_occurrence(esk20_0,esk16_2(esk19_1(esk20_0),tptp0))
    | ~ subactivity_occurrence(esk17_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)) ),
    inference(spm,[status(thm)],[c_0_55,c_0_51]) ).

cnf(c_0_61,negated_conjecture,
    subactivity_occurrence(esk17_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]) ).

fof(c_0_62,plain,
    ! [X192,X193] :
      ( ( earlier(X192,X193)
        | ~ precedes(X192,X193) )
      & ( legal(X193)
        | ~ precedes(X192,X193) )
      & ( ~ earlier(X192,X193)
        | ~ legal(X193)
        | precedes(X192,X193) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])]) ).

cnf(c_0_63,plain,
    ( precedes(X1,X2)
    | ~ min_precedes(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_58]) ).

cnf(c_0_64,negated_conjecture,
    ( X1 = esk19_1(esk20_0)
    | min_precedes(X1,esk19_1(esk20_0),X2)
    | ~ subactivity_occurrence(X1,esk16_2(esk19_1(esk20_0),tptp0))
    | ~ arboreal(X1)
    | ~ occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),X2) ),
    inference(spm,[status(thm)],[c_0_59,c_0_47]) ).

cnf(c_0_65,negated_conjecture,
    subactivity_occurrence(esk20_0,esk16_2(esk19_1(esk20_0),tptp0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).

fof(c_0_66,plain,
    ! [X227,X228,X230,X231,X232,X233] :
      ( ( root(X227,X228)
        | min_precedes(esk6_2(X227,X228),X227,X228)
        | ~ leaf(X227,X228) )
      & ( ~ min_precedes(X227,X230,X228)
        | ~ leaf(X227,X228) )
      & ( ~ root(X231,X232)
        | min_precedes(X231,esk7_2(X231,X232),X232)
        | leaf(X231,X232) )
      & ( ~ min_precedes(X233,X231,X232)
        | min_precedes(X231,esk7_2(X231,X232),X232)
        | leaf(X231,X232) ) ),
    inference(distribute,[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])])])])])]) ).

fof(c_0_67,plain,
    ! [X181,X182,X183] :
      ( ~ earlier(X181,X182)
      | ~ earlier(X182,X183)
      | earlier(X181,X183) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])]) ).

cnf(c_0_68,plain,
    ( earlier(X1,X2)
    | ~ precedes(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_62]) ).

cnf(c_0_69,negated_conjecture,
    precedes(esk18_1(esk20_0),esk19_1(esk20_0)),
    inference(spm,[status(thm)],[c_0_63,c_0_45]) ).

cnf(c_0_70,plain,
    ( occurrence_of(esk19_1(X1),tptp2)
    | occurrence_of(esk19_1(X1),tptp1)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_71,negated_conjecture,
    ( esk19_1(esk20_0) = esk20_0
    | min_precedes(esk20_0,esk19_1(esk20_0),X1)
    | ~ occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_26])]) ).

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

cnf(c_0_73,plain,
    ( earlier(X1,X3)
    | ~ earlier(X1,X2)
    | ~ earlier(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_67]) ).

cnf(c_0_74,negated_conjecture,
    earlier(esk18_1(esk20_0),esk19_1(esk20_0)),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_75,negated_conjecture,
    precedes(esk17_1(esk20_0),esk18_1(esk20_0)),
    inference(spm,[status(thm)],[c_0_63,c_0_43]) ).

cnf(c_0_76,negated_conjecture,
    ( ~ occurrence_of(X1,tptp1)
    | ~ occurrence_of(X2,tptp3)
    | ~ next_subocc(esk20_0,X2,tptp0)
    | ~ min_precedes(X2,X1,tptp0)
    | ~ leaf(X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_77,negated_conjecture,
    ( leaf_occ(X1,esk21_0)
    | occurrence_of(esk19_1(X1),tptp1)
    | occurrence_of(esk19_1(X1),tptp2)
    | ~ subactivity_occurrence(X1,esk21_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_70,c_0_18]) ).

cnf(c_0_78,negated_conjecture,
    ( ~ occurrence_of(X1,tptp2)
    | ~ occurrence_of(X2,tptp3)
    | ~ next_subocc(esk20_0,X2,tptp0)
    | ~ min_precedes(X2,X1,tptp0)
    | ~ leaf(X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_79,plain,
    ( occurrence_of(esk17_1(X1),tptp3)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_80,plain,
    ! [X216,X217,X218,X219] :
      ( ~ min_precedes(X216,X217,X219)
      | ~ min_precedes(X216,X218,X219)
      | ~ precedes(X217,X218)
      | min_precedes(X217,X218,X219) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_18])]) ).

cnf(c_0_81,negated_conjecture,
    ( esk19_1(esk20_0) = esk20_0
    | min_precedes(esk20_0,esk19_1(esk20_0),tptp0) ),
    inference(spm,[status(thm)],[c_0_71,c_0_51]) ).

cnf(c_0_82,negated_conjecture,
    ~ leaf(esk20_0,tptp0),
    inference(spm,[status(thm)],[c_0_72,c_0_49]) ).

cnf(c_0_83,negated_conjecture,
    ( earlier(X1,esk19_1(esk20_0))
    | ~ earlier(X1,esk18_1(esk20_0)) ),
    inference(spm,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_84,negated_conjecture,
    earlier(esk17_1(esk20_0),esk18_1(esk20_0)),
    inference(spm,[status(thm)],[c_0_68,c_0_75]) ).

cnf(c_0_85,plain,
    ( legal(X1)
    | ~ precedes(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_62]) ).

cnf(c_0_86,negated_conjecture,
    ( ~ next_subocc(esk20_0,X1,tptp0)
    | ~ min_precedes(X1,esk19_1(esk20_0),tptp0)
    | ~ occurrence_of(esk19_1(esk20_0),tptp1)
    | ~ occurrence_of(X1,tptp3) ),
    inference(spm,[status(thm)],[c_0_76,c_0_39]) ).

cnf(c_0_87,negated_conjecture,
    ( occurrence_of(esk19_1(esk20_0),tptp2)
    | occurrence_of(esk19_1(esk20_0),tptp1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_25]),c_0_26])]),c_0_27]) ).

cnf(c_0_88,negated_conjecture,
    ( ~ next_subocc(esk20_0,X1,tptp0)
    | ~ min_precedes(X1,esk19_1(esk20_0),tptp0)
    | ~ occurrence_of(esk19_1(esk20_0),tptp2)
    | ~ occurrence_of(X1,tptp3) ),
    inference(spm,[status(thm)],[c_0_78,c_0_39]) ).

cnf(c_0_89,negated_conjecture,
    ( leaf_occ(X1,esk21_0)
    | occurrence_of(esk17_1(X1),tptp3)
    | ~ subactivity_occurrence(X1,esk21_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_79,c_0_18]) ).

cnf(c_0_90,plain,
    ( min_precedes(X2,X4,X3)
    | ~ min_precedes(X1,X2,X3)
    | ~ min_precedes(X1,X4,X3)
    | ~ precedes(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_80]) ).

cnf(c_0_91,negated_conjecture,
    min_precedes(esk20_0,esk19_1(esk20_0),tptp0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_81]),c_0_82]) ).

cnf(c_0_92,plain,
    ( precedes(X1,X2)
    | ~ earlier(X1,X2)
    | ~ legal(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_62]) ).

cnf(c_0_93,negated_conjecture,
    earlier(esk17_1(esk20_0),esk19_1(esk20_0)),
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_94,negated_conjecture,
    legal(esk19_1(esk20_0)),
    inference(spm,[status(thm)],[c_0_85,c_0_69]) ).

cnf(c_0_95,negated_conjecture,
    ( ~ next_subocc(esk20_0,X1,tptp0)
    | ~ min_precedes(X1,esk19_1(esk20_0),tptp0)
    | ~ occurrence_of(X1,tptp3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]) ).

cnf(c_0_96,negated_conjecture,
    occurrence_of(esk17_1(esk20_0),tptp3),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_25]),c_0_26])]),c_0_27]) ).

cnf(c_0_97,negated_conjecture,
    ( min_precedes(X1,esk19_1(esk20_0),tptp0)
    | ~ min_precedes(esk20_0,X1,tptp0)
    | ~ precedes(X1,esk19_1(esk20_0)) ),
    inference(spm,[status(thm)],[c_0_90,c_0_91]) ).

cnf(c_0_98,negated_conjecture,
    precedes(esk17_1(esk20_0),esk19_1(esk20_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94])]) ).

cnf(c_0_99,negated_conjecture,
    ~ min_precedes(esk17_1(esk20_0),esk19_1(esk20_0),tptp0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_41])]) ).

cnf(c_0_100,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_49])]),c_0_99]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : PRO014+3 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.33  % Computer : n017.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Mon Aug 28 18:47:58 EDT 2023
% 0.11/0.34  % CPUTime  : 
% 0.18/0.57  start to proof: theBenchmark
% 1.03/1.14  % Version  : CSE_E---1.5
% 1.03/1.14  % Problem  : theBenchmark.p
% 1.03/1.14  % Proof found
% 1.03/1.14  % SZS status Theorem for theBenchmark.p
% 1.03/1.14  % SZS output start Proof
% See solution above
% 1.03/1.15  % Total time : 0.558000 s
% 1.03/1.15  % SZS output end Proof
% 1.03/1.15  % Total time : 0.562000 s
%------------------------------------------------------------------------------