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

View Problem - Process Solution

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

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Mon Jul 18 09:34:09 EDT 2022

% Result   : Theorem 0.43s 38.61s
% Output   : CNFRefutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   64 (  12 unt;   0 def)
%            Number of atoms       :  273 (  51 equ)
%            Maximal formula atoms :   52 (   4 avg)
%            Number of connectives :  360 ( 151   ~; 155   |;  34   &)
%                                         (   7 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   8 con; 0-3 aty)
%            Number of variables   :  100 (   5 sgn  46   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mCardEmpty,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ( sbrdtbr0(X1) = sz00
      <=> X1 = slcrc0 ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mCardEmpty) ).

fof(mDefEmp,axiom,
    ! [X1] :
      ( X1 = slcrc0
    <=> ( aSet0(X1)
        & ~ ? [X2] : aElementOf0(X2,X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDefEmp) ).

fof(mDefDiff,axiom,
    ! [X1,X2] :
      ( ( aSet0(X1)
        & aElement0(X2) )
     => ! [X3] :
          ( X3 = sdtmndt0(X1,X2)
        <=> ( aSet0(X3)
            & ! [X4] :
                ( aElementOf0(X4,X3)
              <=> ( aElement0(X4)
                  & aElementOf0(X4,X1)
                  & X4 != X2 ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDefDiff) ).

fof(mCardNum,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
      <=> isFinite0(X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mCardNum) ).

fof(mDefSub,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ! [X2] :
          ( aSubsetOf0(X2,X1)
        <=> ( aSet0(X2)
            & ! [X3] :
                ( aElementOf0(X3,X2)
               => aElementOf0(X3,X1) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDefSub) ).

fof(m__3671,hypothesis,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
        & isCountable0(sdtlpdtrp0(xN,X1)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__3671) ).

fof(mCountNFin,axiom,
    ! [X1] :
      ( ( aSet0(X1)
        & isCountable0(X1) )
     => ~ isFinite0(X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mCountNFin) ).

fof(mZeroNum,axiom,
    aElementOf0(sz00,szNzAzT0),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mZeroNum) ).

fof(mSubTrans,axiom,
    ! [X1,X2,X3] :
      ( ( aSet0(X1)
        & aSet0(X2)
        & aSet0(X3) )
     => ( ( aSubsetOf0(X1,X2)
          & aSubsetOf0(X2,X3) )
       => aSubsetOf0(X1,X3) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mSubTrans) ).

fof(mNATSet,axiom,
    ( aSet0(szNzAzT0)
    & isCountable0(szNzAzT0) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mNATSet) ).

fof(mDefMin,axiom,
    ! [X1] :
      ( ( aSubsetOf0(X1,szNzAzT0)
        & X1 != slcrc0 )
     => ! [X2] :
          ( X2 = szmzizndt0(X1)
        <=> ( aElementOf0(X2,X1)
            & ! [X3] :
                ( aElementOf0(X3,X1)
               => sdtlseqdt0(X2,X3) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDefMin) ).

fof(m__,conjecture,
    aSubsetOf0(xY,szNzAzT0),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__) ).

fof(mEOfElem,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ! [X2] :
          ( aElementOf0(X2,X1)
         => aElement0(X2) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mEOfElem) ).

fof(m__4448_02,hypothesis,
    ( xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
    & xd = sdtlpdtrp0(xC,xi) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__4448_02) ).

fof(m__4448,hypothesis,
    aElementOf0(xi,szNzAzT0),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__4448) ).

fof(c_0_15,plain,
    ! [X2] :
      ( ( sbrdtbr0(X2) != sz00
        | X2 = slcrc0
        | ~ aSet0(X2) )
      & ( X2 != slcrc0
        | sbrdtbr0(X2) = sz00
        | ~ aSet0(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])]) ).

fof(c_0_16,plain,
    ! [X3,X4,X3] :
      ( ( aSet0(X3)
        | X3 != slcrc0 )
      & ( ~ aElementOf0(X4,X3)
        | X3 != slcrc0 )
      & ( ~ aSet0(X3)
        | aElementOf0(esk14_1(X3),X3)
        | X3 = slcrc0 ) ),
    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)],[mDefEmp])])])])])])]) ).

fof(c_0_17,plain,
    ! [X5,X6,X7,X8,X8,X7] :
      ( ( aSet0(X7)
        | X7 != sdtmndt0(X5,X6)
        | ~ aSet0(X5)
        | ~ aElement0(X6) )
      & ( aElement0(X8)
        | ~ aElementOf0(X8,X7)
        | X7 != sdtmndt0(X5,X6)
        | ~ aSet0(X5)
        | ~ aElement0(X6) )
      & ( aElementOf0(X8,X5)
        | ~ aElementOf0(X8,X7)
        | X7 != sdtmndt0(X5,X6)
        | ~ aSet0(X5)
        | ~ aElement0(X6) )
      & ( X8 != X6
        | ~ aElementOf0(X8,X7)
        | X7 != sdtmndt0(X5,X6)
        | ~ aSet0(X5)
        | ~ aElement0(X6) )
      & ( ~ aElement0(X8)
        | ~ aElementOf0(X8,X5)
        | X8 = X6
        | aElementOf0(X8,X7)
        | X7 != sdtmndt0(X5,X6)
        | ~ aSet0(X5)
        | ~ aElement0(X6) )
      & ( ~ aElementOf0(esk11_3(X5,X6,X7),X7)
        | ~ aElement0(esk11_3(X5,X6,X7))
        | ~ aElementOf0(esk11_3(X5,X6,X7),X5)
        | esk11_3(X5,X6,X7) = X6
        | ~ aSet0(X7)
        | X7 = sdtmndt0(X5,X6)
        | ~ aSet0(X5)
        | ~ aElement0(X6) )
      & ( aElement0(esk11_3(X5,X6,X7))
        | aElementOf0(esk11_3(X5,X6,X7),X7)
        | ~ aSet0(X7)
        | X7 = sdtmndt0(X5,X6)
        | ~ aSet0(X5)
        | ~ aElement0(X6) )
      & ( aElementOf0(esk11_3(X5,X6,X7),X5)
        | aElementOf0(esk11_3(X5,X6,X7),X7)
        | ~ aSet0(X7)
        | X7 = sdtmndt0(X5,X6)
        | ~ aSet0(X5)
        | ~ aElement0(X6) )
      & ( esk11_3(X5,X6,X7) != X6
        | aElementOf0(esk11_3(X5,X6,X7),X7)
        | ~ aSet0(X7)
        | X7 = sdtmndt0(X5,X6)
        | ~ aSet0(X5)
        | ~ aElement0(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)],[mDefDiff])])])])])])]) ).

fof(c_0_18,plain,
    ! [X2] :
      ( ( ~ aElementOf0(sbrdtbr0(X2),szNzAzT0)
        | isFinite0(X2)
        | ~ aSet0(X2) )
      & ( ~ isFinite0(X2)
        | aElementOf0(sbrdtbr0(X2),szNzAzT0)
        | ~ aSet0(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardNum])])]) ).

cnf(c_0_19,plain,
    ( sbrdtbr0(X1) = sz00
    | ~ aSet0(X1)
    | X1 != slcrc0 ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,plain,
    ( aSet0(X1)
    | X1 != slcrc0 ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_21,plain,
    ! [X4,X5,X6,X5] :
      ( ( aSet0(X5)
        | ~ aSubsetOf0(X5,X4)
        | ~ aSet0(X4) )
      & ( ~ aElementOf0(X6,X5)
        | aElementOf0(X6,X4)
        | ~ aSubsetOf0(X5,X4)
        | ~ aSet0(X4) )
      & ( aElementOf0(esk3_2(X4,X5),X5)
        | ~ aSet0(X5)
        | aSubsetOf0(X5,X4)
        | ~ aSet0(X4) )
      & ( ~ aElementOf0(esk3_2(X4,X5),X4)
        | ~ aSet0(X5)
        | aSubsetOf0(X5,X4)
        | ~ aSet0(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)],[mDefSub])])])])])])]) ).

fof(c_0_22,hypothesis,
    ! [X2] :
      ( ( aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
        | ~ aElementOf0(X2,szNzAzT0) )
      & ( isCountable0(sdtlpdtrp0(xN,X2))
        | ~ aElementOf0(X2,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])]) ).

cnf(c_0_23,plain,
    ( aElementOf0(X4,X2)
    | ~ aElement0(X1)
    | ~ aSet0(X2)
    | X3 != sdtmndt0(X2,X1)
    | ~ aElementOf0(X4,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_24,plain,
    ( aSet0(X3)
    | ~ aElement0(X1)
    | ~ aSet0(X2)
    | X3 != sdtmndt0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_25,plain,
    ! [X2] :
      ( ~ aSet0(X2)
      | ~ isCountable0(X2)
      | ~ isFinite0(X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[mCountNFin])])]) ).

cnf(c_0_26,plain,
    ( isFinite0(X1)
    | ~ aSet0(X1)
    | ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_27,plain,
    ( sbrdtbr0(X1) = sz00
    | X1 != slcrc0 ),
    inference(csr,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_28,plain,
    aElementOf0(sz00,szNzAzT0),
    inference(split_conjunct,[status(thm)],[mZeroNum]) ).

fof(c_0_29,plain,
    ! [X4,X5,X6] :
      ( ~ aSet0(X4)
      | ~ aSet0(X5)
      | ~ aSet0(X6)
      | ~ aSubsetOf0(X4,X5)
      | ~ aSubsetOf0(X5,X6)
      | aSubsetOf0(X4,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])]) ).

cnf(c_0_30,plain,
    ( aSet0(X2)
    | ~ aSet0(X1)
    | ~ aSubsetOf0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_31,hypothesis,
    ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_32,plain,
    aSet0(szNzAzT0),
    inference(split_conjunct,[status(thm)],[mNATSet]) ).

cnf(c_0_33,plain,
    ( aElementOf0(X1,X2)
    | ~ aElementOf0(X1,sdtmndt0(X2,X3))
    | ~ aElement0(X3)
    | ~ aSet0(X2) ),
    inference(er,[status(thm)],[c_0_23]) ).

cnf(c_0_34,plain,
    ( aSubsetOf0(X2,X1)
    | aElementOf0(esk3_2(X1,X2),X2)
    | ~ aSet0(X1)
    | ~ aSet0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_35,plain,
    ( aSet0(sdtmndt0(X1,X2))
    | ~ aElement0(X2)
    | ~ aSet0(X1) ),
    inference(er,[status(thm)],[c_0_24]) ).

fof(c_0_36,plain,
    ! [X4,X5,X6,X5] :
      ( ( aElementOf0(X5,X4)
        | X5 != szmzizndt0(X4)
        | ~ aSubsetOf0(X4,szNzAzT0)
        | X4 = slcrc0 )
      & ( ~ aElementOf0(X6,X4)
        | sdtlseqdt0(X5,X6)
        | X5 != szmzizndt0(X4)
        | ~ aSubsetOf0(X4,szNzAzT0)
        | X4 = slcrc0 )
      & ( aElementOf0(esk12_2(X4,X5),X4)
        | ~ aElementOf0(X5,X4)
        | X5 = szmzizndt0(X4)
        | ~ aSubsetOf0(X4,szNzAzT0)
        | X4 = slcrc0 )
      & ( ~ sdtlseqdt0(X5,esk12_2(X4,X5))
        | ~ aElementOf0(X5,X4)
        | X5 = szmzizndt0(X4)
        | ~ aSubsetOf0(X4,szNzAzT0)
        | X4 = slcrc0 ) ),
    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)],[mDefMin])])])])])])]) ).

cnf(c_0_37,plain,
    ( ~ isFinite0(X1)
    | ~ isCountable0(X1)
    | ~ aSet0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_38,plain,
    ( isFinite0(X1)
    | X1 != slcrc0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_20]) ).

cnf(c_0_39,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aSubsetOf0(X3,X2)
    | ~ aSubsetOf0(X1,X3)
    | ~ aSet0(X2)
    | ~ aSet0(X3)
    | ~ aSet0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_40,hypothesis,
    ( aSet0(sdtlpdtrp0(xN,X1))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).

cnf(c_0_41,plain,
    ( aSubsetOf0(X2,X1)
    | ~ aSet0(X1)
    | ~ aSet0(X2)
    | ~ aElementOf0(esk3_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_42,plain,
    ( aSubsetOf0(sdtmndt0(X1,X2),X3)
    | aElementOf0(esk3_2(X3,sdtmndt0(X1,X2)),X1)
    | ~ aElement0(X2)
    | ~ aSet0(X1)
    | ~ aSet0(X3) ),
    inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).

fof(c_0_43,negated_conjecture,
    ~ aSubsetOf0(xY,szNzAzT0),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_44,plain,
    ( aElementOf0(X3,X1)
    | ~ aSet0(X1)
    | ~ aSubsetOf0(X2,X1)
    | ~ aElementOf0(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_45,plain,
    ( X1 = slcrc0
    | aElementOf0(X2,X1)
    | ~ aSubsetOf0(X1,szNzAzT0)
    | X2 != szmzizndt0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_46,plain,
    ( X1 != slcrc0
    | ~ isCountable0(X1) ),
    inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_37,c_0_38]),c_0_20]) ).

cnf(c_0_47,hypothesis,
    ( isCountable0(sdtlpdtrp0(xN,X1))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_48,hypothesis,
    ( aSubsetOf0(X1,szNzAzT0)
    | ~ aSubsetOf0(X1,sdtlpdtrp0(xN,X2))
    | ~ aElementOf0(X2,szNzAzT0) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_39,c_0_31]),c_0_32])]),c_0_30]),c_0_40]) ).

cnf(c_0_49,plain,
    ( aSubsetOf0(sdtmndt0(X1,X2),X1)
    | ~ aElement0(X2)
    | ~ aSet0(X1) ),
    inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_41,c_0_42]),c_0_35]) ).

fof(c_0_50,negated_conjecture,
    ~ aSubsetOf0(xY,szNzAzT0),
    inference(fof_simplification,[status(thm)],[c_0_43]) ).

fof(c_0_51,plain,
    ! [X3,X4] :
      ( ~ aSet0(X3)
      | ~ aElementOf0(X4,X3)
      | aElement0(X4) ),
    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)],[mEOfElem])])])])]) ).

cnf(c_0_52,hypothesis,
    ( aElementOf0(X1,szNzAzT0)
    | ~ aElementOf0(X1,sdtlpdtrp0(xN,X2))
    | ~ aElementOf0(X2,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_44,c_0_31]),c_0_32])]) ).

cnf(c_0_53,plain,
    ( X1 = slcrc0
    | aElementOf0(szmzizndt0(X1),X1)
    | ~ aSubsetOf0(X1,szNzAzT0) ),
    inference(er,[status(thm)],[c_0_45]) ).

cnf(c_0_54,hypothesis,
    ( sdtlpdtrp0(xN,X1) != slcrc0
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(pm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_55,hypothesis,
    ( aSubsetOf0(sdtmndt0(sdtlpdtrp0(xN,X1),X2),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aElement0(X2) ),
    inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_48,c_0_49]),c_0_40]) ).

cnf(c_0_56,hypothesis,
    xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),
    inference(split_conjunct,[status(thm)],[m__4448_02]) ).

cnf(c_0_57,hypothesis,
    aElementOf0(xi,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__4448]) ).

cnf(c_0_58,negated_conjecture,
    ~ aSubsetOf0(xY,szNzAzT0),
    inference(split_conjunct,[status(thm)],[c_0_50]) ).

cnf(c_0_59,plain,
    ( aElement0(X1)
    | ~ aElementOf0(X1,X2)
    | ~ aSet0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_51]) ).

cnf(c_0_60,hypothesis,
    ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_52,c_0_53]),c_0_31]),c_0_54]) ).

cnf(c_0_61,hypothesis,
    ~ aElement0(szmzizndt0(sdtlpdtrp0(xN,xi))),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),c_0_58]) ).

cnf(c_0_62,hypothesis,
    ( aElement0(szmzizndt0(sdtlpdtrp0(xN,X1)))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_59,c_0_60]),c_0_32])]) ).

cnf(c_0_63,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_61,c_0_62]),c_0_57])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : NUM590+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n010.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jul  6 17:12:32 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.34/23.39  eprover: CPU time limit exceeded, terminating
% 0.34/23.40  eprover: CPU time limit exceeded, terminating
% 0.34/23.41  eprover: CPU time limit exceeded, terminating
% 0.34/23.42  eprover: CPU time limit exceeded, terminating
% 0.43/38.61  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.43/38.61  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.43/38.61  # Preprocessing time       : 0.011 s
% 0.43/38.61  
% 0.43/38.61  # Failure: Out of unprocessed clauses!
% 0.43/38.61  # OLD status GaveUp
% 0.43/38.61  # Parsed axioms                        : 92
% 0.43/38.61  # Removed by relevancy pruning/SinE    : 86
% 0.43/38.61  # Initial clauses                      : 9
% 0.43/38.61  # Removed in clause preprocessing      : 1
% 0.43/38.61  # Initial clauses in saturation        : 8
% 0.43/38.61  # Processed clauses                    : 8
% 0.43/38.61  # ...of these trivial                  : 0
% 0.43/38.61  # ...subsumed                          : 0
% 0.43/38.61  # ...remaining for further processing  : 8
% 0.43/38.61  # Other redundant clauses eliminated   : 0
% 0.43/38.61  # Clauses deleted for lack of memory   : 0
% 0.43/38.61  # Backward-subsumed                    : 0
% 0.43/38.61  # Backward-rewritten                   : 0
% 0.43/38.61  # Generated clauses                    : 0
% 0.43/38.61  # ...of the previous two non-trivial   : 0
% 0.43/38.61  # Contextual simplify-reflections      : 3
% 0.43/38.61  # Paramodulations                      : 0
% 0.43/38.61  # Factorizations                       : 0
% 0.43/38.61  # Equation resolutions                 : 0
% 0.43/38.61  # Current number of processed clauses  : 8
% 0.43/38.61  #    Positive orientable unit clauses  : 0
% 0.43/38.61  #    Positive unorientable unit clauses: 0
% 0.43/38.61  #    Negative unit clauses             : 1
% 0.43/38.61  #    Non-unit-clauses                  : 7
% 0.43/38.61  # Current number of unprocessed clauses: 0
% 0.43/38.61  # ...number of literals in the above   : 0
% 0.43/38.61  # Current number of archived formulas  : 0
% 0.43/38.61  # Current number of archived clauses   : 0
% 0.43/38.61  # Clause-clause subsumption calls (NU) : 27
% 0.43/38.61  # Rec. Clause-clause subsumption calls : 10
% 0.43/38.61  # Non-unit clause-clause subsumptions  : 3
% 0.43/38.61  # Unit Clause-clause subsumption calls : 0
% 0.43/38.61  # Rewrite failures with RHS unbound    : 0
% 0.43/38.61  # BW rewrite match attempts            : 0
% 0.43/38.61  # BW rewrite match successes           : 0
% 0.43/38.61  # Condensation attempts                : 0
% 0.43/38.61  # Condensation successes               : 0
% 0.43/38.61  # Termbank termtop insertions          : 2012
% 0.43/38.61  
% 0.43/38.61  # -------------------------------------------------
% 0.43/38.61  # User time                : 0.008 s
% 0.43/38.61  # System time              : 0.003 s
% 0.43/38.61  # Total time               : 0.011 s
% 0.43/38.61  # Maximum resident set size: 2848 pages
% 0.43/38.61  # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.43/38.61  
% 0.43/38.61  # Failure: Resource limit exceeded (time)
% 0.43/38.61  # OLD status Res
% 0.43/38.61  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.43/38.61  # Preprocessing time       : 0.023 s
% 0.43/38.61  # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.43/38.61  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.43/38.61  # Preprocessing time       : 0.012 s
% 0.43/38.61  
% 0.43/38.61  # Proof found!
% 0.43/38.61  # SZS status Theorem
% 0.43/38.61  # SZS output start CNFRefutation
% See solution above
% 0.43/38.61  # Proof object total steps             : 64
% 0.43/38.61  # Proof object clause steps            : 37
% 0.43/38.61  # Proof object formula steps           : 27
% 0.43/38.61  # Proof object conjectures             : 4
% 0.43/38.61  # Proof object clause conjectures      : 1
% 0.43/38.61  # Proof object formula conjectures     : 3
% 0.43/38.61  # Proof object initial clauses used    : 20
% 0.43/38.61  # Proof object initial formulas used   : 15
% 0.43/38.61  # Proof object generating inferences   : 16
% 0.43/38.61  # Proof object simplifying inferences  : 25
% 0.43/38.61  # Training examples: 0 positive, 0 negative
% 0.43/38.61  # Parsed axioms                        : 92
% 0.43/38.61  # Removed by relevancy pruning/SinE    : 12
% 0.43/38.61  # Initial clauses                      : 146
% 0.43/38.61  # Removed in clause preprocessing      : 7
% 0.43/38.61  # Initial clauses in saturation        : 139
% 0.43/38.61  # Processed clauses                    : 41964
% 0.43/38.61  # ...of these trivial                  : 169
% 0.43/38.61  # ...subsumed                          : 30519
% 0.43/38.61  # ...remaining for further processing  : 11276
% 0.43/38.61  # Other redundant clauses eliminated   : 53
% 0.43/38.61  # Clauses deleted for lack of memory   : 243560
% 0.43/38.61  # Backward-subsumed                    : 1478
% 0.43/38.61  # Backward-rewritten                   : 458
% 0.43/38.61  # Generated clauses                    : 450343
% 0.43/38.61  # ...of the previous two non-trivial   : 432828
% 0.43/38.61  # Contextual simplify-reflections      : 42117
% 0.43/38.61  # Paramodulations                      : 450090
% 0.43/38.61  # Factorizations                       : 0
% 0.43/38.61  # Equation resolutions                 : 249
% 0.43/38.61  # Current number of processed clauses  : 9334
% 0.43/38.61  #    Positive orientable unit clauses  : 108
% 0.43/38.61  #    Positive unorientable unit clauses: 0
% 0.43/38.61  #    Negative unit clauses             : 99
% 0.43/38.61  #    Non-unit-clauses                  : 9127
% 0.43/38.61  # Current number of unprocessed clauses: 102737
% 0.43/38.61  # ...number of literals in the above   : 691305
% 0.43/38.61  # Current number of archived formulas  : 0
% 0.43/38.61  # Current number of archived clauses   : 1940
% 0.43/38.61  # Clause-clause subsumption calls (NU) : 26466851
% 0.43/38.61  # Rec. Clause-clause subsumption calls : 2413154
% 0.43/38.61  # Non-unit clause-clause subsumptions  : 65747
% 0.43/38.61  # Unit Clause-clause subsumption calls : 50760
% 0.43/38.61  # Rewrite failures with RHS unbound    : 0
% 0.43/38.61  # BW rewrite match attempts            : 51
% 0.43/38.61  # BW rewrite match successes           : 28
% 0.43/38.61  # Condensation attempts                : 0
% 0.43/38.61  # Condensation successes               : 0
% 0.43/38.61  # Termbank termtop insertions          : 5109374
% 0.43/38.61  
% 0.43/38.61  # -------------------------------------------------
% 0.43/38.61  # User time                : 14.902 s
% 0.43/38.61  # System time              : 0.119 s
% 0.43/38.61  # Total time               : 15.021 s
% 0.43/38.61  # Maximum resident set size: 147532 pages
% 0.43/46.41  eprover: CPU time limit exceeded, terminating
% 0.43/46.41  eprover: CPU time limit exceeded, terminating
% 0.43/46.42  eprover: CPU time limit exceeded, terminating
% 0.43/46.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.43  eprover: No such file or directory
% 0.43/46.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.43  eprover: No such file or directory
% 0.43/46.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.43  eprover: No such file or directory
% 0.43/46.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.43  eprover: No such file or directory
% 0.43/46.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.43  eprover: No such file or directory
% 0.43/46.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.43  eprover: No such file or directory
% 0.43/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.44  eprover: No such file or directory
% 0.43/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.44  eprover: No such file or directory
% 0.43/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.44  eprover: No such file or directory
% 0.43/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.44  eprover: No such file or directory
% 0.43/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.44  eprover: No such file or directory
% 0.43/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.45  eprover: No such file or directory
% 0.43/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.45  eprover: No such file or directory
% 0.43/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.45  eprover: No such file or directory
% 0.43/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.45  eprover: No such file or directory
% 0.43/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.45  eprover: No such file or directory
% 0.43/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.45  eprover: No such file or directory
% 0.43/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.45  eprover: No such file or directory
% 0.43/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.46  eprover: No such file or directory
% 0.43/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.46  eprover: No such file or directory
% 0.43/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.46  eprover: No such file or directory
% 0.43/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.46  eprover: No such file or directory
% 0.43/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.46  eprover: No such file or directory
% 0.43/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.46  eprover: No such file or directory
% 0.43/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.47  eprover: No such file or directory
% 0.43/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.47  eprover: No such file or directory
% 0.43/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.47  eprover: No such file or directory
% 0.43/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.47  eprover: No such file or directory
% 0.43/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.47  eprover: No such file or directory
% 0.43/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.47  eprover: No such file or directory
%------------------------------------------------------------------------------