↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEU168+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 12:47:32 PM UTC 2026

% Result   : Theorem 8.96s 2.27s
% Output   : Refutation 9.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   74 (   6 unt;   2 def)
%            Number of atoms       :  322 (  10 equ)
%            Maximal formula atoms :   11 (   4 avg)
%            Number of connectives :  404 ( 156   ~; 148   |;  85   &)
%                                         (   4 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   1 con; 0-2 aty)
%            Number of variables   :  182 ( 152   !;  30   ?)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fof(f21,plain,
    ! [X0,X1] :
      ( ( X1 = powerset(X0)
        | ? [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,[],[f20]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ( X1 = powerset(X0)
        | ( ( ~ subset(sK1(X0,X1),X0)
            | ~ in(sK1(X0,X1),X1) )
          & ( subset(sK1(X0,X1),X0)
            | in(sK1(X0,X1),X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | ~ subset(X3,X0) )
            & ( subset(X3,X0)
              | ~ in(X3,X1) ) )
        | powerset(X0) != X1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f21]) ).

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

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

fof(f25,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ in(sK2(X0,X1),X1)
          & in(sK2(X0,X1),X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f24]) ).

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

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

fof(f28,plain,
    ! [X0] :
      ( ( subset(sK3(X0),X0)
        & ~ are_equipotent(sK3(X0),X0)
        & ~ in(sK3(X0),X0) )
      | ~ sP0(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X1,sK3(X0))],[f27]) ).

fof(f29,plain,
    ! [X1] :
      ( ~ in(sK4,X1)
      | ( ~ in(sK6(X1),X1)
        & in(sK5(X1),X1)
        & subset(sK6(X1),sK5(X1)) )
      | ( ~ in(powerset(sK7(X1)),X1)
        & in(sK7(X1),X1) )
      | sP0(X1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X0,sK4),skolemize(X2,sK5(X1)),skolemize(X3,sK6(X1)),skolemize(X4,sK7(X1))],[f19]) ).

fof(f30,plain,
    ! [X0] :
      ( in(X0,sK8(X0))
      & ! [X2,X3] :
          ( in(X3,sK8(X0))
          | ~ in(X2,sK8(X0))
          | ~ subset(X3,X2) )
      & ! [X4] :
          ( ~ in(X4,sK8(X0))
          | ( in(sK9(X0,X4),sK8(X0))
            & ! [X6] :
                ( in(X6,sK9(X0,X4))
                | ~ subset(X6,X4) ) ) )
      & ! [X7] :
          ( ~ subset(X7,sK8(X0))
          | are_equipotent(X7,sK8(X0))
          | in(X7,sK8(X0)) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X1,sK8(X0)),skolemize(X5,sK9(X0,X4))],[f17]) ).

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

fof(f37,plain,
    ! [X0,X1] :
      ( in(sK2(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( ~ in(sK2(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f40,plain,
    ! [X0] :
      ( ~ in(sK3(X0),X0)
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f41,plain,
    ! [X0] :
      ( ~ are_equipotent(sK3(X0),X0)
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f42,plain,
    ! [X0] :
      ( subset(sK3(X0),X0)
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f43,plain,
    ! [X1] :
      ( subset(sK6(X1),sK5(X1))
      | ~ in(sK4,X1)
      | in(sK7(X1),X1)
      | sP0(X1) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f44,plain,
    ! [X1] :
      ( ~ in(sK4,X1)
      | subset(sK6(X1),sK5(X1))
      | ~ in(powerset(sK7(X1)),X1)
      | sP0(X1) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f45,plain,
    ! [X1] :
      ( in(sK7(X1),X1)
      | in(sK5(X1),X1)
      | ~ in(sK4,X1)
      | sP0(X1) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f46,plain,
    ! [X1] :
      ( ~ in(sK4,X1)
      | in(sK5(X1),X1)
      | ~ in(powerset(sK7(X1)),X1)
      | sP0(X1) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f47,plain,
    ! [X1] :
      ( ~ in(sK6(X1),X1)
      | ~ in(sK4,X1)
      | in(sK7(X1),X1)
      | sP0(X1) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f48,plain,
    ! [X1] :
      ( ~ in(sK4,X1)
      | ~ in(sK6(X1),X1)
      | ~ in(powerset(sK7(X1)),X1)
      | sP0(X1) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f49,plain,
    ! [X0,X7] :
      ( ~ subset(X7,sK8(X0))
      | are_equipotent(X7,sK8(X0))
      | in(X7,sK8(X0)) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f50,plain,
    ! [X0,X6,X4] :
      ( in(X6,sK9(X0,X4))
      | ~ in(X4,sK8(X0))
      | ~ subset(X6,X4) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f51,plain,
    ! [X0,X4] :
      ( in(sK9(X0,X4),sK8(X0))
      | ~ in(X4,sK8(X0)) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f52,plain,
    ! [X2,X3,X0] :
      ( ~ in(X2,sK8(X0))
      | in(X3,sK8(X0))
      | ~ subset(X3,X2) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f53,plain,
    ! [X0] : in(X0,sK8(X0)),
    inference(cnf_transformation,[],[f30]) ).

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

fof(f56,definition,
    ! [X1] : sF10(X1) = powerset(sK7(X1)),
    introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).

fof(f57,plain,
    ! [X1] : powerset(sK7(X1)) = sF10(X1),
    inference(reorient_equations,[],[f56]) ).

fof(f58,plain,
    ! [X1] :
      ( ~ in(sF10(X1),X1)
      | ~ in(sK6(X1),X1)
      | ~ in(sK4,X1)
      | sP0(X1) ),
    inference(definition_folding,[],[f48,f57]) ).

fof(f59,plain,
    ! [X1] :
      ( ~ in(sF10(X1),X1)
      | in(sK5(X1),X1)
      | ~ in(sK4,X1)
      | sP0(X1) ),
    inference(definition_folding,[],[f46,f57]) ).

fof(f60,plain,
    ! [X1] :
      ( subset(sK6(X1),sK5(X1))
      | ~ in(sK4,X1)
      | ~ in(sF10(X1),X1)
      | sP0(X1) ),
    inference(definition_folding,[],[f44,f57]) ).

fof(f64,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X2,sK9(X1,X0))
      | in(X2,sK8(X1))
      | ~ in(X0,sK8(X1)) ),
    inference(resolution,[],[f51,f52]) ).

fof(f75,plain,
    ! [X0,X1] :
      ( subset(sK2(powerset(X0),X1),X0)
      | subset(powerset(X0),X1) ),
    inference(resolution,[],[f55,f37]) ).

fof(f79,plain,
    ! [X0] :
      ( are_equipotent(sK3(sK8(X0)),sK8(X0))
      | in(sK3(sK8(X0)),sK8(X0))
      | ~ sP0(sK8(X0)) ),
    inference(resolution,[],[f49,f42]) ).

fof(f80,plain,
    ! [X0] :
      ( in(sK3(sK8(X0)),sK8(X0))
      | ~ sP0(sK8(X0)) ),
    inference(forward_subsumption_resolution,[],[f79,f41]) ).

fof(f81,plain,
    ! [X0] : ~ sP0(sK8(X0)),
    inference(forward_subsumption_resolution,[],[f80,f40]) ).

fof(f102,plain,
    ! [X2,X0,X1] :
      ( ~ subset(sK2(X2,sK9(X1,X0)),X0)
      | ~ in(X0,sK8(X1))
      | subset(X2,sK9(X1,X0)) ),
    inference(resolution,[],[f50,f38]) ).

fof(f108,plain,
    ! [X0,X1] :
      ( subset(powerset(X0),sK9(X1,X0))
      | ~ in(X0,sK8(X1))
      | subset(powerset(X0),sK9(X1,X0)) ),
    inference(resolution,[],[f75,f102]) ).

fof(f116,plain,
    ! [X0,X1] :
      ( subset(powerset(X0),sK9(X1,X0))
      | ~ in(X0,sK8(X1)) ),
    inference(duplicate_literal_removal,[],[f108]) ).

fof(f147,plain,
    ! [X0,X1] :
      ( ~ in(X0,sK8(X1))
      | in(powerset(X0),sK8(X1))
      | ~ in(X0,sK8(X1)) ),
    inference(resolution,[],[f116,f64]) ).

fof(f150,plain,
    ! [X0,X1] :
      ( in(powerset(X0),sK8(X1))
      | ~ in(X0,sK8(X1)) ),
    inference(duplicate_literal_removal,[],[f147]) ).

fof(f153,plain,
    ! [X0,X1] :
      ( ~ in(sK7(X0),sK8(X1))
      | in(sF10(X0),sK8(X1)) ),
    inference(superposition,[],[f150,f57]) ).

fof(f203,plain,
    ! [X0] :
      ( in(sF10(sK8(X0)),sK8(X0))
      | in(sK5(sK8(X0)),sK8(X0))
      | ~ in(sK4,sK8(X0))
      | sP0(sK8(X0)) ),
    inference(resolution,[],[f153,f45]) ).

fof(f206,plain,
    ! [X0] :
      ( in(sK5(sK8(X0)),sK8(X0))
      | ~ in(sK4,sK8(X0))
      | sP0(sK8(X0)) ),
    inference(forward_subsumption_resolution,[],[f203,f59]) ).

fof(f207,plain,
    ! [X0] :
      ( in(sK5(sK8(X0)),sK8(X0))
      | ~ in(sK4,sK8(X0)) ),
    inference(forward_subsumption_resolution,[],[f206,f81]) ).

fof(f208,plain,
    ! [X0,X1] :
      ( ~ subset(X1,sK5(sK8(X0)))
      | in(X1,sK8(X0))
      | ~ in(sK4,sK8(X0)) ),
    inference(resolution,[],[f207,f52]) ).

fof(f213,plain,
    ! [X0] :
      ( in(sK6(sK8(X0)),sK8(X0))
      | ~ in(sK4,sK8(X0))
      | ~ in(sK4,sK8(X0))
      | ~ in(sF10(sK8(X0)),sK8(X0))
      | sP0(sK8(X0)) ),
    inference(resolution,[],[f208,f60]) ).

fof(f214,plain,
    ! [X0] :
      ( in(sK6(sK8(X0)),sK8(X0))
      | ~ in(sK4,sK8(X0))
      | ~ in(sK4,sK8(X0))
      | in(sK7(sK8(X0)),sK8(X0))
      | sP0(sK8(X0)) ),
    inference(resolution,[],[f208,f43]) ).

fof(f215,plain,
    ! [X0] :
      ( in(sK6(sK8(X0)),sK8(X0))
      | ~ in(sK4,sK8(X0))
      | in(sK7(sK8(X0)),sK8(X0))
      | sP0(sK8(X0)) ),
    inference(duplicate_literal_removal,[],[f214]) ).

fof(f216,plain,
    ! [X0] :
      ( in(sK6(sK8(X0)),sK8(X0))
      | ~ in(sK4,sK8(X0))
      | ~ in(sF10(sK8(X0)),sK8(X0))
      | sP0(sK8(X0)) ),
    inference(duplicate_literal_removal,[],[f213]) ).

fof(f217,plain,
    ! [X0] :
      ( ~ in(sK4,sK8(X0))
      | in(sK7(sK8(X0)),sK8(X0))
      | sP0(sK8(X0)) ),
    inference(forward_subsumption_resolution,[],[f215,f47]) ).

fof(f218,plain,
    ! [X0] :
      ( ~ in(sK4,sK8(X0))
      | ~ in(sF10(sK8(X0)),sK8(X0))
      | sP0(sK8(X0)) ),
    inference(forward_subsumption_resolution,[],[f216,f58]) ).

fof(f219,plain,
    ! [X0] :
      ( in(sK7(sK8(X0)),sK8(X0))
      | ~ in(sK4,sK8(X0)) ),
    inference(forward_subsumption_resolution,[],[f217,f81]) ).

fof(f220,plain,
    ! [X0] :
      ( ~ in(sF10(sK8(X0)),sK8(X0))
      | ~ in(sK4,sK8(X0)) ),
    inference(forward_subsumption_resolution,[],[f218,f81]) ).

fof(f222,plain,
    ! [X0] :
      ( ~ in(sK4,sK8(X0))
      | in(sF10(sK8(X0)),sK8(X0)) ),
    inference(resolution,[],[f219,f153]) ).

fof(f225,plain,
    ! [X0] : ~ in(sK4,sK8(X0)),
    inference(forward_subsumption_resolution,[],[f222,f220]) ).

fof(f226,plain,
    $false,
    inference(resolution,[],[f225,f53]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU168+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  % Computer : n002.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Mon Sep 28 03:54:37 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43  Running first-order theorem proving
% 0.13/0.43  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.96/2.27  % (4131913)Detected formulas, will run a generic FOF schedule.
% 8.96/2.27  % (4131941)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3689306303:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 8.96/2.27  % (4131943)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3628758767:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 8.96/2.27  % (4131945)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2433646141:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 8.96/2.27  % (4131946)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4268513523:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 8.96/2.27  % (4131944)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4049684301:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 8.96/2.27  % (4131947)dis-21_1_sil=8000:lcm=predicate:random_seed=1539926035:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 8.96/2.27  % (4131942)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=808352282:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 8.96/2.27  % (4131944)Instruction limit reached! 
% 8.96/2.27  % (4131944)------------------------------
% 8.96/2.27  % (4131944)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.96/2.27  % (4131944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.96/2.27  % (4131944)CaDiCaL version: 2.1.3
% 8.96/2.27  % (4131944)Termination reason: Instruction limit
% 8.96/2.27  % (4131944)Termination phase: Saturation
% 8.96/2.27  % (4131944)Time elapsed: 0.077 s
% 8.96/2.27  % (4131944)Peak memory usage: 88 MB
% 8.96/2.27  % (4131944)Instructions burned: 110 (million)
% 8.96/2.27  % (4131945)Instruction limit reached! 
% 8.96/2.27  % (4131945)------------------------------
% 8.96/2.27  % (4131945)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.96/2.27  % (4131945)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.96/2.27  % (4131945)CaDiCaL version: 2.1.3
% 8.96/2.27  % (4131945)Termination reason: Instruction limit
% 8.96/2.27  % (4131945)Termination phase: Saturation
% 8.96/2.27  % (4131945)Time elapsed: 0.094 s
% 8.96/2.27  % (4131945)Peak memory usage: 88 MB
% 8.96/2.27  % (4131945)Instructions burned: 120 (million)
% 8.96/2.27  % (4131947)Instruction limit reached! 
% 8.96/2.27  % (4131947)------------------------------
% 8.96/2.27  % (4131947)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.96/2.27  % (4131947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.96/2.27  % (4131947)CaDiCaL version: 2.1.3
% 8.96/2.27  % (4131947)Termination reason: Instruction limit
% 8.96/2.27  % (4131947)Termination phase: Saturation
% 8.96/2.27  % (4131947)Time elapsed: 0.113 s
% 8.96/2.27  % (4131947)Peak memory usage: 88 MB
% 8.96/2.27  % (4131947)Instructions burned: 129 (million)
% 8.96/2.27  % (4131946)Instruction limit reached! 
% 8.96/2.27  % (4131946)------------------------------
% 8.96/2.27  % (4131946)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.96/2.27  % (4131946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.96/2.27  % (4131946)CaDiCaL version: 2.1.3
% 8.96/2.27  % (4131946)Termination reason: Instruction limit
% 8.96/2.27  % (4131946)Termination phase: Saturation
% 8.96/2.27  % (4131946)Time elapsed: 0.158 s
% 8.96/2.27  % (4131946)Peak memory usage: 90 MB
% 8.96/2.27  % (4131946)Instructions burned: 140 (million)
% 8.96/2.27  % (4131960)lrs+10_1_sil=8000:sp=occurrence:random_seed=625980667:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 8.96/2.27  % (4131961)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3906115664:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 8.96/2.27  % (4131962)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2610081500:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 8.96/2.27  % (4131966)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=3441764946:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 8.96/2.27  % (4131961)Instruction limit reached! 
% 8.96/2.27  % (4131961)------------------------------
% 8.96/2.27  % (4131961)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.96/2.27  % (4131961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.96/2.27  % (4131961)CaDiCaL version: 2.1.3
% 8.96/2.27  % (4131961)Termination reason: Instruction limit
% 8.96/2.27  % (4131961)Termination phase: Saturation
% 8.96/2.27  % (4131961)Time elapsed: 0.159 s
% 8.96/2.27  % (4131961)Peak memory usage: 90 MB
% 8.96/2.27  % (4131961)Instructions burned: 157 (million)
% 8.96/2.27  % (4131960)Instruction limit reached! 
% 8.96/2.27  % (4131960)------------------------------
% 8.96/2.27  % (4131960)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.96/2.27  % (4131960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.96/2.27  % (4131960)CaDiCaL version: 2.1.3
% 8.96/2.27  % (4131960)Termination reason: Instruction limit
% 8.96/2.27  % (4131960)Termination phase: Saturation
% 8.96/2.27  % (4131960)Time elapsed: 0.227 s
% 8.96/2.27  % (4131960)Peak memory usage: 91 MB
% 8.96/2.27  % (4131960)Instructions burned: 285 (million)
% 8.96/2.27  % (4131966)Instruction limit reached! 
% 8.96/2.27  % (4131966)------------------------------
% 8.96/2.27  % (4131966)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.96/2.27  % (4131966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.96/2.27  % (4131966)CaDiCaL version: 2.1.3
% 8.96/2.27  % (4131966)Termination reason: Instruction limit
% 8.96/2.27  % (4131966)Termination phase: Saturation
% 8.96/2.27  % (4131966)Time elapsed: 0.260 s
% 8.96/2.27  % (4131966)Peak memory usage: 91 MB
% 8.96/2.27  % (4131966)Instructions burned: 248 (million)
% 8.96/2.27  % (4131977)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=86772091:i=2350_2992 on theBenchmark for (2992ds/2350Mi)
% 8.96/2.27  % (4131976)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2583578058:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2993 on theBenchmark for (2993ds/294Mi)
% 8.96/2.27  % (4131962)Instruction limit reached! 
% 8.96/2.27  % (4131962)------------------------------
% 8.96/2.27  % (4131962)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.96/2.27  % (4131962)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.96/2.27  % (4131962)CaDiCaL version: 2.1.3
% 8.96/2.27  % (4131962)Termination reason: Instruction limit
% 8.96/2.27  % (4131962)Termination phase: Saturation
% 8.96/2.27  % (4131962)Time elapsed: 0.367 s
% 8.96/2.27  % (4131962)Peak memory usage: 92 MB
% 8.96/2.27  % (4131962)Instructions burned: 325 (million)
% 8.96/2.27  % (4131980)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2943053585:cts=off:i=113:fsr=off:ss=included:sgt=4_2991 on theBenchmark for (2991ds/113Mi)
% 8.96/2.27  % (4131941)First to succeed.
% 8.96/2.27  % (4131941)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4131913"
% 8.96/2.27  % (4131983)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=3864227162:i=127:av=off:fsr=off:sup=off_2990 on theBenchmark for (2990ds/127Mi)
% 8.96/2.27  % (4131980)Instruction limit reached! 
% 8.96/2.27  % (4131980)------------------------------
% 8.96/2.27  % (4131980)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.96/2.27  % (4131980)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.96/2.27  % (4131980)CaDiCaL version: 2.1.3
% 8.96/2.27  % (4131980)Termination reason: Instruction limit
% 8.96/2.27  % (4131980)Termination phase: Saturation
% 8.96/2.27  % (4131980)Time elapsed: 0.071 s
% 8.96/2.27  % (4131980)Peak memory usage: 88 MB
% 8.96/2.27  % (4131980)Instructions burned: 114 (million)
% 8.96/2.27  % (4131942)Also succeeded, but the first one will report.
% 8.96/2.27  % (4131976)Instruction limit reached! 
% 8.96/2.27  % (4131976)------------------------------
% 8.96/2.27  % (4131976)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.96/2.27  % (4131976)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.96/2.27  % (4131976)CaDiCaL version: 2.1.3
% 8.96/2.27  % (4131976)Termination reason: Instruction limit
% 8.96/2.27  % (4131976)Termination phase: Saturation
% 8.96/2.27  % (4131976)Time elapsed: 0.233 s
% 8.96/2.27  % (4131976)Peak memory usage: 89 MB
% 8.96/2.27  % (4131976)Instructions burned: 294 (million)
% 8.96/2.27  % (4131983)Instruction limit reached! 
% 8.96/2.27  % (4131983)------------------------------
% 8.96/2.27  % (4131983)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.96/2.27  % (4131983)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.96/2.27  % (4131983)CaDiCaL version: 2.1.3
% 8.96/2.27  % (4131983)Termination reason: Instruction limit
% 8.96/2.27  % (4131983)Termination phase: Saturation
% 8.96/2.27  % (4131983)Time elapsed: 0.076 s
% 8.96/2.27  % (4131983)Peak memory usage: 89 MB
% 8.96/2.27  % (4131983)Instructions burned: 128 (million)
% 8.96/2.27  % (4131943)Also succeeded, but the first one will report.
% 8.96/2.27  % (4131987)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=995729087:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2989 on theBenchmark for (2989ds/114Mi)
% 8.96/2.27  % (4131988)lrs+10_1_sil=8000:sp=occurrence:random_seed=964603462:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2988 on theBenchmark for (2988ds/907Mi)
% 8.96/2.27  % (4131989)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=1102089667:i=437:sd=1:aac=none:ss=included_2988 on theBenchmark for (2988ds/437Mi)
% 8.96/2.27  % (4131987)Instruction limit reached! 
% 8.96/2.27  % (4131987)------------------------------
% 8.96/2.27  % (4131987)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.96/2.27  % (4131987)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.96/2.27  % (4131987)CaDiCaL version: 2.1.3
% 8.96/2.27  % (4131987)Termination reason: Instruction limit
% 8.96/2.27  % (4131987)Termination phase: Saturation
% 8.96/2.27  % (4131987)Time elapsed: 0.073 s
% 8.96/2.27  % (4131987)Peak memory usage: 89 MB
% 8.96/2.27  % (4131987)Instructions burned: 115 (million)
% 8.96/2.27  % (4131941)Refutation found. Thanks to Tanya!
% 8.96/2.27  % SZS status Theorem for theBenchmark
% 8.96/2.27  % SZS output start Proof for theBenchmark
% See solution above
% 9.93/2.46  % (4131941)------------------------------
% 9.93/2.46  % (4131941)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.93/2.46  % (4131941)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.93/2.46  % (4131941)CaDiCaL version: 2.1.3
% 9.93/2.46  % (4131941)Termination reason: Refutation
% 9.93/2.46  % (4131941)Time elapsed: 0.918 s
% 9.93/2.46  % (4131941)Peak memory usage: 129 MB
% 9.93/2.46  % (4131941)Instructions burned: 976 (million)
% 9.93/2.46  % (4131941)------------------------------
% 9.93/2.46  % (4131941)------------------------------
% 9.93/2.46  % (4131913)Success in time 1.315 s
% 9.93/2.46  % Vampire exiting
%------------------------------------------------------------------------------