↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : PRO009+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:59:32 PM UTC 2026

% Result   : Theorem 0.23s 5.61s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   79 (  25 unt;   0 def)
%            Number of atoms       :  263 (  13 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :  303 ( 119   ~; 111   |;  57   &)
%                                         (   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    :   14 (  14 usr;   6 con; 0-3 aty)
%            Number of variables   :  131 (   2 sgn  71   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ! [X106] :
      ( occurrence_of(X106,tptp0)
     => ? [X107,X108] :
          ( leaf_occ(X108,X106)
          & min_precedes(X107,X108,tptp0)
          & ( occurrence_of(X108,tptp1)
            | occurrence_of(X108,tptp2) )
          & root_occ(X107,X106)
          & occurrence_of(X107,tptp3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(sos_32,axiom,
    ! [X102] :
      ( occurrence_of(X102,tptp0)
     => ? [X103,X104,X105] :
          ( leaf_occ(X105,X102)
          & next_subocc(X104,X105,tptp0)
          & ( occurrence_of(X105,tptp1)
            | occurrence_of(X105,tptp2) )
          & next_subocc(X103,X104,tptp0)
          & occurrence_of(X104,tptp4)
          & root_occ(X103,X102)
          & occurrence_of(X103,tptp3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).

fof(sos_08,axiom,
    ! [X29,X30,X31] :
      ( ( occurrence_of(X29,X31)
        & occurrence_of(X29,X30) )
     => X30 = X31 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).

fof(sos_18,axiom,
    ! [X56,X57] :
      ( leaf_occ(X56,X57)
    <=> ? [X58] :
          ( leaf(X56,X58)
          & subactivity_occurrence(X56,X57)
          & occurrence_of(X57,X58) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_18) ).

fof(sos_02,axiom,
    ! [X9,X10,X11,X12] :
      ( ( ~ min_precedes(X11,X12,X9)
        & arboreal(X11)
        & leaf_occ(X12,X10)
        & subactivity_occurrence(X11,X10)
        & occurrence_of(X10,X9) )
     => X12 = X11 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).

fof(sos_26,axiom,
    ! [X79,X80,X81] :
      ( next_subocc(X79,X80,X81)
    <=> ( ~ ? [X82] :
              ( min_precedes(X82,X80,X81)
              & min_precedes(X79,X82,X81) )
        & min_precedes(X79,X80,X81) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_26) ).

fof(sos_07,axiom,
    ! [X26,X27] :
      ( ( ~ atomic(X27)
        & leaf(X26,X27) )
     => ? [X28] :
          ( leaf_occ(X26,X28)
          & occurrence_of(X28,X27) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).

fof(sos_34,axiom,
    ~ atomic(tptp0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_34) ).

fof(sos_19,axiom,
    ! [X59,X60] :
      ( root_occ(X59,X60)
    <=> ? [X61] :
          ( root(X59,X61)
          & subactivity_occurrence(X59,X60)
          & occurrence_of(X60,X61) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_19) ).

fof(sos_16,axiom,
    ! [X52,X53] :
      ( occurrence_of(X52,X53)
     => ( arboreal(X52)
      <=> atomic(X53) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_16) ).

fof(sos_03,axiom,
    ! [X13,X14] :
      ( occurrence_of(X14,X13)
     => ( activity_occurrence(X14)
        & activity(X13) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_03) ).

fof(sos_09,axiom,
    ! [X32,X33,X34] :
      ( ( leaf_occ(X33,X32)
        & occurrence_of(X32,X34) )
     => ~ ? [X35] : min_precedes(X33,X35,X34) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_09) ).

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

fof(sos_12,axiom,
    ! [X42] :
      ( activity_occurrence(X42)
     => ? [X43] :
          ( occurrence_of(X42,X43)
          & activity(X43) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_12) ).

fof(c_0_14,negated_conjecture,
    ~ ! [X106] :
        ( occurrence_of(X106,tptp0)
       => ? [X107,X108] :
            ( leaf_occ(X108,X106)
            & min_precedes(X107,X108,tptp0)
            & ( occurrence_of(X108,tptp1)
              | occurrence_of(X108,tptp2) )
            & root_occ(X107,X106)
            & occurrence_of(X107,tptp3) ) ),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_15,plain,
    ! [X227] :
      ( ( ~ occurrence_of(X227,tptp0)
        | leaf_occ(esk15_1(X227),X227) )
      & ( ~ occurrence_of(X227,tptp0)
        | next_subocc(esk14_1(X227),esk15_1(X227),tptp0) )
      & ( ~ occurrence_of(X227,tptp0)
        | occurrence_of(esk15_1(X227),tptp1)
        | occurrence_of(esk15_1(X227),tptp2) )
      & ( ~ occurrence_of(X227,tptp0)
        | next_subocc(esk13_1(X227),esk14_1(X227),tptp0) )
      & ( ~ occurrence_of(X227,tptp0)
        | occurrence_of(esk14_1(X227),tptp4) )
      & ( ~ occurrence_of(X227,tptp0)
        | root_occ(esk13_1(X227),X227) )
      & ( ~ occurrence_of(X227,tptp0)
        | occurrence_of(esk13_1(X227),tptp3) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_32])])])])]) ).

fof(c_0_16,negated_conjecture,
    ! [X232,X233] :
      ( ( ~ leaf_occ(X233,esk16_0)
        | ~ min_precedes(X232,X233,tptp0)
        | ~ root_occ(X232,esk16_0)
        | ~ occurrence_of(X232,tptp3)
        | ~ occurrence_of(X233,tptp1) )
      & ( ~ leaf_occ(X233,esk16_0)
        | ~ min_precedes(X232,X233,tptp0)
        | ~ root_occ(X232,esk16_0)
        | ~ occurrence_of(X232,tptp3)
        | ~ occurrence_of(X233,tptp2) )
      & occurrence_of(esk16_0,tptp0) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])])]) ).

fof(c_0_17,plain,
    ! [X137,X138,X139] :
      ( X138 = X139
      | ~ occurrence_of(X137,X139)
      | ~ occurrence_of(X137,X138) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])]) ).

fof(c_0_18,plain,
    ! [X171,X172,X174,X175,X176] :
      ( ( leaf_occ(X174,X175)
        | ~ leaf(X174,X176)
        | ~ subactivity_occurrence(X174,X175)
        | ~ occurrence_of(X175,X176) )
      & ( ~ leaf_occ(X171,X172)
        | leaf(X171,esk9_2(X171,X172)) )
      & ( ~ leaf_occ(X171,X172)
        | subactivity_occurrence(X171,X172) )
      & ( ~ leaf_occ(X171,X172)
        | occurrence_of(X172,esk9_2(X171,X172)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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_18])])])])])])]) ).

cnf(c_0_19,plain,
    ( ~ occurrence_of(X1,tptp0)
    | leaf_occ(esk15_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    occurrence_of(esk16_0,tptp0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

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

cnf(c_0_22,plain,
    ( ~ leaf_occ(X2,X1)
    | occurrence_of(X1,esk9_2(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_23,negated_conjecture,
    leaf_occ(esk15_1(esk16_0),esk16_0),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

fof(c_0_24,plain,
    ! [X9,X10,X11,X12] :
      ( ( ~ min_precedes(X11,X12,X9)
        & arboreal(X11)
        & leaf_occ(X12,X10)
        & subactivity_occurrence(X11,X10)
        & occurrence_of(X10,X9) )
     => X12 = X11 ),
    inference(fof_simplification,[status(thm)],[sos_02]) ).

fof(c_0_25,plain,
    ! [X200,X201,X202,X203,X204,X205,X206] :
      ( ( next_subocc(X204,X205,X206)
        | ~ min_precedes(X204,X205,X206)
        | min_precedes(esk12_3(X204,X205,X206),X205,X206) )
      & ( next_subocc(X204,X205,X206)
        | ~ min_precedes(X204,X205,X206)
        | min_precedes(X204,esk12_3(X204,X205,X206),X206) )
      & ( ~ next_subocc(X200,X201,X202)
        | ~ min_precedes(X203,X201,X202)
        | ~ min_precedes(X200,X203,X202) )
      & ( ~ next_subocc(X200,X201,X202)
        | min_precedes(X200,X201,X202) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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_26])])])])])])]) ).

cnf(c_0_26,plain,
    ( ~ occurrence_of(X1,tptp0)
    | next_subocc(esk13_1(X1),esk14_1(X1),tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_27,plain,
    ! [X26,X27] :
      ( ( ~ atomic(X27)
        & leaf(X26,X27) )
     => ? [X28] :
          ( leaf_occ(X26,X28)
          & occurrence_of(X28,X27) ) ),
    inference(fof_simplification,[status(thm)],[sos_07]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ occurrence_of(esk16_0,X1)
    | X1 = tptp0 ),
    inference(spm,[status(thm)],[c_0_21,c_0_20]) ).

cnf(c_0_29,negated_conjecture,
    occurrence_of(esk16_0,esk9_2(esk15_1(esk16_0),esk16_0)),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

fof(c_0_30,plain,
    ~ atomic(tptp0),
    inference(fof_simplification,[status(thm)],[sos_34]) ).

fof(c_0_31,plain,
    ! [X117,X118,X119,X120] :
      ( X120 = X119
      | min_precedes(X119,X120,X117)
      | ~ arboreal(X119)
      | ~ leaf_occ(X120,X118)
      | ~ subactivity_occurrence(X119,X118)
      | ~ occurrence_of(X118,X117) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).

fof(c_0_32,plain,
    ! [X177,X178,X180,X181,X182] :
      ( ( root_occ(X180,X181)
        | ~ root(X180,X182)
        | ~ subactivity_occurrence(X180,X181)
        | ~ occurrence_of(X181,X182) )
      & ( ~ root_occ(X177,X178)
        | root(X177,esk10_2(X177,X178)) )
      & ( ~ root_occ(X177,X178)
        | subactivity_occurrence(X177,X178) )
      & ( ~ root_occ(X177,X178)
        | occurrence_of(X178,esk10_2(X177,X178)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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_19])])])])])])]) ).

cnf(c_0_33,plain,
    ( ~ occurrence_of(X1,tptp0)
    | root_occ(esk13_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_34,plain,
    ! [X167,X168] :
      ( ( ~ occurrence_of(X167,X168)
        | arboreal(X167)
        | ~ atomic(X168) )
      & ( ~ occurrence_of(X167,X168)
        | atomic(X168)
        | ~ arboreal(X167) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_16])])])]) ).

cnf(c_0_35,plain,
    ( ~ occurrence_of(X1,tptp0)
    | occurrence_of(esk13_1(X1),tptp3) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_36,plain,
    ! [X121,X122] :
      ( ( ~ occurrence_of(X122,X121)
        | activity_occurrence(X122) )
      & ( ~ occurrence_of(X122,X121)
        | activity(X121) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_03])])])]) ).

cnf(c_0_37,negated_conjecture,
    ( ~ leaf_occ(X1,esk16_0)
    | ~ min_precedes(X2,X1,tptp0)
    | ~ root_occ(X2,esk16_0)
    | ~ occurrence_of(X2,tptp3)
    | ~ occurrence_of(X1,tptp1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_38,plain,
    ( ~ occurrence_of(X1,tptp0)
    | occurrence_of(esk15_1(X1),tptp1)
    | occurrence_of(esk15_1(X1),tptp2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_39,negated_conjecture,
    ( ~ leaf_occ(X1,esk16_0)
    | ~ min_precedes(X2,X1,tptp0)
    | ~ root_occ(X2,esk16_0)
    | ~ occurrence_of(X2,tptp3)
    | ~ occurrence_of(X1,tptp2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_40,plain,
    ! [X140,X141,X142,X143] :
      ( ~ min_precedes(X141,X143,X142)
      | ~ leaf_occ(X141,X140)
      | ~ occurrence_of(X140,X142) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])])]) ).

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

cnf(c_0_42,negated_conjecture,
    next_subocc(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
    inference(spm,[status(thm)],[c_0_26,c_0_20]) ).

fof(c_0_43,plain,
    ! [X134,X135] :
      ( ( atomic(X135)
        | ~ leaf(X134,X135)
        | leaf_occ(X134,esk4_2(X134,X135)) )
      & ( atomic(X135)
        | ~ leaf(X134,X135)
        | occurrence_of(esk4_2(X134,X135),X135) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])])]) ).

cnf(c_0_44,plain,
    ( ~ leaf_occ(X1,X2)
    | leaf(X1,esk9_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_45,negated_conjecture,
    esk9_2(esk15_1(esk16_0),esk16_0) = tptp0,
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

fof(c_0_46,plain,
    ~ atomic(tptp0),
    inference(fof_nnf,[status(thm)],[c_0_30]) ).

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

cnf(c_0_48,plain,
    ( ~ root_occ(X1,X2)
    | subactivity_occurrence(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_49,negated_conjecture,
    root_occ(esk13_1(esk16_0),esk16_0),
    inference(spm,[status(thm)],[c_0_33,c_0_20]) ).

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

cnf(c_0_51,negated_conjecture,
    occurrence_of(esk13_1(esk16_0),tptp3),
    inference(spm,[status(thm)],[c_0_35,c_0_20]) ).

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

fof(c_0_53,plain,
    ! [X150] :
      ( ( ~ activity_occurrence(X150)
        | occurrence_of(X150,esk5_1(X150)) )
      & ( ~ activity_occurrence(X150)
        | activity(esk5_1(X150)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_12])])])])]) ).

cnf(c_0_54,plain,
    ( ~ occurrence_of(X1,X2)
    | activity_occurrence(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_55,negated_conjecture,
    ( ~ occurrence_of(X1,tptp3)
    | ~ occurrence_of(esk15_1(esk16_0),tptp1)
    | ~ root_occ(X1,esk16_0)
    | ~ min_precedes(X1,esk15_1(esk16_0),tptp0) ),
    inference(spm,[status(thm)],[c_0_37,c_0_23]) ).

cnf(c_0_56,negated_conjecture,
    ( occurrence_of(esk15_1(esk16_0),tptp2)
    | occurrence_of(esk15_1(esk16_0),tptp1) ),
    inference(spm,[status(thm)],[c_0_38,c_0_20]) ).

cnf(c_0_57,negated_conjecture,
    ( ~ occurrence_of(X1,tptp3)
    | ~ occurrence_of(esk15_1(esk16_0),tptp2)
    | ~ root_occ(X1,esk16_0)
    | ~ min_precedes(X1,esk15_1(esk16_0),tptp0) ),
    inference(spm,[status(thm)],[c_0_39,c_0_23]) ).

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

cnf(c_0_59,negated_conjecture,
    min_precedes(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_60,plain,
    ( ~ leaf(X1,X2)
    | atomic(X2)
    | occurrence_of(esk4_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_61,negated_conjecture,
    leaf(esk15_1(esk16_0),tptp0),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_23]),c_0_45]) ).

cnf(c_0_62,plain,
    ~ atomic(tptp0),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_63,negated_conjecture,
    ( ~ occurrence_of(esk16_0,X2)
    | ~ subactivity_occurrence(X1,esk16_0)
    | ~ arboreal(X1)
    | min_precedes(X1,esk15_1(esk16_0),X2)
    | X1 = esk15_1(esk16_0) ),
    inference(spm,[status(thm)],[c_0_47,c_0_23]) ).

cnf(c_0_64,negated_conjecture,
    subactivity_occurrence(esk13_1(esk16_0),esk16_0),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_65,negated_conjecture,
    arboreal(esk13_1(esk16_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).

cnf(c_0_66,plain,
    ( ~ activity_occurrence(X1)
    | occurrence_of(X1,esk5_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_53]) ).

cnf(c_0_67,negated_conjecture,
    activity_occurrence(esk16_0),
    inference(spm,[status(thm)],[c_0_54,c_0_20]) ).

cnf(c_0_68,negated_conjecture,
    ( ~ occurrence_of(X1,tptp3)
    | ~ root_occ(X1,esk16_0)
    | ~ min_precedes(X1,esk15_1(esk16_0),tptp0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).

cnf(c_0_69,negated_conjecture,
    ( ~ occurrence_of(X1,tptp0)
    | ~ leaf_occ(esk13_1(esk16_0),X1) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_70,negated_conjecture,
    occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),tptp0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]) ).

cnf(c_0_71,negated_conjecture,
    ( ~ occurrence_of(esk16_0,X1)
    | min_precedes(esk13_1(esk16_0),esk15_1(esk16_0),X1)
    | esk13_1(esk16_0) = esk15_1(esk16_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).

cnf(c_0_72,negated_conjecture,
    esk5_1(esk16_0) = tptp0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_66]),c_0_67])]) ).

cnf(c_0_73,negated_conjecture,
    ~ min_precedes(esk13_1(esk16_0),esk15_1(esk16_0),tptp0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_49]),c_0_51])]) ).

cnf(c_0_74,plain,
    ( ~ leaf(X1,X2)
    | atomic(X2)
    | leaf_occ(X1,esk4_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_75,negated_conjecture,
    ~ leaf_occ(esk13_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
    inference(spm,[status(thm)],[c_0_69,c_0_70]) ).

cnf(c_0_76,negated_conjecture,
    esk13_1(esk16_0) = esk15_1(esk16_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_66]),c_0_72]),c_0_67])]),c_0_73]) ).

cnf(c_0_77,negated_conjecture,
    leaf_occ(esk15_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_61]),c_0_62]) ).

cnf(c_0_78,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76]),c_0_77])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : PRO009+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.46  % Computer : n020.cluster.edu
% 0.18/5.46  % Model    : x86_64 x86_64
% 0.18/5.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.46  % Memory   : 8046.5625MB
% 0.18/5.46  % OS       : Linux 6.8.0-71-generic
% 0.18/5.46  % CPULimit : 300
% 0.18/5.46  % WCLimit  : 300
% 0.18/5.46  % DateTime : Mon Sep 21 03:43:08 UTC 2026
% 0.18/5.46  % CPUTime  : 
% 0.18/5.46  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.53  Running first-order theorem proving
% 0.23/5.53  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/5.61  % Version: 3.5.1
% 0.23/5.61  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.61  % Starting new_bool_3 with 300s (1) cores
% 0.23/5.61  % Starting new_bool_1 with 300s (1) cores
% 0.23/5.61  % Starting sh5l with 300s (1) cores
% 0.23/5.61  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1920616 completed with status 0
% 0.23/5.61  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/5.61  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.61  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.61  % No SInE strategy applied
% 0.23/5.61  % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.23/5.61  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.61  % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/5.61  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.23/5.61  % Starting new_bool_3 with 136s (1) cores
% 0.23/5.61  % Starting new_bool_1 with 136s (1) cores
% 0.23/5.61  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1920623 completed with status 0
% 0.23/5.61  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/5.61  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.61  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.61  % No SInE strategy applied
% 0.23/5.61  % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.23/5.61  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.61  % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/5.61  % Preprocessing time       : 0.003 s
% 0.23/5.61  % Presaturation interreduction done
% 0.23/5.61  
% 0.23/5.61  % Proof found!
% 0.23/5.61  % SZS status Theorem
% 0.23/5.61  % SZS output start CNFRefutation
% See solution above
% 0.23/5.61  % Parsed axioms                        : 46
% 0.23/5.61  % Removed by relevancy pruning/SinE    : 0
% 0.23/5.61  % Initial clauses                      : 82
% 0.23/5.61  % Removed in clause preprocessing      : 0
% 0.23/5.61  % Initial clauses in saturation        : 82
% 0.23/5.61  % Processed clauses                    : 400
% 0.23/5.61  % ...of these trivial                  : 5
% 0.23/5.61  % ...subsumed                          : 36
% 0.23/5.61  % ...remaining for further processing  : 359
% 0.23/5.61  % Other redundant clauses eliminated   : 0
% 0.23/5.61  % Clauses deleted for lack of memory   : 0
% 0.23/5.61  % Backward-subsumed                    : 6
% 0.23/5.61  % Backward-rewritten                   : 62
% 0.23/5.61  % Generated clauses                    : 509
% 0.23/5.61  % ...of the previous two non-redundant : 381
% 0.23/5.61  % ...aggressively subsumed             : 0
% 0.23/5.61  % Contextual simplify-reflections      : 2
% 0.23/5.61  % Paramodulations                      : 509
% 0.23/5.61  % Factorizations                       : 0
% 0.23/5.61  % NegExts                              : 0
% 0.23/5.61  % Equation resolutions                 : 0
% 0.23/5.61  % Disequality decompositions           : 0
% 0.23/5.61  % Total rewrite steps                  : 273
% 0.23/5.61  % ...of those cached                   : 214
% 0.23/5.61  % Propositional unsat checks           : 0
% 0.23/5.61  %    Propositional check models        : 0
% 0.23/5.61  %    Propositional check unsatisfiable : 0
% 0.23/5.61  %    Propositional clauses             : 0
% 0.23/5.61  %    Propositional clauses after purity: 0
% 0.23/5.61  %    Propositional unsat core size     : 0
% 0.23/5.61  %    Propositional preprocessing time  : 0.000
% 0.23/5.61  %    Propositional encoding time       : 0.000
% 0.23/5.61  %    Propositional solver time         : 0.000
% 0.23/5.61  %    Success case prop preproc time    : 0.000
% 0.23/5.61  %    Success case prop encoding time   : 0.000
% 0.23/5.61  %    Success case prop solver time     : 0.000
% 0.23/5.61  % Current number of processed clauses  : 209
% 0.23/5.61  %    Positive orientable unit clauses  : 51
% 0.23/5.61  %    Positive unorientable unit clauses: 0
% 0.23/5.61  %    Negative unit clauses             : 51
% 0.23/5.61  %    Non-unit-clauses                  : 107
% 0.23/5.61  % Current number of unprocessed clauses: 122
% 0.23/5.61  % ...number of literals in the above   : 244
% 0.23/5.61  % Current number of archived formulas  : 0
% 0.23/5.61  % Current number of archived clauses   : 150
% 0.23/5.61  % Clause-clause subsumption calls (NU) : 5933
% 0.23/5.61  % Rec. Clause-clause subsumption calls : 3651
% 0.23/5.61  % Non-unit clause-clause subsumptions  : 22
% 0.23/5.61  % Unit Clause-clause subsumption calls : 727
% 0.23/5.61  % Rewrite failures with RHS unbound    : 0
% 0.23/5.61  % BW rewrite match attempts            : 8
% 0.23/5.61  % BW rewrite match successes           : 7
% 0.23/5.61  % Condensation attempts                : 0
% 0.23/5.61  % Condensation successes               : 0
% 0.23/5.61  % Termbank termtop insertions          : 13589
% 0.23/5.61  % Search garbage collected termcells   : 1344
% 0.23/5.61  
% 0.23/5.61  % -------------------------------------------------
% 0.23/5.61  % User time                : 0.041 s
% 0.23/5.61  % System time              : 0.011 s
% 0.23/5.61  % Total time               : 0.052 s
% 0.23/5.61  % Maximum resident set size: 3996 pages
% 0.23/5.61  
% 0.23/5.61  % -------------------------------------------------
% 0.23/5.61  % User time                : 0.188 s
% 0.23/5.61  % System time              : 0.042 s
% 0.23/5.61  % Total time               : 0.230 s
% 0.23/5.61  % Maximum resident set size: 4864 pages
% 0.23/5.61  % E exiting
%------------------------------------------------------------------------------