TSTP Solution File: NUM570+3 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM570+3 : 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 : Mon Jul 18 09:33:55 EDT 2022

% Result   : Theorem 1.78s 265.93s
% Output   : CNFRefutation 1.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   43 (  15 unt;   0 def)
%            Number of atoms       :  343 (  35 equ)
%            Maximal formula atoms :  181 (   7 avg)
%            Number of connectives :  509 ( 209   ~; 217   |;  68   &)
%                                         (   1 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   45 (   5 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   6 con; 0-2 aty)
%            Number of variables   :   44 (   1 sgn  21   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( xi != sz00
   => ( ? [X1] :
          ( aElementOf0(X1,szNzAzT0)
          & szszuzczcdt0(X1) = xi )
      & ( ( aSet0(sdtlpdtrp0(xN,xi))
          & ! [X1] :
              ( aElementOf0(X1,sdtlpdtrp0(xN,xi))
             => aElementOf0(X1,szNzAzT0) ) )
        | aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) )
      & isCountable0(sdtlpdtrp0(xN,xi)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(mNatExtra,axiom,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => ( X1 = sz00
        | ? [X2] :
            ( aElementOf0(X2,szNzAzT0)
            & X1 = szszuzczcdt0(X2) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mNatExtra) ).

fof(mIH,axiom,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => iLess0(X1,szszuzczcdt0(X1)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIH) ).

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

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

fof(m__3623,hypothesis,
    ( aFunction0(xN)
    & szDzozmdt0(xN) = szNzAzT0
    & sdtlpdtrp0(xN,sz00) = xS
    & ! [X1] :
        ( aElementOf0(X1,szNzAzT0)
       => ( ( ( ( aSet0(sdtlpdtrp0(xN,X1))
                & ! [X2] :
                    ( aElementOf0(X2,sdtlpdtrp0(xN,X1))
                   => aElementOf0(X2,szNzAzT0) ) )
              | aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) )
            & isCountable0(sdtlpdtrp0(xN,X1)) )
         => ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
            & ! [X2] :
                ( aElementOf0(X2,sdtlpdtrp0(xN,X1))
               => sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X2) )
            & aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
            & ! [X2] :
                ( aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
              <=> ( aElement0(X2)
                  & aElementOf0(X2,sdtlpdtrp0(xN,X1))
                  & X2 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) )
            & aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
            & ! [X2] :
                ( aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1)))
               => aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
            & aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
            & isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3623) ).

fof(c_0_6,negated_conjecture,
    ~ ( xi != sz00
     => ( ? [X1] :
            ( aElementOf0(X1,szNzAzT0)
            & szszuzczcdt0(X1) = xi )
        & ( ( aSet0(sdtlpdtrp0(xN,xi))
            & ! [X1] :
                ( aElementOf0(X1,sdtlpdtrp0(xN,xi))
               => aElementOf0(X1,szNzAzT0) ) )
          | aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) )
        & isCountable0(sdtlpdtrp0(xN,xi)) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_7,plain,
    ! [X3] :
      ( ( aElementOf0(esk23_1(X3),szNzAzT0)
        | X3 = sz00
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( X3 = szszuzczcdt0(esk23_1(X3))
        | X3 = sz00
        | ~ aElementOf0(X3,szNzAzT0) ) ),
    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)],[mNatExtra])])])])])]) ).

fof(c_0_8,negated_conjecture,
    ! [X2] :
      ( xi != sz00
      & ( aElementOf0(esk13_0,sdtlpdtrp0(xN,xi))
        | ~ aSet0(sdtlpdtrp0(xN,xi))
        | ~ aElementOf0(X2,szNzAzT0)
        | szszuzczcdt0(X2) != xi
        | ~ isCountable0(sdtlpdtrp0(xN,xi)) )
      & ( ~ aElementOf0(esk13_0,szNzAzT0)
        | ~ aSet0(sdtlpdtrp0(xN,xi))
        | ~ aElementOf0(X2,szNzAzT0)
        | szszuzczcdt0(X2) != xi
        | ~ isCountable0(sdtlpdtrp0(xN,xi)) )
      & ( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
        | ~ aElementOf0(X2,szNzAzT0)
        | szszuzczcdt0(X2) != xi
        | ~ isCountable0(sdtlpdtrp0(xN,xi)) ) ),
    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)],[c_0_6])])])])])])]) ).

fof(c_0_9,plain,
    ! [X2] :
      ( ~ aElementOf0(X2,szNzAzT0)
      | iLess0(X2,szszuzczcdt0(X2)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIH])]) ).

cnf(c_0_10,plain,
    ( X1 = sz00
    | aElementOf0(esk23_1(X1),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,hypothesis,
    aElementOf0(xi,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__3702]) ).

cnf(c_0_12,negated_conjecture,
    xi != sz00,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( X1 = sz00
    | X1 = szszuzczcdt0(esk23_1(X1))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_14,hypothesis,
    ! [X3,X4] :
      ( ( aSet0(sdtlpdtrp0(xN,X3))
        | ~ iLess0(X3,xi)
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
        | aElementOf0(X4,szNzAzT0)
        | ~ iLess0(X3,xi)
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
        | ~ iLess0(X3,xi)
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( isCountable0(sdtlpdtrp0(xN,X3))
        | ~ iLess0(X3,xi)
        | ~ aElementOf0(X3,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[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)],[m__3671])])])])])]) ).

cnf(c_0_15,plain,
    ( iLess0(X1,szszuzczcdt0(X1))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_16,hypothesis,
    aElementOf0(esk23_1(xi),szNzAzT0),
    inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

cnf(c_0_17,hypothesis,
    szszuzczcdt0(esk23_1(xi)) = xi,
    inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_13,c_0_11]),c_0_12]) ).

fof(c_0_18,hypothesis,
    ! [X3,X5,X6,X6,X7] :
      ( aFunction0(xN)
      & szDzozmdt0(xN) = szNzAzT0
      & sdtlpdtrp0(xN,sz00) = xS
      & ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X3)),sdtlpdtrp0(xN,X3))
        | aElementOf0(esk12_1(X3),sdtlpdtrp0(xN,X3))
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( ~ aElementOf0(X5,sdtlpdtrp0(xN,X3))
        | sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X3)),X5)
        | aElementOf0(esk12_1(X3),sdtlpdtrp0(xN,X3))
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | aElementOf0(esk12_1(X3),sdtlpdtrp0(xN,X3))
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aElement0(X6)
        | ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | aElementOf0(esk12_1(X3),sdtlpdtrp0(xN,X3))
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aElementOf0(X6,sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | aElementOf0(esk12_1(X3),sdtlpdtrp0(xN,X3))
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( X6 != szmzizndt0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | aElementOf0(esk12_1(X3),sdtlpdtrp0(xN,X3))
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( ~ aElement0(X6)
        | ~ aElementOf0(X6,sdtlpdtrp0(xN,X3))
        | X6 = szmzizndt0(sdtlpdtrp0(xN,X3))
        | aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | aElementOf0(esk12_1(X3),sdtlpdtrp0(xN,X3))
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X3)))
        | aElementOf0(esk12_1(X3),sdtlpdtrp0(xN,X3))
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( ~ aElementOf0(X7,sdtlpdtrp0(xN,szszuzczcdt0(X3)))
        | aElementOf0(X7,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | aElementOf0(esk12_1(X3),sdtlpdtrp0(xN,X3))
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X3)),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | aElementOf0(esk12_1(X3),sdtlpdtrp0(xN,X3))
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X3)))
        | aElementOf0(esk12_1(X3),sdtlpdtrp0(xN,X3))
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X3)),sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(esk12_1(X3),szNzAzT0)
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( ~ aElementOf0(X5,sdtlpdtrp0(xN,X3))
        | sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X3)),X5)
        | ~ aElementOf0(esk12_1(X3),szNzAzT0)
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aElementOf0(esk12_1(X3),szNzAzT0)
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aElement0(X6)
        | ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aElementOf0(esk12_1(X3),szNzAzT0)
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aElementOf0(X6,sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aElementOf0(esk12_1(X3),szNzAzT0)
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( X6 != szmzizndt0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aElementOf0(esk12_1(X3),szNzAzT0)
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( ~ aElement0(X6)
        | ~ aElementOf0(X6,sdtlpdtrp0(xN,X3))
        | X6 = szmzizndt0(sdtlpdtrp0(xN,X3))
        | aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aElementOf0(esk12_1(X3),szNzAzT0)
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X3)))
        | ~ aElementOf0(esk12_1(X3),szNzAzT0)
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( ~ aElementOf0(X7,sdtlpdtrp0(xN,szszuzczcdt0(X3)))
        | aElementOf0(X7,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aElementOf0(esk12_1(X3),szNzAzT0)
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X3)),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aElementOf0(esk12_1(X3),szNzAzT0)
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X3)))
        | ~ aElementOf0(esk12_1(X3),szNzAzT0)
        | ~ aSet0(sdtlpdtrp0(xN,X3))
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X3)),sdtlpdtrp0(xN,X3))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( ~ aElementOf0(X5,sdtlpdtrp0(xN,X3))
        | sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X3)),X5)
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aElement0(X6)
        | ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aElementOf0(X6,sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( X6 != szmzizndt0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( ~ aElement0(X6)
        | ~ aElementOf0(X6,sdtlpdtrp0(xN,X3))
        | X6 = szmzizndt0(sdtlpdtrp0(xN,X3))
        | aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X3)))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( ~ aElementOf0(X7,sdtlpdtrp0(xN,szszuzczcdt0(X3)))
        | aElementOf0(X7,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X3)),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) )
      & ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X3)))
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X3))
        | ~ aElementOf0(X3,szNzAzT0) ) ),
    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)],[m__3623])])])])])])]) ).

cnf(c_0_19,hypothesis,
    ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ iLess0(X1,xi) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,hypothesis,
    iLess0(esk23_1(xi),xi),
    inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_21,hypothesis,
    ( isCountable0(sdtlpdtrp0(xN,X1))
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ iLess0(X1,xi) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

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

cnf(c_0_23,hypothesis,
    aSubsetOf0(sdtlpdtrp0(xN,esk23_1(xi)),szNzAzT0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_19,c_0_20]),c_0_16])]) ).

cnf(c_0_24,hypothesis,
    isCountable0(sdtlpdtrp0(xN,esk23_1(xi))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_21,c_0_20]),c_0_16])]) ).

cnf(c_0_25,negated_conjecture,
    ( aElementOf0(esk13_0,sdtlpdtrp0(xN,xi))
    | ~ isCountable0(sdtlpdtrp0(xN,xi))
    | szszuzczcdt0(X1) != xi
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aSet0(sdtlpdtrp0(xN,xi)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_26,hypothesis,
    aSet0(sdtlpdtrp0(xN,xi)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_22,c_0_23]),c_0_17]),c_0_24]),c_0_16])]) ).

cnf(c_0_27,hypothesis,
    ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ isCountable0(sdtlpdtrp0(xN,X1))
    | ~ aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_28,negated_conjecture,
    ( aElementOf0(esk13_0,sdtlpdtrp0(xN,xi))
    | szszuzczcdt0(X1) != xi
    | ~ isCountable0(sdtlpdtrp0(xN,xi))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).

cnf(c_0_29,hypothesis,
    isCountable0(sdtlpdtrp0(xN,xi)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_27,c_0_23]),c_0_17]),c_0_24]),c_0_16])]) ).

cnf(c_0_30,hypothesis,
    ( aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ isCountable0(sdtlpdtrp0(xN,X1))
    | ~ aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
    | ~ aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_31,negated_conjecture,
    ( aElementOf0(esk13_0,sdtlpdtrp0(xN,xi))
    | szszuzczcdt0(X1) != xi
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).

cnf(c_0_32,hypothesis,
    ( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,esk23_1(xi)),szmzizndt0(sdtlpdtrp0(xN,esk23_1(xi)))))
    | ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_30,c_0_17]),c_0_23]),c_0_24]),c_0_16])]) ).

cnf(c_0_33,hypothesis,
    aElementOf0(esk13_0,sdtlpdtrp0(xN,xi)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_31,c_0_16]),c_0_17])]) ).

cnf(c_0_34,hypothesis,
    ( aElementOf0(X2,sdtlpdtrp0(xN,X1))
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ isCountable0(sdtlpdtrp0(xN,X1))
    | ~ aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
    | ~ aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_35,hypothesis,
    aElementOf0(esk13_0,sdtmndt0(sdtlpdtrp0(xN,esk23_1(xi)),szmzizndt0(sdtlpdtrp0(xN,esk23_1(xi))))),
    inference(pm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ isCountable0(sdtlpdtrp0(xN,xi))
    | szszuzczcdt0(X1) != xi
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aSet0(sdtlpdtrp0(xN,xi))
    | ~ aElementOf0(esk13_0,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_37,hypothesis,
    ( aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ iLess0(X1,xi)
    | ~ aElementOf0(X2,sdtlpdtrp0(xN,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_38,hypothesis,
    aElementOf0(esk13_0,sdtlpdtrp0(xN,esk23_1(xi))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_35]),c_0_23]),c_0_24]),c_0_16])]) ).

cnf(c_0_39,negated_conjecture,
    ( szszuzczcdt0(X1) != xi
    | ~ aElementOf0(esk13_0,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_26])]),c_0_29])]) ).

cnf(c_0_40,hypothesis,
    aElementOf0(esk13_0,szNzAzT0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_37,c_0_38]),c_0_20]),c_0_16])]) ).

cnf(c_0_41,negated_conjecture,
    ( szszuzczcdt0(X1) != xi
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).

cnf(c_0_42,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_41,c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM570+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/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 : Tue Jul  5 18:13:07 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.36/23.41  eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.36/23.41  
% 0.36/23.41  eprover: CPU time limit exceeded, terminating
% 0.36/23.42  eprover: CPU time limit exceeded, terminating
% 0.50/46.43  eprover: CPU time limit exceeded, terminating
% 0.50/46.44  eprover: CPU time limit exceeded, terminating
% 0.50/46.45  eprover: CPU time limit exceeded, terminating
% 0.50/46.45  eprover: CPU time limit exceeded, terminating
% 0.63/69.45  eprover: CPU time limit exceeded, terminating
% 0.63/69.46  eprover: CPU time limit exceeded, terminating
% 0.63/69.47  eprover: CPU time limit exceeded, terminating
% 0.63/69.48  eprover: CPU time limit exceeded, terminating
% 0.77/92.48  eprover: CPU time limit exceeded, terminating
% 0.77/92.48  eprover: CPU time limit exceeded, terminating
% 0.77/92.50  eprover: CPU time limit exceeded, terminating
% 0.77/92.51  eprover: CPU time limit exceeded, terminating
% 0.90/115.50  eprover: CPU time limit exceeded, terminating
% 0.90/115.52  eprover: CPU time limit exceeded, terminating
% 0.90/115.52  eprover: CPU time limit exceeded, terminating
% 0.90/115.53  eprover: CPU time limit exceeded, terminating
% 1.04/138.54  eprover: CPU time limit exceeded, terminating
% 1.04/138.55  eprover: CPU time limit exceeded, terminating
% 1.04/138.55  eprover: CPU time limit exceeded, terminating
% 1.04/138.56  eprover: CPU time limit exceeded, terminating
% 1.17/161.57  eprover: CPU time limit exceeded, terminating
% 1.17/161.58  eprover: CPU time limit exceeded, terminating
% 1.17/161.58  eprover: CPU time limit exceeded, terminating
% 1.17/161.59  eprover: CPU time limit exceeded, terminating
% 1.30/184.59  eprover: CPU time limit exceeded, terminating
% 1.30/184.60  eprover: CPU time limit exceeded, terminating
% 1.30/184.60  eprover: CPU time limit exceeded, terminating
% 1.30/184.61  eprover: CPU time limit exceeded, terminating
% 1.44/207.62  eprover: CPU time limit exceeded, terminating
% 1.44/207.63  eprover: CPU time limit exceeded, terminating
% 1.44/207.63  eprover: CPU time limit exceeded, terminating
% 1.44/207.63  eprover: CPU time limit exceeded, terminating
% 1.57/230.65  eprover: CPU time limit exceeded, terminating
% 1.57/230.65  eprover: CPU time limit exceeded, terminating
% 1.57/230.65  eprover: CPU time limit exceeded, terminating
% 1.57/230.67  eprover: CPU time limit exceeded, terminating
% 1.70/253.67  eprover: CPU time limit exceeded, terminating
% 1.70/253.67  eprover: CPU time limit exceeded, terminating
% 1.70/253.69  eprover: CPU time limit exceeded, terminating
% 1.70/253.69  eprover: CPU time limit exceeded, terminating
% 1.78/265.93  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 1.78/265.93  
% 1.78/265.93  # Failure: Resource limit exceeded (time)
% 1.78/265.93  # OLD status Res
% 1.78/265.93  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 1.78/265.93  # Preprocessing time       : 0.413 s
% 1.78/265.93  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 1.78/265.93  
% 1.78/265.93  # Failure: Resource limit exceeded (time)
% 1.78/265.93  # OLD status Res
% 1.78/265.93  # Preprocessing time       : 0.273 s
% 1.78/265.93  # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 1.78/265.93  
% 1.78/265.93  # Failure: Resource limit exceeded (time)
% 1.78/265.93  # OLD status Res
% 1.78/265.93  # Preprocessing time       : 0.166 s
% 1.78/265.93  # Running protocol protocol_eprover_761a0d093d9701c0eed884aebb46468e8d439c31 for 23 seconds:
% 1.78/265.93  
% 1.78/265.93  # Failure: Resource limit exceeded (time)
% 1.78/265.93  # OLD status Res
% 1.78/265.93  # SinE strategy is GSinE(CountFormulas,hypos,1.2,,,100,1.0)
% 1.78/265.93  # Preprocessing time       : 0.184 s
% 1.78/265.93  # Running protocol protocol_eprover_bb5e3cecdbc7660bd3a6f864cadb7769d8aea26a for 23 seconds:
% 1.78/265.93  
% 1.78/265.93  # Failure: Resource limit exceeded (time)
% 1.78/265.93  # OLD status Res
% 1.78/265.93  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,,500,1.0)
% 1.78/265.93  # Preprocessing time       : 0.171 s
% 1.78/265.93  # Running protocol protocol_eprover_e252f7803940d118fa0ef69fc2319cb55aee23b9 for 23 seconds:
% 1.78/265.93  
% 1.78/265.93  # Failure: Resource limit exceeded (time)
% 1.78/265.93  # OLD status Res
% 1.78/265.93  # SinE strategy is GSinE(CountFormulas,,1.4,,03,100,1.0)
% 1.78/265.93  # Preprocessing time       : 0.188 s
% 1.78/265.93  # Running protocol protocol_eprover_b1d72019af42f5b571a6c0b233a5b6d1de064075 for 23 seconds:
% 1.78/265.93  
% 1.78/265.93  # Failure: Resource limit exceeded (time)
% 1.78/265.93  # OLD status Res
% 1.78/265.93  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,500,1.0)
% 1.78/265.93  # Preprocessing time       : 0.290 s
% 1.78/265.93  # Running protocol protocol_eprover_e96ef4641ae500918cdd95fcfce21e29f2ac5eec for 23 seconds:
% 1.78/265.93  
% 1.78/265.93  # Failure: Resource limit exceeded (time)
% 1.78/265.93  # OLD status Res
% 1.78/265.93  # SinE strategy is GSinE(CountFormulas,,6.0,,03,100,1.0)
% 1.78/265.93  # Preprocessing time       : 0.245 s
% 1.78/265.93  # Running protocol protocol_eprover_1f734394cb6ce69b36c9826f6782d3567d6ecd6c for 23 seconds:
% 1.78/265.93  
% 1.78/265.93  # Failure: Resource limit exceeded (time)
% 1.78/265.93  # OLD status Res
% 1.78/265.93  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,20000,1.0)
% 1.78/265.93  # Preprocessing time       : 0.265 s
% 1.78/265.93  # Running protocol protocol_eprover_e9eb28a402764e1f99b41605245cd0a359f475fb for 23 seconds:
% 1.78/265.93  
% 1.78/265.93  # Failure: Resource limit exceeded (time)
% 1.78/265.93  # OLD status Res
% 1.78/265.93  # Preprocessing time       : 0.176 s
% 1.78/265.93  # Running protocol protocol_eprover_3dd3316ad6e39f95bf120b2757347c6970e0a532 for 23 seconds:
% 1.78/265.93  
% 1.78/265.93  # Failure: Resource limit exceeded (time)
% 1.78/265.93  # OLD status Res
% 1.78/265.93  # SinE strategy is GSinE(CountFormulas,,1.1,,01,500,1.0)
% 1.78/265.93  # Preprocessing time       : 0.011 s
% 1.78/265.93  # Running protocol protocol_eprover_d8753ebeaa9aad70c7a4742461200d6169c65b7e for 23 seconds:
% 1.78/265.93  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,03,100,1.0)
% 1.78/265.93  # Preprocessing time       : 0.184 s
% 1.78/265.93  
% 1.78/265.93  # Proof found!
% 1.78/265.93  # SZS status Theorem
% 1.78/265.93  # SZS output start CNFRefutation
% See solution above
% 1.78/265.93  # Proof object total steps             : 43
% 1.78/265.93  # Proof object clause steps            : 31
% 1.78/265.93  # Proof object formula steps           : 12
% 1.78/265.93  # Proof object conjectures             : 10
% 1.78/265.93  # Proof object clause conjectures      : 7
% 1.78/265.93  # Proof object formula conjectures     : 3
% 1.78/265.93  # Proof object initial clauses used    : 14
% 1.78/265.93  # Proof object initial formulas used   : 6
% 1.78/265.93  # Proof object generating inferences   : 13
% 1.78/265.93  # Proof object simplifying inferences  : 40
% 1.78/265.93  # Training examples: 0 positive, 0 negative
% 1.78/265.93  # Parsed axioms                        : 84
% 1.78/265.93  # Removed by relevancy pruning/SinE    : 12
% 1.78/265.93  # Initial clauses                      : 4148
% 1.78/265.93  # Removed in clause preprocessing      : 7
% 1.78/265.93  # Initial clauses in saturation        : 4141
% 1.78/265.93  # Processed clauses                    : 11102
% 1.78/265.93  # ...of these trivial                  : 91
% 1.78/265.93  # ...subsumed                          : 1098
% 1.78/265.93  # ...remaining for further processing  : 9913
% 1.78/265.93  # Other redundant clauses eliminated   : 2
% 1.78/265.93  # Clauses deleted for lack of memory   : 309455
% 1.78/265.93  # Backward-subsumed                    : 6
% 1.78/265.93  # Backward-rewritten                   : 78
% 1.78/265.93  # Generated clauses                    : 411943
% 1.78/265.93  # ...of the previous two non-trivial   : 410643
% 1.78/265.93  # Contextual simplify-reflections      : 0
% 1.78/265.93  # Paramodulations                      : 411762
% 1.78/265.93  # Factorizations                       : 0
% 1.78/265.93  # Equation resolutions                 : 180
% 1.78/265.93  # Current number of processed clauses  : 9826
% 1.78/265.93  #    Positive orientable unit clauses  : 1727
% 1.78/265.93  #    Positive unorientable unit clauses: 0
% 1.78/265.93  #    Negative unit clauses             : 312
% 1.78/265.93  #    Non-unit-clauses                  : 7787
% 1.78/265.93  # Current number of unprocessed clauses: 93667
% 1.78/265.93  # ...number of literals in the above   : 253338
% 1.78/265.93  # Current number of archived formulas  : 0
% 1.78/265.93  # Current number of archived clauses   : 85
% 1.78/265.93  # Clause-clause subsumption calls (NU) : 4659643
% 1.78/265.93  # Rec. Clause-clause subsumption calls : 102428
% 1.78/265.93  # Non-unit clause-clause subsumptions  : 827
% 1.78/265.93  # Unit Clause-clause subsumption calls : 5782655
% 1.78/265.93  # Rewrite failures with RHS unbound    : 0
% 1.78/265.93  # BW rewrite match attempts            : 6561
% 1.78/265.93  # BW rewrite match successes           : 19
% 1.78/265.93  # Condensation attempts                : 0
% 1.78/265.93  # Condensation successes               : 0
% 1.78/265.93  # Termbank termtop insertions          : 3239422
% 1.78/265.93  
% 1.78/265.93  # -------------------------------------------------
% 1.78/265.93  # User time                : 12.055 s
% 1.78/265.93  # System time              : 0.114 s
% 1.78/265.93  # Total time               : 12.169 s
% 1.78/265.93  # Maximum resident set size: 152400 pages
% 1.78/276.69  eprover: CPU time limit exceeded, terminating
% 1.78/276.70  eprover: CPU time limit exceeded, terminating
% 1.78/276.72  eprover: CPU time limit exceeded, terminating
%------------------------------------------------------------------------------