TSTP Solution File: PRO012+3 by E---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.2.0
% Problem  : PRO012+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n017.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  : 300s
% DateTime : Mon Jun 24 13:39:59 EDT 2024

% Result   : Theorem 1.37s 0.66s
% Output   : CNFRefutation 1.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   91 (  29 unt;   0 def)
%            Number of atoms       :  292 (  16 equ)
%            Maximal formula atoms :   17 (   3 avg)
%            Number of connectives :  329 ( 128   ~; 128   |;  55   &)
%                                         (   3 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   6 con; 0-3 aty)
%            Number of variables   :  163 (   5 sgn  84   !;  15   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ! [X167] :
      ( occurrence_of(X167,tptp0)
     => ? [X168,X169] :
          ( occurrence_of(X168,tptp3)
          & root_occ(X168,X167)
          & ( occurrence_of(X169,tptp2)
            | occurrence_of(X169,tptp1) )
          & min_precedes(X168,X169,tptp0) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',goals) ).

fof(sos_49,axiom,
    ! [X162] :
      ( occurrence_of(X162,tptp0)
     => ? [X163,X164,X165] :
          ( occurrence_of(X163,tptp3)
          & root_occ(X163,X162)
          & occurrence_of(X164,tptp4)
          & min_precedes(X163,X164,tptp0)
          & ( occurrence_of(X165,tptp2)
            | occurrence_of(X165,tptp1) )
          & min_precedes(X164,X165,tptp0)
          & ! [X166] :
              ( min_precedes(X163,X166,tptp0)
             => ( X166 = X164
                | X166 = X165 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_49) ).

fof(sos_27,axiom,
    ! [X77,X78] :
      ( ( occurrence_of(X78,X77)
        & ~ atomic(X77) )
     => ? [X79] :
          ( root(X79,X77)
          & subactivity_occurrence(X79,X78) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_27) ).

fof(sos_51,axiom,
    ~ atomic(tptp0),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_51) ).

fof(sos_11,axiom,
    ! [X24,X25,X26] :
      ( min_precedes(X25,X26,X24)
     => ? [X27,X28] :
          ( subactivity(X27,X24)
          & subactivity(X28,X24)
          & atocc(X25,X27)
          & atocc(X26,X28) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_11) ).

fof(sos_23,axiom,
    ! [X65,X66] :
      ( atocc(X65,X66)
    <=> ? [X67] :
          ( subactivity(X66,X67)
          & atomic(X67)
          & occurrence_of(X65,X67) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_23) ).

fof(sos_33,axiom,
    ! [X100,X101] :
      ( root_occ(X100,X101)
    <=> ? [X102] :
          ( occurrence_of(X101,X102)
          & subactivity_occurrence(X100,X101)
          & root(X100,X102) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_33) ).

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/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_25) ).

fof(sos_07,axiom,
    ! [X17,X18] :
      ( occurrence_of(X17,X18)
     => ( arboreal(X17)
      <=> atomic(X18) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_07) ).

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/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_29) ).

fof(sos_28,axiom,
    ! [X80,X81,X82,X83] :
      ( ( occurrence_of(X81,X80)
        & arboreal(X82)
        & arboreal(X83)
        & subactivity_occurrence(X82,X81)
        & subactivity_occurrence(X83,X81) )
     => ( min_precedes(X82,X83,X80)
        | min_precedes(X83,X82,X80)
        | X82 = X83 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_28) ).

fof(sos_35,axiom,
    ! [X106,X107,X108,X109] :
      ( ( occurrence_of(X108,X109)
        & root_occ(X106,X108)
        & root_occ(X107,X108) )
     => X106 = X107 ),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_35) ).

fof(sos_38,axiom,
    ! [X118,X119,X120] :
      ( ( occurrence_of(X118,X120)
        & root_occ(X119,X118) )
     => ~ ? [X121] : min_precedes(X121,X119,X120) ),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_38) ).

fof(sos_55,axiom,
    atomic(tptp3),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_55) ).

fof(sos_14,axiom,
    ! [X36,X37,X38] :
      ( min_precedes(X36,X37,X38)
     => ~ root(X37,X38) ),
    file('/export/starexec/sandbox2/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p',sos_14) ).

fof(c_0_15,negated_conjecture,
    ~ ! [X167] :
        ( occurrence_of(X167,tptp0)
       => ? [X168,X169] :
            ( occurrence_of(X168,tptp3)
            & root_occ(X168,X167)
            & ( occurrence_of(X169,tptp2)
              | occurrence_of(X169,tptp1) )
            & min_precedes(X168,X169,tptp0) ) ),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_16,plain,
    ! [X181,X185] :
      ( ( occurrence_of(esk3_1(X181),tptp3)
        | ~ occurrence_of(X181,tptp0) )
      & ( root_occ(esk3_1(X181),X181)
        | ~ occurrence_of(X181,tptp0) )
      & ( occurrence_of(esk4_1(X181),tptp4)
        | ~ occurrence_of(X181,tptp0) )
      & ( min_precedes(esk3_1(X181),esk4_1(X181),tptp0)
        | ~ occurrence_of(X181,tptp0) )
      & ( occurrence_of(esk5_1(X181),tptp2)
        | occurrence_of(esk5_1(X181),tptp1)
        | ~ occurrence_of(X181,tptp0) )
      & ( min_precedes(esk4_1(X181),esk5_1(X181),tptp0)
        | ~ occurrence_of(X181,tptp0) )
      & ( ~ min_precedes(esk3_1(X181),X185,tptp0)
        | X185 = esk4_1(X181)
        | X185 = esk5_1(X181)
        | ~ occurrence_of(X181,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)],[sos_49])])])])])]) ).

fof(c_0_17,negated_conjecture,
    ! [X171,X172] :
      ( occurrence_of(esk1_0,tptp0)
      & ( ~ occurrence_of(X172,tptp2)
        | ~ occurrence_of(X171,tptp3)
        | ~ root_occ(X171,esk1_0)
        | ~ min_precedes(X171,X172,tptp0) )
      & ( ~ occurrence_of(X172,tptp1)
        | ~ occurrence_of(X171,tptp3)
        | ~ root_occ(X171,esk1_0)
        | ~ min_precedes(X171,X172,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_15])])])])])]) ).

fof(c_0_18,plain,
    ! [X77,X78] :
      ( ( occurrence_of(X78,X77)
        & ~ atomic(X77) )
     => ? [X79] :
          ( root(X79,X77)
          & subactivity_occurrence(X79,X78) ) ),
    inference(fof_simplification,[status(thm)],[sos_27]) ).

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

fof(c_0_20,plain,
    ! [X269,X270,X271] :
      ( ( subactivity(esk11_3(X269,X270,X271),X269)
        | ~ min_precedes(X270,X271,X269) )
      & ( subactivity(esk12_3(X269,X270,X271),X269)
        | ~ min_precedes(X270,X271,X269) )
      & ( atocc(X270,esk11_3(X269,X270,X271))
        | ~ min_precedes(X270,X271,X269) )
      & ( atocc(X271,esk12_3(X269,X270,X271))
        | ~ min_precedes(X270,X271,X269) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_11])])])])]) ).

cnf(c_0_21,plain,
    ( min_precedes(esk4_1(X1),esk5_1(X1),tptp0)
    | ~ occurrence_of(X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_22,negated_conjecture,
    occurrence_of(esk1_0,tptp0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_23,plain,
    ! [X235,X236] :
      ( ( root(esk9_2(X235,X236),X235)
        | ~ occurrence_of(X236,X235)
        | atomic(X235) )
      & ( subactivity_occurrence(esk9_2(X235,X236),X236)
        | ~ occurrence_of(X236,X235)
        | atomic(X235) ) ),
    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_18])])])])]) ).

fof(c_0_24,plain,
    ~ atomic(tptp0),
    inference(fof_nnf,[status(thm)],[c_0_19]) ).

fof(c_0_25,plain,
    ! [X277,X278,X280,X281,X282] :
      ( ( subactivity(X278,esk14_2(X277,X278))
        | ~ atocc(X277,X278) )
      & ( atomic(esk14_2(X277,X278))
        | ~ atocc(X277,X278) )
      & ( occurrence_of(X277,esk14_2(X277,X278))
        | ~ atocc(X277,X278) )
      & ( ~ subactivity(X281,X282)
        | ~ atomic(X282)
        | ~ occurrence_of(X280,X282)
        | atocc(X280,X281) ) ),
    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_23])])])])])])]) ).

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

cnf(c_0_27,negated_conjecture,
    min_precedes(esk4_1(esk1_0),esk5_1(esk1_0),tptp0),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

fof(c_0_28,plain,
    ! [X189,X190,X192,X193,X194] :
      ( ( occurrence_of(X190,esk6_2(X189,X190))
        | ~ root_occ(X189,X190) )
      & ( subactivity_occurrence(X189,X190)
        | ~ root_occ(X189,X190) )
      & ( root(X189,esk6_2(X189,X190))
        | ~ root_occ(X189,X190) )
      & ( ~ occurrence_of(X193,X194)
        | ~ subactivity_occurrence(X192,X193)
        | ~ root(X192,X194)
        | root_occ(X192,X193) ) ),
    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,
    ( subactivity_occurrence(esk9_2(X1,X2),X2)
    | atomic(X1)
    | ~ occurrence_of(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_30,plain,
    ~ atomic(tptp0),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

fof(c_0_31,plain,
    ! [X173,X174,X175] :
      ( ( occurrence_of(esk2_3(X173,X174,X175),X173)
        | ~ min_precedes(X174,X175,X173) )
      & ( subactivity_occurrence(X174,esk2_3(X173,X174,X175))
        | ~ min_precedes(X174,X175,X173) )
      & ( subactivity_occurrence(X175,esk2_3(X173,X174,X175))
        | ~ min_precedes(X174,X175,X173) ) ),
    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])])])])]) ).

fof(c_0_32,plain,
    ! [X257,X258] :
      ( ( ~ arboreal(X257)
        | atomic(X258)
        | ~ occurrence_of(X257,X258) )
      & ( ~ atomic(X258)
        | arboreal(X257)
        | ~ occurrence_of(X257,X258) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).

cnf(c_0_33,plain,
    ( occurrence_of(X1,esk14_2(X1,X2))
    | ~ atocc(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_34,negated_conjecture,
    atocc(esk5_1(esk1_0),esk12_3(tptp0,esk4_1(esk1_0),esk5_1(esk1_0))),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_35,plain,
    ( atomic(esk14_2(X1,X2))
    | ~ atocc(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

fof(c_0_36,plain,
    ! [X177,X178,X179,X180] :
      ( ~ min_precedes(X177,X178,X179)
      | ~ occurrence_of(X180,X179)
      | ~ subactivity_occurrence(X178,X180)
      | subactivity_occurrence(X177,X180) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])])]) ).

cnf(c_0_37,plain,
    ( min_precedes(esk3_1(X1),esk4_1(X1),tptp0)
    | ~ occurrence_of(X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_38,plain,
    ( root_occ(X3,X1)
    | ~ occurrence_of(X1,X2)
    | ~ subactivity_occurrence(X3,X1)
    | ~ root(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_39,negated_conjecture,
    subactivity_occurrence(esk9_2(tptp0,esk1_0),esk1_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_22]),c_0_30]) ).

cnf(c_0_40,plain,
    ( root(esk9_2(X1,X2),X1)
    | atomic(X1)
    | ~ occurrence_of(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

fof(c_0_41,plain,
    ! [X260,X261,X262,X263] :
      ( ~ occurrence_of(X261,X260)
      | ~ arboreal(X262)
      | ~ arboreal(X263)
      | ~ subactivity_occurrence(X262,X261)
      | ~ subactivity_occurrence(X263,X261)
      | min_precedes(X262,X263,X260)
      | min_precedes(X263,X262,X260)
      | X262 = X263 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_28])])]) ).

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

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

cnf(c_0_44,negated_conjecture,
    occurrence_of(esk5_1(esk1_0),esk14_2(esk5_1(esk1_0),esk12_3(tptp0,esk4_1(esk1_0),esk5_1(esk1_0)))),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_45,negated_conjecture,
    atomic(esk14_2(esk5_1(esk1_0),esk12_3(tptp0,esk4_1(esk1_0),esk5_1(esk1_0)))),
    inference(spm,[status(thm)],[c_0_35,c_0_34]) ).

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

cnf(c_0_47,negated_conjecture,
    min_precedes(esk3_1(esk1_0),esk4_1(esk1_0),tptp0),
    inference(spm,[status(thm)],[c_0_37,c_0_22]) ).

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

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

cnf(c_0_50,plain,
    ( occurrence_of(esk3_1(X1),tptp3)
    | ~ occurrence_of(X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_51,plain,
    ( root_occ(esk3_1(X1),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_52,plain,
    ! [X195,X196,X197,X198] :
      ( ~ occurrence_of(X197,X198)
      | ~ root_occ(X195,X197)
      | ~ root_occ(X196,X197)
      | X195 = X196 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_35])])]) ).

cnf(c_0_53,negated_conjecture,
    ( root_occ(esk9_2(tptp0,esk1_0),esk1_0)
    | ~ root(esk9_2(tptp0,esk1_0),X1)
    | ~ occurrence_of(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_54,negated_conjecture,
    root(esk9_2(tptp0,esk1_0),tptp0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_22]),c_0_30]) ).

fof(c_0_55,plain,
    ! [X199,X200,X201,X202] :
      ( ~ occurrence_of(X199,X201)
      | ~ root_occ(X200,X199)
      | ~ min_precedes(X202,X200,X201) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_38])])])]) ).

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

cnf(c_0_57,negated_conjecture,
    subactivity_occurrence(esk5_1(esk1_0),esk2_3(tptp0,esk4_1(esk1_0),esk5_1(esk1_0))),
    inference(spm,[status(thm)],[c_0_42,c_0_27]) ).

cnf(c_0_58,negated_conjecture,
    arboreal(esk5_1(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).

cnf(c_0_59,negated_conjecture,
    ( subactivity_occurrence(esk3_1(esk1_0),X1)
    | ~ subactivity_occurrence(esk4_1(esk1_0),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_60,negated_conjecture,
    occurrence_of(esk2_3(tptp0,esk4_1(esk1_0),esk5_1(esk1_0)),tptp0),
    inference(spm,[status(thm)],[c_0_48,c_0_27]) ).

cnf(c_0_61,negated_conjecture,
    subactivity_occurrence(esk4_1(esk1_0),esk2_3(tptp0,esk4_1(esk1_0),esk5_1(esk1_0))),
    inference(spm,[status(thm)],[c_0_49,c_0_27]) ).

cnf(c_0_62,negated_conjecture,
    occurrence_of(esk3_1(esk1_0),tptp3),
    inference(spm,[status(thm)],[c_0_50,c_0_22]) ).

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

cnf(c_0_64,negated_conjecture,
    ( ~ occurrence_of(X1,tptp1)
    | ~ occurrence_of(X2,tptp3)
    | ~ root_occ(X2,esk1_0)
    | ~ min_precedes(X2,X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_65,negated_conjecture,
    root_occ(esk3_1(esk1_0),esk1_0),
    inference(spm,[status(thm)],[c_0_51,c_0_22]) ).

cnf(c_0_66,plain,
    ( occurrence_of(esk5_1(X1),tptp2)
    | occurrence_of(esk5_1(X1),tptp1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_67,negated_conjecture,
    ( ~ occurrence_of(X1,tptp2)
    | ~ occurrence_of(X2,tptp3)
    | ~ root_occ(X2,esk1_0)
    | ~ min_precedes(X2,X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_68,plain,
    ( X3 = X4
    | ~ occurrence_of(X1,X2)
    | ~ root_occ(X3,X1)
    | ~ root_occ(X4,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_52]) ).

cnf(c_0_69,negated_conjecture,
    root_occ(esk9_2(tptp0,esk1_0),esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_22]),c_0_54])]) ).

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

cnf(c_0_71,negated_conjecture,
    ( X1 = esk5_1(esk1_0)
    | min_precedes(X1,esk5_1(esk1_0),X2)
    | min_precedes(esk5_1(esk1_0),X1,X2)
    | ~ subactivity_occurrence(X1,esk2_3(tptp0,esk4_1(esk1_0),esk5_1(esk1_0)))
    | ~ arboreal(X1)
    | ~ occurrence_of(esk2_3(tptp0,esk4_1(esk1_0),esk5_1(esk1_0)),X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).

cnf(c_0_72,negated_conjecture,
    subactivity_occurrence(esk3_1(esk1_0),esk2_3(tptp0,esk4_1(esk1_0),esk5_1(esk1_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]) ).

cnf(c_0_73,negated_conjecture,
    arboreal(esk3_1(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_62]),c_0_63])]) ).

cnf(c_0_74,negated_conjecture,
    ( ~ min_precedes(esk3_1(esk1_0),X1,tptp0)
    | ~ occurrence_of(X1,tptp1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_62])]) ).

cnf(c_0_75,negated_conjecture,
    ( occurrence_of(esk5_1(esk1_0),tptp1)
    | occurrence_of(esk5_1(esk1_0),tptp2) ),
    inference(spm,[status(thm)],[c_0_66,c_0_22]) ).

cnf(c_0_76,negated_conjecture,
    ( ~ min_precedes(esk3_1(esk1_0),X1,tptp0)
    | ~ occurrence_of(X1,tptp2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_65]),c_0_62])]) ).

cnf(c_0_77,negated_conjecture,
    ( X1 = esk9_2(tptp0,esk1_0)
    | ~ root_occ(X1,esk1_0)
    | ~ occurrence_of(esk1_0,X2) ),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

fof(c_0_78,plain,
    ! [X36,X37,X38] :
      ( min_precedes(X36,X37,X38)
     => ~ root(X37,X38) ),
    inference(fof_simplification,[status(thm)],[sos_14]) ).

cnf(c_0_79,negated_conjecture,
    ( ~ root_occ(esk5_1(esk1_0),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(spm,[status(thm)],[c_0_70,c_0_27]) ).

cnf(c_0_80,negated_conjecture,
    ( esk5_1(esk1_0) = esk3_1(esk1_0)
    | min_precedes(esk5_1(esk1_0),esk3_1(esk1_0),X1)
    | min_precedes(esk3_1(esk1_0),esk5_1(esk1_0),X1)
    | ~ occurrence_of(esk2_3(tptp0,esk4_1(esk1_0),esk5_1(esk1_0)),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73])]) ).

cnf(c_0_81,negated_conjecture,
    ~ min_precedes(esk3_1(esk1_0),esk5_1(esk1_0),tptp0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]) ).

cnf(c_0_82,negated_conjecture,
    ( esk9_2(tptp0,esk1_0) = esk3_1(esk1_0)
    | ~ occurrence_of(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_77,c_0_65]) ).

fof(c_0_83,plain,
    ! [X242,X243,X244] :
      ( ~ min_precedes(X242,X243,X244)
      | ~ root(X243,X244) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_78])])]) ).

cnf(c_0_84,negated_conjecture,
    ~ root_occ(esk5_1(esk1_0),esk1_0),
    inference(spm,[status(thm)],[c_0_79,c_0_22]) ).

cnf(c_0_85,negated_conjecture,
    ( esk5_1(esk1_0) = esk3_1(esk1_0)
    | min_precedes(esk5_1(esk1_0),esk3_1(esk1_0),tptp0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_60]),c_0_81]) ).

cnf(c_0_86,negated_conjecture,
    esk9_2(tptp0,esk1_0) = esk3_1(esk1_0),
    inference(spm,[status(thm)],[c_0_82,c_0_22]) ).

cnf(c_0_87,plain,
    ( ~ min_precedes(X1,X2,X3)
    | ~ root(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_83]) ).

cnf(c_0_88,negated_conjecture,
    min_precedes(esk5_1(esk1_0),esk3_1(esk1_0),tptp0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_65])]) ).

cnf(c_0_89,negated_conjecture,
    root(esk3_1(esk1_0),tptp0),
    inference(rw,[status(thm)],[c_0_54,c_0_86]) ).

cnf(c_0_90,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : PRO012+3 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.12  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n017.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Thu Jun 20 06:25:54 EDT 2024
% 0.11/0.33  % CPUTime    : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  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/tmp/tmp.ARt1HYJiN7/E---3.1_29474.p
% 1.37/0.66  # Version: 3.2.0
% 1.37/0.66  # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.37/0.66  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.37/0.66  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.37/0.66  # Starting new_bool_3 with 300s (1) cores
% 1.37/0.66  # Starting new_bool_1 with 300s (1) cores
% 1.37/0.66  # Starting sh5l with 300s (1) cores
% 1.37/0.66  # new_bool_3 with pid 29565 completed with status 0
% 1.37/0.66  # Result found by new_bool_3
% 1.37/0.66  # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.37/0.66  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.37/0.66  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.37/0.66  # Starting new_bool_3 with 300s (1) cores
% 1.37/0.66  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.37/0.66  # Search class: FGHSF-FFMM32-SFFFFFNN
% 1.37/0.66  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.37/0.66  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 1.37/0.66  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 29571 completed with status 0
% 1.37/0.66  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 1.37/0.66  # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.37/0.66  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.37/0.66  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.37/0.66  # Starting new_bool_3 with 300s (1) cores
% 1.37/0.66  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.37/0.66  # Search class: FGHSF-FFMM32-SFFFFFNN
% 1.37/0.66  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.37/0.66  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 1.37/0.66  # Preprocessing time       : 0.001 s
% 1.37/0.66  # Presaturation interreduction done
% 1.37/0.66  
% 1.37/0.66  # Proof found!
% 1.37/0.66  # SZS status Theorem
% 1.37/0.66  # SZS output start CNFRefutation
% See solution above
% 1.37/0.66  # Parsed axioms                        : 63
% 1.37/0.66  # Removed by relevancy pruning/SinE    : 13
% 1.37/0.66  # Initial clauses                      : 80
% 1.37/0.66  # Removed in clause preprocessing      : 0
% 1.37/0.66  # Initial clauses in saturation        : 80
% 1.37/0.66  # Processed clauses                    : 2504
% 1.37/0.66  # ...of these trivial                  : 59
% 1.37/0.66  # ...subsumed                          : 566
% 1.37/0.66  # ...remaining for further processing  : 1879
% 1.37/0.66  # Other redundant clauses eliminated   : 0
% 1.37/0.66  # Clauses deleted for lack of memory   : 0
% 1.37/0.66  # Backward-subsumed                    : 13
% 1.37/0.66  # Backward-rewritten                   : 297
% 1.37/0.66  # Generated clauses                    : 5876
% 1.37/0.66  # ...of the previous two non-redundant : 5447
% 1.37/0.66  # ...aggressively subsumed             : 0
% 1.37/0.66  # Contextual simplify-reflections      : 13
% 1.37/0.66  # Paramodulations                      : 5873
% 1.37/0.66  # Factorizations                       : 3
% 1.37/0.66  # NegExts                              : 0
% 1.37/0.66  # Equation resolutions                 : 0
% 1.37/0.66  # Disequality decompositions           : 0
% 1.37/0.66  # Total rewrite steps                  : 1812
% 1.37/0.66  # ...of those cached                   : 1619
% 1.37/0.66  # Propositional unsat checks           : 0
% 1.37/0.66  #    Propositional check models        : 0
% 1.37/0.66  #    Propositional check unsatisfiable : 0
% 1.37/0.66  #    Propositional clauses             : 0
% 1.37/0.66  #    Propositional clauses after purity: 0
% 1.37/0.66  #    Propositional unsat core size     : 0
% 1.37/0.66  #    Propositional preprocessing time  : 0.000
% 1.37/0.66  #    Propositional encoding time       : 0.000
% 1.37/0.66  #    Propositional solver time         : 0.000
% 1.37/0.66  #    Success case prop preproc time    : 0.000
% 1.37/0.66  #    Success case prop encoding time   : 0.000
% 1.37/0.66  #    Success case prop solver time     : 0.000
% 1.37/0.66  # Current number of processed clauses  : 1489
% 1.37/0.66  #    Positive orientable unit clauses  : 450
% 1.37/0.66  #    Positive unorientable unit clauses: 0
% 1.37/0.66  #    Negative unit clauses             : 577
% 1.37/0.66  #    Non-unit-clauses                  : 462
% 1.37/0.66  # Current number of unprocessed clauses: 2693
% 1.37/0.66  # ...number of literals in the above   : 6364
% 1.37/0.66  # Current number of archived formulas  : 0
% 1.37/0.66  # Current number of archived clauses   : 390
% 1.37/0.66  # Clause-clause subsumption calls (NU) : 37816
% 1.37/0.66  # Rec. Clause-clause subsumption calls : 21894
% 1.37/0.66  # Non-unit clause-clause subsumptions  : 254
% 1.37/0.66  # Unit Clause-clause subsumption calls : 14995
% 1.37/0.66  # Rewrite failures with RHS unbound    : 0
% 1.37/0.66  # BW rewrite match attempts            : 797
% 1.37/0.66  # BW rewrite match successes           : 49
% 1.37/0.66  # Condensation attempts                : 0
% 1.37/0.66  # Condensation successes               : 0
% 1.37/0.66  # Termbank termtop insertions          : 153671
% 1.37/0.66  # Search garbage collected termcells   : 1538
% 1.37/0.66  
% 1.37/0.66  # -------------------------------------------------
% 1.37/0.66  # User time                : 0.154 s
% 1.37/0.66  # System time              : 0.014 s
% 1.37/0.66  # Total time               : 0.169 s
% 1.37/0.66  # Maximum resident set size: 2084 pages
% 1.37/0.66  
% 1.37/0.66  # -------------------------------------------------
% 1.37/0.66  # User time                : 0.157 s
% 1.37/0.66  # System time              : 0.017 s
% 1.37/0.66  # Total time               : 0.174 s
% 1.37/0.66  # Maximum resident set size: 1884 pages
% 1.37/0.66  % E---3.1 exiting
% 1.37/0.66  % E exiting
%------------------------------------------------------------------------------