TSTP Solution File: NUM604+1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : NUM604+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n009.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 : Thu Aug 31 11:31:47 EDT 2023

% Result   : Theorem 11.84s 2.70s
% Output   : CNFRefutation 11.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   92 (  22 unt;   0 def)
%            Number of atoms       :  321 (  59 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  383 ( 154   ~; 151   |;  57   &)
%                                         (   7 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   7 con; 0-2 aty)
%            Number of variables   :  128 (   0 sgn;  92   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0] :
      ( slcrc0 = X0
    <=> ( ~ ? [X1] : aElementOf0(X1,X0)
        & aSet0(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).

fof(f9,axiom,
    ! [X0] :
      ( ( isCountable0(X0)
        & aSet0(X0) )
     => slcrc0 != X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin_01) ).

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

fof(f14,axiom,
    ! [X0,X1,X2] :
      ( ( aSet0(X2)
        & aSet0(X1)
        & aSet0(X0) )
     => ( ( aSubsetOf0(X1,X2)
          & aSubsetOf0(X0,X1) )
       => aSubsetOf0(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubTrans) ).

fof(f17,axiom,
    ! [X0] :
      ( aSet0(X0)
     => ! [X1] :
          ( aElementOf0(X1,X0)
         => sdtpldt0(sdtmndt0(X0,X1),X1) = X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mConsDiff) ).

fof(f23,axiom,
    ( isCountable0(szNzAzT0)
    & aSet0(szNzAzT0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).

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

fof(f75,axiom,
    ( isCountable0(xS)
    & aSubsetOf0(xS,szNzAzT0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).

fof(f82,axiom,
    ! [X0] :
      ( aElementOf0(X0,szNzAzT0)
     => ( isCountable0(sdtlpdtrp0(xN,X0))
        & aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3671) ).

fof(f91,axiom,
    ( ! [X0] :
        ( aElementOf0(X0,szNzAzT0)
       => szmzizndt0(sdtlpdtrp0(xN,X0)) = sdtlpdtrp0(xe,X0) )
    & szNzAzT0 = szDzozmdt0(xe)
    & aFunction0(xe) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4660) ).

fof(f99,axiom,
    ( xx = sdtlpdtrp0(xe,xi)
    & aElementOf0(xi,szNzAzT0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5034) ).

fof(f100,axiom,
    aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5045) ).

fof(f101,conjecture,
    aElementOf0(xx,xS),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f102,negated_conjecture,
    ~ aElementOf0(xx,xS),
    inference(negated_conjecture,[],[f101]) ).

fof(f110,plain,
    ~ aElementOf0(xx,xS),
    inference(flattening,[],[f102]) ).

fof(f112,plain,
    ! [X0] :
      ( slcrc0 = X0
    <=> ( ! [X1] : ~ aElementOf0(X1,X0)
        & aSet0(X0) ) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f115,plain,
    ! [X0] :
      ( slcrc0 != X0
      | ~ isCountable0(X0)
      | ~ aSet0(X0) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f116,plain,
    ! [X0] :
      ( slcrc0 != X0
      | ~ isCountable0(X0)
      | ~ aSet0(X0) ),
    inference(flattening,[],[f115]) ).

fof(f117,plain,
    ! [X0] :
      ( ! [X1] :
          ( aSubsetOf0(X1,X0)
        <=> ( ! [X2] :
                ( aElementOf0(X2,X0)
                | ~ aElementOf0(X2,X1) )
            & aSet0(X1) ) )
      | ~ aSet0(X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f123,plain,
    ! [X0,X1,X2] :
      ( aSubsetOf0(X0,X2)
      | ~ aSubsetOf0(X1,X2)
      | ~ aSubsetOf0(X0,X1)
      | ~ aSet0(X2)
      | ~ aSet0(X1)
      | ~ aSet0(X0) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f124,plain,
    ! [X0,X1,X2] :
      ( aSubsetOf0(X0,X2)
      | ~ aSubsetOf0(X1,X2)
      | ~ aSubsetOf0(X0,X1)
      | ~ aSet0(X2)
      | ~ aSet0(X1)
      | ~ aSet0(X0) ),
    inference(flattening,[],[f123]) ).

fof(f129,plain,
    ! [X0] :
      ( ! [X1] :
          ( sdtpldt0(sdtmndt0(X0,X1),X1) = X0
          | ~ aElementOf0(X1,X0) )
      | ~ aSet0(X0) ),
    inference(ennf_transformation,[],[f17]) ).

fof(f170,plain,
    ! [X0] :
      ( ! [X1] :
          ( szmzizndt0(X0) = X1
        <=> ( ! [X2] :
                ( sdtlseqdt0(X1,X2)
                | ~ aElementOf0(X2,X0) )
            & aElementOf0(X1,X0) ) )
      | slcrc0 = X0
      | ~ aSubsetOf0(X0,szNzAzT0) ),
    inference(ennf_transformation,[],[f47]) ).

fof(f171,plain,
    ! [X0] :
      ( ! [X1] :
          ( szmzizndt0(X0) = X1
        <=> ( ! [X2] :
                ( sdtlseqdt0(X1,X2)
                | ~ aElementOf0(X2,X0) )
            & aElementOf0(X1,X0) ) )
      | slcrc0 = X0
      | ~ aSubsetOf0(X0,szNzAzT0) ),
    inference(flattening,[],[f170]) ).

fof(f214,plain,
    ! [X0] :
      ( ( isCountable0(sdtlpdtrp0(xN,X0))
        & aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) )
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(ennf_transformation,[],[f82]) ).

fof(f230,plain,
    ( ! [X0] :
        ( szmzizndt0(sdtlpdtrp0(xN,X0)) = sdtlpdtrp0(xe,X0)
        | ~ aElementOf0(X0,szNzAzT0) )
    & szNzAzT0 = szDzozmdt0(xe)
    & aFunction0(xe) ),
    inference(ennf_transformation,[],[f91]) ).

fof(f240,plain,
    ! [X0] :
      ( ( slcrc0 = X0
        | ? [X1] : aElementOf0(X1,X0)
        | ~ aSet0(X0) )
      & ( ( ! [X1] : ~ aElementOf0(X1,X0)
          & aSet0(X0) )
        | slcrc0 != X0 ) ),
    inference(nnf_transformation,[],[f112]) ).

fof(f241,plain,
    ! [X0] :
      ( ( slcrc0 = X0
        | ? [X1] : aElementOf0(X1,X0)
        | ~ aSet0(X0) )
      & ( ( ! [X1] : ~ aElementOf0(X1,X0)
          & aSet0(X0) )
        | slcrc0 != X0 ) ),
    inference(flattening,[],[f240]) ).

fof(f242,plain,
    ! [X0] :
      ( ( slcrc0 = X0
        | ? [X1] : aElementOf0(X1,X0)
        | ~ aSet0(X0) )
      & ( ( ! [X2] : ~ aElementOf0(X2,X0)
          & aSet0(X0) )
        | slcrc0 != X0 ) ),
    inference(rectify,[],[f241]) ).

fof(f243,plain,
    ! [X0] :
      ( ? [X1] : aElementOf0(X1,X0)
     => aElementOf0(sK4(X0),X0) ),
    introduced(choice_axiom,[]) ).

fof(f244,plain,
    ! [X0] :
      ( ( slcrc0 = X0
        | aElementOf0(sK4(X0),X0)
        | ~ aSet0(X0) )
      & ( ( ! [X2] : ~ aElementOf0(X2,X0)
          & aSet0(X0) )
        | slcrc0 != X0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f242,f243]) ).

fof(f245,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( aSubsetOf0(X1,X0)
            | ? [X2] :
                ( ~ aElementOf0(X2,X0)
                & aElementOf0(X2,X1) )
            | ~ aSet0(X1) )
          & ( ( ! [X2] :
                  ( aElementOf0(X2,X0)
                  | ~ aElementOf0(X2,X1) )
              & aSet0(X1) )
            | ~ aSubsetOf0(X1,X0) ) )
      | ~ aSet0(X0) ),
    inference(nnf_transformation,[],[f117]) ).

fof(f246,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( aSubsetOf0(X1,X0)
            | ? [X2] :
                ( ~ aElementOf0(X2,X0)
                & aElementOf0(X2,X1) )
            | ~ aSet0(X1) )
          & ( ( ! [X2] :
                  ( aElementOf0(X2,X0)
                  | ~ aElementOf0(X2,X1) )
              & aSet0(X1) )
            | ~ aSubsetOf0(X1,X0) ) )
      | ~ aSet0(X0) ),
    inference(flattening,[],[f245]) ).

fof(f247,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( aSubsetOf0(X1,X0)
            | ? [X2] :
                ( ~ aElementOf0(X2,X0)
                & aElementOf0(X2,X1) )
            | ~ aSet0(X1) )
          & ( ( ! [X3] :
                  ( aElementOf0(X3,X0)
                  | ~ aElementOf0(X3,X1) )
              & aSet0(X1) )
            | ~ aSubsetOf0(X1,X0) ) )
      | ~ aSet0(X0) ),
    inference(rectify,[],[f246]) ).

fof(f248,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ~ aElementOf0(X2,X0)
          & aElementOf0(X2,X1) )
     => ( ~ aElementOf0(sK5(X0,X1),X0)
        & aElementOf0(sK5(X0,X1),X1) ) ),
    introduced(choice_axiom,[]) ).

fof(f249,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( aSubsetOf0(X1,X0)
            | ( ~ aElementOf0(sK5(X0,X1),X0)
              & aElementOf0(sK5(X0,X1),X1) )
            | ~ aSet0(X1) )
          & ( ( ! [X3] :
                  ( aElementOf0(X3,X0)
                  | ~ aElementOf0(X3,X1) )
              & aSet0(X1) )
            | ~ aSubsetOf0(X1,X0) ) )
      | ~ aSet0(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f247,f248]) ).

fof(f269,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( szmzizndt0(X0) = X1
            | ? [X2] :
                ( ~ sdtlseqdt0(X1,X2)
                & aElementOf0(X2,X0) )
            | ~ aElementOf0(X1,X0) )
          & ( ( ! [X2] :
                  ( sdtlseqdt0(X1,X2)
                  | ~ aElementOf0(X2,X0) )
              & aElementOf0(X1,X0) )
            | szmzizndt0(X0) != X1 ) )
      | slcrc0 = X0
      | ~ aSubsetOf0(X0,szNzAzT0) ),
    inference(nnf_transformation,[],[f171]) ).

fof(f270,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( szmzizndt0(X0) = X1
            | ? [X2] :
                ( ~ sdtlseqdt0(X1,X2)
                & aElementOf0(X2,X0) )
            | ~ aElementOf0(X1,X0) )
          & ( ( ! [X2] :
                  ( sdtlseqdt0(X1,X2)
                  | ~ aElementOf0(X2,X0) )
              & aElementOf0(X1,X0) )
            | szmzizndt0(X0) != X1 ) )
      | slcrc0 = X0
      | ~ aSubsetOf0(X0,szNzAzT0) ),
    inference(flattening,[],[f269]) ).

fof(f271,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( szmzizndt0(X0) = X1
            | ? [X2] :
                ( ~ sdtlseqdt0(X1,X2)
                & aElementOf0(X2,X0) )
            | ~ aElementOf0(X1,X0) )
          & ( ( ! [X3] :
                  ( sdtlseqdt0(X1,X3)
                  | ~ aElementOf0(X3,X0) )
              & aElementOf0(X1,X0) )
            | szmzizndt0(X0) != X1 ) )
      | slcrc0 = X0
      | ~ aSubsetOf0(X0,szNzAzT0) ),
    inference(rectify,[],[f270]) ).

fof(f272,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ~ sdtlseqdt0(X1,X2)
          & aElementOf0(X2,X0) )
     => ( ~ sdtlseqdt0(X1,sK10(X0,X1))
        & aElementOf0(sK10(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f273,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( szmzizndt0(X0) = X1
            | ( ~ sdtlseqdt0(X1,sK10(X0,X1))
              & aElementOf0(sK10(X0,X1),X0) )
            | ~ aElementOf0(X1,X0) )
          & ( ( ! [X3] :
                  ( sdtlseqdt0(X1,X3)
                  | ~ aElementOf0(X3,X0) )
              & aElementOf0(X1,X0) )
            | szmzizndt0(X0) != X1 ) )
      | slcrc0 = X0
      | ~ aSubsetOf0(X0,szNzAzT0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f271,f272]) ).

fof(f326,plain,
    ! [X0] :
      ( aSet0(X0)
      | slcrc0 != X0 ),
    inference(cnf_transformation,[],[f244]) ).

fof(f331,plain,
    ! [X0] :
      ( slcrc0 != X0
      | ~ isCountable0(X0)
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f116]) ).

fof(f332,plain,
    ! [X0,X1] :
      ( aSet0(X1)
      | ~ aSubsetOf0(X1,X0)
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f249]) ).

fof(f333,plain,
    ! [X3,X0,X1] :
      ( aElementOf0(X3,X0)
      | ~ aElementOf0(X3,X1)
      | ~ aSubsetOf0(X1,X0)
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f249]) ).

fof(f339,plain,
    ! [X2,X0,X1] :
      ( aSubsetOf0(X0,X2)
      | ~ aSubsetOf0(X1,X2)
      | ~ aSubsetOf0(X0,X1)
      | ~ aSet0(X2)
      | ~ aSet0(X1)
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f124]) ).

fof(f364,plain,
    ! [X0,X1] :
      ( sdtpldt0(sdtmndt0(X0,X1),X1) = X0
      | ~ aElementOf0(X1,X0)
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f129]) ).

fof(f370,plain,
    aSet0(szNzAzT0),
    inference(cnf_transformation,[],[f23]) ).

fof(f399,plain,
    ! [X0,X1] :
      ( aElementOf0(X1,X0)
      | szmzizndt0(X0) != X1
      | slcrc0 = X0
      | ~ aSubsetOf0(X0,szNzAzT0) ),
    inference(cnf_transformation,[],[f273]) ).

fof(f471,plain,
    aSubsetOf0(xS,szNzAzT0),
    inference(cnf_transformation,[],[f75]) ).

fof(f490,plain,
    ! [X0] :
      ( isCountable0(sdtlpdtrp0(xN,X0))
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(cnf_transformation,[],[f214]) ).

fof(f509,plain,
    ! [X0] :
      ( szmzizndt0(sdtlpdtrp0(xN,X0)) = sdtlpdtrp0(xe,X0)
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(cnf_transformation,[],[f230]) ).

fof(f524,plain,
    aElementOf0(xi,szNzAzT0),
    inference(cnf_transformation,[],[f99]) ).

fof(f525,plain,
    xx = sdtlpdtrp0(xe,xi),
    inference(cnf_transformation,[],[f99]) ).

fof(f526,plain,
    aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(cnf_transformation,[],[f100]) ).

fof(f527,plain,
    ~ aElementOf0(xx,xS),
    inference(cnf_transformation,[],[f110]) ).

fof(f529,plain,
    aSet0(slcrc0),
    inference(equality_resolution,[],[f326]) ).

fof(f530,plain,
    ( ~ isCountable0(slcrc0)
    | ~ aSet0(slcrc0) ),
    inference(equality_resolution,[],[f331]) ).

fof(f537,plain,
    ! [X0] :
      ( aElementOf0(szmzizndt0(X0),X0)
      | slcrc0 = X0
      | ~ aSubsetOf0(X0,szNzAzT0) ),
    inference(equality_resolution,[],[f399]) ).

cnf(c_52,plain,
    aSet0(slcrc0),
    inference(cnf_transformation,[],[f529]) ).

cnf(c_55,plain,
    ( ~ aSet0(slcrc0)
    | ~ isCountable0(slcrc0) ),
    inference(cnf_transformation,[],[f530]) ).

cnf(c_58,plain,
    ( ~ aElementOf0(X0,X1)
    | ~ aSubsetOf0(X1,X2)
    | ~ aSet0(X2)
    | aElementOf0(X0,X2) ),
    inference(cnf_transformation,[],[f333]) ).

cnf(c_59,plain,
    ( ~ aSubsetOf0(X0,X1)
    | ~ aSet0(X1)
    | aSet0(X0) ),
    inference(cnf_transformation,[],[f332]) ).

cnf(c_63,plain,
    ( ~ aSubsetOf0(X0,X1)
    | ~ aSubsetOf0(X2,X0)
    | ~ aSet0(X0)
    | ~ aSet0(X1)
    | ~ aSet0(X2)
    | aSubsetOf0(X2,X1) ),
    inference(cnf_transformation,[],[f339]) ).

cnf(c_88,plain,
    ( ~ aElementOf0(X0,X1)
    | ~ aSet0(X1)
    | sdtpldt0(sdtmndt0(X1,X0),X0) = X1 ),
    inference(cnf_transformation,[],[f364]) ).

cnf(c_95,plain,
    aSet0(szNzAzT0),
    inference(cnf_transformation,[],[f370]) ).

cnf(c_126,plain,
    ( ~ aSubsetOf0(X0,szNzAzT0)
    | X0 = slcrc0
    | aElementOf0(szmzizndt0(X0),X0) ),
    inference(cnf_transformation,[],[f537]) ).

cnf(c_196,plain,
    aSubsetOf0(xS,szNzAzT0),
    inference(cnf_transformation,[],[f471]) ).

cnf(c_213,plain,
    ( ~ aElementOf0(X0,szNzAzT0)
    | isCountable0(sdtlpdtrp0(xN,X0)) ),
    inference(cnf_transformation,[],[f490]) ).

cnf(c_231,plain,
    ( ~ aElementOf0(X0,szNzAzT0)
    | szmzizndt0(sdtlpdtrp0(xN,X0)) = sdtlpdtrp0(xe,X0) ),
    inference(cnf_transformation,[],[f509]) ).

cnf(c_248,plain,
    sdtlpdtrp0(xe,xi) = xx,
    inference(cnf_transformation,[],[f525]) ).

cnf(c_249,plain,
    aElementOf0(xi,szNzAzT0),
    inference(cnf_transformation,[],[f524]) ).

cnf(c_250,plain,
    aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(cnf_transformation,[],[f526]) ).

cnf(c_251,negated_conjecture,
    ~ aElementOf0(xx,xS),
    inference(cnf_transformation,[],[f527]) ).

cnf(c_401,plain,
    ( ~ aSubsetOf0(X2,X0)
    | ~ aSubsetOf0(X0,X1)
    | ~ aSet0(X1)
    | ~ aSet0(X2)
    | aSubsetOf0(X2,X1) ),
    inference(global_subsumption_just,[status(thm)],[c_63,c_59,c_63]) ).

cnf(c_402,plain,
    ( ~ aSubsetOf0(X0,X1)
    | ~ aSubsetOf0(X2,X0)
    | ~ aSet0(X1)
    | ~ aSet0(X2)
    | aSubsetOf0(X2,X1) ),
    inference(renaming,[status(thm)],[c_401]) ).

cnf(c_18190,plain,
    ( ~ aSet0(szNzAzT0)
    | aSet0(xS) ),
    inference(superposition,[status(thm)],[c_196,c_59]) ).

cnf(c_18193,plain,
    ( ~ aSet0(xS)
    | aSet0(sdtlpdtrp0(xN,xi)) ),
    inference(superposition,[status(thm)],[c_250,c_59]) ).

cnf(c_18275,plain,
    ( ~ aSubsetOf0(X0,xS)
    | ~ aSet0(X0)
    | ~ aSet0(szNzAzT0)
    | aSubsetOf0(X0,szNzAzT0) ),
    inference(superposition,[status(thm)],[c_196,c_402]) ).

cnf(c_18492,plain,
    ( ~ aSet0(X0)
    | ~ aSubsetOf0(X0,xS)
    | aSubsetOf0(X0,szNzAzT0) ),
    inference(global_subsumption_just,[status(thm)],[c_18275,c_95,c_18275]) ).

cnf(c_18493,plain,
    ( ~ aSubsetOf0(X0,xS)
    | ~ aSet0(X0)
    | aSubsetOf0(X0,szNzAzT0) ),
    inference(renaming,[status(thm)],[c_18492]) ).

cnf(c_18501,plain,
    ( ~ aSet0(sdtlpdtrp0(xN,xi))
    | aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
    inference(superposition,[status(thm)],[c_250,c_18493]) ).

cnf(c_20798,plain,
    szmzizndt0(sdtlpdtrp0(xN,xi)) = sdtlpdtrp0(xe,xi),
    inference(superposition,[status(thm)],[c_249,c_231]) ).

cnf(c_21950,plain,
    szmzizndt0(sdtlpdtrp0(xN,xi)) = xx,
    inference(light_normalisation,[status(thm)],[c_20798,c_248]) ).

cnf(c_21953,plain,
    ( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
    | sdtlpdtrp0(xN,xi) = slcrc0
    | aElementOf0(xx,sdtlpdtrp0(xN,xi)) ),
    inference(superposition,[status(thm)],[c_21950,c_126]) ).

cnf(c_26320,plain,
    ( sdtlpdtrp0(xN,xi) = slcrc0
    | aElementOf0(xx,sdtlpdtrp0(xN,xi)) ),
    inference(global_subsumption_just,[status(thm)],[c_21953,c_95,c_18190,c_18193,c_18501,c_21953]) ).

cnf(c_26327,plain,
    ( ~ aSet0(sdtlpdtrp0(xN,xi))
    | sdtpldt0(sdtmndt0(sdtlpdtrp0(xN,xi),xx),xx) = sdtlpdtrp0(xN,xi)
    | sdtlpdtrp0(xN,xi) = slcrc0 ),
    inference(superposition,[status(thm)],[c_26320,c_88]) ).

cnf(c_26328,plain,
    ( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),X0)
    | ~ aSet0(X0)
    | sdtlpdtrp0(xN,xi) = slcrc0
    | aElementOf0(xx,X0) ),
    inference(superposition,[status(thm)],[c_26320,c_58]) ).

cnf(c_53777,plain,
    ( ~ aSet0(xS)
    | sdtlpdtrp0(xN,xi) = slcrc0
    | aElementOf0(xx,xS) ),
    inference(superposition,[status(thm)],[c_250,c_26328]) ).

cnf(c_53803,plain,
    sdtlpdtrp0(xN,xi) = slcrc0,
    inference(global_subsumption_just,[status(thm)],[c_26327,c_95,c_251,c_18190,c_53777]) ).

cnf(c_53886,plain,
    ( ~ aElementOf0(xi,szNzAzT0)
    | isCountable0(slcrc0) ),
    inference(superposition,[status(thm)],[c_53803,c_213]) ).

cnf(c_53921,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_53886,c_55,c_249,c_52]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : NUM604+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n009.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Fri Aug 25 15:31:06 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 11.84/2.70  % SZS status Started for theBenchmark.p
% 11.84/2.70  % SZS status Theorem for theBenchmark.p
% 11.84/2.70  
% 11.84/2.70  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 11.84/2.70  
% 11.84/2.70  ------  iProver source info
% 11.84/2.70  
% 11.84/2.70  git: date: 2023-05-31 18:12:56 +0000
% 11.84/2.70  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 11.84/2.70  git: non_committed_changes: false
% 11.84/2.70  git: last_make_outside_of_git: false
% 11.84/2.70  
% 11.84/2.70  ------ Parsing...
% 11.84/2.70  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 11.84/2.70  
% 11.84/2.70  ------ Preprocessing... sup_sim: 2  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e 
% 11.84/2.70  
% 11.84/2.70  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 11.84/2.70  
% 11.84/2.70  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 11.84/2.70  ------ Proving...
% 11.84/2.70  ------ Problem Properties 
% 11.84/2.70  
% 11.84/2.70  
% 11.84/2.70  clauses                                 198
% 11.84/2.70  conjectures                             1
% 11.84/2.70  EPR                                     46
% 11.84/2.70  Horn                                    159
% 11.84/2.70  unary                                   40
% 11.84/2.70  binary                                  32
% 11.84/2.70  lits                                    653
% 11.84/2.70  lits eq                                 104
% 11.84/2.70  fd_pure                                 0
% 11.84/2.70  fd_pseudo                               0
% 11.84/2.70  fd_cond                                 10
% 11.84/2.70  fd_pseudo_cond                          25
% 11.84/2.70  AC symbols                              0
% 11.84/2.70  
% 11.84/2.70  ------ Input Options Time Limit: Unbounded
% 11.84/2.70  
% 11.84/2.70  
% 11.84/2.70  ------ 
% 11.84/2.70  Current options:
% 11.84/2.70  ------ 
% 11.84/2.70  
% 11.84/2.70  
% 11.84/2.70  
% 11.84/2.70  
% 11.84/2.70  ------ Proving...
% 11.84/2.70  
% 11.84/2.70  
% 11.84/2.70  ------ Proving...
% 11.84/2.70  
% 11.84/2.70  
% 11.84/2.70  ------ Proving...
% 11.84/2.70  
% 11.84/2.70  
% 11.84/2.70  % SZS status Theorem for theBenchmark.p
% 11.84/2.70  
% 11.84/2.70  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 11.84/2.70  
% 11.84/2.70  
%------------------------------------------------------------------------------