TSTP Solution File: PRO017+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : PRO017+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n010.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  : 600s
% DateTime : Mon Jul 18 17:45:05 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   80 (  26 unt;   0 def)
%            Number of atoms       :  298 (  24 equ)
%            Maximal formula atoms :   38 (   3 avg)
%            Number of connectives :  339 ( 121   ~; 153   |;  54   &)
%                                         (   4 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   7 con; 0-3 aty)
%            Number of variables   :  109 (   8 sgn  53   !;  12   ?)

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

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)
          & min_precedes(X108,X109,tptp0)
          & ( occurrence_of(X110,tptp2)
            | occurrence_of(X110,tptp1) )
          & min_precedes(X109,X110,tptp0)
          & ! [X111] :
              ( min_precedes(X108,X111,tptp0)
             => ( X111 = X109
                | X111 = X110 ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_35) ).

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/solver/bin/../tmp/theBenchmark.p',sos_22) ).

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/solver/bin/../tmp/theBenchmark.p',sos_25) ).

fof(sos_07,axiom,
    ! [X17,X18] :
      ( occurrence_of(X17,X18)
     => ( arboreal(X17)
      <=> atomic(X18) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_07) ).

fof(sos_41,axiom,
    atomic(tptp3),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_41) ).

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

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/sandbox/solver/bin/../tmp/theBenchmark.p',sos_34) ).

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/solver/bin/../tmp/theBenchmark.p',sos_21) ).

fof(sos_42,axiom,
    tptp4 != tptp3,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_42) ).

fof(sos_46,axiom,
    tptp3 != tptp1,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_46) ).

fof(sos_45,axiom,
    tptp3 != tptp2,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_45) ).

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

fof(c_0_13,plain,
    ! [X112,X113,X117] :
      ( ( occurrence_of(esk8_1(X112),tptp3)
        | ~ occurrence_of(X113,tptp0)
        | ~ subactivity_occurrence(X112,X113)
        | ~ arboreal(X112)
        | leaf_occ(X112,X113) )
      & ( next_subocc(X112,esk8_1(X112),tptp0)
        | ~ occurrence_of(X113,tptp0)
        | ~ subactivity_occurrence(X112,X113)
        | ~ arboreal(X112)
        | leaf_occ(X112,X113) )
      & ( occurrence_of(esk9_1(X112),tptp4)
        | ~ occurrence_of(X113,tptp0)
        | ~ subactivity_occurrence(X112,X113)
        | ~ arboreal(X112)
        | leaf_occ(X112,X113) )
      & ( min_precedes(esk8_1(X112),esk9_1(X112),tptp0)
        | ~ occurrence_of(X113,tptp0)
        | ~ subactivity_occurrence(X112,X113)
        | ~ arboreal(X112)
        | leaf_occ(X112,X113) )
      & ( occurrence_of(esk10_1(X112),tptp2)
        | occurrence_of(esk10_1(X112),tptp1)
        | ~ occurrence_of(X113,tptp0)
        | ~ subactivity_occurrence(X112,X113)
        | ~ arboreal(X112)
        | leaf_occ(X112,X113) )
      & ( min_precedes(esk9_1(X112),esk10_1(X112),tptp0)
        | ~ occurrence_of(X113,tptp0)
        | ~ subactivity_occurrence(X112,X113)
        | ~ arboreal(X112)
        | leaf_occ(X112,X113) )
      & ( ~ min_precedes(esk8_1(X112),X117,tptp0)
        | X117 = esk9_1(X112)
        | X117 = esk10_1(X112)
        | ~ occurrence_of(X113,tptp0)
        | ~ subactivity_occurrence(X112,X113)
        | ~ arboreal(X112)
        | leaf_occ(X112,X113) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[sos_35])])])])])])])]) ).

fof(c_0_14,negated_conjecture,
    ! [X118,X119] :
      ( occurrence_of(esk2_0,tptp0)
      & subactivity_occurrence(esk1_0,esk2_0)
      & arboreal(esk1_0)
      & ~ leaf_occ(esk1_0,esk2_0)
      & ( ~ occurrence_of(X119,tptp2)
        | ~ occurrence_of(X118,tptp3)
        | ~ next_subocc(esk1_0,X118,tptp0)
        | ~ min_precedes(X118,X119,tptp0)
        | ~ leaf(X119,tptp0) )
      & ( ~ occurrence_of(X119,tptp1)
        | ~ occurrence_of(X118,tptp3)
        | ~ next_subocc(esk1_0,X118,tptp0)
        | ~ min_precedes(X118,X119,tptp0)
        | ~ leaf(X119,tptp0) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12])])])])])])])]) ).

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

cnf(c_0_16,negated_conjecture,
    occurrence_of(esk2_0,tptp0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_17,plain,
    ! [X65,X66,X67,X68,X65,X66,X67] :
      ( ( min_precedes(X65,X66,X67)
        | ~ next_subocc(X65,X66,X67) )
      & ( ~ min_precedes(X65,X68,X67)
        | ~ min_precedes(X68,X66,X67)
        | ~ next_subocc(X65,X66,X67) )
      & ( min_precedes(X65,esk7_3(X65,X66,X67),X67)
        | ~ min_precedes(X65,X66,X67)
        | next_subocc(X65,X66,X67) )
      & ( min_precedes(esk7_3(X65,X66,X67),X66,X67)
        | ~ min_precedes(X65,X66,X67)
        | next_subocc(X65,X66,X67) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])])])])])])]) ).

cnf(c_0_18,negated_conjecture,
    ( leaf_occ(X1,esk2_0)
    | next_subocc(X1,esk8_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk2_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    subactivity_occurrence(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    arboreal(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,negated_conjecture,
    ~ leaf_occ(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_22,plain,
    ! [X74,X75,X76] :
      ( ( occurrence_of(esk6_3(X74,X75,X76),X74)
        | ~ min_precedes(X75,X76,X74) )
      & ( subactivity_occurrence(X75,esk6_3(X74,X75,X76))
        | ~ min_precedes(X75,X76,X74) )
      & ( subactivity_occurrence(X76,esk6_3(X74,X75,X76))
        | ~ min_precedes(X75,X76,X74) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_25])])])])])]) ).

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

cnf(c_0_24,negated_conjecture,
    next_subocc(esk1_0,esk8_1(esk1_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]) ).

cnf(c_0_25,plain,
    ( leaf_occ(X1,X2)
    | occurrence_of(esk8_1(X1),tptp3)
    | ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,X2)
    | ~ occurrence_of(X2,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_26,plain,
    ( occurrence_of(esk6_3(X3,X1,X2),X3)
    | ~ min_precedes(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_27,negated_conjecture,
    min_precedes(esk1_0,esk8_1(esk1_0),tptp0),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

fof(c_0_28,plain,
    ! [X19,X20] :
      ( ( ~ arboreal(X19)
        | atomic(X20)
        | ~ occurrence_of(X19,X20) )
      & ( ~ atomic(X20)
        | arboreal(X19)
        | ~ occurrence_of(X19,X20) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])]) ).

cnf(c_0_29,negated_conjecture,
    ( leaf_occ(X1,esk2_0)
    | occurrence_of(esk8_1(X1),tptp3)
    | ~ subactivity_occurrence(X1,esk2_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_16]) ).

cnf(c_0_30,negated_conjecture,
    occurrence_of(esk6_3(tptp0,esk1_0,esk8_1(esk1_0)),tptp0),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,plain,
    ( subactivity_occurrence(X2,esk6_3(X3,X1,X2))
    | ~ min_precedes(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_32,plain,
    ( arboreal(X1)
    | ~ occurrence_of(X1,X2)
    | ~ atomic(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_33,negated_conjecture,
    occurrence_of(esk8_1(esk1_0),tptp3),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_19]),c_0_20])]),c_0_21]) ).

cnf(c_0_34,plain,
    atomic(tptp3),
    inference(split_conjunct,[status(thm)],[sos_41]) ).

fof(c_0_35,plain,
    ! [X8,X9,X10] :
      ( ~ occurrence_of(X8,X9)
      | ~ occurrence_of(X8,X10)
      | X9 = X10 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])]) ).

fof(c_0_36,plain,
    ! [X106,X107,X106,X107,X109] :
      ( ( occurrence_of(X107,esk5_2(X106,X107))
        | ~ leaf_occ(X106,X107) )
      & ( subactivity_occurrence(X106,X107)
        | ~ leaf_occ(X106,X107) )
      & ( leaf(X106,esk5_2(X106,X107))
        | ~ leaf_occ(X106,X107) )
      & ( ~ occurrence_of(X107,X109)
        | ~ subactivity_occurrence(X106,X107)
        | ~ leaf(X106,X109)
        | leaf_occ(X106,X107) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_34])])])])])])]) ).

cnf(c_0_37,negated_conjecture,
    ( leaf_occ(X1,esk6_3(tptp0,esk1_0,esk8_1(esk1_0)))
    | next_subocc(X1,esk8_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk6_3(tptp0,esk1_0,esk8_1(esk1_0)))
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_30]) ).

cnf(c_0_38,negated_conjecture,
    subactivity_occurrence(esk8_1(esk1_0),esk6_3(tptp0,esk1_0,esk8_1(esk1_0))),
    inference(spm,[status(thm)],[c_0_31,c_0_27]) ).

cnf(c_0_39,negated_conjecture,
    arboreal(esk8_1(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).

cnf(c_0_40,plain,
    ( leaf_occ(X1,X2)
    | min_precedes(esk8_1(X1),esk9_1(X1),tptp0)
    | ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,X2)
    | ~ occurrence_of(X2,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

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

cnf(c_0_42,plain,
    ( occurrence_of(X2,esk5_2(X1,X2))
    | ~ leaf_occ(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_43,negated_conjecture,
    ( leaf_occ(esk8_1(esk1_0),esk6_3(tptp0,esk1_0,esk8_1(esk1_0)))
    | next_subocc(esk8_1(esk1_0),esk8_1(esk8_1(esk1_0)),tptp0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).

fof(c_0_44,plain,
    ! [X61,X62,X64,X61,X62,X65] :
      ( ( root(X61,X62)
        | min_precedes(esk3_2(X61,X62),X61,X62)
        | ~ leaf(X61,X62) )
      & ( ~ min_precedes(X61,X64,X62)
        | ~ leaf(X61,X62) )
      & ( ~ root(X61,X62)
        | min_precedes(X61,esk4_2(X61,X62),X62)
        | leaf(X61,X62) )
      & ( ~ min_precedes(X65,X61,X62)
        | min_precedes(X61,esk4_2(X61,X62),X62)
        | leaf(X61,X62) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])])])])]) ).

cnf(c_0_45,negated_conjecture,
    ( leaf_occ(X1,esk2_0)
    | min_precedes(esk8_1(X1),esk9_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk2_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_16]) ).

cnf(c_0_46,plain,
    ( leaf(X1,esk5_2(X1,X2))
    | ~ leaf_occ(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_47,negated_conjecture,
    ( X1 = tptp0
    | ~ occurrence_of(esk6_3(tptp0,esk1_0,esk8_1(esk1_0)),X1) ),
    inference(spm,[status(thm)],[c_0_41,c_0_30]) ).

cnf(c_0_48,negated_conjecture,
    ( next_subocc(esk8_1(esk1_0),esk8_1(esk8_1(esk1_0)),tptp0)
    | occurrence_of(esk6_3(tptp0,esk1_0,esk8_1(esk1_0)),esk5_2(esk8_1(esk1_0),esk6_3(tptp0,esk1_0,esk8_1(esk1_0)))) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

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

cnf(c_0_50,negated_conjecture,
    min_precedes(esk8_1(esk1_0),esk9_1(esk1_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_19]),c_0_20])]),c_0_21]) ).

cnf(c_0_51,negated_conjecture,
    ( next_subocc(esk8_1(esk1_0),esk8_1(esk8_1(esk1_0)),tptp0)
    | leaf(esk8_1(esk1_0),esk5_2(esk8_1(esk1_0),esk6_3(tptp0,esk1_0,esk8_1(esk1_0)))) ),
    inference(spm,[status(thm)],[c_0_46,c_0_43]) ).

cnf(c_0_52,negated_conjecture,
    ( esk5_2(esk8_1(esk1_0),esk6_3(tptp0,esk1_0,esk8_1(esk1_0))) = tptp0
    | next_subocc(esk8_1(esk1_0),esk8_1(esk8_1(esk1_0)),tptp0) ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_53,negated_conjecture,
    ~ leaf(esk8_1(esk1_0),tptp0),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_54,negated_conjecture,
    ( leaf_occ(X1,esk6_3(tptp0,esk1_0,esk8_1(esk1_0)))
    | occurrence_of(esk8_1(X1),tptp3)
    | ~ subactivity_occurrence(X1,esk6_3(tptp0,esk1_0,esk8_1(esk1_0)))
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_30]) ).

cnf(c_0_55,negated_conjecture,
    next_subocc(esk8_1(esk1_0),esk8_1(esk8_1(esk1_0)),tptp0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).

cnf(c_0_56,negated_conjecture,
    ( leaf_occ(esk8_1(esk1_0),esk6_3(tptp0,esk1_0,esk8_1(esk1_0)))
    | occurrence_of(esk8_1(esk8_1(esk1_0)),tptp3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_38]),c_0_39])]) ).

cnf(c_0_57,plain,
    ( leaf_occ(X1,X2)
    | occurrence_of(esk10_1(X1),tptp1)
    | occurrence_of(esk10_1(X1),tptp2)
    | ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,X2)
    | ~ occurrence_of(X2,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_58,plain,
    ( leaf_occ(X1,X2)
    | X3 = esk10_1(X1)
    | X3 = esk9_1(X1)
    | ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ min_precedes(esk8_1(X1),X3,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_59,negated_conjecture,
    min_precedes(esk8_1(esk1_0),esk8_1(esk8_1(esk1_0)),tptp0),
    inference(spm,[status(thm)],[c_0_23,c_0_55]) ).

cnf(c_0_60,negated_conjecture,
    ( occurrence_of(esk6_3(tptp0,esk1_0,esk8_1(esk1_0)),esk5_2(esk8_1(esk1_0),esk6_3(tptp0,esk1_0,esk8_1(esk1_0))))
    | occurrence_of(esk8_1(esk8_1(esk1_0)),tptp3) ),
    inference(spm,[status(thm)],[c_0_42,c_0_56]) ).

cnf(c_0_61,plain,
    ( leaf_occ(X1,X2)
    | occurrence_of(esk9_1(X1),tptp4)
    | ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,X2)
    | ~ occurrence_of(X2,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_62,negated_conjecture,
    ( leaf_occ(X1,esk2_0)
    | occurrence_of(esk10_1(X1),tptp2)
    | occurrence_of(esk10_1(X1),tptp1)
    | ~ subactivity_occurrence(X1,esk2_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_57,c_0_16]) ).

cnf(c_0_63,negated_conjecture,
    ( esk9_1(esk1_0) = esk8_1(esk8_1(esk1_0))
    | esk10_1(esk1_0) = esk8_1(esk8_1(esk1_0))
    | leaf_occ(esk1_0,X1)
    | ~ subactivity_occurrence(esk1_0,X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_20])]) ).

cnf(c_0_64,negated_conjecture,
    ( leaf(esk8_1(esk1_0),esk5_2(esk8_1(esk1_0),esk6_3(tptp0,esk1_0,esk8_1(esk1_0))))
    | occurrence_of(esk8_1(esk8_1(esk1_0)),tptp3) ),
    inference(spm,[status(thm)],[c_0_46,c_0_56]) ).

cnf(c_0_65,negated_conjecture,
    ( esk5_2(esk8_1(esk1_0),esk6_3(tptp0,esk1_0,esk8_1(esk1_0))) = tptp0
    | occurrence_of(esk8_1(esk8_1(esk1_0)),tptp3) ),
    inference(spm,[status(thm)],[c_0_47,c_0_60]) ).

cnf(c_0_66,negated_conjecture,
    ( leaf_occ(X1,esk2_0)
    | occurrence_of(esk9_1(X1),tptp4)
    | ~ subactivity_occurrence(X1,esk2_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_61,c_0_16]) ).

cnf(c_0_67,negated_conjecture,
    ( occurrence_of(esk10_1(esk1_0),tptp1)
    | occurrence_of(esk10_1(esk1_0),tptp2) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_19]),c_0_20])]),c_0_21]) ).

cnf(c_0_68,negated_conjecture,
    ( esk10_1(esk1_0) = esk8_1(esk8_1(esk1_0))
    | esk9_1(esk1_0) = esk8_1(esk8_1(esk1_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_19]),c_0_16])]),c_0_21]) ).

cnf(c_0_69,negated_conjecture,
    occurrence_of(esk8_1(esk8_1(esk1_0)),tptp3),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_53]) ).

cnf(c_0_70,negated_conjecture,
    occurrence_of(esk9_1(esk1_0),tptp4),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_19]),c_0_20])]),c_0_21]) ).

cnf(c_0_71,negated_conjecture,
    ( esk9_1(esk1_0) = esk8_1(esk8_1(esk1_0))
    | occurrence_of(esk8_1(esk8_1(esk1_0)),tptp2)
    | occurrence_of(esk8_1(esk8_1(esk1_0)),tptp1) ),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_72,negated_conjecture,
    ( X1 = tptp3
    | ~ occurrence_of(esk8_1(esk8_1(esk1_0)),X1) ),
    inference(spm,[status(thm)],[c_0_41,c_0_69]) ).

cnf(c_0_73,negated_conjecture,
    ( occurrence_of(esk8_1(esk8_1(esk1_0)),tptp1)
    | occurrence_of(esk8_1(esk8_1(esk1_0)),tptp2)
    | occurrence_of(esk8_1(esk8_1(esk1_0)),tptp4) ),
    inference(spm,[status(thm)],[c_0_70,c_0_71]) ).

cnf(c_0_74,plain,
    tptp4 != tptp3,
    inference(split_conjunct,[status(thm)],[sos_42]) ).

cnf(c_0_75,negated_conjecture,
    ( occurrence_of(esk8_1(esk8_1(esk1_0)),tptp2)
    | occurrence_of(esk8_1(esk8_1(esk1_0)),tptp1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]) ).

cnf(c_0_76,plain,
    tptp3 != tptp1,
    inference(split_conjunct,[status(thm)],[sos_46]) ).

cnf(c_0_77,negated_conjecture,
    occurrence_of(esk8_1(esk8_1(esk1_0)),tptp2),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_75]),c_0_76]) ).

cnf(c_0_78,plain,
    tptp3 != tptp2,
    inference(split_conjunct,[status(thm)],[sos_45]) ).

cnf(c_0_79,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_77]),c_0_78]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PRO017+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n010.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jun 13 00:57:55 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.24/1.42  # Preprocessing time       : 0.018 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 80
% 0.24/1.42  # Proof object clause steps            : 59
% 0.24/1.42  # Proof object formula steps           : 21
% 0.24/1.42  # Proof object conjectures             : 44
% 0.24/1.42  # Proof object clause conjectures      : 41
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 22
% 0.24/1.42  # Proof object initial formulas used   : 12
% 0.24/1.42  # Proof object generating inferences   : 37
% 0.24/1.42  # Proof object simplifying inferences  : 31
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 49
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 17
% 0.24/1.42  # Initial clauses                      : 58
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 58
% 0.24/1.42  # Processed clauses                    : 2236
% 0.24/1.42  # ...of these trivial                  : 7
% 0.24/1.42  # ...subsumed                          : 604
% 0.24/1.42  # ...remaining for further processing  : 1625
% 0.24/1.42  # Other redundant clauses eliminated   : 0
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 23
% 0.24/1.42  # Backward-rewritten                   : 25
% 0.24/1.42  # Generated clauses                    : 8035
% 0.24/1.42  # ...of the previous two non-trivial   : 7349
% 0.24/1.42  # Contextual simplify-reflections      : 374
% 0.24/1.42  # Paramodulations                      : 8034
% 0.24/1.42  # Factorizations                       : 1
% 0.24/1.42  # Equation resolutions                 : 0
% 0.24/1.42  # Current number of processed clauses  : 1577
% 0.24/1.42  #    Positive orientable unit clauses  : 219
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 81
% 0.24/1.42  #    Non-unit-clauses                  : 1277
% 0.24/1.42  # Current number of unprocessed clauses: 4685
% 0.24/1.42  # ...number of literals in the above   : 18055
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 48
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 152825
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 41768
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 648
% 0.24/1.42  # Unit Clause-clause subsumption calls : 4938
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 312
% 0.24/1.42  # BW rewrite match successes           : 4
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 230692
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.319 s
% 0.24/1.42  # System time              : 0.011 s
% 0.24/1.42  # Total time               : 0.330 s
% 0.24/1.42  # Maximum resident set size: 12644 pages
% 0.24/23.41  eprover: CPU time limit exceeded, terminating
% 0.24/23.42  eprover: CPU time limit exceeded, terminating
% 0.24/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49  eprover: No such file or directory
%------------------------------------------------------------------------------