TSTP Solution File: SET951+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET951+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n028.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 : Wed Aug 31 18:22:50 EDT 2022

% Result   : Theorem 1.52s 0.55s
% Output   : Refutation 1.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   91 (  13 unt;   0 def)
%            Number of atoms       :  343 (  84 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  405 ( 153   ~; 148   |;  82   &)
%                                         (  15 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   8 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   5 con; 0-3 aty)
%            Number of variables   :  213 ( 171   !;  42   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f280,plain,
    $false,
    inference(avatar_sat_refutation,[],[f162,f172,f202,f215,f220,f237,f270,f278]) ).

fof(f278,plain,
    spl11_9,
    inference(avatar_contradiction_clause,[],[f277]) ).

fof(f277,plain,
    ( $false
    | spl11_9 ),
    inference(subsumption_resolution,[],[f276,f75]) ).

fof(f75,plain,
    in(sK9,cartesian_product2(sK8,sK7)),
    inference(resolution,[],[f68,f49]) ).

fof(f49,plain,
    in(sK9,set_intersection2(cartesian_product2(sK6,sK5),cartesian_product2(sK8,sK7))),
    inference(cnf_transformation,[],[f33]) ).

fof(f33,plain,
    ( ! [X5,X6] :
        ( ordered_pair(X6,X5) != sK9
        | ~ in(X6,set_intersection2(sK6,sK8))
        | ~ in(X5,set_intersection2(sK5,sK7)) )
    & in(sK9,set_intersection2(cartesian_product2(sK6,sK5),cartesian_product2(sK8,sK7))) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9])],[f31,f32]) ).

fof(f32,plain,
    ( ? [X0,X1,X2,X3,X4] :
        ( ! [X5,X6] :
            ( ordered_pair(X6,X5) != X4
            | ~ in(X6,set_intersection2(X1,X3))
            | ~ in(X5,set_intersection2(X0,X2)) )
        & in(X4,set_intersection2(cartesian_product2(X1,X0),cartesian_product2(X3,X2))) )
   => ( ! [X6,X5] :
          ( ordered_pair(X6,X5) != sK9
          | ~ in(X6,set_intersection2(sK6,sK8))
          | ~ in(X5,set_intersection2(sK5,sK7)) )
      & in(sK9,set_intersection2(cartesian_product2(sK6,sK5),cartesian_product2(sK8,sK7))) ) ),
    introduced(choice_axiom,[]) ).

fof(f31,plain,
    ? [X0,X1,X2,X3,X4] :
      ( ! [X5,X6] :
          ( ordered_pair(X6,X5) != X4
          | ~ in(X6,set_intersection2(X1,X3))
          | ~ in(X5,set_intersection2(X0,X2)) )
      & in(X4,set_intersection2(cartesian_product2(X1,X0),cartesian_product2(X3,X2))) ),
    inference(rectify,[],[f21]) ).

fof(f21,plain,
    ? [X4,X2,X0,X1,X3] :
      ( ! [X5,X6] :
          ( ordered_pair(X6,X5) != X3
          | ~ in(X6,set_intersection2(X2,X1))
          | ~ in(X5,set_intersection2(X4,X0)) )
      & in(X3,set_intersection2(cartesian_product2(X2,X4),cartesian_product2(X1,X0))) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f14,plain,
    ~ ! [X4,X2,X0,X1,X3] :
        ~ ( ! [X6,X5] :
              ~ ( in(X5,set_intersection2(X4,X0))
                & in(X6,set_intersection2(X2,X1))
                & ordered_pair(X6,X5) = X3 )
          & in(X3,set_intersection2(cartesian_product2(X2,X4),cartesian_product2(X1,X0))) ),
    inference(rectify,[],[f12]) ).

fof(f12,negated_conjecture,
    ~ ! [X4,X3,X1,X0,X2] :
        ~ ( in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4)))
          & ! [X6,X5] :
              ~ ( in(X5,set_intersection2(X1,X3))
                & ordered_pair(X5,X6) = X0
                & in(X6,set_intersection2(X2,X4)) ) ),
    inference(negated_conjecture,[],[f11]) ).

fof(f11,conjecture,
    ! [X4,X3,X1,X0,X2] :
      ~ ( in(X0,set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4)))
        & ! [X6,X5] :
            ~ ( in(X5,set_intersection2(X1,X3))
              & ordered_pair(X5,X6) = X0
              & in(X6,set_intersection2(X2,X4)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t104_zfmisc_1) ).

fof(f68,plain,
    ! [X2,X0,X4] :
      ( ~ in(X4,set_intersection2(X2,X0))
      | in(X4,X0) ),
    inference(equality_resolution,[],[f51]) ).

fof(f51,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X0)
      | ~ in(X4,X1)
      | set_intersection2(X2,X0) != X1 ),
    inference(cnf_transformation,[],[f38]) ).

fof(f38,plain,
    ! [X0,X1,X2] :
      ( ( set_intersection2(X2,X0) = X1
        | ( ( ~ in(sK10(X0,X1,X2),X2)
            | ~ in(sK10(X0,X1,X2),X0)
            | ~ in(sK10(X0,X1,X2),X1) )
          & ( ( in(sK10(X0,X1,X2),X2)
              & in(sK10(X0,X1,X2),X0) )
            | in(sK10(X0,X1,X2),X1) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X1)
              | ~ in(X4,X2)
              | ~ in(X4,X0) )
            & ( ( in(X4,X2)
                & in(X4,X0) )
              | ~ in(X4,X1) ) )
        | set_intersection2(X2,X0) != X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f36,f37]) ).

fof(f37,plain,
    ! [X0,X1,X2] :
      ( ? [X3] :
          ( ( ~ in(X3,X2)
            | ~ in(X3,X0)
            | ~ in(X3,X1) )
          & ( ( in(X3,X2)
              & in(X3,X0) )
            | in(X3,X1) ) )
     => ( ( ~ in(sK10(X0,X1,X2),X2)
          | ~ in(sK10(X0,X1,X2),X0)
          | ~ in(sK10(X0,X1,X2),X1) )
        & ( ( in(sK10(X0,X1,X2),X2)
            & in(sK10(X0,X1,X2),X0) )
          | in(sK10(X0,X1,X2),X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f36,plain,
    ! [X0,X1,X2] :
      ( ( set_intersection2(X2,X0) = X1
        | ? [X3] :
            ( ( ~ in(X3,X2)
              | ~ in(X3,X0)
              | ~ in(X3,X1) )
            & ( ( in(X3,X2)
                & in(X3,X0) )
              | in(X3,X1) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X1)
              | ~ in(X4,X2)
              | ~ in(X4,X0) )
            & ( ( in(X4,X2)
                & in(X4,X0) )
              | ~ in(X4,X1) ) )
        | set_intersection2(X2,X0) != X1 ) ),
    inference(rectify,[],[f35]) ).

fof(f35,plain,
    ! [X0,X1,X2] :
      ( ( set_intersection2(X2,X0) = X1
        | ? [X3] :
            ( ( ~ in(X3,X2)
              | ~ in(X3,X0)
              | ~ in(X3,X1) )
            & ( ( in(X3,X2)
                & in(X3,X0) )
              | in(X3,X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | ~ in(X3,X2)
              | ~ in(X3,X0) )
            & ( ( in(X3,X2)
                & in(X3,X0) )
              | ~ in(X3,X1) ) )
        | set_intersection2(X2,X0) != X1 ) ),
    inference(flattening,[],[f34]) ).

fof(f34,plain,
    ! [X0,X1,X2] :
      ( ( set_intersection2(X2,X0) = X1
        | ? [X3] :
            ( ( ~ in(X3,X2)
              | ~ in(X3,X0)
              | ~ in(X3,X1) )
            & ( ( in(X3,X2)
                & in(X3,X0) )
              | in(X3,X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | ~ in(X3,X2)
              | ~ in(X3,X0) )
            & ( ( in(X3,X2)
                & in(X3,X0) )
              | ~ in(X3,X1) ) )
        | set_intersection2(X2,X0) != X1 ) ),
    inference(nnf_transformation,[],[f18]) ).

fof(f18,plain,
    ! [X0,X1,X2] :
      ( set_intersection2(X2,X0) = X1
    <=> ! [X3] :
          ( in(X3,X1)
        <=> ( in(X3,X2)
            & in(X3,X0) ) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,axiom,
    ! [X1,X2,X0] :
      ( ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X0)
            & in(X3,X1) ) )
    <=> set_intersection2(X0,X1) = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).

fof(f276,plain,
    ( ~ in(sK9,cartesian_product2(sK8,sK7))
    | spl11_9 ),
    inference(subsumption_resolution,[],[f275,f232]) ).

fof(f232,plain,
    ( ~ in(sK1(sK5,sK6,sK9),sK8)
    | spl11_9 ),
    inference(avatar_component_clause,[],[f230]) ).

fof(f230,plain,
    ( spl11_9
  <=> in(sK1(sK5,sK6,sK9),sK8) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_9])]) ).

fof(f275,plain,
    ( in(sK1(sK5,sK6,sK9),sK8)
    | ~ in(sK9,cartesian_product2(sK8,sK7)) ),
    inference(superposition,[],[f63,f261]) ).

fof(f261,plain,
    sK1(sK5,sK6,sK9) = sK1(sK7,sK8,sK9),
    inference(trivial_inequality_removal,[],[f260]) ).

fof(f260,plain,
    ( sK1(sK5,sK6,sK9) = sK1(sK7,sK8,sK9)
    | sK9 != sK9 ),
    inference(superposition,[],[f149,f207]) ).

fof(f207,plain,
    sK9 = ordered_pair(sK1(sK7,sK8,sK9),sK0(sK5,sK6,sK9)),
    inference(backward_demodulation,[],[f145,f206]) ).

fof(f206,plain,
    sK0(sK5,sK6,sK9) = sK0(sK7,sK8,sK9),
    inference(trivial_inequality_removal,[],[f205]) ).

fof(f205,plain,
    ( sK0(sK5,sK6,sK9) = sK0(sK7,sK8,sK9)
    | sK9 != sK9 ),
    inference(superposition,[],[f147,f145]) ).

fof(f147,plain,
    ! [X0,X1] :
      ( ordered_pair(X0,X1) != sK9
      | sK0(sK5,sK6,sK9) = X1 ),
    inference(superposition,[],[f58,f144]) ).

fof(f144,plain,
    sK9 = ordered_pair(sK1(sK5,sK6,sK9),sK0(sK5,sK6,sK9)),
    inference(resolution,[],[f61,f70]) ).

fof(f70,plain,
    in(sK9,cartesian_product2(sK6,sK5)),
    inference(resolution,[],[f67,f49]) ).

fof(f67,plain,
    ! [X2,X0,X4] :
      ( ~ in(X4,set_intersection2(X2,X0))
      | in(X4,X2) ),
    inference(equality_resolution,[],[f52]) ).

fof(f52,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | ~ in(X4,X1)
      | set_intersection2(X2,X0) != X1 ),
    inference(cnf_transformation,[],[f38]) ).

fof(f61,plain,
    ! [X2,X3,X1] :
      ( ~ in(X3,cartesian_product2(X2,X1))
      | ordered_pair(sK1(X1,X2,X3),sK0(X1,X2,X3)) = X3 ),
    inference(equality_resolution,[],[f48]) ).

fof(f48,plain,
    ! [X2,X3,X0,X1] :
      ( ordered_pair(sK1(X1,X2,X3),sK0(X1,X2,X3)) = X3
      | ~ in(X3,X0)
      | cartesian_product2(X2,X1) != X0 ),
    inference(cnf_transformation,[],[f30]) ).

fof(f30,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( ( ordered_pair(sK1(X1,X2,X3),sK0(X1,X2,X3)) = X3
                & in(sK0(X1,X2,X3),X1)
                & in(sK1(X1,X2,X3),X2) )
              | ~ in(X3,X0) )
            & ( in(X3,X0)
              | ! [X6,X7] :
                  ( ordered_pair(X7,X6) != X3
                  | ~ in(X6,X1)
                  | ~ in(X7,X2) ) ) )
        | cartesian_product2(X2,X1) != X0 )
      & ( cartesian_product2(X2,X1) = X0
        | ( ( ~ in(sK2(X0,X1,X2),X0)
            | ! [X9,X10] :
                ( ordered_pair(X10,X9) != sK2(X0,X1,X2)
                | ~ in(X9,X1)
                | ~ in(X10,X2) ) )
          & ( in(sK2(X0,X1,X2),X0)
            | ( ordered_pair(sK4(X0,X1,X2),sK3(X0,X1,X2)) = sK2(X0,X1,X2)
              & in(sK3(X0,X1,X2),X1)
              & in(sK4(X0,X1,X2),X2) ) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f26,f29,f28,f27]) ).

fof(f27,plain,
    ! [X1,X2,X3] :
      ( ? [X4,X5] :
          ( ordered_pair(X5,X4) = X3
          & in(X4,X1)
          & in(X5,X2) )
     => ( ordered_pair(sK1(X1,X2,X3),sK0(X1,X2,X3)) = X3
        & in(sK0(X1,X2,X3),X1)
        & in(sK1(X1,X2,X3),X2) ) ),
    introduced(choice_axiom,[]) ).

fof(f28,plain,
    ! [X0,X1,X2] :
      ( ? [X8] :
          ( ( ~ in(X8,X0)
            | ! [X9,X10] :
                ( ordered_pair(X10,X9) != X8
                | ~ in(X9,X1)
                | ~ in(X10,X2) ) )
          & ( in(X8,X0)
            | ? [X11,X12] :
                ( ordered_pair(X12,X11) = X8
                & in(X11,X1)
                & in(X12,X2) ) ) )
     => ( ( ~ in(sK2(X0,X1,X2),X0)
          | ! [X10,X9] :
              ( ordered_pair(X10,X9) != sK2(X0,X1,X2)
              | ~ in(X9,X1)
              | ~ in(X10,X2) ) )
        & ( in(sK2(X0,X1,X2),X0)
          | ? [X12,X11] :
              ( ordered_pair(X12,X11) = sK2(X0,X1,X2)
              & in(X11,X1)
              & in(X12,X2) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f29,plain,
    ! [X0,X1,X2] :
      ( ? [X12,X11] :
          ( ordered_pair(X12,X11) = sK2(X0,X1,X2)
          & in(X11,X1)
          & in(X12,X2) )
     => ( ordered_pair(sK4(X0,X1,X2),sK3(X0,X1,X2)) = sK2(X0,X1,X2)
        & in(sK3(X0,X1,X2),X1)
        & in(sK4(X0,X1,X2),X2) ) ),
    introduced(choice_axiom,[]) ).

fof(f26,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( ? [X4,X5] :
                  ( ordered_pair(X5,X4) = X3
                  & in(X4,X1)
                  & in(X5,X2) )
              | ~ in(X3,X0) )
            & ( in(X3,X0)
              | ! [X6,X7] :
                  ( ordered_pair(X7,X6) != X3
                  | ~ in(X6,X1)
                  | ~ in(X7,X2) ) ) )
        | cartesian_product2(X2,X1) != X0 )
      & ( cartesian_product2(X2,X1) = X0
        | ? [X8] :
            ( ( ~ in(X8,X0)
              | ! [X9,X10] :
                  ( ordered_pair(X10,X9) != X8
                  | ~ in(X9,X1)
                  | ~ in(X10,X2) ) )
            & ( in(X8,X0)
              | ? [X11,X12] :
                  ( ordered_pair(X12,X11) = X8
                  & in(X11,X1)
                  & in(X12,X2) ) ) ) ) ),
    inference(rectify,[],[f25]) ).

fof(f25,plain,
    ! [X1,X2,X0] :
      ( ( ! [X3] :
            ( ( ? [X5,X4] :
                  ( ordered_pair(X4,X5) = X3
                  & in(X5,X2)
                  & in(X4,X0) )
              | ~ in(X3,X1) )
            & ( in(X3,X1)
              | ! [X5,X4] :
                  ( ordered_pair(X4,X5) != X3
                  | ~ in(X5,X2)
                  | ~ in(X4,X0) ) ) )
        | cartesian_product2(X0,X2) != X1 )
      & ( cartesian_product2(X0,X2) = X1
        | ? [X3] :
            ( ( ~ in(X3,X1)
              | ! [X5,X4] :
                  ( ordered_pair(X4,X5) != X3
                  | ~ in(X5,X2)
                  | ~ in(X4,X0) ) )
            & ( in(X3,X1)
              | ? [X5,X4] :
                  ( ordered_pair(X4,X5) = X3
                  & in(X5,X2)
                  & in(X4,X0) ) ) ) ) ),
    inference(nnf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X1,X2,X0] :
      ( ! [X3] :
          ( ? [X5,X4] :
              ( ordered_pair(X4,X5) = X3
              & in(X5,X2)
              & in(X4,X0) )
        <=> in(X3,X1) )
    <=> cartesian_product2(X0,X2) = X1 ),
    inference(rectify,[],[f4]) ).

fof(f4,axiom,
    ! [X0,X2,X1] :
      ( ! [X3] :
          ( in(X3,X2)
        <=> ? [X4,X5] :
              ( ordered_pair(X4,X5) = X3
              & in(X4,X0)
              & in(X5,X1) ) )
    <=> cartesian_product2(X0,X1) = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_zfmisc_1) ).

fof(f58,plain,
    ! [X2,X3,X0,X1] :
      ( ordered_pair(X1,X3) != ordered_pair(X0,X2)
      | X2 = X3 ),
    inference(cnf_transformation,[],[f22]) ).

fof(f22,plain,
    ! [X0,X1,X2,X3] :
      ( ordered_pair(X1,X3) != ordered_pair(X0,X2)
      | ( X0 = X1
        & X2 = X3 ) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f16,plain,
    ! [X2,X1,X3,X0] :
      ( ordered_pair(X1,X3) = ordered_pair(X0,X2)
     => ( X0 = X1
        & X2 = X3 ) ),
    inference(rectify,[],[f13]) ).

fof(f13,axiom,
    ! [X2,X0,X3,X1] :
      ( ordered_pair(X0,X1) = ordered_pair(X2,X3)
     => ( X1 = X3
        & X0 = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_zfmisc_1) ).

fof(f145,plain,
    ordered_pair(sK1(sK7,sK8,sK9),sK0(sK7,sK8,sK9)) = sK9,
    inference(resolution,[],[f61,f75]) ).

fof(f149,plain,
    ! [X4,X5] :
      ( ordered_pair(X4,X5) != sK9
      | sK1(sK5,sK6,sK9) = X4 ),
    inference(superposition,[],[f59,f144]) ).

fof(f59,plain,
    ! [X2,X3,X0,X1] :
      ( ordered_pair(X1,X3) != ordered_pair(X0,X2)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f22]) ).

fof(f63,plain,
    ! [X2,X3,X1] :
      ( in(sK1(X1,X2,X3),X2)
      | ~ in(X3,cartesian_product2(X2,X1)) ),
    inference(equality_resolution,[],[f46]) ).

fof(f46,plain,
    ! [X2,X3,X0,X1] :
      ( in(sK1(X1,X2,X3),X2)
      | ~ in(X3,X0)
      | cartesian_product2(X2,X1) != X0 ),
    inference(cnf_transformation,[],[f30]) ).

fof(f270,plain,
    spl11_10,
    inference(avatar_contradiction_clause,[],[f269]) ).

fof(f269,plain,
    ( $false
    | spl11_10 ),
    inference(subsumption_resolution,[],[f268,f70]) ).

fof(f268,plain,
    ( ~ in(sK9,cartesian_product2(sK6,sK5))
    | spl11_10 ),
    inference(resolution,[],[f236,f63]) ).

fof(f236,plain,
    ( ~ in(sK1(sK5,sK6,sK9),sK6)
    | spl11_10 ),
    inference(avatar_component_clause,[],[f234]) ).

fof(f234,plain,
    ( spl11_10
  <=> in(sK1(sK5,sK6,sK9),sK6) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_10])]) ).

fof(f237,plain,
    ( ~ spl11_9
    | ~ spl11_10
    | spl11_2 ),
    inference(avatar_split_clause,[],[f228,f159,f234,f230]) ).

fof(f159,plain,
    ( spl11_2
  <=> in(sK1(sK5,sK6,sK9),set_intersection2(sK6,sK8)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).

fof(f228,plain,
    ( ~ in(sK1(sK5,sK6,sK9),sK6)
    | ~ in(sK1(sK5,sK6,sK9),sK8)
    | spl11_2 ),
    inference(resolution,[],[f161,f66]) ).

fof(f66,plain,
    ! [X2,X0,X4] :
      ( in(X4,set_intersection2(X2,X0))
      | ~ in(X4,X2)
      | ~ in(X4,X0) ),
    inference(equality_resolution,[],[f53]) ).

fof(f53,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X1)
      | ~ in(X4,X2)
      | ~ in(X4,X0)
      | set_intersection2(X2,X0) != X1 ),
    inference(cnf_transformation,[],[f38]) ).

fof(f161,plain,
    ( ~ in(sK1(sK5,sK6,sK9),set_intersection2(sK6,sK8))
    | spl11_2 ),
    inference(avatar_component_clause,[],[f159]) ).

fof(f220,plain,
    spl11_4,
    inference(avatar_contradiction_clause,[],[f219]) ).

fof(f219,plain,
    ( $false
    | spl11_4 ),
    inference(subsumption_resolution,[],[f218,f70]) ).

fof(f218,plain,
    ( ~ in(sK9,cartesian_product2(sK6,sK5))
    | spl11_4 ),
    inference(resolution,[],[f171,f62]) ).

fof(f62,plain,
    ! [X2,X3,X1] :
      ( in(sK0(X1,X2,X3),X1)
      | ~ in(X3,cartesian_product2(X2,X1)) ),
    inference(equality_resolution,[],[f47]) ).

fof(f47,plain,
    ! [X2,X3,X0,X1] :
      ( in(sK0(X1,X2,X3),X1)
      | ~ in(X3,X0)
      | cartesian_product2(X2,X1) != X0 ),
    inference(cnf_transformation,[],[f30]) ).

fof(f171,plain,
    ( ~ in(sK0(sK5,sK6,sK9),sK5)
    | spl11_4 ),
    inference(avatar_component_clause,[],[f169]) ).

fof(f169,plain,
    ( spl11_4
  <=> in(sK0(sK5,sK6,sK9),sK5) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).

fof(f215,plain,
    ( spl11_3
    | ~ spl11_7 ),
    inference(avatar_contradiction_clause,[],[f214]) ).

fof(f214,plain,
    ( $false
    | spl11_3
    | ~ spl11_7 ),
    inference(subsumption_resolution,[],[f211,f167]) ).

fof(f167,plain,
    ( ~ in(sK0(sK5,sK6,sK9),sK7)
    | spl11_3 ),
    inference(avatar_component_clause,[],[f165]) ).

fof(f165,plain,
    ( spl11_3
  <=> in(sK0(sK5,sK6,sK9),sK7) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).

fof(f211,plain,
    ( in(sK0(sK5,sK6,sK9),sK7)
    | ~ spl11_7 ),
    inference(backward_demodulation,[],[f193,f206]) ).

fof(f193,plain,
    ( in(sK0(sK7,sK8,sK9),sK7)
    | ~ spl11_7 ),
    inference(avatar_component_clause,[],[f192]) ).

fof(f192,plain,
    ( spl11_7
  <=> in(sK0(sK7,sK8,sK9),sK7) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_7])]) ).

fof(f202,plain,
    spl11_7,
    inference(avatar_contradiction_clause,[],[f201]) ).

fof(f201,plain,
    ( $false
    | spl11_7 ),
    inference(subsumption_resolution,[],[f200,f75]) ).

fof(f200,plain,
    ( ~ in(sK9,cartesian_product2(sK8,sK7))
    | spl11_7 ),
    inference(resolution,[],[f194,f62]) ).

fof(f194,plain,
    ( ~ in(sK0(sK7,sK8,sK9),sK7)
    | spl11_7 ),
    inference(avatar_component_clause,[],[f192]) ).

fof(f172,plain,
    ( ~ spl11_3
    | ~ spl11_4
    | spl11_1 ),
    inference(avatar_split_clause,[],[f163,f155,f169,f165]) ).

fof(f155,plain,
    ( spl11_1
  <=> in(sK0(sK5,sK6,sK9),set_intersection2(sK5,sK7)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).

fof(f163,plain,
    ( ~ in(sK0(sK5,sK6,sK9),sK5)
    | ~ in(sK0(sK5,sK6,sK9),sK7)
    | spl11_1 ),
    inference(resolution,[],[f157,f66]) ).

fof(f157,plain,
    ( ~ in(sK0(sK5,sK6,sK9),set_intersection2(sK5,sK7))
    | spl11_1 ),
    inference(avatar_component_clause,[],[f155]) ).

fof(f162,plain,
    ( ~ spl11_1
    | ~ spl11_2 ),
    inference(avatar_split_clause,[],[f153,f159,f155]) ).

fof(f153,plain,
    ( ~ in(sK1(sK5,sK6,sK9),set_intersection2(sK6,sK8))
    | ~ in(sK0(sK5,sK6,sK9),set_intersection2(sK5,sK7)) ),
    inference(trivial_inequality_removal,[],[f146]) ).

fof(f146,plain,
    ( ~ in(sK1(sK5,sK6,sK9),set_intersection2(sK6,sK8))
    | ~ in(sK0(sK5,sK6,sK9),set_intersection2(sK5,sK7))
    | sK9 != sK9 ),
    inference(superposition,[],[f50,f144]) ).

fof(f50,plain,
    ! [X6,X5] :
      ( ordered_pair(X6,X5) != sK9
      | ~ in(X6,set_intersection2(sK6,sK8))
      | ~ in(X5,set_intersection2(sK5,sK7)) ),
    inference(cnf_transformation,[],[f33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET951+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Aug 30 14:41:18 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.20/0.50  % (31633)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.51  % (31639)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.51  % (31639)Refutation not found, incomplete strategy% (31639)------------------------------
% 0.20/0.51  % (31639)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (31634)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.51  % (31631)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.51  % (31637)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.52  % (31629)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.52  % (31639)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (31639)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.52  
% 0.20/0.52  % (31639)Memory used [KB]: 6012
% 0.20/0.52  % (31639)Time elapsed: 0.106 s
% 0.20/0.52  % (31639)Instructions burned: 4 (million)
% 0.20/0.52  % (31639)------------------------------
% 0.20/0.52  % (31639)------------------------------
% 0.20/0.52  % (31635)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.52  % (31646)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52  % (31646)Instruction limit reached!
% 0.20/0.52  % (31646)------------------------------
% 0.20/0.52  % (31646)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (31646)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (31646)Termination reason: Unknown
% 0.20/0.52  % (31646)Termination phase: Finite model building preprocessing
% 0.20/0.52  
% 0.20/0.52  % (31646)Memory used [KB]: 1407
% 0.20/0.52  % (31646)Time elapsed: 0.003 s
% 0.20/0.52  % (31646)Instructions burned: 3 (million)
% 0.20/0.52  % (31646)------------------------------
% 0.20/0.52  % (31646)------------------------------
% 0.20/0.52  % (31640)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52  % (31652)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.52  % (31655)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.53  % (31656)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.53  % (31630)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.53  % (31658)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.53  % (31633)First to succeed.
% 0.20/0.53  % (31648)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.53  % (31632)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53  % (31648)Refutation not found, incomplete strategy% (31648)------------------------------
% 0.20/0.53  % (31648)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (31642)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53  % (31631)Instruction limit reached!
% 0.20/0.53  % (31631)------------------------------
% 0.20/0.53  % (31631)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (31631)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (31631)Termination reason: Unknown
% 0.20/0.53  % (31631)Termination phase: Saturation
% 0.20/0.53  
% 0.20/0.53  % (31631)Memory used [KB]: 6012
% 0.20/0.53  % (31631)Time elapsed: 0.004 s
% 0.20/0.53  % (31631)Instructions burned: 3 (million)
% 0.20/0.53  % (31631)------------------------------
% 0.20/0.53  % (31631)------------------------------
% 0.20/0.53  % (31651)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.53  % (31648)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (31648)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.53  
% 0.20/0.53  % (31648)Memory used [KB]: 6012
% 0.20/0.53  % (31648)Time elapsed: 0.129 s
% 0.20/0.53  % (31648)Instructions burned: 3 (million)
% 0.20/0.53  % (31648)------------------------------
% 0.20/0.53  % (31648)------------------------------
% 0.20/0.53  % (31654)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.20/0.54  % (31644)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.54  % (31636)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.54  % (31640)Instruction limit reached!
% 0.20/0.54  % (31640)------------------------------
% 0.20/0.54  % (31640)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (31640)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (31640)Termination reason: Unknown
% 0.20/0.54  % (31640)Termination phase: Saturation
% 0.20/0.54  
% 0.20/0.54  % (31640)Memory used [KB]: 6012
% 0.20/0.54  % (31640)Time elapsed: 0.140 s
% 0.20/0.54  % (31640)Instructions burned: 7 (million)
% 0.20/0.54  % (31640)------------------------------
% 0.20/0.54  % (31640)------------------------------
% 0.20/0.54  % (31645)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.54  % (31634)Instruction limit reached!
% 0.20/0.54  % (31634)------------------------------
% 0.20/0.54  % (31634)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (31634)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (31634)Termination reason: Unknown
% 0.20/0.54  % (31634)Termination phase: Saturation
% 0.20/0.54  
% 0.20/0.54  % (31634)Memory used [KB]: 1535
% 0.20/0.54  % (31634)Time elapsed: 0.139 s
% 0.20/0.54  % (31634)Instructions burned: 16 (million)
% 0.20/0.54  % (31634)------------------------------
% 0.20/0.54  % (31634)------------------------------
% 0.20/0.54  % (31644)Instruction limit reached!
% 0.20/0.54  % (31644)------------------------------
% 0.20/0.54  % (31644)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (31644)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (31644)Termination reason: Unknown
% 0.20/0.54  % (31644)Termination phase: Saturation
% 0.20/0.54  
% 0.20/0.54  % (31644)Memory used [KB]: 6012
% 0.20/0.54  % (31644)Time elapsed: 0.098 s
% 0.20/0.54  % (31644)Instructions burned: 7 (million)
% 0.20/0.54  % (31644)------------------------------
% 0.20/0.54  % (31644)------------------------------
% 0.20/0.54  % (31643)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.54  % (31643)Instruction limit reached!
% 0.20/0.54  % (31643)------------------------------
% 0.20/0.54  % (31643)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (31643)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (31643)Termination reason: Unknown
% 0.20/0.54  % (31643)Termination phase: Saturation
% 0.20/0.54  
% 0.20/0.54  % (31643)Memory used [KB]: 6012
% 0.20/0.54  % (31643)Time elapsed: 0.003 s
% 0.20/0.54  % (31643)Instructions burned: 4 (million)
% 0.20/0.54  % (31643)------------------------------
% 0.20/0.54  % (31643)------------------------------
% 1.52/0.54  % (31641)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 1.52/0.54  % (31653)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.52/0.54  % (31641)Refutation not found, incomplete strategy% (31641)------------------------------
% 1.52/0.54  % (31641)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.52/0.54  % (31641)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.52/0.54  % (31641)Termination reason: Refutation not found, incomplete strategy
% 1.52/0.54  
% 1.52/0.54  % (31641)Memory used [KB]: 1535
% 1.52/0.54  % (31641)Time elapsed: 0.138 s
% 1.52/0.54  % (31641)Instructions burned: 3 (million)
% 1.52/0.54  % (31641)------------------------------
% 1.52/0.54  % (31641)------------------------------
% 1.52/0.54  % (31657)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 1.52/0.55  % (31649)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 1.52/0.55  % (31650)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.52/0.55  % (31657)Refutation not found, incomplete strategy% (31657)------------------------------
% 1.52/0.55  % (31657)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.52/0.55  % (31647)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.52/0.55  % (31647)Instruction limit reached!
% 1.52/0.55  % (31647)------------------------------
% 1.52/0.55  % (31647)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.52/0.55  % (31647)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.52/0.55  % (31647)Termination reason: Unknown
% 1.52/0.55  % (31647)Termination phase: Saturation
% 1.52/0.55  
% 1.52/0.55  % (31647)Memory used [KB]: 1407
% 1.52/0.55  % (31647)Time elapsed: 0.002 s
% 1.52/0.55  % (31647)Instructions burned: 2 (million)
% 1.52/0.55  % (31647)------------------------------
% 1.52/0.55  % (31647)------------------------------
% 1.52/0.55  % (31633)Refutation found. Thanks to Tanya!
% 1.52/0.55  % SZS status Theorem for theBenchmark
% 1.52/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 1.52/0.56  % (31633)------------------------------
% 1.52/0.56  % (31633)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.52/0.56  % (31633)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.52/0.56  % (31633)Termination reason: Refutation
% 1.52/0.56  
% 1.52/0.56  % (31633)Memory used [KB]: 6140
% 1.52/0.56  % (31633)Time elapsed: 0.133 s
% 1.52/0.56  % (31633)Instructions burned: 10 (million)
% 1.52/0.56  % (31633)------------------------------
% 1.52/0.56  % (31633)------------------------------
% 1.52/0.56  % (31627)Success in time 0.197 s
%------------------------------------------------------------------------------