TSTP Solution File: COM019+1 by ET---2.0

View Problem - Process Solution

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

% Computer : n006.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 : Fri Jul 15 01:14:06 EDT 2022

% Result   : Theorem 0.24s 1.43s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   60 (  22 unt;   0 def)
%            Number of atoms       :  296 (   7 equ)
%            Maximal formula atoms :   30 (   4 avg)
%            Number of connectives :  409 ( 173   ~; 177   |;  43   &)
%                                         (   4 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   8 con; 0-3 aty)
%            Number of variables   :  104 (   3 sgn  47   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mNFRDef,axiom,
    ! [X1,X2] :
      ( ( aElement0(X1)
        & aRewritingSystem0(X2) )
     => ! [X3] :
          ( aNormalFormOfIn0(X3,X1,X2)
        <=> ( aElement0(X3)
            & sdtmndtasgtdt0(X1,X2,X3)
            & ~ ? [X4] : aReductOfIn0(X4,X3,X2) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mNFRDef) ).

fof(m__818,hypothesis,
    aNormalFormOfIn0(xd,xw,xR),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__818) ).

fof(m__656,hypothesis,
    aRewritingSystem0(xR),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__656) ).

fof(m__799,hypothesis,
    ( aElement0(xw)
    & sdtmndtasgtdt0(xu,xR,xw)
    & sdtmndtasgtdt0(xv,xR,xw) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__799) ).

fof(mTCDef,axiom,
    ! [X1,X2,X3] :
      ( ( aElement0(X1)
        & aRewritingSystem0(X2)
        & aElement0(X3) )
     => ( sdtmndtplgtdt0(X1,X2,X3)
      <=> ( aReductOfIn0(X3,X1,X2)
          | ? [X4] :
              ( aElement0(X4)
              & aReductOfIn0(X4,X1,X2)
              & sdtmndtplgtdt0(X4,X2,X3) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTCDef) ).

fof(mTCRDef,axiom,
    ! [X1,X2,X3] :
      ( ( aElement0(X1)
        & aRewritingSystem0(X2)
        & aElement0(X3) )
     => ( sdtmndtasgtdt0(X1,X2,X3)
      <=> ( X1 = X3
          | sdtmndtplgtdt0(X1,X2,X3) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTCRDef) ).

fof(m__715,hypothesis,
    ! [X1,X2,X3] :
      ( ( aElement0(X1)
        & aElement0(X2)
        & aElement0(X3)
        & sdtmndtasgtdt0(X1,xR,X2)
        & sdtmndtasgtdt0(X1,xR,X3) )
     => ( iLess0(X1,xa)
       => ? [X4] :
            ( aElement0(X4)
            & sdtmndtasgtdt0(X2,xR,X4)
            & sdtmndtasgtdt0(X3,xR,X4) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__715) ).

fof(mReduct,axiom,
    ! [X1,X2] :
      ( ( aElement0(X1)
        & aRewritingSystem0(X2) )
     => ! [X3] :
          ( aReductOfIn0(X3,X1,X2)
         => aElement0(X3) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mReduct) ).

fof(mTCRTrans,axiom,
    ! [X1,X2,X3,X4] :
      ( ( aElement0(X1)
        & aRewritingSystem0(X2)
        & aElement0(X3)
        & aElement0(X4) )
     => ( ( sdtmndtasgtdt0(X1,X2,X3)
          & sdtmndtasgtdt0(X3,X2,X4) )
       => sdtmndtasgtdt0(X1,X2,X4) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTCRTrans) ).

fof(mTermin,axiom,
    ! [X1] :
      ( aRewritingSystem0(X1)
     => ( isTerminating0(X1)
      <=> ! [X2,X3] :
            ( ( aElement0(X2)
              & aElement0(X3) )
           => ( sdtmndtplgtdt0(X2,X1,X3)
             => iLess0(X3,X2) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTermin) ).

fof(m__,conjecture,
    sdtmndtasgtdt0(xb,xR,xd),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(m__755,hypothesis,
    ( aElement0(xu)
    & aReductOfIn0(xu,xa,xR)
    & sdtmndtasgtdt0(xu,xR,xb) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__755) ).

fof(m__656_01,hypothesis,
    ( isLocallyConfluent0(xR)
    & isTerminating0(xR) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__656_01) ).

fof(m__731,hypothesis,
    ( aElement0(xa)
    & aElement0(xb)
    & aElement0(xc) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__731) ).

fof(c_0_14,plain,
    ! [X5,X6,X7,X8,X7] :
      ( ( aElement0(X7)
        | ~ aNormalFormOfIn0(X7,X5,X6)
        | ~ aElement0(X5)
        | ~ aRewritingSystem0(X6) )
      & ( sdtmndtasgtdt0(X5,X6,X7)
        | ~ aNormalFormOfIn0(X7,X5,X6)
        | ~ aElement0(X5)
        | ~ aRewritingSystem0(X6) )
      & ( ~ aReductOfIn0(X8,X7,X6)
        | ~ aNormalFormOfIn0(X7,X5,X6)
        | ~ aElement0(X5)
        | ~ aRewritingSystem0(X6) )
      & ( ~ aElement0(X7)
        | ~ sdtmndtasgtdt0(X5,X6,X7)
        | aReductOfIn0(esk10_3(X5,X6,X7),X7,X6)
        | aNormalFormOfIn0(X7,X5,X6)
        | ~ aElement0(X5)
        | ~ aRewritingSystem0(X6) ) ),
    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)],[mNFRDef])])])])])])]) ).

cnf(c_0_15,plain,
    ( ~ aRewritingSystem0(X1)
    | ~ aElement0(X2)
    | ~ aNormalFormOfIn0(X3,X2,X1)
    | ~ aReductOfIn0(X4,X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_16,hypothesis,
    aNormalFormOfIn0(xd,xw,xR),
    inference(split_conjunct,[status(thm)],[m__818]) ).

cnf(c_0_17,hypothesis,
    aRewritingSystem0(xR),
    inference(split_conjunct,[status(thm)],[m__656]) ).

cnf(c_0_18,hypothesis,
    aElement0(xw),
    inference(split_conjunct,[status(thm)],[m__799]) ).

fof(c_0_19,plain,
    ! [X5,X6,X7,X9] :
      ( ( aElement0(esk9_3(X5,X6,X7))
        | aReductOfIn0(X7,X5,X6)
        | ~ sdtmndtplgtdt0(X5,X6,X7)
        | ~ aElement0(X5)
        | ~ aRewritingSystem0(X6)
        | ~ aElement0(X7) )
      & ( aReductOfIn0(esk9_3(X5,X6,X7),X5,X6)
        | aReductOfIn0(X7,X5,X6)
        | ~ sdtmndtplgtdt0(X5,X6,X7)
        | ~ aElement0(X5)
        | ~ aRewritingSystem0(X6)
        | ~ aElement0(X7) )
      & ( sdtmndtplgtdt0(esk9_3(X5,X6,X7),X6,X7)
        | aReductOfIn0(X7,X5,X6)
        | ~ sdtmndtplgtdt0(X5,X6,X7)
        | ~ aElement0(X5)
        | ~ aRewritingSystem0(X6)
        | ~ aElement0(X7) )
      & ( ~ aReductOfIn0(X7,X5,X6)
        | sdtmndtplgtdt0(X5,X6,X7)
        | ~ aElement0(X5)
        | ~ aRewritingSystem0(X6)
        | ~ aElement0(X7) )
      & ( ~ aElement0(X9)
        | ~ aReductOfIn0(X9,X5,X6)
        | ~ sdtmndtplgtdt0(X9,X6,X7)
        | sdtmndtplgtdt0(X5,X6,X7)
        | ~ aElement0(X5)
        | ~ aRewritingSystem0(X6)
        | ~ aElement0(X7) ) ),
    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)],[mTCDef])])])])])])]) ).

cnf(c_0_20,plain,
    ( aElement0(X3)
    | ~ aRewritingSystem0(X1)
    | ~ aElement0(X2)
    | ~ aNormalFormOfIn0(X3,X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,hypothesis,
    ~ aReductOfIn0(X1,xd,xR),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).

cnf(c_0_22,plain,
    ( aReductOfIn0(X1,X3,X2)
    | aReductOfIn0(esk9_3(X3,X2,X1),X3,X2)
    | ~ aElement0(X1)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X3)
    | ~ sdtmndtplgtdt0(X3,X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_23,hypothesis,
    aElement0(xd),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_17]),c_0_18])]) ).

fof(c_0_24,plain,
    ! [X4,X5,X6] :
      ( ( ~ sdtmndtasgtdt0(X4,X5,X6)
        | X4 = X6
        | sdtmndtplgtdt0(X4,X5,X6)
        | ~ aElement0(X4)
        | ~ aRewritingSystem0(X5)
        | ~ aElement0(X6) )
      & ( X4 != X6
        | sdtmndtasgtdt0(X4,X5,X6)
        | ~ aElement0(X4)
        | ~ aRewritingSystem0(X5)
        | ~ aElement0(X6) )
      & ( ~ sdtmndtplgtdt0(X4,X5,X6)
        | sdtmndtasgtdt0(X4,X5,X6)
        | ~ aElement0(X4)
        | ~ aRewritingSystem0(X5)
        | ~ aElement0(X6) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRDef])])]) ).

cnf(c_0_25,hypothesis,
    ( ~ sdtmndtplgtdt0(xd,xR,X1)
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17])]),c_0_21]),c_0_23])]) ).

cnf(c_0_26,plain,
    ( sdtmndtplgtdt0(X3,X2,X1)
    | X3 = X1
    | ~ aElement0(X1)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X3)
    | ~ sdtmndtasgtdt0(X3,X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

fof(c_0_27,hypothesis,
    ! [X5,X6,X7] :
      ( ( aElement0(esk1_3(X5,X6,X7))
        | ~ iLess0(X5,xa)
        | ~ aElement0(X5)
        | ~ aElement0(X6)
        | ~ aElement0(X7)
        | ~ sdtmndtasgtdt0(X5,xR,X6)
        | ~ sdtmndtasgtdt0(X5,xR,X7) )
      & ( sdtmndtasgtdt0(X6,xR,esk1_3(X5,X6,X7))
        | ~ iLess0(X5,xa)
        | ~ aElement0(X5)
        | ~ aElement0(X6)
        | ~ aElement0(X7)
        | ~ sdtmndtasgtdt0(X5,xR,X6)
        | ~ sdtmndtasgtdt0(X5,xR,X7) )
      & ( sdtmndtasgtdt0(X7,xR,esk1_3(X5,X6,X7))
        | ~ iLess0(X5,xa)
        | ~ aElement0(X5)
        | ~ aElement0(X6)
        | ~ aElement0(X7)
        | ~ sdtmndtasgtdt0(X5,xR,X6)
        | ~ sdtmndtasgtdt0(X5,xR,X7) ) ),
    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)],[m__715])])])])])]) ).

fof(c_0_28,plain,
    ! [X4,X5,X6] :
      ( ~ aElement0(X4)
      | ~ aRewritingSystem0(X5)
      | ~ aReductOfIn0(X6,X4,X5)
      | aElement0(X6) ),
    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)],[mReduct])])])])]) ).

cnf(c_0_29,hypothesis,
    ( X1 = xd
    | ~ sdtmndtasgtdt0(xd,xR,X1)
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17]),c_0_23])]) ).

cnf(c_0_30,hypothesis,
    ( sdtmndtasgtdt0(X3,xR,esk1_3(X1,X3,X2))
    | ~ sdtmndtasgtdt0(X1,xR,X2)
    | ~ sdtmndtasgtdt0(X1,xR,X3)
    | ~ aElement0(X2)
    | ~ aElement0(X3)
    | ~ aElement0(X1)
    | ~ iLess0(X1,xa) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

fof(c_0_31,plain,
    ! [X5,X6,X7,X8] :
      ( ~ aElement0(X5)
      | ~ aRewritingSystem0(X6)
      | ~ aElement0(X7)
      | ~ aElement0(X8)
      | ~ sdtmndtasgtdt0(X5,X6,X7)
      | ~ sdtmndtasgtdt0(X7,X6,X8)
      | sdtmndtasgtdt0(X5,X6,X8) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRTrans])]) ).

cnf(c_0_32,plain,
    ( sdtmndtasgtdt0(X2,X1,X3)
    | ~ aRewritingSystem0(X1)
    | ~ aElement0(X2)
    | ~ aNormalFormOfIn0(X3,X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_33,plain,
    ! [X4,X5,X6] :
      ( ( ~ isTerminating0(X4)
        | ~ aElement0(X5)
        | ~ aElement0(X6)
        | ~ sdtmndtplgtdt0(X5,X4,X6)
        | iLess0(X6,X5)
        | ~ aRewritingSystem0(X4) )
      & ( aElement0(esk2_1(X4))
        | isTerminating0(X4)
        | ~ aRewritingSystem0(X4) )
      & ( aElement0(esk3_1(X4))
        | isTerminating0(X4)
        | ~ aRewritingSystem0(X4) )
      & ( sdtmndtplgtdt0(esk2_1(X4),X4,esk3_1(X4))
        | isTerminating0(X4)
        | ~ aRewritingSystem0(X4) )
      & ( ~ iLess0(esk3_1(X4),esk2_1(X4))
        | isTerminating0(X4)
        | ~ aRewritingSystem0(X4) ) ),
    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)],[mTermin])])])])])])]) ).

cnf(c_0_34,plain,
    ( sdtmndtplgtdt0(X3,X2,X1)
    | ~ aElement0(X1)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X3)
    | ~ aReductOfIn0(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_35,plain,
    ( aElement0(X1)
    | ~ aReductOfIn0(X1,X2,X3)
    | ~ aRewritingSystem0(X3)
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_36,hypothesis,
    ( esk1_3(X1,xd,X2) = xd
    | ~ sdtmndtasgtdt0(X1,xR,xd)
    | ~ sdtmndtasgtdt0(X1,xR,X2)
    | ~ iLess0(X1,xa)
    | ~ aElement0(esk1_3(X1,xd,X2))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_23])]) ).

cnf(c_0_37,hypothesis,
    ( aElement0(esk1_3(X1,X3,X2))
    | ~ sdtmndtasgtdt0(X1,xR,X2)
    | ~ sdtmndtasgtdt0(X1,xR,X3)
    | ~ aElement0(X2)
    | ~ aElement0(X3)
    | ~ aElement0(X1)
    | ~ iLess0(X1,xa) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_38,plain,
    ( sdtmndtasgtdt0(X1,X2,X3)
    | ~ sdtmndtasgtdt0(X4,X2,X3)
    | ~ sdtmndtasgtdt0(X1,X2,X4)
    | ~ aElement0(X3)
    | ~ aElement0(X4)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_39,hypothesis,
    sdtmndtasgtdt0(xw,xR,xd),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_16]),c_0_17]),c_0_18])]) ).

cnf(c_0_40,plain,
    ( iLess0(X2,X3)
    | ~ aRewritingSystem0(X1)
    | ~ sdtmndtplgtdt0(X3,X1,X2)
    | ~ aElement0(X2)
    | ~ aElement0(X3)
    | ~ isTerminating0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_41,plain,
    ( sdtmndtplgtdt0(X1,X2,X3)
    | ~ aReductOfIn0(X3,X1,X2)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X1) ),
    inference(csr,[status(thm)],[c_0_34,c_0_35]) ).

fof(c_0_42,negated_conjecture,
    ~ sdtmndtasgtdt0(xb,xR,xd),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_43,hypothesis,
    ( sdtmndtasgtdt0(X2,xR,esk1_3(X1,X3,X2))
    | ~ sdtmndtasgtdt0(X1,xR,X2)
    | ~ sdtmndtasgtdt0(X1,xR,X3)
    | ~ aElement0(X2)
    | ~ aElement0(X3)
    | ~ aElement0(X1)
    | ~ iLess0(X1,xa) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_44,hypothesis,
    ( esk1_3(X1,xd,X2) = xd
    | ~ sdtmndtasgtdt0(X1,xR,xd)
    | ~ sdtmndtasgtdt0(X1,xR,X2)
    | ~ iLess0(X1,xa)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_23])]) ).

cnf(c_0_45,hypothesis,
    ( sdtmndtasgtdt0(X1,xR,xd)
    | ~ sdtmndtasgtdt0(X1,xR,xw)
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_17]),c_0_18])]),c_0_23])]) ).

cnf(c_0_46,hypothesis,
    sdtmndtasgtdt0(xu,xR,xw),
    inference(split_conjunct,[status(thm)],[m__799]) ).

cnf(c_0_47,hypothesis,
    aElement0(xu),
    inference(split_conjunct,[status(thm)],[m__755]) ).

cnf(c_0_48,plain,
    ( iLess0(X1,X2)
    | ~ isTerminating0(X3)
    | ~ aReductOfIn0(X1,X2,X3)
    | ~ aRewritingSystem0(X3)
    | ~ aElement0(X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_35]) ).

cnf(c_0_49,hypothesis,
    aReductOfIn0(xu,xa,xR),
    inference(split_conjunct,[status(thm)],[m__755]) ).

cnf(c_0_50,hypothesis,
    isTerminating0(xR),
    inference(split_conjunct,[status(thm)],[m__656_01]) ).

cnf(c_0_51,hypothesis,
    aElement0(xa),
    inference(split_conjunct,[status(thm)],[m__731]) ).

fof(c_0_52,negated_conjecture,
    ~ sdtmndtasgtdt0(xb,xR,xd),
    inference(fof_simplification,[status(thm)],[c_0_42]) ).

cnf(c_0_53,hypothesis,
    ( sdtmndtasgtdt0(X1,xR,xd)
    | ~ sdtmndtasgtdt0(X2,xR,xd)
    | ~ sdtmndtasgtdt0(X2,xR,X1)
    | ~ iLess0(X2,xa)
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_23])]) ).

cnf(c_0_54,hypothesis,
    sdtmndtasgtdt0(xu,xR,xb),
    inference(split_conjunct,[status(thm)],[m__755]) ).

cnf(c_0_55,hypothesis,
    sdtmndtasgtdt0(xu,xR,xd),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).

cnf(c_0_56,hypothesis,
    iLess0(xu,xa),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_17]),c_0_51])]) ).

cnf(c_0_57,hypothesis,
    aElement0(xb),
    inference(split_conjunct,[status(thm)],[m__731]) ).

cnf(c_0_58,negated_conjecture,
    ~ sdtmndtasgtdt0(xb,xR,xd),
    inference(split_conjunct,[status(thm)],[c_0_52]) ).

cnf(c_0_59,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_56]),c_0_57]),c_0_47])]),c_0_58]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : COM019+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n006.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Thu Jun 16 19:52:41 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.24/1.43  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.43  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.43  # Preprocessing time       : 0.018 s
% 0.24/1.43  
% 0.24/1.43  # Proof found!
% 0.24/1.43  # SZS status Theorem
% 0.24/1.43  # SZS output start CNFRefutation
% See solution above
% 0.24/1.43  # Proof object total steps             : 60
% 0.24/1.43  # Proof object clause steps            : 37
% 0.24/1.43  # Proof object formula steps           : 23
% 0.24/1.43  # Proof object conjectures             : 4
% 0.24/1.43  # Proof object clause conjectures      : 1
% 0.24/1.43  # Proof object formula conjectures     : 3
% 0.24/1.43  # Proof object initial clauses used    : 23
% 0.24/1.43  # Proof object initial formulas used   : 14
% 0.24/1.43  # Proof object generating inferences   : 13
% 0.24/1.43  # Proof object simplifying inferences  : 42
% 0.24/1.43  # Training examples: 0 positive, 0 negative
% 0.24/1.43  # Parsed axioms                        : 24
% 0.24/1.43  # Removed by relevancy pruning/SinE    : 1
% 0.24/1.43  # Initial clauses                      : 56
% 0.24/1.43  # Removed in clause preprocessing      : 4
% 0.24/1.43  # Initial clauses in saturation        : 52
% 0.24/1.43  # Processed clauses                    : 1894
% 0.24/1.43  # ...of these trivial                  : 2
% 0.24/1.43  # ...subsumed                          : 999
% 0.24/1.43  # ...remaining for further processing  : 893
% 0.24/1.43  # Other redundant clauses eliminated   : 1
% 0.24/1.43  # Clauses deleted for lack of memory   : 0
% 0.24/1.43  # Backward-subsumed                    : 8
% 0.24/1.43  # Backward-rewritten                   : 1
% 0.24/1.43  # Generated clauses                    : 10660
% 0.24/1.43  # ...of the previous two non-trivial   : 8012
% 0.24/1.43  # Contextual simplify-reflections      : 1877
% 0.24/1.43  # Paramodulations                      : 10659
% 0.24/1.43  # Factorizations                       : 0
% 0.24/1.43  # Equation resolutions                 : 1
% 0.24/1.43  # Current number of processed clauses  : 883
% 0.24/1.43  #    Positive orientable unit clauses  : 35
% 0.24/1.43  #    Positive unorientable unit clauses: 0
% 0.24/1.43  #    Negative unit clauses             : 2
% 0.24/1.43  #    Non-unit-clauses                  : 846
% 0.24/1.43  # Current number of unprocessed clauses: 6164
% 0.24/1.43  # ...number of literals in the above   : 43814
% 0.24/1.43  # Current number of archived formulas  : 0
% 0.24/1.43  # Current number of archived clauses   : 9
% 0.24/1.43  # Clause-clause subsumption calls (NU) : 240636
% 0.24/1.43  # Rec. Clause-clause subsumption calls : 42395
% 0.24/1.43  # Non-unit clause-clause subsumptions  : 2775
% 0.24/1.43  # Unit Clause-clause subsumption calls : 210
% 0.24/1.43  # Rewrite failures with RHS unbound    : 0
% 0.24/1.43  # BW rewrite match attempts            : 26
% 0.24/1.43  # BW rewrite match successes           : 1
% 0.24/1.43  # Condensation attempts                : 0
% 0.24/1.43  # Condensation successes               : 0
% 0.24/1.43  # Termbank termtop insertions          : 255032
% 0.24/1.43  
% 0.24/1.43  # -------------------------------------------------
% 0.24/1.43  # User time                : 0.231 s
% 0.24/1.43  # System time              : 0.010 s
% 0.24/1.43  # Total time               : 0.241 s
% 0.24/1.43  # Maximum resident set size: 10196 pages
% 0.24/23.43  eprover: CPU time limit exceeded, terminating
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49  eprover: No such file or directory
% 0.24/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.50  eprover: No such file or directory
% 0.24/23.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.51  eprover: No such file or directory
%------------------------------------------------------------------------------