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

View Problem - Process Solution

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

% Computer : n016.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:06 EDT 2022

% Result   : Theorem 0.20s 1.39s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   83 (  30 unt;   0 def)
%            Number of atoms       :  294 (  21 equ)
%            Maximal formula atoms :   38 (   3 avg)
%            Number of connectives :  341 ( 130   ~; 152   |;  48   &)
%                                         (   2 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-3 aty)
%            Number of variables   :  117 (   4 sgn  53   !;  10   ?)

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

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)
          & min_precedes(X164,X165,tptp0)
          & ( occurrence_of(X166,tptp2)
            | occurrence_of(X166,tptp1) )
          & min_precedes(X165,X166,tptp0)
          & ! [X167] :
              ( min_precedes(X164,X167,tptp0)
             => ( X167 = X165
                | X167 = X166 ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_49) ).

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

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

fof(sos_37,axiom,
    ! [X114,X115,X116] :
      ( ( occurrence_of(X114,X116)
        & leaf_occ(X115,X114) )
     => ~ ? [X117] : min_precedes(X115,X117,X116) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',sos_37) ).

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

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

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

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

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

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

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

fof(c_0_13,plain,
    ! [X168,X169,X173] :
      ( ( occurrence_of(esk7_1(X168),tptp3)
        | ~ occurrence_of(X169,tptp0)
        | ~ subactivity_occurrence(X168,X169)
        | ~ arboreal(X168)
        | leaf_occ(X168,X169) )
      & ( next_subocc(X168,esk7_1(X168),tptp0)
        | ~ occurrence_of(X169,tptp0)
        | ~ subactivity_occurrence(X168,X169)
        | ~ arboreal(X168)
        | leaf_occ(X168,X169) )
      & ( occurrence_of(esk8_1(X168),tptp4)
        | ~ occurrence_of(X169,tptp0)
        | ~ subactivity_occurrence(X168,X169)
        | ~ arboreal(X168)
        | leaf_occ(X168,X169) )
      & ( min_precedes(esk7_1(X168),esk8_1(X168),tptp0)
        | ~ occurrence_of(X169,tptp0)
        | ~ subactivity_occurrence(X168,X169)
        | ~ arboreal(X168)
        | leaf_occ(X168,X169) )
      & ( occurrence_of(esk9_1(X168),tptp2)
        | occurrence_of(esk9_1(X168),tptp1)
        | ~ occurrence_of(X169,tptp0)
        | ~ subactivity_occurrence(X168,X169)
        | ~ arboreal(X168)
        | leaf_occ(X168,X169) )
      & ( min_precedes(esk8_1(X168),esk9_1(X168),tptp0)
        | ~ occurrence_of(X169,tptp0)
        | ~ subactivity_occurrence(X168,X169)
        | ~ arboreal(X168)
        | leaf_occ(X168,X169) )
      & ( ~ min_precedes(esk7_1(X168),X173,tptp0)
        | X173 = esk8_1(X168)
        | X173 = esk9_1(X168)
        | ~ occurrence_of(X169,tptp0)
        | ~ subactivity_occurrence(X168,X169)
        | ~ arboreal(X168)
        | leaf_occ(X168,X169) ) ),
    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_49])])])])])])])]) ).

fof(c_0_14,negated_conjecture,
    ! [X174,X175] :
      ( occurrence_of(esk2_0,tptp0)
      & subactivity_occurrence(esk1_0,esk2_0)
      & arboreal(esk1_0)
      & ~ leaf_occ(esk1_0,esk2_0)
      & ( ~ occurrence_of(X175,tptp2)
        | ~ occurrence_of(X174,tptp3)
        | ~ next_subocc(esk1_0,X174,tptp0)
        | ~ min_precedes(X174,X175,tptp0)
        | ~ leaf(X175,tptp0) )
      & ( ~ occurrence_of(X175,tptp1)
        | ~ occurrence_of(X174,tptp3)
        | ~ next_subocc(esk1_0,X174,tptp0)
        | ~ min_precedes(X174,X175,tptp0)
        | ~ leaf(X175,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,esk7_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,esk10_3(X65,X66,X67),X67)
        | ~ min_precedes(X65,X66,X67)
        | next_subocc(X65,X66,X67) )
      & ( min_precedes(esk10_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,esk7_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(esk11_3(X74,X75,X76),X74)
        | ~ min_precedes(X75,X76,X74) )
      & ( subactivity_occurrence(X75,esk11_3(X74,X75,X76))
        | ~ min_precedes(X75,X76,X74) )
      & ( subactivity_occurrence(X76,esk11_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,esk7_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(esk7_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,
    ( leaf_occ(X1,X2)
    | min_precedes(esk7_1(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_27,plain,
    ( occurrence_of(esk11_3(X3,X1,X2),X3)
    | ~ min_precedes(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

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

fof(c_0_29,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_30,negated_conjecture,
    ( leaf_occ(X1,esk2_0)
    | occurrence_of(esk7_1(X1),tptp3)
    | ~ subactivity_occurrence(X1,esk2_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_16]) ).

fof(c_0_31,plain,
    ! [X118,X119,X120,X121] :
      ( ~ occurrence_of(X118,X120)
      | ~ leaf_occ(X119,X118)
      | ~ min_precedes(X119,X121,X120) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_37])])])])]) ).

cnf(c_0_32,negated_conjecture,
    ( leaf_occ(X1,esk2_0)
    | min_precedes(esk7_1(X1),esk8_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk2_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_16]) ).

cnf(c_0_33,negated_conjecture,
    occurrence_of(esk11_3(tptp0,esk1_0,esk7_1(esk1_0)),tptp0),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

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

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

cnf(c_0_36,negated_conjecture,
    occurrence_of(esk7_1(esk1_0),tptp3),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_20])]),c_0_21]) ).

cnf(c_0_37,plain,
    atomic(tptp3),
    inference(split_conjunct,[status(thm)],[sos_55]) ).

cnf(c_0_38,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_39,plain,
    ( ~ min_precedes(X1,X2,X3)
    | ~ leaf_occ(X1,X4)
    | ~ occurrence_of(X4,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_40,negated_conjecture,
    min_precedes(esk7_1(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_32,c_0_19]),c_0_20])]),c_0_21]) ).

cnf(c_0_41,negated_conjecture,
    ( leaf_occ(X1,esk11_3(tptp0,esk1_0,esk7_1(esk1_0)))
    | next_subocc(X1,esk7_1(X1),tptp0)
    | ~ subactivity_occurrence(X1,esk11_3(tptp0,esk1_0,esk7_1(esk1_0)))
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_33]) ).

cnf(c_0_42,negated_conjecture,
    subactivity_occurrence(esk7_1(esk1_0),esk11_3(tptp0,esk1_0,esk7_1(esk1_0))),
    inference(spm,[status(thm)],[c_0_34,c_0_28]) ).

cnf(c_0_43,negated_conjecture,
    arboreal(esk7_1(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).

fof(c_0_44,plain,
    ! [X88,X89,X90,X91] :
      ( ~ min_precedes(X88,X89,X90)
      | ~ occurrence_of(X91,X90)
      | ~ subactivity_occurrence(X89,X91)
      | subactivity_occurrence(X88,X91) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])]) ).

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_38,c_0_16]) ).

cnf(c_0_46,negated_conjecture,
    ( ~ leaf_occ(esk7_1(esk1_0),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_47,negated_conjecture,
    ( leaf_occ(esk7_1(esk1_0),esk11_3(tptp0,esk1_0,esk7_1(esk1_0)))
    | next_subocc(esk7_1(esk1_0),esk7_1(esk7_1(esk1_0)),tptp0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).

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

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

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(esk7_1(esk1_0),esk7_1(esk7_1(esk1_0)),tptp0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_33])]) ).

cnf(c_0_52,negated_conjecture,
    ( subactivity_occurrence(esk7_1(esk1_0),X1)
    | ~ subactivity_occurrence(esk8_1(esk1_0),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_48,c_0_40]) ).

cnf(c_0_53,negated_conjecture,
    subactivity_occurrence(esk8_1(esk1_0),esk11_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0))),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_54,negated_conjecture,
    occurrence_of(esk11_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0)),tptp0),
    inference(spm,[status(thm)],[c_0_27,c_0_50]) ).

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

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

cnf(c_0_57,negated_conjecture,
    min_precedes(esk7_1(esk1_0),esk7_1(esk7_1(esk1_0)),tptp0),
    inference(spm,[status(thm)],[c_0_23,c_0_51]) ).

cnf(c_0_58,negated_conjecture,
    ( ~ leaf_occ(esk1_0,X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_39,c_0_28]) ).

cnf(c_0_59,negated_conjecture,
    ( subactivity_occurrence(esk1_0,X1)
    | ~ subactivity_occurrence(esk7_1(esk1_0),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_48,c_0_28]) ).

cnf(c_0_60,negated_conjecture,
    subactivity_occurrence(esk7_1(esk1_0),esk11_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).

cnf(c_0_61,negated_conjecture,
    ( leaf_occ(X1,esk11_3(tptp0,esk1_0,esk7_1(esk1_0)))
    | occurrence_of(esk7_1(X1),tptp3)
    | ~ subactivity_occurrence(X1,esk11_3(tptp0,esk1_0,esk7_1(esk1_0)))
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_33]) ).

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

cnf(c_0_63,negated_conjecture,
    ( leaf_occ(X1,esk2_0)
    | occurrence_of(esk9_1(X1),tptp2)
    | occurrence_of(esk9_1(X1),tptp1)
    | ~ subactivity_occurrence(X1,esk2_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_55,c_0_16]) ).

cnf(c_0_64,negated_conjecture,
    ( esk8_1(esk1_0) = esk7_1(esk7_1(esk1_0))
    | esk9_1(esk1_0) = esk7_1(esk7_1(esk1_0))
    | ~ subactivity_occurrence(esk1_0,X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_20])]),c_0_58]) ).

cnf(c_0_65,negated_conjecture,
    subactivity_occurrence(esk1_0,esk11_3(tptp0,esk8_1(esk1_0),esk9_1(esk1_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_54])]) ).

fof(c_0_66,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])]) ).

cnf(c_0_67,negated_conjecture,
    ( leaf_occ(esk7_1(esk1_0),esk11_3(tptp0,esk1_0,esk7_1(esk1_0)))
    | occurrence_of(esk7_1(esk7_1(esk1_0)),tptp3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_42]),c_0_43])]) ).

cnf(c_0_68,negated_conjecture,
    ( leaf_occ(X1,esk2_0)
    | occurrence_of(esk8_1(X1),tptp4)
    | ~ subactivity_occurrence(X1,esk2_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_62,c_0_16]) ).

cnf(c_0_69,negated_conjecture,
    ( occurrence_of(esk9_1(esk1_0),tptp1)
    | occurrence_of(esk9_1(esk1_0),tptp2) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_19]),c_0_20])]),c_0_21]) ).

cnf(c_0_70,negated_conjecture,
    ( esk9_1(esk1_0) = esk7_1(esk7_1(esk1_0))
    | esk8_1(esk1_0) = esk7_1(esk7_1(esk1_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_54])]) ).

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

cnf(c_0_72,negated_conjecture,
    occurrence_of(esk7_1(esk7_1(esk1_0)),tptp3),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_67]),c_0_33])]) ).

cnf(c_0_73,negated_conjecture,
    occurrence_of(esk8_1(esk1_0),tptp4),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_19]),c_0_20])]),c_0_21]) ).

cnf(c_0_74,negated_conjecture,
    ( esk8_1(esk1_0) = esk7_1(esk7_1(esk1_0))
    | occurrence_of(esk7_1(esk7_1(esk1_0)),tptp2)
    | occurrence_of(esk7_1(esk7_1(esk1_0)),tptp1) ),
    inference(spm,[status(thm)],[c_0_69,c_0_70]) ).

cnf(c_0_75,negated_conjecture,
    ( X1 = tptp3
    | ~ occurrence_of(esk7_1(esk7_1(esk1_0)),X1) ),
    inference(spm,[status(thm)],[c_0_71,c_0_72]) ).

cnf(c_0_76,negated_conjecture,
    ( occurrence_of(esk7_1(esk7_1(esk1_0)),tptp1)
    | occurrence_of(esk7_1(esk7_1(esk1_0)),tptp2)
    | occurrence_of(esk7_1(esk7_1(esk1_0)),tptp4) ),
    inference(spm,[status(thm)],[c_0_73,c_0_74]) ).

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

cnf(c_0_78,negated_conjecture,
    ( occurrence_of(esk7_1(esk7_1(esk1_0)),tptp2)
    | occurrence_of(esk7_1(esk7_1(esk1_0)),tptp1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).

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

cnf(c_0_80,negated_conjecture,
    occurrence_of(esk7_1(esk7_1(esk1_0)),tptp2),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_78]),c_0_79]) ).

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

cnf(c_0_82,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_80]),c_0_81]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PRO017+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.12/0.32  % Computer : n016.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Mon Jun 13 02:54:14 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.20/1.39  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.20/1.39  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.20/1.39  # Preprocessing time       : 0.010 s
% 0.20/1.39  
% 0.20/1.39  # Proof found!
% 0.20/1.39  # SZS status Theorem
% 0.20/1.39  # SZS output start CNFRefutation
% See solution above
% 0.20/1.39  # Proof object total steps             : 83
% 0.20/1.39  # Proof object clause steps            : 62
% 0.20/1.39  # Proof object formula steps           : 21
% 0.20/1.39  # Proof object conjectures             : 46
% 0.20/1.39  # Proof object clause conjectures      : 43
% 0.20/1.39  # Proof object formula conjectures     : 3
% 0.20/1.39  # Proof object initial clauses used    : 23
% 0.20/1.39  # Proof object initial formulas used   : 12
% 0.20/1.39  # Proof object generating inferences   : 39
% 0.20/1.39  # Proof object simplifying inferences  : 40
% 0.20/1.39  # Training examples: 0 positive, 0 negative
% 0.20/1.39  # Parsed axioms                        : 63
% 0.20/1.39  # Removed by relevancy pruning/SinE    : 26
% 0.20/1.39  # Initial clauses                      : 65
% 0.20/1.39  # Removed in clause preprocessing      : 0
% 0.20/1.39  # Initial clauses in saturation        : 65
% 0.20/1.39  # Processed clauses                    : 905
% 0.20/1.39  # ...of these trivial                  : 4
% 0.20/1.39  # ...subsumed                          : 212
% 0.20/1.39  # ...remaining for further processing  : 689
% 0.20/1.39  # Other redundant clauses eliminated   : 0
% 0.20/1.39  # Clauses deleted for lack of memory   : 0
% 0.20/1.39  # Backward-subsumed                    : 23
% 0.20/1.39  # Backward-rewritten                   : 4
% 0.20/1.39  # Generated clauses                    : 2810
% 0.20/1.39  # ...of the previous two non-trivial   : 2595
% 0.20/1.39  # Contextual simplify-reflections      : 132
% 0.20/1.39  # Paramodulations                      : 2809
% 0.20/1.39  # Factorizations                       : 1
% 0.20/1.39  # Equation resolutions                 : 0
% 0.20/1.39  # Current number of processed clauses  : 662
% 0.20/1.39  #    Positive orientable unit clauses  : 101
% 0.20/1.39  #    Positive unorientable unit clauses: 0
% 0.20/1.39  #    Negative unit clauses             : 49
% 0.20/1.39  #    Non-unit-clauses                  : 512
% 0.20/1.39  # Current number of unprocessed clauses: 1611
% 0.20/1.39  # ...number of literals in the above   : 5754
% 0.20/1.39  # Current number of archived formulas  : 0
% 0.20/1.39  # Current number of archived clauses   : 27
% 0.20/1.39  # Clause-clause subsumption calls (NU) : 38949
% 0.20/1.39  # Rec. Clause-clause subsumption calls : 14530
% 0.20/1.39  # Non-unit clause-clause subsumptions  : 258
% 0.20/1.39  # Unit Clause-clause subsumption calls : 1798
% 0.20/1.39  # Rewrite failures with RHS unbound    : 0
% 0.20/1.39  # BW rewrite match attempts            : 36
% 0.20/1.39  # BW rewrite match successes           : 3
% 0.20/1.39  # Condensation attempts                : 0
% 0.20/1.39  # Condensation successes               : 0
% 0.20/1.39  # Termbank termtop insertions          : 70885
% 0.20/1.39  
% 0.20/1.39  # -------------------------------------------------
% 0.20/1.39  # User time                : 0.078 s
% 0.20/1.39  # System time              : 0.004 s
% 0.20/1.39  # Total time               : 0.082 s
% 0.20/1.39  # Maximum resident set size: 6640 pages
% 0.20/23.39  eprover: CPU time limit exceeded, terminating
% 0.20/23.39  eprover: CPU time limit exceeded, terminating
% 0.20/23.40  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.40  eprover: No such file or directory
% 0.20/23.40  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.40  eprover: No such file or directory
% 0.20/23.41  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.41  eprover: No such file or directory
% 0.20/23.41  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.41  eprover: No such file or directory
% 0.20/23.41  eprover: CPU time limit exceeded, terminating
% 0.20/23.41  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.41  eprover: No such file or directory
% 0.20/23.41  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.41  eprover: No such file or directory
% 0.20/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42  eprover: No such file or directory
% 0.20/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42  eprover: No such file or directory
% 0.20/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42  eprover: No such file or directory
% 0.20/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42  eprover: No such file or directory
% 0.20/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.42  eprover: No such file or directory
% 0.20/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43  eprover: No such file or directory
% 0.20/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43  eprover: No such file or directory
% 0.20/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43  eprover: No such file or directory
% 0.20/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43  eprover: No such file or directory
% 0.20/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43  eprover: No such file or directory
% 0.20/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43  eprover: No such file or directory
% 0.20/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44  eprover: No such file or directory
% 0.20/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44  eprover: No such file or directory
% 0.20/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44  eprover: No such file or directory
% 0.20/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44  eprover: No such file or directory
% 0.20/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44  eprover: No such file or directory
% 0.20/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44  eprover: No such file or directory
% 0.20/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44  eprover: No such file or directory
% 0.20/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.45  eprover: No such file or directory
% 0.20/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45  eprover: No such file or directory
% 0.20/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.45  eprover: No such file or directory
% 0.20/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.45  eprover: No such file or directory
% 0.20/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45  eprover: No such file or directory
% 0.20/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46  eprover: No such file or directory
% 0.20/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46  eprover: No such file or directory
% 0.20/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46  eprover: No such file or directory
% 0.20/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.47  eprover: No such file or directory
%------------------------------------------------------------------------------