↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : PRO017+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n020.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.23s 1.42s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   72 (  26 unt;   0 def)
%            Number of atoms       :  263 (  21 equ)
%            Maximal formula atoms :   38 (   3 avg)
%            Number of connectives :  306 ( 115   ~; 135   |;  46   &)
%                                         (   2 <=>;   8  =>;   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   :  100 (   4 sgn  45   !;  10   ?)

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

fof(sos_32,axiom,
    ! [X96,X97] :
      ( ( occurrence_of(X97,tptp0)
        & subactivity_occurrence(X96,X97)
        & arboreal(X96)
        & ~ leaf_occ(X96,X97) )
     => ? [X98,X99,X100] :
          ( occurrence_of(X98,tptp3)
          & next_subocc(X96,X98,tptp0)
          & occurrence_of(X99,tptp4)
          & min_precedes(X98,X99,tptp0)
          & ( occurrence_of(X100,tptp2)
            | occurrence_of(X100,tptp1) )
          & min_precedes(X99,X100,tptp0)
          & ! [X101] :
              ( min_precedes(X98,X101,tptp0)
             => ( X101 = X99
                | X101 = X100 ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_32) ).

fof(sos_04,axiom,
    ! [X16,X17,X18] :
      ( next_subocc(X16,X17,X18)
    <=> ( min_precedes(X16,X17,X18)
        & ~ ? [X19] :
              ( min_precedes(X16,X19,X18)
              & min_precedes(X19,X17,X18) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_04) ).

fof(sos_24,axiom,
    ! [X71,X72,X73] :
      ( min_precedes(X72,X73,X71)
     => ? [X74] :
          ( occurrence_of(X74,X71)
          & subactivity_occurrence(X72,X74)
          & subactivity_occurrence(X73,X74) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_24) ).

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

fof(sos_21,axiom,
    ! [X61,X62,X63] :
      ( ( occurrence_of(X61,X63)
        & leaf_occ(X62,X61) )
     => ~ ? [X64] : min_precedes(X62,X64,X63) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_21) ).

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

fof(sos_22,axiom,
    ! [X65,X66,X67] :
      ( ( occurrence_of(X65,X66)
        & occurrence_of(X65,X67) )
     => X66 = X67 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_22) ).

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

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

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

fof(c_0_11,negated_conjecture,
    ~ ! [X102,X103] :
        ( ( occurrence_of(X103,tptp0)
          & subactivity_occurrence(X102,X103)
          & arboreal(X102)
          & ~ leaf_occ(X102,X103) )
       => ? [X104,X105] :
            ( occurrence_of(X104,tptp3)
            & next_subocc(X102,X104,tptp0)
            & ( occurrence_of(X105,tptp2)
              | occurrence_of(X105,tptp1) )
            & min_precedes(X104,X105,tptp0)
            & leaf(X105,tptp0) ) ),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_12,plain,
    ! [X102,X103,X107] :
      ( ( occurrence_of(esk8_1(X102),tptp3)
        | ~ occurrence_of(X103,tptp0)
        | ~ subactivity_occurrence(X102,X103)
        | ~ arboreal(X102)
        | leaf_occ(X102,X103) )
      & ( next_subocc(X102,esk8_1(X102),tptp0)
        | ~ occurrence_of(X103,tptp0)
        | ~ subactivity_occurrence(X102,X103)
        | ~ arboreal(X102)
        | leaf_occ(X102,X103) )
      & ( occurrence_of(esk9_1(X102),tptp4)
        | ~ occurrence_of(X103,tptp0)
        | ~ subactivity_occurrence(X102,X103)
        | ~ arboreal(X102)
        | leaf_occ(X102,X103) )
      & ( min_precedes(esk8_1(X102),esk9_1(X102),tptp0)
        | ~ occurrence_of(X103,tptp0)
        | ~ subactivity_occurrence(X102,X103)
        | ~ arboreal(X102)
        | leaf_occ(X102,X103) )
      & ( occurrence_of(esk10_1(X102),tptp2)
        | occurrence_of(esk10_1(X102),tptp1)
        | ~ occurrence_of(X103,tptp0)
        | ~ subactivity_occurrence(X102,X103)
        | ~ arboreal(X102)
        | leaf_occ(X102,X103) )
      & ( min_precedes(esk9_1(X102),esk10_1(X102),tptp0)
        | ~ occurrence_of(X103,tptp0)
        | ~ subactivity_occurrence(X102,X103)
        | ~ arboreal(X102)
        | leaf_occ(X102,X103) )
      & ( ~ min_precedes(esk8_1(X102),X107,tptp0)
        | X107 = esk9_1(X102)
        | X107 = esk10_1(X102)
        | ~ occurrence_of(X103,tptp0)
        | ~ subactivity_occurrence(X102,X103)
        | ~ arboreal(X102)
        | leaf_occ(X102,X103) ) ),
    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_32])])])])])])])]) ).

fof(c_0_13,negated_conjecture,
    ! [X108,X109] :
      ( occurrence_of(esk2_0,tptp0)
      & subactivity_occurrence(esk1_0,esk2_0)
      & arboreal(esk1_0)
      & ~ leaf_occ(esk1_0,esk2_0)
      & ( ~ occurrence_of(X109,tptp2)
        | ~ occurrence_of(X108,tptp3)
        | ~ next_subocc(esk1_0,X108,tptp0)
        | ~ min_precedes(X108,X109,tptp0)
        | ~ leaf(X109,tptp0) )
      & ( ~ occurrence_of(X109,tptp1)
        | ~ occurrence_of(X108,tptp3)
        | ~ next_subocc(esk1_0,X108,tptp0)
        | ~ min_precedes(X108,X109,tptp0)
        | ~ leaf(X109,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_11])])])])])])])]) ).

cnf(c_0_14,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_12]) ).

cnf(c_0_15,negated_conjecture,
    occurrence_of(esk2_0,tptp0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_16,plain,
    ! [X20,X21,X22,X23,X20,X21,X22] :
      ( ( min_precedes(X20,X21,X22)
        | ~ next_subocc(X20,X21,X22) )
      & ( ~ min_precedes(X20,X23,X22)
        | ~ min_precedes(X23,X21,X22)
        | ~ next_subocc(X20,X21,X22) )
      & ( min_precedes(X20,esk11_3(X20,X21,X22),X22)
        | ~ min_precedes(X20,X21,X22)
        | next_subocc(X20,X21,X22) )
      & ( min_precedes(esk11_3(X20,X21,X22),X21,X22)
        | ~ min_precedes(X20,X21,X22)
        | next_subocc(X20,X21,X22) ) ),
    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_04])])])])])])]) ).

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

cnf(c_0_18,negated_conjecture,
    subactivity_occurrence(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    arboreal(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

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

fof(c_0_21,plain,
    ! [X75,X76,X77] :
      ( ( occurrence_of(esk12_3(X75,X76,X77),X75)
        | ~ min_precedes(X76,X77,X75) )
      & ( subactivity_occurrence(X76,esk12_3(X75,X76,X77))
        | ~ min_precedes(X76,X77,X75) )
      & ( subactivity_occurrence(X77,esk12_3(X75,X76,X77))
        | ~ min_precedes(X76,X77,X75) ) ),
    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_24])])])])])]) ).

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

cnf(c_0_23,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_17,c_0_18]),c_0_19])]),c_0_20]) ).

cnf(c_0_24,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_12]) ).

cnf(c_0_25,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_12]) ).

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

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

fof(c_0_28,plain,
    ! [X43,X44] :
      ( ( ~ arboreal(X43)
        | atomic(X44)
        | ~ occurrence_of(X43,X44) )
      & ( ~ atomic(X44)
        | arboreal(X43)
        | ~ occurrence_of(X43,X44) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_13])])]) ).

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_24,c_0_15]) ).

fof(c_0_30,plain,
    ! [X65,X66,X67,X68] :
      ( ~ occurrence_of(X65,X67)
      | ~ leaf_occ(X66,X65)
      | ~ min_precedes(X66,X68,X67) ),
    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_21])])])])]) ).

cnf(c_0_31,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_25,c_0_15]) ).

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

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

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

cnf(c_0_35,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_18]),c_0_19])]),c_0_20]) ).

cnf(c_0_36,plain,
    atomic(tptp3),
    inference(split_conjunct,[status(thm)],[sos_38]) ).

cnf(c_0_37,plain,
    ( ~ min_precedes(X1,X2,X3)
    | ~ leaf_occ(X1,X4)
    | ~ occurrence_of(X4,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_38,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_31,c_0_18]),c_0_19])]),c_0_20]) ).

cnf(c_0_39,negated_conjecture,
    ( next_subocc(X1,esk8_1(X1),tptp0)
    | leaf_occ(X1,esk12_3(tptp0,esk1_0,esk8_1(esk1_0)))
    | ~ subactivity_occurrence(X1,esk12_3(tptp0,esk1_0,esk8_1(esk1_0)))
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_32]) ).

cnf(c_0_40,negated_conjecture,
    subactivity_occurrence(esk8_1(esk1_0),esk12_3(tptp0,esk1_0,esk8_1(esk1_0))),
    inference(spm,[status(thm)],[c_0_33,c_0_27]) ).

cnf(c_0_41,negated_conjecture,
    arboreal(esk8_1(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).

cnf(c_0_42,negated_conjecture,
    ( ~ leaf_occ(esk8_1(esk1_0),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_43,negated_conjecture,
    ( next_subocc(esk8_1(esk1_0),esk8_1(esk8_1(esk1_0)),tptp0)
    | leaf_occ(esk8_1(esk1_0),esk12_3(tptp0,esk1_0,esk8_1(esk1_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).

cnf(c_0_44,negated_conjecture,
    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_42,c_0_43]),c_0_32])]) ).

cnf(c_0_45,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_12]) ).

cnf(c_0_46,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_12]) ).

cnf(c_0_47,negated_conjecture,
    min_precedes(esk8_1(esk1_0),esk8_1(esk8_1(esk1_0)),tptp0),
    inference(spm,[status(thm)],[c_0_22,c_0_44]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ leaf_occ(esk1_0,X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_37,c_0_27]) ).

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

cnf(c_0_50,negated_conjecture,
    ( leaf_occ(X1,esk12_3(tptp0,esk1_0,esk8_1(esk1_0)))
    | occurrence_of(esk8_1(X1),tptp3)
    | ~ subactivity_occurrence(X1,esk12_3(tptp0,esk1_0,esk8_1(esk1_0)))
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_32]) ).

cnf(c_0_51,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_12]) ).

cnf(c_0_52,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_45,c_0_15]) ).

cnf(c_0_53,negated_conjecture,
    ( esk9_1(esk1_0) = esk8_1(esk8_1(esk1_0))
    | esk10_1(esk1_0) = esk8_1(esk8_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_46,c_0_47]),c_0_19])]),c_0_48]) ).

cnf(c_0_54,negated_conjecture,
    subactivity_occurrence(esk1_0,esk12_3(tptp0,esk1_0,esk8_1(esk1_0))),
    inference(spm,[status(thm)],[c_0_49,c_0_27]) ).

fof(c_0_55,plain,
    ! [X68,X69,X70] :
      ( ~ occurrence_of(X68,X69)
      | ~ occurrence_of(X68,X70)
      | X69 = X70 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])]) ).

cnf(c_0_56,negated_conjecture,
    ( leaf_occ(esk8_1(esk1_0),esk12_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_50,c_0_40]),c_0_41])]) ).

cnf(c_0_57,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_51,c_0_15]) ).

cnf(c_0_58,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_52,c_0_18]),c_0_19])]),c_0_20]) ).

cnf(c_0_59,negated_conjecture,
    ( esk10_1(esk1_0) = esk8_1(esk8_1(esk1_0))
    | esk9_1(esk1_0) = esk8_1(esk8_1(esk1_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_32])]) ).

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

cnf(c_0_61,negated_conjecture,
    occurrence_of(esk8_1(esk8_1(esk1_0)),tptp3),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_56]),c_0_32])]) ).

cnf(c_0_62,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_57,c_0_18]),c_0_19])]),c_0_20]) ).

cnf(c_0_63,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_58,c_0_59]) ).

cnf(c_0_64,negated_conjecture,
    ( X1 = tptp3
    | ~ occurrence_of(esk8_1(esk8_1(esk1_0)),X1) ),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_65,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_62,c_0_63]) ).

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

cnf(c_0_67,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_64,c_0_65]),c_0_66]) ).

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

cnf(c_0_69,negated_conjecture,
    occurrence_of(esk8_1(esk8_1(esk1_0)),tptp2),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_67]),c_0_68]) ).

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

cnf(c_0_71,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_69]),c_0_70]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12  % Problem  : PRO017+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jun 13 02:24:05 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.23/1.42  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.23/1.42  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.23/1.42  # Preprocessing time       : 0.018 s
% 0.23/1.42  
% 0.23/1.42  # Proof found!
% 0.23/1.42  # SZS status Theorem
% 0.23/1.42  # SZS output start CNFRefutation
% See solution above
% 0.23/1.42  # Proof object total steps             : 72
% 0.23/1.42  # Proof object clause steps            : 53
% 0.23/1.42  # Proof object formula steps           : 19
% 0.23/1.42  # Proof object conjectures             : 39
% 0.23/1.42  # Proof object clause conjectures      : 36
% 0.23/1.42  # Proof object formula conjectures     : 3
% 0.23/1.42  # Proof object initial clauses used    : 21
% 0.23/1.42  # Proof object initial formulas used   : 11
% 0.23/1.42  # Proof object generating inferences   : 32
% 0.23/1.42  # Proof object simplifying inferences  : 33
% 0.23/1.42  # Training examples: 0 positive, 0 negative
% 0.23/1.42  # Parsed axioms                        : 46
% 0.23/1.42  # Removed by relevancy pruning/SinE    : 16
% 0.23/1.42  # Initial clauses                      : 57
% 0.23/1.42  # Removed in clause preprocessing      : 0
% 0.23/1.42  # Initial clauses in saturation        : 57
% 0.23/1.42  # Processed clauses                    : 619
% 0.23/1.42  # ...of these trivial                  : 11
% 0.23/1.42  # ...subsumed                          : 138
% 0.23/1.42  # ...remaining for further processing  : 470
% 0.23/1.42  # Other redundant clauses eliminated   : 0
% 0.23/1.42  # Clauses deleted for lack of memory   : 0
% 0.23/1.42  # Backward-subsumed                    : 18
% 0.23/1.42  # Backward-rewritten                   : 9
% 0.23/1.42  # Generated clauses                    : 1830
% 0.23/1.42  # ...of the previous two non-trivial   : 1656
% 0.23/1.42  # Contextual simplify-reflections      : 51
% 0.23/1.42  # Paramodulations                      : 1814
% 0.23/1.42  # Factorizations                       : 5
% 0.23/1.42  # Equation resolutions                 : 0
% 0.23/1.42  # Current number of processed clauses  : 432
% 0.23/1.42  #    Positive orientable unit clauses  : 94
% 0.23/1.42  #    Positive unorientable unit clauses: 0
% 0.23/1.42  #    Negative unit clauses             : 38
% 0.23/1.42  #    Non-unit-clauses                  : 300
% 0.23/1.42  # Current number of unprocessed clauses: 868
% 0.23/1.42  # ...number of literals in the above   : 2923
% 0.23/1.42  # Current number of archived formulas  : 0
% 0.23/1.42  # Current number of archived clauses   : 38
% 0.23/1.42  # Clause-clause subsumption calls (NU) : 13520
% 0.23/1.42  # Rec. Clause-clause subsumption calls : 7936
% 0.23/1.42  # Non-unit clause-clause subsumptions  : 133
% 0.23/1.42  # Unit Clause-clause subsumption calls : 1544
% 0.23/1.42  # Rewrite failures with RHS unbound    : 0
% 0.23/1.42  # BW rewrite match attempts            : 105
% 0.23/1.42  # BW rewrite match successes           : 6
% 0.23/1.42  # Condensation attempts                : 0
% 0.23/1.42  # Condensation successes               : 0
% 0.23/1.42  # Termbank termtop insertions          : 43352
% 0.23/1.42  
% 0.23/1.42  # -------------------------------------------------
% 0.23/1.42  # User time                : 0.078 s
% 0.23/1.42  # System time              : 0.002 s
% 0.23/1.42  # Total time               : 0.080 s
% 0.23/1.42  # Maximum resident set size: 4992 pages
% 0.23/23.41  eprover: CPU time limit exceeded, terminating
% 0.23/23.42  eprover: CPU time limit exceeded, terminating
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49  eprover: No such file or directory
% 0.23/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.49  eprover: No such file or directory
% 0.23/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49  eprover: No such file or directory
%------------------------------------------------------------------------------