TSTP Solution File: SEU168+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

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

% Computer : n005.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:32:18 EDT 2022

% Result   : Theorem 2.28s 0.69s
% Output   : Refutation 2.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   36
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   93 (   7 unt;   0 def)
%            Number of atoms       :  427 (  10 equ)
%            Maximal formula atoms :   22 (   4 avg)
%            Number of connectives :  512 ( 178   ~; 189   |; 118   &)
%                                         (   7 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   1 con; 0-2 aty)
%            Number of variables   :  210 ( 159   !;  51   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f914,plain,
    $false,
    inference(subsumption_resolution,[],[f913,f778]) ).

fof(f778,plain,
    ~ in(sK1(sK6(sK2)),sK6(sK2)),
    inference(resolution,[],[f696,f43]) ).

fof(f43,plain,
    ! [X0] :
      ( ~ sP0(X0)
      | ~ in(sK1(X0),X0) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X0] :
      ( ( subset(sK1(X0),X0)
        & ~ in(sK1(X0),X0)
        & ~ are_equipotent(sK1(X0),X0) )
      | ~ sP0(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f23,f24]) ).

fof(f24,plain,
    ! [X0] :
      ( ? [X1] :
          ( subset(X1,X0)
          & ~ in(X1,X0)
          & ~ are_equipotent(X1,X0) )
     => ( subset(sK1(X0),X0)
        & ~ in(sK1(X0),X0)
        & ~ are_equipotent(sK1(X0),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f23,plain,
    ! [X0] :
      ( ? [X1] :
          ( subset(X1,X0)
          & ~ in(X1,X0)
          & ~ are_equipotent(X1,X0) )
      | ~ sP0(X0) ),
    inference(rectify,[],[f22]) ).

fof(f22,plain,
    ! [X1] :
      ( ? [X5] :
          ( subset(X5,X1)
          & ~ in(X5,X1)
          & ~ are_equipotent(X5,X1) )
      | ~ sP0(X1) ),
    inference(nnf_transformation,[],[f20]) ).

fof(f20,plain,
    ! [X1] :
      ( ? [X5] :
          ( subset(X5,X1)
          & ~ in(X5,X1)
          & ~ are_equipotent(X5,X1) )
      | ~ sP0(X1) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f696,plain,
    sP0(sK6(sK2)),
    inference(subsumption_resolution,[],[f695,f579]) ).

fof(f579,plain,
    ( in(powerset(sK3(sK6(sK2))),sK6(sK2))
    | sP0(sK6(sK2)) ),
    inference(subsumption_resolution,[],[f574,f221]) ).

fof(f221,plain,
    ( in(sK3(sK6(sK2)),sK6(sK2))
    | sP0(sK6(sK2)) ),
    inference(subsumption_resolution,[],[f218,f53]) ).

fof(f53,plain,
    ! [X0] : in(X0,sK6(X0)),
    inference(cnf_transformation,[],[f33]) ).

fof(f33,plain,
    ! [X0] :
      ( ! [X2] :
          ( are_equipotent(X2,sK6(X0))
          | ~ subset(X2,sK6(X0))
          | in(X2,sK6(X0)) )
      & ! [X3] :
          ( ~ in(X3,sK6(X0))
          | ( in(sK7(X0,X3),sK6(X0))
            & ! [X5] :
                ( in(X5,sK7(X0,X3))
                | ~ subset(X5,X3) ) ) )
      & in(X0,sK6(X0))
      & ! [X6,X7] :
          ( ~ in(X6,sK6(X0))
          | in(X7,sK6(X0))
          | ~ subset(X7,X6) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f19,f32,f31]) ).

fof(f31,plain,
    ! [X0] :
      ( ? [X1] :
          ( ! [X2] :
              ( are_equipotent(X2,X1)
              | ~ subset(X2,X1)
              | in(X2,X1) )
          & ! [X3] :
              ( ~ in(X3,X1)
              | ? [X4] :
                  ( in(X4,X1)
                  & ! [X5] :
                      ( in(X5,X4)
                      | ~ subset(X5,X3) ) ) )
          & in(X0,X1)
          & ! [X6,X7] :
              ( ~ in(X6,X1)
              | in(X7,X1)
              | ~ subset(X7,X6) ) )
     => ( ! [X2] :
            ( are_equipotent(X2,sK6(X0))
            | ~ subset(X2,sK6(X0))
            | in(X2,sK6(X0)) )
        & ! [X3] :
            ( ~ in(X3,sK6(X0))
            | ? [X4] :
                ( in(X4,sK6(X0))
                & ! [X5] :
                    ( in(X5,X4)
                    | ~ subset(X5,X3) ) ) )
        & in(X0,sK6(X0))
        & ! [X7,X6] :
            ( ~ in(X6,sK6(X0))
            | in(X7,sK6(X0))
            | ~ subset(X7,X6) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f32,plain,
    ! [X0,X3] :
      ( ? [X4] :
          ( in(X4,sK6(X0))
          & ! [X5] :
              ( in(X5,X4)
              | ~ subset(X5,X3) ) )
     => ( in(sK7(X0,X3),sK6(X0))
        & ! [X5] :
            ( in(X5,sK7(X0,X3))
            | ~ subset(X5,X3) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f19,plain,
    ! [X0] :
    ? [X1] :
      ( ! [X2] :
          ( are_equipotent(X2,X1)
          | ~ subset(X2,X1)
          | in(X2,X1) )
      & ! [X3] :
          ( ~ in(X3,X1)
          | ? [X4] :
              ( in(X4,X1)
              & ! [X5] :
                  ( in(X5,X4)
                  | ~ subset(X5,X3) ) ) )
      & in(X0,X1)
      & ! [X6,X7] :
          ( ~ in(X6,X1)
          | in(X7,X1)
          | ~ subset(X7,X6) ) ),
    inference(flattening,[],[f18]) ).

fof(f18,plain,
    ! [X0] :
    ? [X1] :
      ( ! [X3] :
          ( ~ in(X3,X1)
          | ? [X4] :
              ( in(X4,X1)
              & ! [X5] :
                  ( in(X5,X4)
                  | ~ subset(X5,X3) ) ) )
      & ! [X6,X7] :
          ( in(X7,X1)
          | ~ subset(X7,X6)
          | ~ in(X6,X1) )
      & ! [X2] :
          ( are_equipotent(X2,X1)
          | ~ subset(X2,X1)
          | in(X2,X1) )
      & in(X0,X1) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X0] :
    ? [X1] :
      ( ! [X3] :
          ~ ( in(X3,X1)
            & ! [X4] :
                ~ ( ! [X5] :
                      ( subset(X5,X3)
                     => in(X5,X4) )
                  & in(X4,X1) ) )
      & ! [X6,X7] :
          ( ( subset(X7,X6)
            & in(X6,X1) )
         => in(X7,X1) )
      & ! [X2] :
          ~ ( ~ in(X2,X1)
            & ~ are_equipotent(X2,X1)
            & subset(X2,X1) )
      & in(X0,X1) ),
    inference(rectify,[],[f8]) ).

fof(f8,axiom,
    ! [X0] :
    ? [X1] :
      ( ! [X2] :
          ~ ( ~ in(X2,X1)
            & ~ are_equipotent(X2,X1)
            & subset(X2,X1) )
      & ! [X2] :
          ~ ( in(X2,X1)
            & ! [X3] :
                ~ ( in(X3,X1)
                  & ! [X4] :
                      ( subset(X4,X2)
                     => in(X4,X3) ) ) )
      & in(X0,X1)
      & ! [X2,X3] :
          ( ( in(X2,X1)
            & subset(X3,X2) )
         => in(X3,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_tarski) ).

fof(f218,plain,
    ( in(sK3(sK6(sK2)),sK6(sK2))
    | sP0(sK6(sK2))
    | ~ in(sK2,sK6(sK2)) ),
    inference(duplicate_literal_removal,[],[f216]) ).

fof(f216,plain,
    ( sP0(sK6(sK2))
    | in(sK3(sK6(sK2)),sK6(sK2))
    | ~ in(sK2,sK6(sK2))
    | in(sK3(sK6(sK2)),sK6(sK2))
    | sP0(sK6(sK2)) ),
    inference(resolution,[],[f209,f49]) ).

fof(f49,plain,
    ! [X1] :
      ( ~ in(sK4(X1),X1)
      | sP0(X1)
      | in(sK3(X1),X1)
      | ~ in(sK2,X1) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f30,plain,
    ! [X1] :
      ( ( in(sK3(X1),X1)
        & ~ in(powerset(sK3(X1)),X1) )
      | ( in(sK5(X1),X1)
        & ~ in(sK4(X1),X1)
        & subset(sK4(X1),sK5(X1)) )
      | ~ in(sK2,X1)
      | sP0(X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f26,f29,f28,f27]) ).

fof(f27,plain,
    ( ? [X0] :
      ! [X1] :
        ( ? [X2] :
            ( in(X2,X1)
            & ~ in(powerset(X2),X1) )
        | ? [X3,X4] :
            ( in(X4,X1)
            & ~ in(X3,X1)
            & subset(X3,X4) )
        | ~ in(X0,X1)
        | sP0(X1) )
   => ! [X1] :
        ( ? [X2] :
            ( in(X2,X1)
            & ~ in(powerset(X2),X1) )
        | ? [X3,X4] :
            ( in(X4,X1)
            & ~ in(X3,X1)
            & subset(X3,X4) )
        | ~ in(sK2,X1)
        | sP0(X1) ) ),
    introduced(choice_axiom,[]) ).

fof(f28,plain,
    ! [X1] :
      ( ? [X2] :
          ( in(X2,X1)
          & ~ in(powerset(X2),X1) )
     => ( in(sK3(X1),X1)
        & ~ in(powerset(sK3(X1)),X1) ) ),
    introduced(choice_axiom,[]) ).

fof(f29,plain,
    ! [X1] :
      ( ? [X3,X4] :
          ( in(X4,X1)
          & ~ in(X3,X1)
          & subset(X3,X4) )
     => ( in(sK5(X1),X1)
        & ~ in(sK4(X1),X1)
        & subset(sK4(X1),sK5(X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f26,plain,
    ? [X0] :
    ! [X1] :
      ( ? [X2] :
          ( in(X2,X1)
          & ~ in(powerset(X2),X1) )
      | ? [X3,X4] :
          ( in(X4,X1)
          & ~ in(X3,X1)
          & subset(X3,X4) )
      | ~ in(X0,X1)
      | sP0(X1) ),
    inference(rectify,[],[f21]) ).

fof(f21,plain,
    ? [X0] :
    ! [X1] :
      ( ? [X4] :
          ( in(X4,X1)
          & ~ in(powerset(X4),X1) )
      | ? [X2,X3] :
          ( in(X3,X1)
          & ~ in(X2,X1)
          & subset(X2,X3) )
      | ~ in(X0,X1)
      | sP0(X1) ),
    inference(definition_folding,[],[f15,f20]) ).

fof(f15,plain,
    ? [X0] :
    ! [X1] :
      ( ? [X4] :
          ( in(X4,X1)
          & ~ in(powerset(X4),X1) )
      | ? [X2,X3] :
          ( in(X3,X1)
          & ~ in(X2,X1)
          & subset(X2,X3) )
      | ~ in(X0,X1)
      | ? [X5] :
          ( subset(X5,X1)
          & ~ in(X5,X1)
          & ~ are_equipotent(X5,X1) ) ),
    inference(flattening,[],[f14]) ).

fof(f14,plain,
    ? [X0] :
    ! [X1] :
      ( ~ in(X0,X1)
      | ? [X4] :
          ( in(X4,X1)
          & ~ in(powerset(X4),X1) )
      | ? [X5] :
          ( subset(X5,X1)
          & ~ in(X5,X1)
          & ~ are_equipotent(X5,X1) )
      | ? [X2,X3] :
          ( ~ in(X2,X1)
          & subset(X2,X3)
          & in(X3,X1) ) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,plain,
    ~ ! [X0] :
      ? [X1] :
        ( in(X0,X1)
        & ! [X4] :
            ( in(X4,X1)
           => in(powerset(X4),X1) )
        & ! [X5] :
            ~ ( subset(X5,X1)
              & ~ in(X5,X1)
              & ~ are_equipotent(X5,X1) )
        & ! [X2,X3] :
            ( ( subset(X2,X3)
              & in(X3,X1) )
           => in(X2,X1) ) ),
    inference(rectify,[],[f7]) ).

fof(f7,negated_conjecture,
    ~ ! [X0] :
      ? [X1] :
        ( ! [X3,X2] :
            ( ( in(X2,X1)
              & subset(X3,X2) )
           => in(X3,X1) )
        & ! [X2] :
            ( in(X2,X1)
           => in(powerset(X2),X1) )
        & ! [X2] :
            ~ ( ~ in(X2,X1)
              & ~ are_equipotent(X2,X1)
              & subset(X2,X1) )
        & in(X0,X1) ),
    inference(negated_conjecture,[],[f6]) ).

fof(f6,conjecture,
    ! [X0] :
    ? [X1] :
      ( ! [X3,X2] :
          ( ( in(X2,X1)
            & subset(X3,X2) )
         => in(X3,X1) )
      & ! [X2] :
          ( in(X2,X1)
         => in(powerset(X2),X1) )
      & ! [X2] :
          ~ ( ~ in(X2,X1)
            & ~ are_equipotent(X2,X1)
            & subset(X2,X1) )
      & in(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t136_zfmisc_1) ).

fof(f209,plain,
    ( in(sK4(sK6(sK2)),sK6(sK2))
    | in(sK3(sK6(sK2)),sK6(sK2))
    | sP0(sK6(sK2)) ),
    inference(subsumption_resolution,[],[f206,f53]) ).

fof(f206,plain,
    ( in(sK3(sK6(sK2)),sK6(sK2))
    | ~ in(sK2,sK6(sK2))
    | sP0(sK6(sK2))
    | in(sK4(sK6(sK2)),sK6(sK2)) ),
    inference(duplicate_literal_removal,[],[f201]) ).

fof(f201,plain,
    ( in(sK4(sK6(sK2)),sK6(sK2))
    | ~ in(sK2,sK6(sK2))
    | in(sK3(sK6(sK2)),sK6(sK2))
    | in(sK3(sK6(sK2)),sK6(sK2))
    | sP0(sK6(sK2))
    | sP0(sK6(sK2)) ),
    inference(resolution,[],[f115,f48]) ).

fof(f48,plain,
    ! [X1] :
      ( subset(sK4(X1),sK5(X1))
      | ~ in(sK2,X1)
      | sP0(X1)
      | in(sK3(X1),X1) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f115,plain,
    ! [X0] :
      ( ~ subset(X0,sK5(sK6(sK2)))
      | sP0(sK6(sK2))
      | in(X0,sK6(sK2))
      | in(sK3(sK6(sK2)),sK6(sK2)) ),
    inference(resolution,[],[f93,f53]) ).

fof(f93,plain,
    ! [X2,X3] :
      ( ~ in(sK2,sK6(X3))
      | ~ subset(X2,sK5(sK6(X3)))
      | sP0(sK6(X3))
      | in(sK3(sK6(X3)),sK6(X3))
      | in(X2,sK6(X3)) ),
    inference(resolution,[],[f52,f50]) ).

fof(f50,plain,
    ! [X1] :
      ( in(sK5(X1),X1)
      | in(sK3(X1),X1)
      | sP0(X1)
      | ~ in(sK2,X1) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f52,plain,
    ! [X0,X6,X7] :
      ( ~ in(X6,sK6(X0))
      | ~ subset(X7,X6)
      | in(X7,sK6(X0)) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f574,plain,
    ( in(powerset(sK3(sK6(sK2))),sK6(sK2))
    | sP0(sK6(sK2))
    | ~ in(sK3(sK6(sK2)),sK6(sK2)) ),
    inference(resolution,[],[f572,f94]) ).

fof(f94,plain,
    ! [X6,X4,X5] :
      ( ~ subset(X4,sK7(X5,X6))
      | in(X4,sK6(X5))
      | ~ in(X6,sK6(X5)) ),
    inference(resolution,[],[f52,f55]) ).

fof(f55,plain,
    ! [X3,X0] :
      ( in(sK7(X0,X3),sK6(X0))
      | ~ in(X3,sK6(X0)) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f572,plain,
    ( subset(powerset(sK3(sK6(sK2))),sK7(sK2,sK3(sK6(sK2))))
    | sP0(sK6(sK2)) ),
    inference(duplicate_literal_removal,[],[f570]) ).

fof(f570,plain,
    ( subset(powerset(sK3(sK6(sK2))),sK7(sK2,sK3(sK6(sK2))))
    | subset(powerset(sK3(sK6(sK2))),sK7(sK2,sK3(sK6(sK2))))
    | sP0(sK6(sK2)) ),
    inference(resolution,[],[f244,f63]) ).

fof(f63,plain,
    ! [X0,X1] :
      ( ~ in(sK9(X0,X1),X0)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( ( subset(X1,X0)
        | ( in(sK9(X0,X1),X1)
          & ~ in(sK9(X0,X1),X0) ) )
      & ( ! [X3] :
            ( ~ in(X3,X1)
            | in(X3,X0) )
        | ~ subset(X1,X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f39,f40]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( in(X2,X1)
          & ~ in(X2,X0) )
     => ( in(sK9(X0,X1),X1)
        & ~ in(sK9(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( ( subset(X1,X0)
        | ? [X2] :
            ( in(X2,X1)
            & ~ in(X2,X0) ) )
      & ( ! [X3] :
            ( ~ in(X3,X1)
            | in(X3,X0) )
        | ~ subset(X1,X0) ) ),
    inference(rectify,[],[f38]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( ( subset(X1,X0)
        | ? [X2] :
            ( in(X2,X1)
            & ~ in(X2,X0) ) )
      & ( ! [X2] :
            ( ~ in(X2,X1)
            | in(X2,X0) )
        | ~ subset(X1,X0) ) ),
    inference(nnf_transformation,[],[f17]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( subset(X1,X0)
    <=> ! [X2] :
          ( ~ in(X2,X1)
          | in(X2,X0) ) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( in(X2,X1)
         => in(X2,X0) )
    <=> subset(X1,X0) ),
    inference(rectify,[],[f3]) ).

fof(f3,axiom,
    ! [X1,X0] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).

fof(f244,plain,
    ! [X3] :
      ( in(sK9(X3,powerset(sK3(sK6(sK2)))),sK7(sK2,sK3(sK6(sK2))))
      | sP0(sK6(sK2))
      | subset(powerset(sK3(sK6(sK2))),X3) ),
    inference(resolution,[],[f227,f84]) ).

fof(f84,plain,
    ! [X3,X4] :
      ( subset(sK9(X4,powerset(X3)),X3)
      | subset(powerset(X3),X4) ),
    inference(resolution,[],[f64,f66]) ).

fof(f66,plain,
    ! [X3,X0] :
      ( ~ in(X3,powerset(X0))
      | subset(X3,X0) ),
    inference(equality_resolution,[],[f57]) ).

fof(f57,plain,
    ! [X3,X0,X1] :
      ( subset(X3,X0)
      | ~ in(X3,X1)
      | powerset(X0) != X1 ),
    inference(cnf_transformation,[],[f37]) ).

fof(f37,plain,
    ! [X0,X1] :
      ( ( powerset(X0) = X1
        | ( ( ~ subset(sK8(X0,X1),X0)
            | ~ in(sK8(X0,X1),X1) )
          & ( subset(sK8(X0,X1),X0)
            | in(sK8(X0,X1),X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | ~ subset(X3,X0) )
            & ( subset(X3,X0)
              | ~ in(X3,X1) ) )
        | powerset(X0) != X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f35,f36]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ( ~ subset(X2,X0)
            | ~ in(X2,X1) )
          & ( subset(X2,X0)
            | in(X2,X1) ) )
     => ( ( ~ subset(sK8(X0,X1),X0)
          | ~ in(sK8(X0,X1),X1) )
        & ( subset(sK8(X0,X1),X0)
          | in(sK8(X0,X1),X1) ) ) ),
    introduced(choice_axiom,[]) ).

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

fof(f34,plain,
    ! [X1,X0] :
      ( ( powerset(X1) = X0
        | ? [X2] :
            ( ( ~ subset(X2,X1)
              | ~ in(X2,X0) )
            & ( subset(X2,X1)
              | in(X2,X0) ) ) )
      & ( ! [X2] :
            ( ( in(X2,X0)
              | ~ subset(X2,X1) )
            & ( subset(X2,X1)
              | ~ in(X2,X0) ) )
        | powerset(X1) != X0 ) ),
    inference(nnf_transformation,[],[f12]) ).

fof(f12,plain,
    ! [X1,X0] :
      ( powerset(X1) = X0
    <=> ! [X2] :
          ( in(X2,X0)
        <=> subset(X2,X1) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ! [X1,X0] :
      ( ! [X2] :
          ( subset(X2,X0)
        <=> in(X2,X1) )
    <=> powerset(X0) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).

fof(f64,plain,
    ! [X0,X1] :
      ( in(sK9(X0,X1),X1)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f227,plain,
    ! [X0] :
      ( ~ subset(X0,sK3(sK6(sK2)))
      | in(X0,sK7(sK2,sK3(sK6(sK2))))
      | sP0(sK6(sK2)) ),
    inference(resolution,[],[f221,f54]) ).

fof(f54,plain,
    ! [X3,X0,X5] :
      ( ~ in(X3,sK6(X0))
      | ~ subset(X5,X3)
      | in(X5,sK7(X0,X3)) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f695,plain,
    ( ~ in(powerset(sK3(sK6(sK2))),sK6(sK2))
    | sP0(sK6(sK2)) ),
    inference(subsumption_resolution,[],[f693,f53]) ).

fof(f693,plain,
    ( ~ in(sK2,sK6(sK2))
    | sP0(sK6(sK2))
    | ~ in(powerset(sK3(sK6(sK2))),sK6(sK2)) ),
    inference(duplicate_literal_removal,[],[f690]) ).

fof(f690,plain,
    ( ~ in(powerset(sK3(sK6(sK2))),sK6(sK2))
    | sP0(sK6(sK2))
    | sP0(sK6(sK2))
    | ~ in(sK2,sK6(sK2)) ),
    inference(resolution,[],[f686,f46]) ).

fof(f46,plain,
    ! [X1] :
      ( ~ in(sK4(X1),X1)
      | ~ in(sK2,X1)
      | ~ in(powerset(sK3(X1)),X1)
      | sP0(X1) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f686,plain,
    ( in(sK4(sK6(sK2)),sK6(sK2))
    | sP0(sK6(sK2)) ),
    inference(duplicate_literal_removal,[],[f674]) ).

fof(f674,plain,
    ( sP0(sK6(sK2))
    | in(sK4(sK6(sK2)),sK6(sK2))
    | sP0(sK6(sK2)) ),
    inference(resolution,[],[f615,f620]) ).

fof(f620,plain,
    ( subset(sK4(sK6(sK2)),sK5(sK6(sK2)))
    | sP0(sK6(sK2)) ),
    inference(resolution,[],[f613,f66]) ).

fof(f613,plain,
    ( in(sK4(sK6(sK2)),powerset(sK5(sK6(sK2))))
    | sP0(sK6(sK2)) ),
    inference(subsumption_resolution,[],[f605,f53]) ).

fof(f605,plain,
    ( sP0(sK6(sK2))
    | in(sK4(sK6(sK2)),powerset(sK5(sK6(sK2))))
    | ~ in(sK2,sK6(sK2)) ),
    inference(duplicate_literal_removal,[],[f602]) ).

fof(f602,plain,
    ( ~ in(sK2,sK6(sK2))
    | sP0(sK6(sK2))
    | in(sK4(sK6(sK2)),powerset(sK5(sK6(sK2))))
    | sP0(sK6(sK2)) ),
    inference(resolution,[],[f579,f70]) ).

fof(f70,plain,
    ! [X0] :
      ( ~ in(powerset(sK3(X0)),X0)
      | ~ in(sK2,X0)
      | in(sK4(X0),powerset(sK5(X0)))
      | sP0(X0) ),
    inference(resolution,[],[f65,f45]) ).

fof(f45,plain,
    ! [X1] :
      ( subset(sK4(X1),sK5(X1))
      | ~ in(powerset(sK3(X1)),X1)
      | ~ in(sK2,X1)
      | sP0(X1) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f65,plain,
    ! [X3,X0] :
      ( ~ subset(X3,X0)
      | in(X3,powerset(X0)) ),
    inference(equality_resolution,[],[f58]) ).

fof(f58,plain,
    ! [X3,X0,X1] :
      ( in(X3,X1)
      | ~ subset(X3,X0)
      | powerset(X0) != X1 ),
    inference(cnf_transformation,[],[f37]) ).

fof(f615,plain,
    ! [X1] :
      ( ~ subset(X1,sK5(sK6(sK2)))
      | in(X1,sK6(sK2))
      | sP0(sK6(sK2)) ),
    inference(resolution,[],[f604,f52]) ).

fof(f604,plain,
    ( in(sK5(sK6(sK2)),sK6(sK2))
    | sP0(sK6(sK2)) ),
    inference(duplicate_literal_removal,[],[f596]) ).

fof(f596,plain,
    ( sP0(sK6(sK2))
    | in(sK5(sK6(sK2)),sK6(sK2))
    | sP0(sK6(sK2)) ),
    inference(resolution,[],[f579,f67]) ).

fof(f67,plain,
    ( ~ in(powerset(sK3(sK6(sK2))),sK6(sK2))
    | sP0(sK6(sK2))
    | in(sK5(sK6(sK2)),sK6(sK2)) ),
    inference(resolution,[],[f53,f47]) ).

fof(f47,plain,
    ! [X1] :
      ( ~ in(sK2,X1)
      | sP0(X1)
      | ~ in(powerset(sK3(X1)),X1)
      | in(sK5(X1),X1) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f913,plain,
    in(sK1(sK6(sK2)),sK6(sK2)),
    inference(subsumption_resolution,[],[f912,f777]) ).

fof(f777,plain,
    subset(sK1(sK6(sK2)),sK6(sK2)),
    inference(resolution,[],[f696,f44]) ).

fof(f44,plain,
    ! [X0] :
      ( ~ sP0(X0)
      | subset(sK1(X0),X0) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f912,plain,
    ( ~ subset(sK1(sK6(sK2)),sK6(sK2))
    | in(sK1(sK6(sK2)),sK6(sK2)) ),
    inference(resolution,[],[f779,f56]) ).

fof(f56,plain,
    ! [X2,X0] :
      ( are_equipotent(X2,sK6(X0))
      | ~ subset(X2,sK6(X0))
      | in(X2,sK6(X0)) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f779,plain,
    ~ are_equipotent(sK1(sK6(sK2)),sK6(sK2)),
    inference(resolution,[],[f696,f42]) ).

fof(f42,plain,
    ! [X0] :
      ( ~ sP0(X0)
      | ~ are_equipotent(sK1(X0),X0) ),
    inference(cnf_transformation,[],[f25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SEU168+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35  % Computer : n005.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 14:45:18 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  % (11331)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.49  % (11331)Instruction limit reached!
% 0.21/0.49  % (11331)------------------------------
% 0.21/0.49  % (11331)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.49  % (11331)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.49  % (11331)Termination reason: Unknown
% 0.21/0.49  % (11331)Termination phase: Preprocessing 3
% 0.21/0.49  
% 0.21/0.49  % (11331)Memory used [KB]: 895
% 0.21/0.49  % (11331)Time elapsed: 0.003 s
% 0.21/0.49  % (11331)Instructions burned: 2 (million)
% 0.21/0.49  % (11331)------------------------------
% 0.21/0.49  % (11331)------------------------------
% 0.21/0.49  % (11348)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.21/0.51  % (11326)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52  % (11323)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.21/0.52  % (11336)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.52  % (11345)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.21/0.52  % (11334)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.52  % (11339)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.52  % (11325)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.53  % (11351)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.21/0.53  % (11343)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.21/0.53  % (11349)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.21/0.53  % (11327)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.53  % (11329)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.53  TRYING [1]
% 0.21/0.53  TRYING [2]
% 0.21/0.53  TRYING [3]
% 0.21/0.53  % (11324)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.53  TRYING [4]
% 0.21/0.53  % (11342)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.53  % (11324)Refutation not found, incomplete strategy% (11324)------------------------------
% 0.21/0.53  % (11324)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53  % (11324)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53  % (11324)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.53  
% 0.21/0.53  % (11324)Memory used [KB]: 5373
% 0.21/0.53  % (11324)Time elapsed: 0.126 s
% 0.21/0.53  % (11324)Instructions burned: 3 (million)
% 0.21/0.53  % (11324)------------------------------
% 0.21/0.53  % (11324)------------------------------
% 0.21/0.53  % (11328)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.21/0.53  % (11337)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.54  % (11352)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.21/0.54  % (11341)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.54  % (11340)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.21/0.54  % (11330)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.54  TRYING [1]
% 0.21/0.54  TRYING [2]
% 0.21/0.54  TRYING [1]
% 0.21/0.54  TRYING [2]
% 0.21/0.54  TRYING [3]
% 0.21/0.54  TRYING [3]
% 0.21/0.54  % (11353)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.21/0.54  % (11350)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.54  TRYING [4]
% 0.21/0.54  % (11332)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.54  % (11335)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.21/0.54  % (11347)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.21/0.55  % (11333)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.55  % (11338)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.21/0.55  % (11344)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.21/0.56  TRYING [5]
% 0.21/0.56  % (11330)Instruction limit reached!
% 0.21/0.56  % (11330)------------------------------
% 0.21/0.56  % (11330)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56  % (11330)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56  % (11330)Termination reason: Unknown
% 0.21/0.56  % (11330)Termination phase: Saturation
% 0.21/0.56  
% 0.21/0.56  % (11330)Memory used [KB]: 5500
% 0.21/0.56  % (11330)Time elapsed: 0.146 s
% 0.21/0.56  % (11330)Instructions burned: 7 (million)
% 0.21/0.56  % (11330)------------------------------
% 0.21/0.56  % (11330)------------------------------
% 0.21/0.56  TRYING [5]
% 1.69/0.57  TRYING [4]
% 1.69/0.59  % (11325)Instruction limit reached!
% 1.69/0.59  % (11325)------------------------------
% 1.69/0.59  % (11325)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.69/0.59  % (11325)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.69/0.59  % (11325)Termination reason: Unknown
% 1.69/0.59  % (11325)Termination phase: Saturation
% 1.69/0.59  
% 1.69/0.59  % (11325)Memory used [KB]: 1407
% 1.69/0.59  % (11325)Time elapsed: 0.190 s
% 1.69/0.59  % (11325)Instructions burned: 38 (million)
% 1.69/0.59  % (11325)------------------------------
% 1.69/0.59  % (11325)------------------------------
% 1.89/0.59  TRYING [6]
% 1.89/0.60  TRYING [5]
% 1.89/0.61  % (11329)Instruction limit reached!
% 1.89/0.61  % (11329)------------------------------
% 1.89/0.61  % (11329)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.89/0.61  % (11329)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.89/0.61  % (11329)Termination reason: Unknown
% 1.89/0.61  % (11329)Termination phase: Finite model building SAT solving
% 1.89/0.61  
% 1.89/0.61  % (11329)Memory used [KB]: 6780
% 1.89/0.61  % (11329)Time elapsed: 0.143 s
% 1.89/0.61  % (11329)Instructions burned: 53 (million)
% 1.89/0.61  % (11329)------------------------------
% 1.89/0.61  % (11329)------------------------------
% 1.89/0.61  % (11326)Instruction limit reached!
% 1.89/0.61  % (11326)------------------------------
% 1.89/0.61  % (11326)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.89/0.61  % (11326)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.89/0.61  % (11326)Termination reason: Unknown
% 1.89/0.61  % (11326)Termination phase: Saturation
% 1.89/0.61  
% 1.89/0.61  % (11326)Memory used [KB]: 6012
% 1.89/0.61  % (11326)Time elapsed: 0.213 s
% 1.89/0.61  % (11326)Instructions burned: 51 (million)
% 1.89/0.61  % (11326)------------------------------
% 1.89/0.61  % (11326)------------------------------
% 1.89/0.62  % (11333)Instruction limit reached!
% 1.89/0.62  % (11333)------------------------------
% 1.89/0.62  % (11333)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.89/0.62  % (11333)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.89/0.62  % (11333)Termination reason: Unknown
% 1.89/0.62  % (11333)Termination phase: Saturation
% 1.89/0.62  
% 1.89/0.62  % (11333)Memory used [KB]: 6396
% 1.89/0.62  % (11333)Time elapsed: 0.224 s
% 1.89/0.62  % (11333)Instructions burned: 51 (million)
% 1.89/0.62  % (11333)------------------------------
% 1.89/0.62  % (11333)------------------------------
% 1.89/0.63  % (11354)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=388:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/388Mi)
% 1.89/0.63  % (11332)Instruction limit reached!
% 1.89/0.63  % (11332)------------------------------
% 1.89/0.63  % (11332)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.89/0.63  % (11332)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.89/0.63  % (11332)Termination reason: Unknown
% 1.89/0.63  % (11332)Termination phase: Saturation
% 1.89/0.63  
% 1.89/0.63  % (11332)Memory used [KB]: 1407
% 1.89/0.63  % (11332)Time elapsed: 0.218 s
% 1.89/0.63  % (11332)Instructions burned: 52 (million)
% 1.89/0.63  % (11332)------------------------------
% 1.89/0.63  % (11332)------------------------------
% 1.89/0.64  % (11328)Instruction limit reached!
% 1.89/0.64  % (11328)------------------------------
% 1.89/0.64  % (11328)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.89/0.64  % (11328)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.89/0.64  % (11328)Termination reason: Unknown
% 1.89/0.64  % (11328)Termination phase: Saturation
% 1.89/0.64  
% 1.89/0.64  % (11328)Memory used [KB]: 5756
% 1.89/0.64  % (11328)Time elapsed: 0.242 s
% 1.89/0.64  % (11328)Instructions burned: 50 (million)
% 1.89/0.64  % (11328)------------------------------
% 1.89/0.64  % (11328)------------------------------
% 2.27/0.64  % (11327)Instruction limit reached!
% 2.27/0.64  % (11327)------------------------------
% 2.27/0.64  % (11327)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.27/0.64  % (11327)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.27/0.64  % (11327)Termination reason: Unknown
% 2.27/0.64  % (11327)Termination phase: Saturation
% 2.27/0.64  
% 2.27/0.64  % (11327)Memory used [KB]: 6268
% 2.27/0.64  % (11327)Time elapsed: 0.222 s
% 2.27/0.64  % (11327)Instructions burned: 51 (million)
% 2.27/0.64  % (11327)------------------------------
% 2.27/0.64  % (11327)------------------------------
% 2.28/0.65  % (11340)Instruction limit reached!
% 2.28/0.65  % (11340)------------------------------
% 2.28/0.65  % (11340)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.28/0.65  % (11340)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.28/0.65  % (11340)Termination reason: Unknown
% 2.28/0.65  % (11340)Termination phase: Finite model building SAT solving
% 2.28/0.65  
% 2.28/0.65  % (11340)Memory used [KB]: 7164
% 2.28/0.65  % (11340)Time elapsed: 0.199 s
% 2.28/0.65  % (11340)Instructions burned: 60 (million)
% 2.28/0.65  % (11340)------------------------------
% 2.28/0.65  % (11340)------------------------------
% 2.28/0.65  % (11337)Instruction limit reached!
% 2.28/0.65  % (11337)------------------------------
% 2.28/0.65  % (11337)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.28/0.65  % (11337)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.28/0.65  % (11337)Termination reason: Unknown
% 2.28/0.65  % (11337)Termination phase: Saturation
% 2.28/0.65  
% 2.28/0.65  % (11337)Memory used [KB]: 6524
% 2.28/0.65  % (11337)Time elapsed: 0.037 s
% 2.28/0.65  % (11337)Instructions burned: 68 (million)
% 2.28/0.65  % (11337)------------------------------
% 2.28/0.65  % (11337)------------------------------
% 2.28/0.66  % (11350)Instruction limit reached!
% 2.28/0.66  % (11350)------------------------------
% 2.28/0.66  % (11350)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.28/0.66  % (11350)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.28/0.66  % (11350)Termination reason: Unknown
% 2.28/0.66  % (11350)Termination phase: Saturation
% 2.28/0.66  
% 2.28/0.66  % (11350)Memory used [KB]: 6524
% 2.28/0.66  % (11350)Time elapsed: 0.036 s
% 2.28/0.66  % (11350)Instructions burned: 70 (million)
% 2.28/0.66  % (11350)------------------------------
% 2.28/0.66  % (11350)------------------------------
% 2.28/0.67  % (11355)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=211:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/211Mi)
% 2.28/0.68  TRYING [7]
% 2.28/0.68  % (11351)First to succeed.
% 2.28/0.69  % (11338)Instruction limit reached!
% 2.28/0.69  % (11338)------------------------------
% 2.28/0.69  % (11338)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.28/0.69  % (11338)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.28/0.69  % (11338)Termination reason: Unknown
% 2.28/0.69  % (11338)Termination phase: Saturation
% 2.28/0.69  
% 2.28/0.69  % (11338)Memory used [KB]: 2174
% 2.28/0.69  % (11338)Time elapsed: 0.290 s
% 2.28/0.69  % (11338)Instructions burned: 76 (million)
% 2.28/0.69  % (11338)------------------------------
% 2.28/0.69  % (11338)------------------------------
% 2.28/0.69  % (11351)Refutation found. Thanks to Tanya!
% 2.28/0.69  % SZS status Theorem for theBenchmark
% 2.28/0.69  % SZS output start Proof for theBenchmark
% See solution above
% 2.28/0.69  % (11351)------------------------------
% 2.28/0.69  % (11351)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.28/0.69  % (11351)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.28/0.69  % (11351)Termination reason: Refutation
% 2.28/0.70  
% 2.28/0.70  % (11351)Memory used [KB]: 2174
% 2.28/0.70  % (11351)Time elapsed: 0.295 s
% 2.28/0.70  % (11351)Instructions burned: 82 (million)
% 2.28/0.70  % (11351)------------------------------
% 2.28/0.70  % (11351)------------------------------
% 2.28/0.70  % (11322)Success in time 0.332 s
%------------------------------------------------------------------------------