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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SEU109+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 : n007.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:26:42 EDT 2022

% Result   : Theorem 0.20s 0.55s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   84 (  10 unt;   0 def)
%            Number of atoms       :  333 (  17 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  422 ( 173   ~; 150   |;  79   &)
%                                         (   7 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-3 aty)
%            Number of variables   :  132 ( 114   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f381,plain,
    $false,
    inference(subsumption_resolution,[],[f380,f154]) ).

fof(f154,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | ~ in(X1,X0) ),
    inference(cnf_transformation,[],[f76]) ).

fof(f76,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | ~ in(X1,X0) ),
    inference(ennf_transformation,[],[f56]) ).

fof(f56,plain,
    ! [X1,X0] :
      ( in(X1,X0)
     => ~ in(X0,X1) ),
    inference(rectify,[],[f1]) ).

fof(f1,axiom,
    ! [X1,X0] :
      ( in(X0,X1)
     => ~ in(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).

fof(f380,plain,
    in(empty_set,empty_set),
    inference(subsumption_resolution,[],[f375,f231]) ).

fof(f231,plain,
    in(empty_set,sK6),
    inference(subsumption_resolution,[],[f229,f184]) ).

fof(f184,plain,
    ~ empty(sK6),
    inference(cnf_transformation,[],[f124]) ).

fof(f124,plain,
    ( preboolean(sK6)
    & ~ empty(sK6)
    & ~ empty(sK7)
    & preboolean(sK7)
    & ( empty(set_intersection2(sK6,sK7))
      | ~ preboolean(set_intersection2(sK6,sK7)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f93,f123,f122]) ).

fof(f122,plain,
    ( ? [X0] :
        ( preboolean(X0)
        & ~ empty(X0)
        & ? [X1] :
            ( ~ empty(X1)
            & preboolean(X1)
            & ( empty(set_intersection2(X0,X1))
              | ~ preboolean(set_intersection2(X0,X1)) ) ) )
   => ( preboolean(sK6)
      & ~ empty(sK6)
      & ? [X1] :
          ( ~ empty(X1)
          & preboolean(X1)
          & ( empty(set_intersection2(sK6,X1))
            | ~ preboolean(set_intersection2(sK6,X1)) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f123,plain,
    ( ? [X1] :
        ( ~ empty(X1)
        & preboolean(X1)
        & ( empty(set_intersection2(sK6,X1))
          | ~ preboolean(set_intersection2(sK6,X1)) ) )
   => ( ~ empty(sK7)
      & preboolean(sK7)
      & ( empty(set_intersection2(sK6,sK7))
        | ~ preboolean(set_intersection2(sK6,sK7)) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f93,plain,
    ? [X0] :
      ( preboolean(X0)
      & ~ empty(X0)
      & ? [X1] :
          ( ~ empty(X1)
          & preboolean(X1)
          & ( empty(set_intersection2(X0,X1))
            | ~ preboolean(set_intersection2(X0,X1)) ) ) ),
    inference(flattening,[],[f92]) ).

fof(f92,plain,
    ? [X0] :
      ( ? [X1] :
          ( ( empty(set_intersection2(X0,X1))
            | ~ preboolean(set_intersection2(X0,X1)) )
          & ~ empty(X1)
          & preboolean(X1) )
      & ~ empty(X0)
      & preboolean(X0) ),
    inference(ennf_transformation,[],[f36]) ).

fof(f36,negated_conjecture,
    ~ ! [X0] :
        ( ( ~ empty(X0)
          & preboolean(X0) )
       => ! [X1] :
            ( ( ~ empty(X1)
              & preboolean(X1) )
           => ( ~ empty(set_intersection2(X0,X1))
              & preboolean(set_intersection2(X0,X1)) ) ) ),
    inference(negated_conjecture,[],[f35]) ).

fof(f35,conjecture,
    ! [X0] :
      ( ( ~ empty(X0)
        & preboolean(X0) )
     => ! [X1] :
          ( ( ~ empty(X1)
            & preboolean(X1) )
         => ( ~ empty(set_intersection2(X0,X1))
            & preboolean(set_intersection2(X0,X1)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_finsub_1) ).

fof(f229,plain,
    ( empty(sK6)
    | in(empty_set,sK6) ),
    inference(resolution,[],[f185,f178]) ).

fof(f178,plain,
    ! [X0] :
      ( ~ preboolean(X0)
      | empty(X0)
      | in(empty_set,X0) ),
    inference(cnf_transformation,[],[f89]) ).

fof(f89,plain,
    ! [X0] :
      ( ~ preboolean(X0)
      | empty(X0)
      | in(empty_set,X0) ),
    inference(flattening,[],[f88]) ).

fof(f88,plain,
    ! [X0] :
      ( in(empty_set,X0)
      | empty(X0)
      | ~ preboolean(X0) ),
    inference(ennf_transformation,[],[f32]) ).

fof(f32,axiom,
    ! [X0] :
      ( ( ~ empty(X0)
        & preboolean(X0) )
     => in(empty_set,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_finsub_1) ).

fof(f185,plain,
    preboolean(sK6),
    inference(cnf_transformation,[],[f124]) ).

fof(f375,plain,
    ( in(empty_set,empty_set)
    | ~ in(empty_set,sK6) ),
    inference(resolution,[],[f326,f234]) ).

fof(f234,plain,
    in(empty_set,sK7),
    inference(subsumption_resolution,[],[f226,f183]) ).

fof(f183,plain,
    ~ empty(sK7),
    inference(cnf_transformation,[],[f124]) ).

fof(f226,plain,
    ( empty(sK7)
    | in(empty_set,sK7) ),
    inference(resolution,[],[f182,f178]) ).

fof(f182,plain,
    preboolean(sK7),
    inference(cnf_transformation,[],[f124]) ).

fof(f326,plain,
    ! [X0] :
      ( ~ in(X0,sK7)
      | in(X0,empty_set)
      | ~ in(X0,sK6) ),
    inference(superposition,[],[f222,f304]) ).

fof(f304,plain,
    empty_set = set_intersection2(sK6,sK7),
    inference(resolution,[],[f302,f211]) ).

fof(f211,plain,
    ! [X0] :
      ( ~ empty(X0)
      | empty_set = X0 ),
    inference(cnf_transformation,[],[f81]) ).

fof(f81,plain,
    ! [X0] :
      ( ~ empty(X0)
      | empty_set = X0 ),
    inference(ennf_transformation,[],[f44]) ).

fof(f44,axiom,
    ! [X0] :
      ( empty(X0)
     => empty_set = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).

fof(f302,plain,
    empty(set_intersection2(sK6,sK7)),
    inference(subsumption_resolution,[],[f301,f273]) ).

fof(f273,plain,
    ( in(sK2(set_intersection2(sK6,sK7)),sK7)
    | empty(set_intersection2(sK6,sK7)) ),
    inference(resolution,[],[f235,f224]) ).

fof(f224,plain,
    ! [X3,X0,X1] :
      ( ~ in(X3,set_intersection2(X1,X0))
      | in(X3,X0) ),
    inference(equality_resolution,[],[f201]) ).

fof(f201,plain,
    ! [X2,X3,X0,X1] :
      ( in(X3,X0)
      | ~ in(X3,X2)
      | set_intersection2(X1,X0) != X2 ),
    inference(cnf_transformation,[],[f138]) ).

fof(f138,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( in(X3,X2)
              | ~ in(X3,X1)
              | ~ in(X3,X0) )
            & ( ( in(X3,X1)
                & in(X3,X0) )
              | ~ in(X3,X2) ) )
        | set_intersection2(X1,X0) != X2 )
      & ( set_intersection2(X1,X0) = X2
        | ( ( ~ in(sK11(X0,X1,X2),X1)
            | ~ in(sK11(X0,X1,X2),X0)
            | ~ in(sK11(X0,X1,X2),X2) )
          & ( ( in(sK11(X0,X1,X2),X1)
              & in(sK11(X0,X1,X2),X0) )
            | in(sK11(X0,X1,X2),X2) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f136,f137]) ).

fof(f137,plain,
    ! [X0,X1,X2] :
      ( ? [X4] :
          ( ( ~ in(X4,X1)
            | ~ in(X4,X0)
            | ~ in(X4,X2) )
          & ( ( in(X4,X1)
              & in(X4,X0) )
            | in(X4,X2) ) )
     => ( ( ~ in(sK11(X0,X1,X2),X1)
          | ~ in(sK11(X0,X1,X2),X0)
          | ~ in(sK11(X0,X1,X2),X2) )
        & ( ( in(sK11(X0,X1,X2),X1)
            & in(sK11(X0,X1,X2),X0) )
          | in(sK11(X0,X1,X2),X2) ) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

fof(f235,plain,
    ( in(sK2(set_intersection2(sK6,sK7)),set_intersection2(sK6,sK7))
    | empty(set_intersection2(sK6,sK7)) ),
    inference(resolution,[],[f181,f165]) ).

fof(f165,plain,
    ! [X0] :
      ( preboolean(X0)
      | in(sK2(X0),X0) ),
    inference(cnf_transformation,[],[f113]) ).

fof(f113,plain,
    ! [X0] :
      ( ( ! [X1,X2] :
            ( ~ in(X2,X0)
            | ( in(set_union2(X1,X2),X0)
              & in(set_difference(X1,X2),X0) )
            | ~ in(X1,X0) )
        | ~ preboolean(X0) )
      & ( preboolean(X0)
        | ( in(sK3(X0),X0)
          & ( ~ in(set_union2(sK2(X0),sK3(X0)),X0)
            | ~ in(set_difference(sK2(X0),sK3(X0)),X0) )
          & in(sK2(X0),X0) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f111,f112]) ).

fof(f112,plain,
    ! [X0] :
      ( ? [X3,X4] :
          ( in(X4,X0)
          & ( ~ in(set_union2(X3,X4),X0)
            | ~ in(set_difference(X3,X4),X0) )
          & in(X3,X0) )
     => ( in(sK3(X0),X0)
        & ( ~ in(set_union2(sK2(X0),sK3(X0)),X0)
          | ~ in(set_difference(sK2(X0),sK3(X0)),X0) )
        & in(sK2(X0),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f111,plain,
    ! [X0] :
      ( ( ! [X1,X2] :
            ( ~ in(X2,X0)
            | ( in(set_union2(X1,X2),X0)
              & in(set_difference(X1,X2),X0) )
            | ~ in(X1,X0) )
        | ~ preboolean(X0) )
      & ( preboolean(X0)
        | ? [X3,X4] :
            ( in(X4,X0)
            & ( ~ in(set_union2(X3,X4),X0)
              | ~ in(set_difference(X3,X4),X0) )
            & in(X3,X0) ) ) ),
    inference(rectify,[],[f110]) ).

fof(f110,plain,
    ! [X0] :
      ( ( ! [X1,X2] :
            ( ~ in(X2,X0)
            | ( in(set_union2(X1,X2),X0)
              & in(set_difference(X1,X2),X0) )
            | ~ in(X1,X0) )
        | ~ preboolean(X0) )
      & ( preboolean(X0)
        | ? [X1,X2] :
            ( in(X2,X0)
            & ( ~ in(set_union2(X1,X2),X0)
              | ~ in(set_difference(X1,X2),X0) )
            & in(X1,X0) ) ) ),
    inference(nnf_transformation,[],[f80]) ).

fof(f80,plain,
    ! [X0] :
      ( ! [X1,X2] :
          ( ~ in(X2,X0)
          | ( in(set_union2(X1,X2),X0)
            & in(set_difference(X1,X2),X0) )
          | ~ in(X1,X0) )
    <=> preboolean(X0) ),
    inference(flattening,[],[f79]) ).

fof(f79,plain,
    ! [X0] :
      ( ! [X2,X1] :
          ( ( in(set_union2(X1,X2),X0)
            & in(set_difference(X1,X2),X0) )
          | ~ in(X2,X0)
          | ~ in(X1,X0) )
    <=> preboolean(X0) ),
    inference(ennf_transformation,[],[f31]) ).

fof(f31,axiom,
    ! [X0] :
      ( ! [X2,X1] :
          ( ( in(X2,X0)
            & in(X1,X0) )
         => ( in(set_union2(X1,X2),X0)
            & in(set_difference(X1,X2),X0) ) )
    <=> preboolean(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_finsub_1) ).

fof(f181,plain,
    ( ~ preboolean(set_intersection2(sK6,sK7))
    | empty(set_intersection2(sK6,sK7)) ),
    inference(cnf_transformation,[],[f124]) ).

fof(f301,plain,
    ( ~ in(sK2(set_intersection2(sK6,sK7)),sK7)
    | empty(set_intersection2(sK6,sK7)) ),
    inference(subsumption_resolution,[],[f300,f272]) ).

fof(f272,plain,
    ( in(sK2(set_intersection2(sK6,sK7)),sK6)
    | empty(set_intersection2(sK6,sK7)) ),
    inference(resolution,[],[f235,f223]) ).

fof(f223,plain,
    ! [X3,X0,X1] :
      ( ~ in(X3,set_intersection2(X1,X0))
      | in(X3,X1) ),
    inference(equality_resolution,[],[f202]) ).

fof(f202,plain,
    ! [X2,X3,X0,X1] :
      ( in(X3,X1)
      | ~ in(X3,X2)
      | set_intersection2(X1,X0) != X2 ),
    inference(cnf_transformation,[],[f138]) ).

fof(f300,plain,
    ( ~ in(sK2(set_intersection2(sK6,sK7)),sK6)
    | empty(set_intersection2(sK6,sK7))
    | ~ in(sK2(set_intersection2(sK6,sK7)),sK7) ),
    inference(subsumption_resolution,[],[f299,f280]) ).

fof(f280,plain,
    ( in(sK3(set_intersection2(sK6,sK7)),sK6)
    | empty(set_intersection2(sK6,sK7)) ),
    inference(resolution,[],[f236,f223]) ).

fof(f236,plain,
    ( in(sK3(set_intersection2(sK6,sK7)),set_intersection2(sK6,sK7))
    | empty(set_intersection2(sK6,sK7)) ),
    inference(resolution,[],[f181,f167]) ).

fof(f167,plain,
    ! [X0] :
      ( preboolean(X0)
      | in(sK3(X0),X0) ),
    inference(cnf_transformation,[],[f113]) ).

fof(f299,plain,
    ( empty(set_intersection2(sK6,sK7))
    | ~ in(sK3(set_intersection2(sK6,sK7)),sK6)
    | ~ in(sK2(set_intersection2(sK6,sK7)),sK6)
    | ~ in(sK2(set_intersection2(sK6,sK7)),sK7) ),
    inference(resolution,[],[f298,f281]) ).

fof(f281,plain,
    ( in(sK3(set_intersection2(sK6,sK7)),sK7)
    | empty(set_intersection2(sK6,sK7)) ),
    inference(resolution,[],[f236,f224]) ).

fof(f298,plain,
    ( ~ in(sK3(set_intersection2(sK6,sK7)),sK7)
    | ~ in(sK3(set_intersection2(sK6,sK7)),sK6)
    | ~ in(sK2(set_intersection2(sK6,sK7)),sK7)
    | ~ in(sK2(set_intersection2(sK6,sK7)),sK6) ),
    inference(subsumption_resolution,[],[f297,f227]) ).

fof(f227,plain,
    ! [X2,X3] :
      ( in(set_union2(X2,X3),sK7)
      | ~ in(X2,sK7)
      | ~ in(X3,sK7) ),
    inference(resolution,[],[f182,f169]) ).

fof(f169,plain,
    ! [X2,X0,X1] :
      ( ~ preboolean(X0)
      | ~ in(X1,X0)
      | ~ in(X2,X0)
      | in(set_union2(X1,X2),X0) ),
    inference(cnf_transformation,[],[f113]) ).

fof(f297,plain,
    ( ~ in(sK2(set_intersection2(sK6,sK7)),sK7)
    | ~ in(sK2(set_intersection2(sK6,sK7)),sK6)
    | ~ in(sK3(set_intersection2(sK6,sK7)),sK7)
    | ~ in(set_union2(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),sK7)
    | ~ in(sK3(set_intersection2(sK6,sK7)),sK6) ),
    inference(subsumption_resolution,[],[f296,f230]) ).

fof(f230,plain,
    ! [X2,X3] :
      ( in(set_union2(X2,X3),sK6)
      | ~ in(X3,sK6)
      | ~ in(X2,sK6) ),
    inference(resolution,[],[f185,f169]) ).

fof(f296,plain,
    ( ~ in(set_union2(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),sK6)
    | ~ in(set_union2(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),sK7)
    | ~ in(sK2(set_intersection2(sK6,sK7)),sK7)
    | ~ in(sK2(set_intersection2(sK6,sK7)),sK6)
    | ~ in(sK3(set_intersection2(sK6,sK7)),sK6)
    | ~ in(sK3(set_intersection2(sK6,sK7)),sK7) ),
    inference(resolution,[],[f295,f222]) ).

fof(f295,plain,
    ( ~ in(set_union2(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),set_intersection2(sK6,sK7))
    | ~ in(sK3(set_intersection2(sK6,sK7)),sK6)
    | ~ in(sK2(set_intersection2(sK6,sK7)),sK6)
    | ~ in(sK3(set_intersection2(sK6,sK7)),sK7)
    | ~ in(sK2(set_intersection2(sK6,sK7)),sK7) ),
    inference(resolution,[],[f294,f228]) ).

fof(f228,plain,
    ! [X0,X1] :
      ( in(set_difference(X0,X1),sK6)
      | ~ in(X1,sK6)
      | ~ in(X0,sK6) ),
    inference(resolution,[],[f185,f168]) ).

fof(f168,plain,
    ! [X2,X0,X1] :
      ( ~ preboolean(X0)
      | ~ in(X1,X0)
      | in(set_difference(X1,X2),X0)
      | ~ in(X2,X0) ),
    inference(cnf_transformation,[],[f113]) ).

fof(f294,plain,
    ( ~ in(set_difference(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),sK6)
    | ~ in(sK2(set_intersection2(sK6,sK7)),sK7)
    | ~ in(sK3(set_intersection2(sK6,sK7)),sK7)
    | ~ in(set_union2(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),set_intersection2(sK6,sK7)) ),
    inference(resolution,[],[f286,f225]) ).

fof(f225,plain,
    ! [X0,X1] :
      ( in(set_difference(X0,X1),sK7)
      | ~ in(X0,sK7)
      | ~ in(X1,sK7) ),
    inference(resolution,[],[f182,f168]) ).

fof(f286,plain,
    ( ~ in(set_difference(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),sK7)
    | ~ in(set_union2(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),set_intersection2(sK6,sK7))
    | ~ in(set_difference(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),sK6) ),
    inference(resolution,[],[f238,f222]) ).

fof(f238,plain,
    ( ~ in(set_difference(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),set_intersection2(sK6,sK7))
    | ~ in(set_union2(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),set_intersection2(sK6,sK7)) ),
    inference(subsumption_resolution,[],[f237,f179]) ).

fof(f179,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | ~ empty(X1) ),
    inference(cnf_transformation,[],[f120]) ).

fof(f120,plain,
    ! [X0,X1] :
      ( ~ empty(X1)
      | ~ in(X0,X1) ),
    inference(rectify,[],[f96]) ).

fof(f96,plain,
    ! [X1,X0] :
      ( ~ empty(X0)
      | ~ in(X1,X0) ),
    inference(ennf_transformation,[],[f57]) ).

fof(f57,plain,
    ! [X1,X0] :
      ~ ( empty(X0)
        & in(X1,X0) ),
    inference(rectify,[],[f45]) ).

fof(f45,axiom,
    ! [X1,X0] :
      ~ ( empty(X1)
        & in(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).

fof(f237,plain,
    ( empty(set_intersection2(sK6,sK7))
    | ~ in(set_union2(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),set_intersection2(sK6,sK7))
    | ~ in(set_difference(sK2(set_intersection2(sK6,sK7)),sK3(set_intersection2(sK6,sK7))),set_intersection2(sK6,sK7)) ),
    inference(resolution,[],[f181,f166]) ).

fof(f166,plain,
    ! [X0] :
      ( preboolean(X0)
      | ~ in(set_union2(sK2(X0),sK3(X0)),X0)
      | ~ in(set_difference(sK2(X0),sK3(X0)),X0) ),
    inference(cnf_transformation,[],[f113]) ).

fof(f222,plain,
    ! [X3,X0,X1] :
      ( in(X3,set_intersection2(X1,X0))
      | ~ in(X3,X0)
      | ~ in(X3,X1) ),
    inference(equality_resolution,[],[f203]) ).

fof(f203,plain,
    ! [X2,X3,X0,X1] :
      ( in(X3,X2)
      | ~ in(X3,X1)
      | ~ in(X3,X0)
      | set_intersection2(X1,X0) != X2 ),
    inference(cnf_transformation,[],[f138]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEU109+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/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.13/0.35  % Computer : n007.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   : Tue Aug 30 14:24:16 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.50  % (30171)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.50  % (30179)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.50  % (30179)Instruction limit reached!
% 0.20/0.50  % (30179)------------------------------
% 0.20/0.50  % (30179)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (30172)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  % (30180)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)
% 0.20/0.51  % (30179)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (30179)Termination reason: Unknown
% 0.20/0.51  % (30179)Termination phase: Saturation
% 0.20/0.51  
% 0.20/0.51  % (30179)Memory used [KB]: 6140
% 0.20/0.51  % (30179)Time elapsed: 0.107 s
% 0.20/0.51  % (30179)Instructions burned: 7 (million)
% 0.20/0.51  % (30179)------------------------------
% 0.20/0.51  % (30179)------------------------------
% 0.20/0.51  % (30186)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)
% 0.20/0.51  % (30174)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.51  % (30180)Instruction limit reached!
% 0.20/0.51  % (30180)------------------------------
% 0.20/0.51  % (30180)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (30187)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.52  % (30170)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.52  % (30194)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.52  % (30187)Refutation not found, incomplete strategy% (30187)------------------------------
% 0.20/0.52  % (30187)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (30187)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (30187)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.52  
% 0.20/0.52  % (30187)Memory used [KB]: 6012
% 0.20/0.52  % (30187)Time elapsed: 0.119 s
% 0.20/0.52  % (30187)Instructions burned: 4 (million)
% 0.20/0.52  % (30187)------------------------------
% 0.20/0.52  % (30187)------------------------------
% 0.20/0.52  % (30172)Instruction limit reached!
% 0.20/0.52  % (30172)------------------------------
% 0.20/0.52  % (30172)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (30172)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (30172)Termination reason: Unknown
% 0.20/0.52  % (30172)Termination phase: Saturation
% 0.20/0.52  
% 0.20/0.52  % (30172)Memory used [KB]: 6140
% 0.20/0.52  % (30172)Time elapsed: 0.121 s
% 0.20/0.52  % (30172)Instructions burned: 13 (million)
% 0.20/0.52  % (30172)------------------------------
% 0.20/0.52  % (30172)------------------------------
% 0.20/0.52  % (30191)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  % (30169)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.52  % (30168)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  % (30192)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)
% 0.20/0.52  % (30193)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.53  % (30188)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)
% 0.20/0.53  % (30170)Instruction limit reached!
% 0.20/0.53  % (30170)------------------------------
% 0.20/0.53  % (30170)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (30196)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)
% 0.20/0.53  % (30170)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (30170)Termination reason: Unknown
% 0.20/0.53  % (30170)Termination phase: Equality resolution with deletion
% 0.20/0.53  
% 0.20/0.53  % (30170)Memory used [KB]: 1535
% 0.20/0.53  % (30170)Time elapsed: 0.003 s
% 0.20/0.53  % (30170)Instructions burned: 3 (million)
% 0.20/0.53  % (30170)------------------------------
% 0.20/0.53  % (30170)------------------------------
% 0.20/0.53  % (30197)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  % (30173)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.53  % (30183)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.53  % (30180)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (30180)Termination reason: Unknown
% 0.20/0.53  % (30180)Termination phase: Saturation
% 0.20/0.53  
% 0.20/0.53  % (30180)Memory used [KB]: 1791
% 0.20/0.53  % (30180)Time elapsed: 0.112 s
% 0.20/0.53  % (30180)Instructions burned: 16 (million)
% 0.20/0.53  % (30180)------------------------------
% 0.20/0.53  % (30180)------------------------------
% 0.20/0.53  % (30186)Instruction limit reached!
% 0.20/0.53  % (30186)------------------------------
% 0.20/0.53  % (30186)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (30186)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (30186)Termination reason: Unknown
% 0.20/0.53  % (30186)Termination phase: shuffling
% 0.20/0.53  
% 0.20/0.53  % (30186)Memory used [KB]: 1407
% 0.20/0.53  % (30186)Time elapsed: 0.002 s
% 0.20/0.53  % (30186)Instructions burned: 2 (million)
% 0.20/0.53  % (30184)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.53  % (30186)------------------------------
% 0.20/0.53  % (30186)------------------------------
% 0.20/0.53  % (30177)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.53  % (30190)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  % (30181)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  % (30176)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.54  % (30175)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  % (30178)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.54  % (30183)Instruction limit reached!
% 0.20/0.54  % (30183)------------------------------
% 0.20/0.54  % (30183)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (30183)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (30183)Termination reason: Unknown
% 0.20/0.54  % (30183)Termination phase: Saturation
% 0.20/0.54  
% 0.20/0.54  % (30183)Memory used [KB]: 6140
% 0.20/0.54  % (30183)Time elapsed: 0.103 s
% 0.20/0.54  % (30183)Instructions burned: 8 (million)
% 0.20/0.54  % (30183)------------------------------
% 0.20/0.54  % (30183)------------------------------
% 0.20/0.54  % (30185)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.54  % (30195)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.54  % (30185)Instruction limit reached!
% 0.20/0.54  % (30185)------------------------------
% 0.20/0.54  % (30185)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (30169)Refutation not found, incomplete strategy% (30169)------------------------------
% 0.20/0.54  % (30169)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (30182)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.55  % (30189)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)
% 0.20/0.55  % (30185)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (30185)Termination reason: Unknown
% 0.20/0.55  % (30185)Termination phase: Finite model building preprocessing
% 0.20/0.55  
% 0.20/0.55  % (30185)Memory used [KB]: 1535
% 0.20/0.55  % (30185)Time elapsed: 0.003 s
% 0.20/0.55  % (30185)Instructions burned: 3 (million)
% 0.20/0.55  % (30185)------------------------------
% 0.20/0.55  % (30185)------------------------------
% 0.20/0.55  % (30169)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (30169)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.55  
% 0.20/0.55  % (30169)Memory used [KB]: 6012
% 0.20/0.55  % (30169)Time elapsed: 0.106 s
% 0.20/0.55  % (30169)Instructions burned: 3 (million)
% 0.20/0.55  % (30169)------------------------------
% 0.20/0.55  % (30169)------------------------------
% 0.20/0.55  % (30173)First to succeed.
% 0.20/0.55  % (30178)Instruction limit reached!
% 0.20/0.55  % (30178)------------------------------
% 0.20/0.55  % (30178)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55  % (30178)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (30178)Termination reason: Unknown
% 0.20/0.55  % (30178)Termination phase: Saturation
% 0.20/0.55  
% 0.20/0.55  % (30178)Memory used [KB]: 6268
% 0.20/0.55  % (30178)Time elapsed: 0.148 s
% 0.20/0.55  % (30178)Instructions burned: 12 (million)
% 0.20/0.55  % (30178)------------------------------
% 0.20/0.55  % (30178)------------------------------
% 0.20/0.55  % (30173)Refutation found. Thanks to Tanya!
% 0.20/0.55  % SZS status Theorem for theBenchmark
% 0.20/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55  % (30173)------------------------------
% 0.20/0.55  % (30173)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55  % (30173)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (30173)Termination reason: Refutation
% 0.20/0.55  
% 0.20/0.55  % (30173)Memory used [KB]: 1663
% 0.20/0.55  % (30173)Time elapsed: 0.132 s
% 0.20/0.55  % (30173)Instructions burned: 10 (million)
% 0.20/0.55  % (30173)------------------------------
% 0.20/0.55  % (30173)------------------------------
% 0.20/0.55  % (30164)Success in time 0.192 s
%------------------------------------------------------------------------------