↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : PRO014+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n028.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 : Tue May  5 05:01:55 PM UTC 2026

% Result   : Theorem 3.36s 3.02s
% Output   : CNFRefutation 3.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   96 (  29 unt;   0 def)
%            Number of atoms       :  366 (   6 equ)
%            Maximal formula atoms :   36 (   3 avg)
%            Number of connectives :  433 ( 163   ~; 188   |;  68   &)
%                                         (   3 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   7 con; 0-3 aty)
%            Number of variables   :  164 (   3 sgn  78   !;  14   ?)

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

fof(goals,conjecture,
    ! [X111,X112] :
      ( ( occurrence_of(X112,tptp0)
        & subactivity_occurrence(X111,X112)
        & arboreal(X111)
        & ~ leaf_occ(X111,X112) )
     => ? [X113,X114] :
          ( occurrence_of(X113,tptp3)
          & next_subocc(X111,X113,tptp0)
          & ( occurrence_of(X114,tptp2)
            | occurrence_of(X114,tptp1) )
          & min_precedes(X113,X114,tptp0)
          & leaf(X114,tptp0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

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/sandbox/benchmark/theBenchmark.p',sos_22) ).

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

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

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/sandbox/benchmark/theBenchmark.p',sos_29) ).

fof(sos_25,axiom,
    ! [X70,X71,X72] :
      ( min_precedes(X71,X72,X70)
     => ? [X73] :
          ( occurrence_of(X73,X70)
          & subactivity_occurrence(X71,X73)
          & subactivity_occurrence(X72,X73) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_25) ).

fof(sos_08,axiom,
    ! [X19] :
      ( legal(X19)
     => arboreal(X19) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).

fof(sos_28,axiom,
    ! [X80,X81,X82,X83] :
      ( ( occurrence_of(X81,X80)
        & arboreal(X82)
        & arboreal(X83)
        & subactivity_occurrence(X82,X81)
        & subactivity_occurrence(X83,X81) )
     => ( min_precedes(X82,X83,X80)
        | min_precedes(X83,X82,X80)
        | X82 = X83 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_28) ).

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/sandbox/benchmark/theBenchmark.p',sos_21) ).

fof(sos_05,axiom,
    ! [X11,X12,X13] :
      ( ( earlier(X11,X12)
        & earlier(X12,X13) )
     => earlier(X11,X13) ),
    file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',sos_18) ).

fof(c_0_12,plain,
    ! [X106,X107] :
      ( ( occurrence_of(X107,tptp0)
        & subactivity_occurrence(X106,X107)
        & arboreal(X106)
        & ~ leaf_occ(X106,X107) )
     => ? [X108,X109,X110] :
          ( occurrence_of(X108,tptp3)
          & next_subocc(X106,X108,tptp0)
          & occurrence_of(X109,tptp4)
          & next_subocc(X108,X109,tptp0)
          & ( occurrence_of(X110,tptp2)
            | occurrence_of(X110,tptp1) )
          & next_subocc(X109,X110,tptp0)
          & leaf(X110,tptp0) ) ),
    inference(fof_simplification,[status(thm)],[sos_35]) ).

fof(c_0_13,negated_conjecture,
    ~ ! [X111,X112] :
        ( ( occurrence_of(X112,tptp0)
          & subactivity_occurrence(X111,X112)
          & arboreal(X111)
          & ~ leaf_occ(X111,X112) )
       => ? [X113,X114] :
            ( occurrence_of(X113,tptp3)
            & next_subocc(X111,X113,tptp0)
            & ( occurrence_of(X114,tptp2)
              | occurrence_of(X114,tptp1) )
            & min_precedes(X113,X114,tptp0)
            & leaf(X114,tptp0) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).

fof(c_0_14,plain,
    ! [X351,X352] :
      ( ( occurrence_of(esk16_1(X351),tptp3)
        | ~ occurrence_of(X352,tptp0)
        | ~ subactivity_occurrence(X351,X352)
        | ~ arboreal(X351)
        | leaf_occ(X351,X352) )
      & ( next_subocc(X351,esk16_1(X351),tptp0)
        | ~ occurrence_of(X352,tptp0)
        | ~ subactivity_occurrence(X351,X352)
        | ~ arboreal(X351)
        | leaf_occ(X351,X352) )
      & ( occurrence_of(esk17_1(X351),tptp4)
        | ~ occurrence_of(X352,tptp0)
        | ~ subactivity_occurrence(X351,X352)
        | ~ arboreal(X351)
        | leaf_occ(X351,X352) )
      & ( next_subocc(esk16_1(X351),esk17_1(X351),tptp0)
        | ~ occurrence_of(X352,tptp0)
        | ~ subactivity_occurrence(X351,X352)
        | ~ arboreal(X351)
        | leaf_occ(X351,X352) )
      & ( occurrence_of(esk18_1(X351),tptp2)
        | occurrence_of(esk18_1(X351),tptp1)
        | ~ occurrence_of(X352,tptp0)
        | ~ subactivity_occurrence(X351,X352)
        | ~ arboreal(X351)
        | leaf_occ(X351,X352) )
      & ( next_subocc(esk17_1(X351),esk18_1(X351),tptp0)
        | ~ occurrence_of(X352,tptp0)
        | ~ subactivity_occurrence(X351,X352)
        | ~ arboreal(X351)
        | leaf_occ(X351,X352) )
      & ( leaf(esk18_1(X351),tptp0)
        | ~ occurrence_of(X352,tptp0)
        | ~ subactivity_occurrence(X351,X352)
        | ~ arboreal(X351)
        | leaf_occ(X351,X352) ) ),
    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_12])])])])])]) ).

fof(c_0_15,negated_conjecture,
    ! [X358,X359] :
      ( occurrence_of(esk20_0,tptp0)
      & subactivity_occurrence(esk19_0,esk20_0)
      & arboreal(esk19_0)
      & ~ leaf_occ(esk19_0,esk20_0)
      & ( ~ occurrence_of(X359,tptp2)
        | ~ occurrence_of(X358,tptp3)
        | ~ next_subocc(esk19_0,X358,tptp0)
        | ~ min_precedes(X358,X359,tptp0)
        | ~ leaf(X359,tptp0) )
      & ( ~ occurrence_of(X359,tptp1)
        | ~ occurrence_of(X358,tptp3)
        | ~ next_subocc(esk19_0,X358,tptp0)
        | ~ min_precedes(X358,X359,tptp0)
        | ~ leaf(X359,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_13])])])])]) ).

cnf(c_0_16,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_14]) ).

cnf(c_0_17,negated_conjecture,
    occurrence_of(esk20_0,tptp0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_18,plain,
    ! [X293,X294,X295,X296,X297,X298,X299] :
      ( ( min_precedes(X293,X294,X295)
        | ~ next_subocc(X293,X294,X295) )
      & ( ~ min_precedes(X293,X296,X295)
        | ~ min_precedes(X296,X294,X295)
        | ~ next_subocc(X293,X294,X295) )
      & ( min_precedes(X297,esk8_3(X297,X298,X299),X299)
        | ~ min_precedes(X297,X298,X299)
        | next_subocc(X297,X298,X299) )
      & ( min_precedes(esk8_3(X297,X298,X299),X298,X299)
        | ~ min_precedes(X297,X298,X299)
        | next_subocc(X297,X298,X299) ) ),
    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_19,negated_conjecture,
    ( leaf_occ(X1,esk20_0)
    | next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk20_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    subactivity_occurrence(esk19_0,esk20_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    arboreal(esk19_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    ~ leaf_occ(esk19_0,esk20_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_23,plain,
    ( next_subocc(X1,esk16_1(X1),tptp0)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_24,plain,
    ( next_subocc(esk16_1(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_14]) ).

fof(c_0_25,plain,
    ! [X267,X268,X269] :
      ( ~ min_precedes(X267,X268,X269)
      | precedes(X267,X268) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_15])]) ).

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

cnf(c_0_27,negated_conjecture,
    next_subocc(esk17_1(esk19_0),esk18_1(esk19_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    ( leaf_occ(X1,esk20_0)
    | next_subocc(X1,esk16_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk20_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_17]) ).

cnf(c_0_29,negated_conjecture,
    ( leaf_occ(X1,esk20_0)
    | next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk20_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_17]) ).

fof(c_0_30,plain,
    ! [X250,X251] :
      ( ( earlier(X250,X251)
        | ~ precedes(X250,X251) )
      & ( legal(X251)
        | ~ precedes(X250,X251) )
      & ( ~ earlier(X250,X251)
        | ~ legal(X251)
        | precedes(X250,X251) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])]) ).

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

cnf(c_0_32,negated_conjecture,
    min_precedes(esk17_1(esk19_0),esk18_1(esk19_0),tptp0),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

fof(c_0_33,plain,
    ! [X323,X324,X325,X326] :
      ( ~ min_precedes(X323,X324,X325)
      | ~ occurrence_of(X326,X325)
      | ~ subactivity_occurrence(X324,X326)
      | subactivity_occurrence(X323,X326) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])]) ).

cnf(c_0_34,negated_conjecture,
    next_subocc(esk19_0,esk16_1(esk19_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_21])]),c_0_22]) ).

fof(c_0_35,plain,
    ! [X309,X310,X311] :
      ( ( occurrence_of(esk10_3(X309,X310,X311),X309)
        | ~ min_precedes(X310,X311,X309) )
      & ( subactivity_occurrence(X310,esk10_3(X309,X310,X311))
        | ~ min_precedes(X310,X311,X309) )
      & ( subactivity_occurrence(X311,esk10_3(X309,X310,X311))
        | ~ min_precedes(X310,X311,X309) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_25])])])]) ).

cnf(c_0_36,negated_conjecture,
    next_subocc(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_20]),c_0_21])]),c_0_22]) ).

fof(c_0_37,plain,
    ! [X247] :
      ( ~ legal(X247)
      | arboreal(X247) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])]) ).

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

cnf(c_0_39,negated_conjecture,
    precedes(esk17_1(esk19_0),esk18_1(esk19_0)),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_40,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_41,negated_conjecture,
    min_precedes(esk19_0,esk16_1(esk19_0),tptp0),
    inference(spm,[status(thm)],[c_0_26,c_0_34]) ).

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

cnf(c_0_43,negated_conjecture,
    min_precedes(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
    inference(spm,[status(thm)],[c_0_26,c_0_36]) ).

cnf(c_0_44,plain,
    ( subactivity_occurrence(X1,esk10_3(X2,X1,X3))
    | ~ min_precedes(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

fof(c_0_45,plain,
    ! [X319,X320,X321,X322] :
      ( ~ occurrence_of(X320,X319)
      | ~ arboreal(X321)
      | ~ arboreal(X322)
      | ~ subactivity_occurrence(X321,X320)
      | ~ subactivity_occurrence(X322,X320)
      | min_precedes(X321,X322,X319)
      | min_precedes(X322,X321,X319)
      | X321 = X322 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_28])]) ).

cnf(c_0_46,plain,
    ( subactivity_occurrence(X1,esk10_3(X2,X3,X1))
    | ~ min_precedes(X3,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_47,plain,
    ( arboreal(X1)
    | ~ legal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_48,negated_conjecture,
    legal(esk18_1(esk19_0)),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_49,negated_conjecture,
    ( subactivity_occurrence(esk19_0,X1)
    | ~ subactivity_occurrence(esk16_1(esk19_0),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_50,negated_conjecture,
    occurrence_of(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)),tptp0),
    inference(spm,[status(thm)],[c_0_42,c_0_32]) ).

cnf(c_0_51,negated_conjecture,
    ( subactivity_occurrence(esk16_1(esk19_0),X1)
    | ~ subactivity_occurrence(esk17_1(esk19_0),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_40,c_0_43]) ).

cnf(c_0_52,negated_conjecture,
    subactivity_occurrence(esk17_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
    inference(spm,[status(thm)],[c_0_44,c_0_32]) ).

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

cnf(c_0_54,negated_conjecture,
    subactivity_occurrence(esk18_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
    inference(spm,[status(thm)],[c_0_46,c_0_32]) ).

cnf(c_0_55,negated_conjecture,
    arboreal(esk18_1(esk19_0)),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_56,negated_conjecture,
    ( subactivity_occurrence(esk19_0,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))
    | ~ subactivity_occurrence(esk16_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_57,negated_conjecture,
    subactivity_occurrence(esk16_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_50]),c_0_52])]) ).

cnf(c_0_58,plain,
    ( leaf(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_14]) ).

cnf(c_0_59,negated_conjecture,
    ( X1 = esk18_1(esk19_0)
    | min_precedes(X1,esk18_1(esk19_0),X2)
    | min_precedes(esk18_1(esk19_0),X1,X2)
    | ~ subactivity_occurrence(X1,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))
    | ~ arboreal(X1)
    | ~ occurrence_of(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)),X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]) ).

cnf(c_0_60,negated_conjecture,
    subactivity_occurrence(esk19_0,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]) ).

fof(c_0_61,plain,
    ! [X285,X286,X288,X289,X290,X291] :
      ( ( root(X285,X286)
        | min_precedes(esk6_2(X285,X286),X285,X286)
        | ~ leaf(X285,X286) )
      & ( ~ min_precedes(X285,X288,X286)
        | ~ leaf(X285,X286) )
      & ( ~ root(X289,X290)
        | min_precedes(X289,esk7_2(X289,X290),X290)
        | leaf(X289,X290) )
      & ( ~ min_precedes(X291,X289,X290)
        | min_precedes(X289,esk7_2(X289,X290),X290)
        | leaf(X289,X290) ) ),
    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])])])])])]) ).

cnf(c_0_62,negated_conjecture,
    ( leaf_occ(X1,esk20_0)
    | leaf(esk18_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk20_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_58,c_0_17]) ).

cnf(c_0_63,negated_conjecture,
    ( esk18_1(esk19_0) = esk19_0
    | min_precedes(esk18_1(esk19_0),esk19_0,X1)
    | min_precedes(esk19_0,esk18_1(esk19_0),X1)
    | ~ occurrence_of(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_21])]) ).

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

fof(c_0_65,plain,
    ! [X239,X240,X241] :
      ( ~ earlier(X239,X240)
      | ~ earlier(X240,X241)
      | earlier(X239,X241) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])]) ).

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

cnf(c_0_67,plain,
    ( occurrence_of(esk18_1(X1),tptp2)
    | occurrence_of(esk18_1(X1),tptp1)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_68,negated_conjecture,
    leaf(esk18_1(esk19_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_20]),c_0_21])]),c_0_22]) ).

cnf(c_0_69,negated_conjecture,
    ( esk18_1(esk19_0) = esk19_0
    | min_precedes(esk19_0,esk18_1(esk19_0),tptp0)
    | min_precedes(esk18_1(esk19_0),esk19_0,tptp0) ),
    inference(spm,[status(thm)],[c_0_63,c_0_50]) ).

cnf(c_0_70,negated_conjecture,
    ~ leaf(esk19_0,tptp0),
    inference(spm,[status(thm)],[c_0_64,c_0_41]) ).

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

cnf(c_0_72,negated_conjecture,
    earlier(esk17_1(esk19_0),esk18_1(esk19_0)),
    inference(spm,[status(thm)],[c_0_66,c_0_39]) ).

cnf(c_0_73,negated_conjecture,
    precedes(esk16_1(esk19_0),esk17_1(esk19_0)),
    inference(spm,[status(thm)],[c_0_31,c_0_43]) ).

cnf(c_0_74,negated_conjecture,
    ( ~ occurrence_of(X1,tptp1)
    | ~ occurrence_of(X2,tptp3)
    | ~ next_subocc(esk19_0,X2,tptp0)
    | ~ min_precedes(X2,X1,tptp0)
    | ~ leaf(X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_75,negated_conjecture,
    ( leaf_occ(X1,esk20_0)
    | occurrence_of(esk18_1(X1),tptp1)
    | occurrence_of(esk18_1(X1),tptp2)
    | ~ subactivity_occurrence(X1,esk20_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_67,c_0_17]) ).

cnf(c_0_76,negated_conjecture,
    ( ~ occurrence_of(X1,tptp2)
    | ~ occurrence_of(X2,tptp3)
    | ~ next_subocc(esk19_0,X2,tptp0)
    | ~ min_precedes(X2,X1,tptp0)
    | ~ leaf(X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_77,plain,
    ( occurrence_of(esk16_1(X1),tptp3)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_78,plain,
    ! [X274,X275,X276,X277] :
      ( ~ min_precedes(X274,X275,X277)
      | ~ min_precedes(X274,X276,X277)
      | ~ precedes(X275,X276)
      | min_precedes(X275,X276,X277) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_18])]) ).

cnf(c_0_79,negated_conjecture,
    ( min_precedes(esk18_1(esk19_0),esk19_0,tptp0)
    | min_precedes(esk19_0,esk18_1(esk19_0),tptp0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).

cnf(c_0_80,negated_conjecture,
    ( earlier(X1,esk18_1(esk19_0))
    | ~ earlier(X1,esk17_1(esk19_0)) ),
    inference(spm,[status(thm)],[c_0_71,c_0_72]) ).

cnf(c_0_81,negated_conjecture,
    earlier(esk16_1(esk19_0),esk17_1(esk19_0)),
    inference(spm,[status(thm)],[c_0_66,c_0_73]) ).

cnf(c_0_82,negated_conjecture,
    ( ~ next_subocc(esk19_0,X1,tptp0)
    | ~ min_precedes(X1,esk18_1(esk19_0),tptp0)
    | ~ occurrence_of(esk18_1(esk19_0),tptp1)
    | ~ occurrence_of(X1,tptp3) ),
    inference(spm,[status(thm)],[c_0_74,c_0_68]) ).

cnf(c_0_83,negated_conjecture,
    ( occurrence_of(esk18_1(esk19_0),tptp2)
    | occurrence_of(esk18_1(esk19_0),tptp1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_20]),c_0_21])]),c_0_22]) ).

cnf(c_0_84,negated_conjecture,
    ( ~ next_subocc(esk19_0,X1,tptp0)
    | ~ min_precedes(X1,esk18_1(esk19_0),tptp0)
    | ~ occurrence_of(esk18_1(esk19_0),tptp2)
    | ~ occurrence_of(X1,tptp3) ),
    inference(spm,[status(thm)],[c_0_76,c_0_68]) ).

cnf(c_0_85,negated_conjecture,
    ( leaf_occ(X1,esk20_0)
    | occurrence_of(esk16_1(X1),tptp3)
    | ~ subactivity_occurrence(X1,esk20_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_77,c_0_17]) ).

cnf(c_0_86,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_78]) ).

cnf(c_0_87,negated_conjecture,
    min_precedes(esk19_0,esk18_1(esk19_0),tptp0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_79]),c_0_68])]) ).

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

cnf(c_0_89,negated_conjecture,
    earlier(esk16_1(esk19_0),esk18_1(esk19_0)),
    inference(spm,[status(thm)],[c_0_80,c_0_81]) ).

cnf(c_0_90,negated_conjecture,
    ( ~ next_subocc(esk19_0,X1,tptp0)
    | ~ min_precedes(X1,esk18_1(esk19_0),tptp0)
    | ~ occurrence_of(X1,tptp3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]) ).

cnf(c_0_91,negated_conjecture,
    occurrence_of(esk16_1(esk19_0),tptp3),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_20]),c_0_21])]),c_0_22]) ).

cnf(c_0_92,negated_conjecture,
    ( min_precedes(X1,esk18_1(esk19_0),tptp0)
    | ~ min_precedes(esk19_0,X1,tptp0)
    | ~ precedes(X1,esk18_1(esk19_0)) ),
    inference(spm,[status(thm)],[c_0_86,c_0_87]) ).

cnf(c_0_93,negated_conjecture,
    precedes(esk16_1(esk19_0),esk18_1(esk19_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_48])]) ).

cnf(c_0_94,negated_conjecture,
    ~ min_precedes(esk16_1(esk19_0),esk18_1(esk19_0),tptp0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_34])]) ).

cnf(c_0_95,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_41])]),c_0_94]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : PRO014+1 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.17/0.34  % Computer : n028.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit   : 300
% 0.17/0.34  % WCLimit    : 300
% 0.17/0.34  % DateTime   : Tue May  5 01:31:01 EDT 2026
% 0.17/0.34  % CPUTime    : 
% 0.17/0.35  % start to proof: theBenchmark
% 3.36/3.02  % Version  : CSE_E---1.7
% 3.36/3.02  % Problem  : theBenchmark.p
% 3.36/3.02  % SZS status Theorem for theBenchmark.p
% 3.36/3.02  % SZS output start CNFRefutation
% See solution above
% 3.48/3.03  % Total time : 2.372s
%------------------------------------------------------------------------------