↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n007.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:30 PM UTC 2026

% Result   : Theorem 1.93s 0.72s
% Output   : CNFRefutation 1.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   91 (  39 unt;   0 def)
%            Number of atoms       :  255 (  19 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :  279 ( 115   ~; 102   |;  47   &)
%                                         (   3 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-3 aty)
%            Number of variables   :  132 (   2 sgn  73   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ~ ? [X170] : occurrence_of(X170,tptp0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(sos_49,axiom,
    ! [X162] :
      ( occurrence_of(X162,tptp0)
     => ? [X163,X164] :
          ( next_subocc(X163,X164,tptp0)
          & leaf_occ(X164,X162)
          & ( occurrence_of(X164,tptp2)
            | occurrence_of(X164,tptp3) )
          & root_occ(X163,X162)
          & occurrence_of(X163,tptp4) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_49) ).

fof(sos_22,axiom,
    ! [X61,X62,X63] :
      ( next_subocc(X61,X62,X63)
    <=> ( ~ ? [X64] :
              ( min_precedes(X64,X62,X63)
              & min_precedes(X61,X64,X63) )
        & min_precedes(X61,X62,X63) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).

fof(sos_63,axiom,
    ! [X167,X168] :
      ( ( ~ leaf_occ(X167,X168)
        & arboreal(X167)
        & subactivity_occurrence(X167,X168)
        & occurrence_of(X168,tptp0) )
     => ? [X169] :
          ( next_subocc(X167,X169,tptp0)
          & occurrence_of(X169,tptp1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_63) ).

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

fof(sos_33,axiom,
    ! [X100,X101] :
      ( root_occ(X100,X101)
    <=> ? [X102] :
          ( root(X100,X102)
          & subactivity_occurrence(X100,X101)
          & occurrence_of(X101,X102) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_33) ).

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

fof(sos_52,axiom,
    atomic(tptp4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_52) ).

fof(sos_62,axiom,
    ! [X165,X166] :
      ( ( ~ leaf_occ(X165,X166)
        & arboreal(X165)
        & subactivity_occurrence(X165,X166)
        & occurrence_of(X166,tptp0) )
     => root_occ(X165,X166) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_62) ).

fof(sos_25,axiom,
    ! [X70,X71,X72] :
      ( min_precedes(X71,X72,X70)
     => ? [X73] :
          ( subactivity_occurrence(X72,X73)
          & subactivity_occurrence(X71,X73)
          & occurrence_of(X73,X70) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_25) ).

fof(sos_38,axiom,
    ! [X118,X119,X120] :
      ( ( root_occ(X119,X118)
        & occurrence_of(X118,X120) )
     => ~ ? [X121] : min_precedes(X121,X119,X120) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_38) ).

fof(sos_36,axiom,
    ! [X110,X111,X112,X113] :
      ( ( leaf_occ(X111,X112)
        & leaf_occ(X110,X112)
        & ~ atomic(X113)
        & occurrence_of(X112,X113) )
     => X110 = X111 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_36) ).

fof(sos_55,axiom,
    atomic(tptp1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_55) ).

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

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

fof(sos_60,axiom,
    tptp1 != tptp2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_60) ).

fof(sos_59,axiom,
    tptp1 != tptp3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_59) ).

fof(c_0_17,negated_conjecture,
    ~ ~ ? [X170] : occurrence_of(X170,tptp0),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_18,plain,
    ! [X349] :
      ( ( ~ occurrence_of(X349,tptp0)
        | next_subocc(esk17_1(X349),esk18_1(X349),tptp0) )
      & ( ~ occurrence_of(X349,tptp0)
        | leaf_occ(esk18_1(X349),X349) )
      & ( ~ occurrence_of(X349,tptp0)
        | occurrence_of(esk18_1(X349),tptp2)
        | occurrence_of(esk18_1(X349),tptp3) )
      & ( ~ occurrence_of(X349,tptp0)
        | root_occ(esk17_1(X349),X349) )
      & ( ~ occurrence_of(X349,tptp0)
        | occurrence_of(esk17_1(X349),tptp4) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_49])])])])]) ).

fof(c_0_19,negated_conjecture,
    occurrence_of(esk20_0,tptp0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).

fof(c_0_20,plain,
    ! [X235,X236,X237,X238,X239,X240,X241] :
      ( ( next_subocc(X239,X240,X241)
        | ~ min_precedes(X239,X240,X241)
        | min_precedes(esk8_3(X239,X240,X241),X240,X241) )
      & ( next_subocc(X239,X240,X241)
        | ~ min_precedes(X239,X240,X241)
        | min_precedes(X239,esk8_3(X239,X240,X241),X241) )
      & ( ~ next_subocc(X235,X236,X237)
        | ~ min_precedes(X238,X236,X237)
        | ~ min_precedes(X235,X238,X237) )
      & ( ~ next_subocc(X235,X236,X237)
        | min_precedes(X235,X236,X237) ) ),
    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_22])])])])])])]) ).

cnf(c_0_21,plain,
    ( ~ occurrence_of(X1,tptp0)
    | next_subocc(esk17_1(X1),esk18_1(X1),tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    occurrence_of(esk20_0,tptp0),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

fof(c_0_23,plain,
    ! [X167,X168] :
      ( ( ~ leaf_occ(X167,X168)
        & arboreal(X167)
        & subactivity_occurrence(X167,X168)
        & occurrence_of(X168,tptp0) )
     => ? [X169] :
          ( next_subocc(X167,X169,tptp0)
          & occurrence_of(X169,tptp1) ) ),
    inference(fof_simplification,[status(thm)],[sos_63]) ).

fof(c_0_24,plain,
    ! [X301,X302,X303,X304] :
      ( ~ min_precedes(X302,X304,X303)
      | ~ leaf_occ(X302,X301)
      | ~ occurrence_of(X301,X303) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_37])])])]) ).

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

cnf(c_0_26,negated_conjecture,
    next_subocc(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

fof(c_0_27,plain,
    ! [X354,X355] :
      ( ( leaf_occ(X354,X355)
        | ~ arboreal(X354)
        | ~ subactivity_occurrence(X354,X355)
        | ~ occurrence_of(X355,tptp0)
        | next_subocc(X354,esk19_1(X354),tptp0) )
      & ( leaf_occ(X354,X355)
        | ~ arboreal(X354)
        | ~ subactivity_occurrence(X354,X355)
        | ~ occurrence_of(X355,tptp0)
        | occurrence_of(esk19_1(X354),tptp1) ) ),
    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)],[c_0_23])])])])])])]) ).

fof(c_0_28,plain,
    ! [X281,X282,X284,X285,X286] :
      ( ( root_occ(X284,X285)
        | ~ root(X284,X286)
        | ~ subactivity_occurrence(X284,X285)
        | ~ occurrence_of(X285,X286) )
      & ( ~ root_occ(X281,X282)
        | root(X281,esk14_2(X281,X282)) )
      & ( ~ root_occ(X281,X282)
        | subactivity_occurrence(X281,X282) )
      & ( ~ root_occ(X281,X282)
        | occurrence_of(X282,esk14_2(X281,X282)) ) ),
    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_33])])])])])])]) ).

cnf(c_0_29,plain,
    ( ~ occurrence_of(X1,tptp0)
    | root_occ(esk17_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_30,plain,
    ! [X187,X188] :
      ( ( ~ occurrence_of(X187,X188)
        | arboreal(X187)
        | ~ atomic(X188) )
      & ( ~ occurrence_of(X187,X188)
        | atomic(X188)
        | ~ arboreal(X187) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).

cnf(c_0_31,plain,
    ( ~ occurrence_of(X1,tptp0)
    | occurrence_of(esk17_1(X1),tptp4) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

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

cnf(c_0_33,negated_conjecture,
    min_precedes(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_34,plain,
    ( ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | leaf_occ(X1,X2)
    | next_subocc(X1,esk19_1(X1),tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

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

cnf(c_0_36,negated_conjecture,
    root_occ(esk17_1(esk20_0),esk20_0),
    inference(spm,[status(thm)],[c_0_29,c_0_22]) ).

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

cnf(c_0_38,negated_conjecture,
    occurrence_of(esk17_1(esk20_0),tptp4),
    inference(spm,[status(thm)],[c_0_31,c_0_22]) ).

cnf(c_0_39,plain,
    atomic(tptp4),
    inference(split_conjunct,[status(thm)],[sos_52]) ).

cnf(c_0_40,negated_conjecture,
    ( ~ occurrence_of(X1,tptp0)
    | ~ leaf_occ(esk17_1(esk20_0),X1) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,esk20_0)
    | next_subocc(X1,esk19_1(X1),tptp0)
    | leaf_occ(X1,esk20_0) ),
    inference(spm,[status(thm)],[c_0_34,c_0_22]) ).

cnf(c_0_42,negated_conjecture,
    subactivity_occurrence(esk17_1(esk20_0),esk20_0),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_43,negated_conjecture,
    arboreal(esk17_1(esk20_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).

cnf(c_0_44,negated_conjecture,
    ~ leaf_occ(esk17_1(esk20_0),esk20_0),
    inference(spm,[status(thm)],[c_0_40,c_0_22]) ).

fof(c_0_45,plain,
    ! [X165,X166] :
      ( ( ~ leaf_occ(X165,X166)
        & arboreal(X165)
        & subactivity_occurrence(X165,X166)
        & occurrence_of(X166,tptp0) )
     => root_occ(X165,X166) ),
    inference(fof_simplification,[status(thm)],[sos_62]) ).

fof(c_0_46,plain,
    ! [X251,X252,X253] :
      ( ( ~ min_precedes(X252,X253,X251)
        | subactivity_occurrence(X253,esk10_3(X251,X252,X253)) )
      & ( ~ min_precedes(X252,X253,X251)
        | subactivity_occurrence(X252,esk10_3(X251,X252,X253)) )
      & ( ~ min_precedes(X252,X253,X251)
        | occurrence_of(esk10_3(X251,X252,X253),X251) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_25])])])])]) ).

cnf(c_0_47,negated_conjecture,
    next_subocc(esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),c_0_44]) ).

cnf(c_0_48,plain,
    ( ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | leaf_occ(X1,X2)
    | occurrence_of(esk19_1(X1),tptp1) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

fof(c_0_49,plain,
    ! [X305,X306,X307,X308] :
      ( ~ min_precedes(X308,X306,X307)
      | ~ root_occ(X306,X305)
      | ~ occurrence_of(X305,X307) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_38])])])]) ).

fof(c_0_50,plain,
    ! [X352,X353] :
      ( root_occ(X352,X353)
      | leaf_occ(X352,X353)
      | ~ arboreal(X352)
      | ~ subactivity_occurrence(X352,X353)
      | ~ occurrence_of(X353,tptp0) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])]) ).

cnf(c_0_51,plain,
    ( ~ min_precedes(X2,X3,X1)
    | occurrence_of(esk10_3(X1,X2,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_52,negated_conjecture,
    min_precedes(esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)),tptp0),
    inference(spm,[status(thm)],[c_0_25,c_0_47]) ).

cnf(c_0_53,negated_conjecture,
    ( ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,esk20_0)
    | occurrence_of(esk19_1(X1),tptp1)
    | leaf_occ(X1,esk20_0) ),
    inference(spm,[status(thm)],[c_0_48,c_0_22]) ).

cnf(c_0_54,plain,
    ( ~ min_precedes(X4,X3,X2)
    | ~ root_occ(X3,X1)
    | ~ occurrence_of(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_49]) ).

fof(c_0_55,plain,
    ! [X110,X111,X112,X113] :
      ( ( leaf_occ(X111,X112)
        & leaf_occ(X110,X112)
        & ~ atomic(X113)
        & occurrence_of(X112,X113) )
     => X110 = X111 ),
    inference(fof_simplification,[status(thm)],[sos_36]) ).

cnf(c_0_56,plain,
    ( ~ arboreal(X2)
    | ~ subactivity_occurrence(X2,X1)
    | ~ occurrence_of(X1,tptp0)
    | root_occ(X2,X1)
    | leaf_occ(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_50]) ).

cnf(c_0_57,negated_conjecture,
    occurrence_of(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))),tptp0),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_58,plain,
    ( ~ min_precedes(X3,X1,X2)
    | subactivity_occurrence(X1,esk10_3(X2,X3,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_59,negated_conjecture,
    occurrence_of(esk19_1(esk17_1(esk20_0)),tptp1),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_42]),c_0_43])]),c_0_44]) ).

cnf(c_0_60,plain,
    atomic(tptp1),
    inference(split_conjunct,[status(thm)],[sos_55]) ).

cnf(c_0_61,negated_conjecture,
    ( ~ occurrence_of(X1,tptp0)
    | ~ root_occ(esk19_1(esk17_1(esk20_0)),X1) ),
    inference(spm,[status(thm)],[c_0_54,c_0_52]) ).

fof(c_0_62,plain,
    ! [X297,X298,X299,X300] :
      ( X297 = X298
      | ~ leaf_occ(X298,X299)
      | ~ leaf_occ(X297,X299)
      | atomic(X300)
      | ~ occurrence_of(X299,X300) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_55])])]) ).

cnf(c_0_63,negated_conjecture,
    ( ~ arboreal(X1)
    | ~ subactivity_occurrence(X1,esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))))
    | root_occ(X1,esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))))
    | leaf_occ(X1,esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_64,negated_conjecture,
    subactivity_occurrence(esk19_1(esk17_1(esk20_0)),esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),
    inference(spm,[status(thm)],[c_0_58,c_0_52]) ).

cnf(c_0_65,negated_conjecture,
    arboreal(esk19_1(esk17_1(esk20_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_59]),c_0_60])]) ).

cnf(c_0_66,negated_conjecture,
    ~ root_occ(esk19_1(esk17_1(esk20_0)),esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),
    inference(spm,[status(thm)],[c_0_61,c_0_57]) ).

cnf(c_0_67,plain,
    ( ~ leaf_occ(X4,X1)
    | ~ leaf_occ(X3,X1)
    | ~ occurrence_of(X1,X2)
    | X3 = X4
    | atomic(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_62]) ).

cnf(c_0_68,negated_conjecture,
    leaf_occ(esk19_1(esk17_1(esk20_0)),esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]),c_0_66]) ).

cnf(c_0_69,plain,
    ( ~ occurrence_of(X1,tptp0)
    | leaf_occ(esk18_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_70,plain,
    ~ atomic(tptp0),
    inference(fof_simplification,[status(thm)],[sos_51]) ).

cnf(c_0_71,negated_conjecture,
    ( ~ occurrence_of(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))),X2)
    | ~ leaf_occ(X1,esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))))
    | atomic(X2)
    | X1 = esk19_1(esk17_1(esk20_0)) ),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_72,negated_conjecture,
    leaf_occ(esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),
    inference(spm,[status(thm)],[c_0_69,c_0_57]) ).

fof(c_0_73,plain,
    ~ atomic(tptp0),
    inference(fof_nnf,[status(thm)],[c_0_70]) ).

fof(c_0_74,plain,
    ! [X175,X176,X177] :
      ( X176 = X177
      | ~ occurrence_of(X175,X177)
      | ~ occurrence_of(X175,X176) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).

cnf(c_0_75,plain,
    ( ~ occurrence_of(X1,tptp0)
    | occurrence_of(esk18_1(X1),tptp2)
    | occurrence_of(esk18_1(X1),tptp3) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_76,negated_conjecture,
    ( ~ occurrence_of(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))),X1)
    | atomic(X1)
    | esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))) = esk19_1(esk17_1(esk20_0)) ),
    inference(spm,[status(thm)],[c_0_71,c_0_72]) ).

cnf(c_0_77,plain,
    ~ atomic(tptp0),
    inference(split_conjunct,[status(thm)],[c_0_73]) ).

fof(c_0_78,plain,
    tptp1 != tptp2,
    inference(fof_simplification,[status(thm)],[sos_60]) ).

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

cnf(c_0_80,negated_conjecture,
    ( occurrence_of(esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),tptp3)
    | occurrence_of(esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),tptp2) ),
    inference(spm,[status(thm)],[c_0_75,c_0_57]) ).

cnf(c_0_81,negated_conjecture,
    esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))) = esk19_1(esk17_1(esk20_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_57]),c_0_77]) ).

fof(c_0_82,plain,
    tptp1 != tptp2,
    inference(fof_nnf,[status(thm)],[c_0_78]) ).

fof(c_0_83,plain,
    tptp1 != tptp3,
    inference(fof_simplification,[status(thm)],[sos_59]) ).

cnf(c_0_84,negated_conjecture,
    ( ~ occurrence_of(esk19_1(esk17_1(esk20_0)),X1)
    | X1 = tptp1 ),
    inference(spm,[status(thm)],[c_0_79,c_0_59]) ).

cnf(c_0_85,negated_conjecture,
    ( occurrence_of(esk19_1(esk17_1(esk20_0)),tptp2)
    | occurrence_of(esk19_1(esk17_1(esk20_0)),tptp3) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81]),c_0_81]) ).

cnf(c_0_86,plain,
    tptp1 != tptp2,
    inference(split_conjunct,[status(thm)],[c_0_82]) ).

fof(c_0_87,plain,
    tptp1 != tptp3,
    inference(fof_nnf,[status(thm)],[c_0_83]) ).

cnf(c_0_88,negated_conjecture,
    occurrence_of(esk19_1(esk17_1(esk20_0)),tptp3),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]) ).

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

cnf(c_0_90,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_88]),c_0_89]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PRO005+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n007.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 03:39:36 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/0.41  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.93/0.72  % Version: 3.5.1
% 1.93/0.72  % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.93/0.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.93/0.72  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.93/0.72  % Starting new_bool_3 with 300s (1) cores
% 1.93/0.72  % Starting new_bool_1 with 300s (1) cores
% 1.93/0.72  % Starting sh5l with 300s (1) cores
% 1.93/0.72  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 91416 completed with status 0
% 1.93/0.72  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.93/0.72  % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.93/0.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.93/0.72  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.93/0.72  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.93/0.72  % No SInE strategy applied
% 1.93/0.72  % Search class: FGHSF-FFMM32-SFFFFFNN
% 1.93/0.72  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.93/0.72  % Starting SubtermCWHack with 136s (1) cores
% 1.93/0.72  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.93/0.72  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 1.93/0.72  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 1.93/0.72  % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 1.93/0.72  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 91424 completed with status 0
% 1.93/0.72  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 1.93/0.72  % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.93/0.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.93/0.72  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.93/0.72  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.93/0.72  % No SInE strategy applied
% 1.93/0.72  % Search class: FGHSF-FFMM32-SFFFFFNN
% 1.93/0.72  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.93/0.72  % Starting SubtermCWHack with 136s (1) cores
% 1.93/0.72  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.93/0.72  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 1.93/0.72  % Preprocessing time       : 0.003 s
% 1.93/0.72  % Presaturation interreduction done
% 1.93/0.72  
% 1.93/0.72  % Proof found!
% 1.93/0.72  % SZS status Theorem
% 1.93/0.72  % SZS output start CNFRefutation
% See solution above
% 1.93/0.72  % Parsed axioms                        : 65
% 1.93/0.72  % Removed by relevancy pruning/SinE    : 0
% 1.93/0.72  % Initial clauses                      : 103
% 1.93/0.72  % Removed in clause preprocessing      : 0
% 1.93/0.72  % Initial clauses in saturation        : 103
% 1.93/0.72  % Processed clauses                    : 2400
% 1.93/0.72  % ...of these trivial                  : 58
% 1.93/0.72  % ...subsumed                          : 676
% 1.93/0.72  % ...remaining for further processing  : 1666
% 1.93/0.72  % Other redundant clauses eliminated   : 0
% 1.93/0.72  % Clauses deleted for lack of memory   : 0
% 1.93/0.72  % Backward-subsumed                    : 5
% 1.93/0.72  % Backward-rewritten                   : 295
% 1.93/0.72  % Generated clauses                    : 5309
% 1.93/0.72  % ...of the previous two non-redundant : 4775
% 1.93/0.72  % ...aggressively subsumed             : 0
% 1.93/0.72  % Contextual simplify-reflections      : 3
% 1.93/0.72  % Paramodulations                      : 5304
% 1.93/0.72  % Factorizations                       : 5
% 1.93/0.72  % NegExts                              : 0
% 1.93/0.72  % Equation resolutions                 : 0
% 1.93/0.72  % Disequality decompositions           : 0
% 1.93/0.72  % Total rewrite steps                  : 1849
% 1.93/0.72  % ...of those cached                   : 1658
% 1.93/0.72  % Propositional unsat checks           : 0
% 1.93/0.72  %    Propositional check models        : 0
% 1.93/0.72  %    Propositional check unsatisfiable : 0
% 1.93/0.72  %    Propositional clauses             : 0
% 1.93/0.72  %    Propositional clauses after purity: 0
% 1.93/0.72  %    Propositional unsat core size     : 0
% 1.93/0.72  %    Propositional preprocessing time  : 0.000
% 1.93/0.72  %    Propositional encoding time       : 0.000
% 1.93/0.72  %    Propositional solver time         : 0.000
% 1.93/0.72  %    Success case prop preproc time    : 0.000
% 1.93/0.72  %    Success case prop encoding time   : 0.000
% 1.93/0.72  %    Success case prop solver time     : 0.000
% 1.93/0.72  % Current number of processed clauses  : 1263
% 1.93/0.72  %    Positive orientable unit clauses  : 340
% 1.93/0.72  %    Positive unorientable unit clauses: 0
% 1.93/0.72  %    Negative unit clauses             : 281
% 1.93/0.72  %    Non-unit-clauses                  : 642
% 1.93/0.72  % Current number of unprocessed clauses: 2328
% 1.93/0.72  % ...number of literals in the above   : 6298
% 1.93/0.72  % Current number of archived formulas  : 0
% 1.93/0.72  % Current number of archived clauses   : 403
% 1.93/0.72  % Clause-clause subsumption calls (NU) : 67514
% 1.93/0.72  % Rec. Clause-clause subsumption calls : 39569
% 1.93/0.72  % Non-unit clause-clause subsumptions  : 471
% 1.93/0.72  % Unit Clause-clause subsumption calls : 4233
% 1.93/0.72  % Rewrite failures with RHS unbound    : 0
% 1.93/0.72  % BW rewrite match attempts            : 368
% 1.93/0.72  % BW rewrite match successes           : 42
% 1.93/0.72  % Condensation attempts                : 0
% 1.93/0.72  % Condensation successes               : 0
% 1.93/0.72  % Termbank termtop insertions          : 133010
% 1.93/0.72  % Search garbage collected termcells   : 1859
% 1.93/0.72  
% 1.93/0.72  % -------------------------------------------------
% 1.93/0.72  % User time                : 0.227 s
% 1.93/0.72  % System time              : 0.019 s
% 1.93/0.72  % Total time               : 0.246 s
% 1.93/0.72  % Maximum resident set size: 3812 pages
% 1.93/0.72  
% 1.93/0.72  % -------------------------------------------------
% 1.93/0.72  % User time                : 1.245 s
% 1.93/0.72  % System time              : 0.061 s
% 1.93/0.72  % Total time               : 1.306 s
% 1.93/0.72  % Maximum resident set size: 4864 pages
% 1.93/0.72  % E exiting
%------------------------------------------------------------------------------