↑ Up

CSE_E---1.7.THM-CRf.s

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

% Computer : n018.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.31s 3.02s
% Output   : CNFRefutation 3.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   13
% Syntax   : Number of formulae    :  101 (  32 unt;   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 predicates  :   14 (  12 usr;   1 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   7 con; 0-3 aty)
%            Number of variables   :  172 (   3 sgn  87   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
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,
    ! [X519,X520] :
      ( ( occurrence_of(esk17_1(X519),tptp3)
        | ~ occurrence_of(X520,tptp0)
        | ~ subactivity_occurrence(X519,X520)
        | ~ arboreal(X519)
        | leaf_occ(X519,X520) )
      & ( next_subocc(X519,esk17_1(X519),tptp0)
        | ~ occurrence_of(X520,tptp0)
        | ~ subactivity_occurrence(X519,X520)
        | ~ arboreal(X519)
        | leaf_occ(X519,X520) )
      & ( occurrence_of(esk18_1(X519),tptp4)
        | ~ occurrence_of(X520,tptp0)
        | ~ subactivity_occurrence(X519,X520)
        | ~ arboreal(X519)
        | leaf_occ(X519,X520) )
      & ( next_subocc(esk17_1(X519),esk18_1(X519),tptp0)
        | ~ occurrence_of(X520,tptp0)
        | ~ subactivity_occurrence(X519,X520)
        | ~ arboreal(X519)
        | leaf_occ(X519,X520) )
      & ( occurrence_of(esk19_1(X519),tptp2)
        | occurrence_of(esk19_1(X519),tptp1)
        | ~ occurrence_of(X520,tptp0)
        | ~ subactivity_occurrence(X519,X520)
        | ~ arboreal(X519)
        | leaf_occ(X519,X520) )
      & ( next_subocc(esk18_1(X519),esk19_1(X519),tptp0)
        | ~ occurrence_of(X520,tptp0)
        | ~ subactivity_occurrence(X519,X520)
        | ~ arboreal(X519)
        | leaf_occ(X519,X520) )
      & ( leaf(esk19_1(X519),tptp0)
        | ~ occurrence_of(X520,tptp0)
        | ~ subactivity_occurrence(X519,X520)
        | ~ arboreal(X519)
        | leaf_occ(X519,X520) ) ),
    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,
    ! [X526,X527] :
      ( occurrence_of(esk21_0,tptp0)
      & subactivity_occurrence(esk20_0,esk21_0)
      & arboreal(esk20_0)
      & ~ leaf_occ(esk20_0,esk21_0)
      & ( ~ occurrence_of(X527,tptp2)
        | ~ occurrence_of(X526,tptp3)
        | ~ next_subocc(esk20_0,X526,tptp0)
        | ~ min_precedes(X526,X527,tptp0)
        | ~ leaf(X527,tptp0) )
      & ( ~ occurrence_of(X527,tptp1)
        | ~ occurrence_of(X526,tptp3)
        | ~ next_subocc(esk20_0,X526,tptp0)
        | ~ min_precedes(X526,X527,tptp0)
        | ~ leaf(X527,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,
    ! [X405,X406,X407,X408,X409,X410,X411] :
      ( ( min_precedes(X405,X406,X407)
        | ~ next_subocc(X405,X406,X407) )
      & ( ~ min_precedes(X405,X408,X407)
        | ~ min_precedes(X408,X406,X407)
        | ~ next_subocc(X405,X406,X407) )
      & ( min_precedes(X409,esk8_3(X409,X410,X411),X411)
        | ~ min_precedes(X409,X410,X411)
        | next_subocc(X409,X410,X411) )
      & ( min_precedes(esk8_3(X409,X410,X411),X410,X411)
        | ~ min_precedes(X409,X410,X411)
        | next_subocc(X409,X410,X411) ) ),
    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,
    ! [X503,X504] :
      ( ( occurrence_of(esk16_2(X503,X504),X504)
        | ~ leaf(X503,X504)
        | atomic(X504) )
      & ( leaf_occ(X503,esk16_2(X503,X504))
        | ~ leaf(X503,X504)
        | atomic(X504) ) ),
    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,
    ! [X435,X436,X437,X438] :
      ( ~ min_precedes(X435,X436,X437)
      | ~ occurrence_of(X438,X437)
      | ~ subactivity_occurrence(X436,X438)
      | subactivity_occurrence(X435,X438) ),
    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,
    ! [X457,X458,X460,X461,X462] :
      ( ( occurrence_of(X458,esk15_2(X457,X458))
        | ~ leaf_occ(X457,X458) )
      & ( subactivity_occurrence(X457,X458)
        | ~ leaf_occ(X457,X458) )
      & ( leaf(X457,esk15_2(X457,X458))
        | ~ leaf_occ(X457,X458) )
      & ( ~ occurrence_of(X461,X462)
        | ~ subactivity_occurrence(X460,X461)
        | ~ leaf(X460,X462)
        | leaf_occ(X460,X461) ) ),
    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,
    ! [X496,X497,X498,X499] :
      ( ~ occurrence_of(X497,X496)
      | ~ subactivity_occurrence(X498,X497)
      | ~ leaf_occ(X499,X497)
      | ~ arboreal(X498)
      | min_precedes(X498,X499,X496)
      | X499 = X498 ),
    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,
    ! [X379,X380,X381] :
      ( ~ min_precedes(X379,X380,X381)
      | precedes(X379,X380) ),
    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,
    ! [X362,X363] :
      ( ( earlier(X362,X363)
        | ~ precedes(X362,X363) )
      & ( legal(X363)
        | ~ precedes(X362,X363) )
      & ( ~ earlier(X362,X363)
        | ~ legal(X363)
        | precedes(X362,X363) ) ),
    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,
    ! [X397,X398,X400,X401,X402,X403] :
      ( ( root(X397,X398)
        | min_precedes(esk6_2(X397,X398),X397,X398)
        | ~ leaf(X397,X398) )
      & ( ~ min_precedes(X397,X400,X398)
        | ~ leaf(X397,X398) )
      & ( ~ root(X401,X402)
        | min_precedes(X401,esk7_2(X401,X402),X402)
        | leaf(X401,X402) )
      & ( ~ min_precedes(X403,X401,X402)
        | min_precedes(X401,esk7_2(X401,X402),X402)
        | leaf(X401,X402) ) ),
    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,
    ! [X351,X352,X353] :
      ( ~ earlier(X351,X352)
      | ~ earlier(X352,X353)
      | earlier(X351,X353) ),
    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,
    ! [X386,X387,X388,X389] :
      ( ~ min_precedes(X386,X387,X389)
      | ~ min_precedes(X386,X388,X389)
      | ~ precedes(X387,X388)
      | min_precedes(X387,X388,X389) ),
    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.00/0.12  % Problem    : PRO014+3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33  % Computer : n018.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 01:31:02 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 3.31/3.02  % Version  : CSE_E---1.7
% 3.31/3.02  % Problem  : theBenchmark.p
% 3.31/3.02  % SZS status Theorem for theBenchmark.p
% 3.31/3.02  % SZS output start CNFRefutation
% See solution above
% 3.43/3.02  % Total time : 2.372s
%------------------------------------------------------------------------------