↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n001.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:42:22 PM UTC 2026

% Result   : Theorem 9.79s 2.27s
% Output   : Refutation 10.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   20
% Syntax   : Number of formulae    :  114 (  39 unt;   7 def)
%            Number of atoms       :  375 (  81 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  412 ( 151   ~; 177   |;  68   &)
%                                         (  11 <=>;   5  =>;   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    :   20 (  20 usr;  10 con; 0-3 aty)
%            Number of variables   :  206 ( 192   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0,X1] :
      ( X1 = singleton(X0)
    <=> ! [X2] :
          ( in(X2,X1)
        <=> X2 = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).

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

fof(f6,axiom,
    ! [X0,X1,X2] :
      ( X2 = set_union2(X0,X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X0)
            | in(X3,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).

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

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

fof(f9,axiom,
    ! [X0,X1] :
      ( disjoint(X0,X1)
    <=> set_intersection2(X0,X1) = empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).

fof(f18,axiom,
    ! [X0,X1] :
      ( disjoint(X0,X1)
     => disjoint(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).

fof(f19,axiom,
    ! [X0,X1,X2] :
      ( ( subset(X0,X1)
        & subset(X1,X2) )
     => subset(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).

fof(f20,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
     => set_intersection2(X0,X1) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).

fof(f21,axiom,
    ! [X0,X1] : subset(set_difference(X0,X1),X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_xboole_1) ).

fof(f22,axiom,
    ! [X0,X1,X2] :
      ( ( subset(X0,X1)
        & disjoint(X1,X2) )
     => disjoint(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_xboole_1) ).

fof(f23,axiom,
    ! [X0,X1] : disjoint(set_difference(X0,X1),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t79_xboole_1) ).

fof(f24,conjecture,
    ! [X0,X1] : subset(powerset(set_difference(X0,X1)),set_union2(singleton(empty_set),set_difference(powerset(X0),powerset(X1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t84_zfmisc_1) ).

fof(f25,negated_conjecture,
    ~ ! [X0,X1] : subset(powerset(set_difference(X0,X1)),set_union2(singleton(empty_set),set_difference(powerset(X0),powerset(X1)))),
    inference(negated_conjecture,[status(cth)],[f24]) ).

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

fof(f33,plain,
    ! [X0,X1] :
      ( disjoint(X1,X0)
      | ~ disjoint(X0,X1) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f34,plain,
    ! [X0,X1,X2] :
      ( subset(X0,X2)
      | ~ subset(X0,X1)
      | ~ subset(X1,X2) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f35,plain,
    ! [X0,X1,X2] :
      ( subset(X0,X2)
      | ~ subset(X0,X1)
      | ~ subset(X1,X2) ),
    inference(flattening,[],[f34]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( set_intersection2(X0,X1) = X0
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f37,plain,
    ! [X0,X1,X2] :
      ( disjoint(X0,X2)
      | ~ subset(X0,X1)
      | ~ disjoint(X1,X2) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f38,plain,
    ! [X0,X1,X2] :
      ( disjoint(X0,X2)
      | ~ subset(X0,X1)
      | ~ disjoint(X1,X2) ),
    inference(flattening,[],[f37]) ).

fof(f39,plain,
    ? [X0,X1] : ~ subset(powerset(set_difference(X0,X1)),set_union2(singleton(empty_set),set_difference(powerset(X0),powerset(X1)))),
    inference(ennf_transformation,[],[f25]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( ( X1 = singleton(X0)
        | ? [X2] :
            ( ( X0 != X2
              | ~ in(X2,X1) )
            & ( X2 = X0
              | in(X2,X1) ) ) )
      & ( ! [X2] :
            ( ( in(X2,X1)
              | X0 != X2 )
            & ( X2 = X0
              | ~ in(X2,X1) ) )
        | singleton(X0) != X1 ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( ( X1 = singleton(X0)
        | ? [X2] :
            ( ( X0 != X2
              | ~ in(X2,X1) )
            & ( X2 = X0
              | in(X2,X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | X0 != X3 )
            & ( X0 = X3
              | ~ in(X3,X1) ) )
        | singleton(X0) != X1 ) ),
    inference(rectify,[],[f40]) ).

fof(f42,plain,
    ! [X0,X1] :
      ( ( X1 = singleton(X0)
        | ( ( sK0(X0,X1) != X0
            | ~ in(sK0(X0,X1),X1) )
          & ( sK0(X0,X1) = X0
            | in(sK0(X0,X1),X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | X0 != X3 )
            & ( X0 = X3
              | ~ in(X3,X1) ) )
        | singleton(X0) != X1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f41]) ).

fof(f43,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,[],[f5]) ).

fof(f44,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,[],[f43]) ).

fof(f45,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))],[f44]) ).

fof(f46,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_union2(X0,X1)
        | ? [X3] :
            ( ( ( ~ in(X3,X0)
                & ~ in(X3,X1) )
              | ~ in(X3,X2) )
            & ( in(X3,X0)
              | in(X3,X1)
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( ~ in(X3,X0)
                & ~ in(X3,X1) ) )
            & ( in(X3,X0)
              | in(X3,X1)
              | ~ in(X3,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f6]) ).

fof(f47,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_union2(X0,X1)
        | ? [X3] :
            ( ( ( ~ in(X3,X0)
                & ~ in(X3,X1) )
              | ~ in(X3,X2) )
            & ( in(X3,X0)
              | in(X3,X1)
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( ~ in(X3,X0)
                & ~ in(X3,X1) ) )
            & ( in(X3,X0)
              | in(X3,X1)
              | ~ in(X3,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(flattening,[],[f46]) ).

fof(f48,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_union2(X0,X1)
        | ? [X3] :
            ( ( ( ~ in(X3,X0)
                & ~ in(X3,X1) )
              | ~ in(X3,X2) )
            & ( in(X3,X0)
              | in(X3,X1)
              | in(X3,X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ( ~ in(X4,X0)
                & ~ in(X4,X1) ) )
            & ( in(X4,X0)
              | in(X4,X1)
              | ~ in(X4,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(rectify,[],[f47]) ).

fof(f49,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_union2(X0,X1)
        | ( ( ( ~ in(sK2(X0,X1,X2),X0)
              & ~ in(sK2(X0,X1,X2),X1) )
            | ~ in(sK2(X0,X1,X2),X2) )
          & ( in(sK2(X0,X1,X2),X0)
            | in(sK2(X0,X1,X2),X1)
            | in(sK2(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ( ~ in(X4,X0)
                & ~ in(X4,X1) ) )
            & ( in(X4,X0)
              | in(X4,X1)
              | ~ in(X4,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f48]) ).

fof(f50,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,[],[f30]) ).

fof(f51,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,[],[f50]) ).

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

fof(f53,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_difference(X0,X1)
        | ? [X3] :
            ( ( ~ in(X3,X0)
              | in(X3,X1)
              | ~ in(X3,X2) )
            & ( ( in(X3,X0)
                & ~ in(X3,X1) )
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ~ in(X3,X0)
              | in(X3,X1) )
            & ( ( in(X3,X0)
                & ~ in(X3,X1) )
              | ~ in(X3,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f8]) ).

fof(f54,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_difference(X0,X1)
        | ? [X3] :
            ( ( ~ in(X3,X0)
              | in(X3,X1)
              | ~ in(X3,X2) )
            & ( ( in(X3,X0)
                & ~ in(X3,X1) )
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ~ in(X3,X0)
              | in(X3,X1) )
            & ( ( in(X3,X0)
                & ~ in(X3,X1) )
              | ~ in(X3,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(flattening,[],[f53]) ).

fof(f55,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_difference(X0,X1)
        | ? [X3] :
            ( ( ~ in(X3,X0)
              | in(X3,X1)
              | ~ in(X3,X2) )
            & ( ( in(X3,X0)
                & ~ in(X3,X1) )
              | in(X3,X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ~ in(X4,X0)
              | in(X4,X1) )
            & ( ( in(X4,X0)
                & ~ in(X4,X1) )
              | ~ in(X4,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(rectify,[],[f54]) ).

fof(f56,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_difference(X0,X1)
        | ( ( ~ in(sK4(X0,X1,X2),X0)
            | in(sK4(X0,X1,X2),X1)
            | ~ in(sK4(X0,X1,X2),X2) )
          & ( ( in(sK4(X0,X1,X2),X0)
              & ~ in(sK4(X0,X1,X2),X1) )
            | in(sK4(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ~ in(X4,X0)
              | in(X4,X1) )
            & ( ( in(X4,X0)
                & ~ in(X4,X1) )
              | ~ in(X4,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X0,X1,X2))],[f55]) ).

fof(f57,plain,
    ! [X0,X1] :
      ( ( disjoint(X0,X1)
        | set_intersection2(X0,X1) != empty_set )
      & ( set_intersection2(X0,X1) = empty_set
        | ~ disjoint(X0,X1) ) ),
    inference(nnf_transformation,[],[f9]) ).

fof(f60,plain,
    ~ subset(powerset(set_difference(sK7,sK8)),set_union2(singleton(empty_set),set_difference(powerset(sK7),powerset(sK8)))),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X0,sK7),skolemize(X1,sK8)],[f39]) ).

fof(f65,plain,
    ! [X3,X0,X1] :
      ( in(X3,X1)
      | X0 != X3
      | singleton(X0) != X1 ),
    inference(cnf_transformation,[],[f42]) ).

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

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

fof(f73,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | ~ in(X4,X1)
      | set_union2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f49]) ).

fof(f74,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | ~ in(X4,X0)
      | set_union2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f49]) ).

fof(f79,plain,
    ! [X0,X1] :
      ( in(sK3(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f52]) ).

fof(f80,plain,
    ! [X0,X1] :
      ( ~ in(sK3(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f52]) ).

fof(f83,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | ~ in(X4,X0)
      | in(X4,X1)
      | set_difference(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f56]) ).

fof(f87,plain,
    ! [X0,X1] :
      ( ~ disjoint(X0,X1)
      | set_intersection2(X0,X1) = empty_set ),
    inference(cnf_transformation,[],[f57]) ).

fof(f88,plain,
    ! [X0,X1] :
      ( set_intersection2(X0,X1) != empty_set
      | disjoint(X0,X1) ),
    inference(cnf_transformation,[],[f57]) ).

fof(f97,plain,
    ! [X0,X1] :
      ( ~ disjoint(X0,X1)
      | disjoint(X1,X0) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f98,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X1,X2)
      | ~ subset(X0,X1)
      | subset(X0,X2) ),
    inference(cnf_transformation,[],[f35]) ).

fof(f99,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | set_intersection2(X0,X1) = X0 ),
    inference(cnf_transformation,[],[f36]) ).

fof(f100,plain,
    ! [X0,X1] : subset(set_difference(X0,X1),X0),
    inference(cnf_transformation,[],[f21]) ).

fof(f101,plain,
    ! [X2,X0,X1] :
      ( ~ disjoint(X1,X2)
      | ~ subset(X0,X1)
      | disjoint(X0,X2) ),
    inference(cnf_transformation,[],[f38]) ).

fof(f102,plain,
    ! [X0,X1] : disjoint(set_difference(X0,X1),X1),
    inference(cnf_transformation,[],[f23]) ).

fof(f103,plain,
    ~ subset(powerset(set_difference(sK7,sK8)),set_union2(singleton(empty_set),set_difference(powerset(sK7),powerset(sK8)))),
    inference(cnf_transformation,[],[f60]) ).

fof(f104,plain,
    ! [X3,X1] :
      ( in(X3,X1)
      | singleton(X3) != X1 ),
    inference(equality_resolution,[],[f65]) ).

fof(f105,plain,
    ! [X3] : in(X3,singleton(X3)),
    inference(equality_resolution,[],[f104]) ).

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

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

fof(f109,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_union2(X0,X1))
      | ~ in(X4,X0) ),
    inference(equality_resolution,[],[f74]) ).

fof(f110,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_union2(X0,X1))
      | ~ in(X4,X1) ),
    inference(equality_resolution,[],[f73]) ).

fof(f112,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_difference(X0,X1))
      | ~ in(X4,X0)
      | in(X4,X1) ),
    inference(equality_resolution,[],[f83]) ).

fof(f115,definition,
    sF9 = set_difference(sK7,sK8),
    introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).

fof(f116,plain,
    set_difference(sK7,sK8) = sF9,
    inference(reorient_equations,[],[f115]) ).

fof(f117,definition,
    sF10 = powerset(sF9),
    introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).

fof(f118,plain,
    powerset(sF9) = sF10,
    inference(reorient_equations,[],[f117]) ).

fof(f119,definition,
    sF11 = singleton(empty_set),
    introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).

fof(f120,plain,
    singleton(empty_set) = sF11,
    inference(reorient_equations,[],[f119]) ).

fof(f121,definition,
    sF12 = powerset(sK7),
    introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).

fof(f122,plain,
    powerset(sK7) = sF12,
    inference(reorient_equations,[],[f121]) ).

fof(f123,definition,
    sF13 = powerset(sK8),
    introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).

fof(f124,plain,
    powerset(sK8) = sF13,
    inference(reorient_equations,[],[f123]) ).

fof(f125,definition,
    sF14 = set_difference(sF12,sF13),
    introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).

fof(f126,plain,
    set_difference(sF12,sF13) = sF14,
    inference(reorient_equations,[],[f125]) ).

fof(f127,definition,
    sF15 = set_union2(sF11,sF14),
    introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).

fof(f128,plain,
    set_union2(sF11,sF14) = sF15,
    inference(reorient_equations,[],[f127]) ).

fof(f129,plain,
    ~ subset(sF10,sF15),
    inference(definition_folding,[],[f103,f128,f126,f124,f122,f120,f118,f116]) ).

fof(f134,plain,
    ! [X0] :
      ( ~ in(X0,sF10)
      | subset(X0,sF9) ),
    inference(superposition,[],[f108,f118]) ).

fof(f135,plain,
    ! [X0] :
      ( ~ in(X0,sF13)
      | subset(X0,sK8) ),
    inference(superposition,[],[f108,f124]) ).

fof(f152,plain,
    ! [X0] :
      ( ~ in(X0,sF14)
      | in(X0,sF15) ),
    inference(superposition,[],[f110,f128]) ).

fof(f156,plain,
    ! [X0] :
      ( ~ in(X0,sF12)
      | in(X0,sF14)
      | in(X0,sF13) ),
    inference(superposition,[],[f112,f126]) ).

fof(f162,plain,
    ! [X0] :
      ( ~ subset(X0,sK7)
      | in(X0,sF12) ),
    inference(superposition,[],[f107,f122]) ).

fof(f167,plain,
    ! [X0] :
      ( ~ in(X0,sF11)
      | in(X0,sF15) ),
    inference(superposition,[],[f109,f128]) ).

fof(f173,plain,
    in(empty_set,sF11),
    inference(superposition,[],[f105,f120]) ).

fof(f200,plain,
    ! [X0] :
      ( subset(sK3(sF10,X0),sF9)
      | subset(sF10,X0) ),
    inference(resolution,[],[f134,f79]) ).

fof(f208,plain,
    in(empty_set,sF15),
    inference(resolution,[],[f173,f167]) ).

fof(f210,plain,
    disjoint(sF9,sK8),
    inference(superposition,[],[f102,f116]) ).

fof(f215,plain,
    subset(sF9,sK7),
    inference(superposition,[],[f100,f116]) ).

fof(f264,plain,
    ! [X0] :
      ( ~ subset(X0,sF9)
      | subset(X0,sK7) ),
    inference(resolution,[],[f98,f215]) ).

fof(f277,plain,
    ! [X0] :
      ( subset(sK3(sF10,X0),sK7)
      | subset(sF10,X0) ),
    inference(resolution,[],[f264,f200]) ).

fof(f278,plain,
    ! [X0] :
      ( in(sK3(sF10,X0),sF12)
      | subset(sF10,X0) ),
    inference(resolution,[],[f277,f162]) ).

fof(f283,plain,
    ! [X0] :
      ( in(sK3(sF10,X0),sF14)
      | subset(sF10,X0)
      | in(sK3(sF10,X0),sF13) ),
    inference(resolution,[],[f278,f156]) ).

fof(f288,plain,
    ! [X0] :
      ( in(sK3(sF10,X0),sF15)
      | in(sK3(sF10,X0),sF13)
      | subset(sF10,X0) ),
    inference(resolution,[],[f283,f152]) ).

fof(f299,plain,
    ( in(sK3(sF10,sF15),sF13)
    | subset(sF10,sF15)
    | subset(sF10,sF15) ),
    inference(resolution,[],[f288,f80]) ).

fof(f301,plain,
    ( in(sK3(sF10,sF15),sF13)
    | subset(sF10,sF15) ),
    inference(duplicate_literal_removal,[],[f299]) ).

fof(f302,plain,
    in(sK3(sF10,sF15),sF13),
    inference(forward_subsumption_resolution,[],[f301,f129]) ).

fof(f303,plain,
    subset(sK3(sF10,sF15),sK8),
    inference(resolution,[],[f302,f135]) ).

fof(f586,plain,
    ! [X0] :
      ( ~ subset(X0,sF9)
      | disjoint(X0,sK8) ),
    inference(resolution,[],[f101,f210]) ).

fof(f593,plain,
    ! [X0] :
      ( disjoint(sK3(sF10,X0),sK8)
      | subset(sF10,X0) ),
    inference(resolution,[],[f586,f200]) ).

fof(f596,plain,
    ! [X0] :
      ( disjoint(sK8,sK3(sF10,X0))
      | subset(sF10,X0) ),
    inference(resolution,[],[f593,f97]) ).

fof(f598,plain,
    ! [X0] :
      ( subset(sF10,X0)
      | empty_set = set_intersection2(sK8,sK3(sF10,X0)) ),
    inference(resolution,[],[f596,f87]) ).

fof(f779,plain,
    empty_set = set_intersection2(sK8,sK3(sF10,sF15)),
    inference(resolution,[],[f598,f129]) ).

fof(f1409,plain,
    ( empty_set != empty_set
    | disjoint(sK8,sK3(sF10,sF15)) ),
    inference(superposition,[],[f88,f779]) ).

fof(f1416,plain,
    disjoint(sK8,sK3(sF10,sF15)),
    inference(trivial_inequality_removal,[],[f1409]) ).

fof(f1423,plain,
    disjoint(sK3(sF10,sF15),sK8),
    inference(resolution,[],[f1416,f97]) ).

fof(f1425,plain,
    empty_set = set_intersection2(sK3(sF10,sF15),sK8),
    inference(resolution,[],[f1423,f87]) ).

fof(f2987,plain,
    sK3(sF10,sF15) = set_intersection2(sK3(sF10,sF15),sK8),
    inference(resolution,[],[f99,f303]) ).

fof(f3003,plain,
    empty_set = sK3(sF10,sF15),
    inference(forward_demodulation,[],[f2987,f1425]) ).

fof(f3085,plain,
    ( ~ in(empty_set,sF15)
    | subset(sF10,sF15) ),
    inference(superposition,[],[f80,f3003]) ).

fof(f3087,plain,
    subset(sF10,sF15),
    inference(forward_subsumption_resolution,[],[f3085,f208]) ).

fof(f3111,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f3087,f129]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET937+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40  % Computer : n001.cluster.edu
% 0.11/0.40  % Model    : x86_64 x86_64
% 0.11/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40  % Memory   : 8046.5625MB
% 0.11/0.40  % OS       : Linux 6.8.0-71-generic
% 0.11/0.40  % CPULimit : 300
% 0.11/0.40  % WCLimit  : 300
% 0.11/0.40  % DateTime : Mon Sep 28 03:21:09 UTC 2026
% 0.11/0.40  % CPUTime  : 
% 0.11/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43  Running first-order theorem proving
% 0.11/0.43  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.79/2.26  % (4176492)Detected formulas, will run a generic FOF schedule.
% 9.79/2.26  % (4176502)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3494919788:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 9.79/2.26  % (4176503)dis-21_1_sil=8000:lcm=predicate:random_seed=895632527: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)
% 9.79/2.26  % (4176500)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=485633513:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 9.79/2.26  % (4176497)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=2506245474:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 9.79/2.26  % (4176499)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=1981518133:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 9.79/2.26  % (4176498)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=2482514190:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 9.79/2.26  % (4176501)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=926079294:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 9.79/2.26  % (4176500)Refutation not found, incomplete strategy
% 9.79/2.26  % (4176500)------------------------------
% 9.79/2.26  % (4176500)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.26  % (4176500)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.26  % (4176500)CaDiCaL version: 2.1.3
% 9.79/2.26  % (4176500)Termination reason: Refutation not found, incomplete strategy
% 9.79/2.26  % (4176500)Time elapsed: 0.002 s
% 9.79/2.26  % (4176500)Peak memory usage: 88 MB
% 9.79/2.26  % (4176500)Instructions burned: 2 (million)
% 9.79/2.26  % (4176502)Instruction limit reached! 
% 9.79/2.26  % (4176502)------------------------------
% 9.79/2.26  % (4176502)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.26  % (4176502)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.26  % (4176502)CaDiCaL version: 2.1.3
% 9.79/2.26  % (4176502)Termination reason: Instruction limit
% 9.79/2.26  % (4176502)Termination phase: Saturation
% 9.79/2.26  % (4176502)Time elapsed: 0.051 s
% 9.79/2.26  % (4176502)Peak memory usage: 89 MB
% 9.79/2.26  % (4176502)Instructions burned: 141 (million)
% 9.79/2.26  % (4176501)Instruction limit reached! 
% 9.79/2.26  % (4176501)------------------------------
% 9.79/2.26  % (4176501)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.26  % (4176501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.26  % (4176501)CaDiCaL version: 2.1.3
% 9.79/2.26  % (4176501)Termination reason: Instruction limit
% 9.79/2.26  % (4176501)Termination phase: Saturation
% 9.79/2.26  % (4176501)Time elapsed: 0.070 s
% 9.79/2.26  % (4176501)Peak memory usage: 88 MB
% 9.79/2.26  % (4176501)Instructions burned: 119 (million)
% 9.79/2.26  % (4176503)Instruction limit reached! 
% 9.79/2.26  % (4176503)------------------------------
% 9.79/2.26  % (4176503)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.26  % (4176503)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.26  % (4176503)CaDiCaL version: 2.1.3
% 9.79/2.26  % (4176503)Termination reason: Instruction limit
% 9.79/2.26  % (4176503)Termination phase: Saturation
% 9.79/2.26  % (4176503)Time elapsed: 0.084 s
% 9.79/2.26  % (4176503)Peak memory usage: 89 MB
% 9.79/2.26  % (4176503)Instructions burned: 129 (million)
% 9.79/2.26  % (4176511)lrs+10_1_sil=8000:sp=occurrence:random_seed=3535153282:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 9.79/2.26  % (4176511)Instruction limit reached! 
% 9.79/2.26  % (4176511)------------------------------
% 9.79/2.26  % (4176511)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.26  % (4176511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.26  % (4176511)CaDiCaL version: 2.1.3
% 9.79/2.26  % (4176511)Termination reason: Instruction limit
% 9.79/2.26  % (4176511)Termination phase: Saturation
% 9.79/2.26  % (4176511)Time elapsed: 0.096 s
% 9.79/2.26  % (4176511)Peak memory usage: 92 MB
% 9.79/2.26  % (4176511)Instructions burned: 287 (million)
% 9.79/2.26  % (4176512)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4084452584:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 9.79/2.26  % (4176513)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3520092487:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 9.79/2.26  % (4176500)------------------------------
% 9.79/2.26  % (4176500)------------------------------
% 9.79/2.26  % (4176515)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=1730975378:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 9.79/2.26  % (4176512)Instruction limit reached! 
% 9.79/2.26  % (4176512)------------------------------
% 9.79/2.26  % (4176512)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.26  % (4176512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.26  % (4176512)CaDiCaL version: 2.1.3
% 9.79/2.26  % (4176512)Termination reason: Instruction limit
% 9.79/2.26  % (4176512)Termination phase: Saturation
% 9.79/2.26  % (4176512)Time elapsed: 0.089 s
% 9.79/2.26  % (4176512)Peak memory usage: 90 MB
% 9.79/2.26  % (4176512)Instructions burned: 157 (million)
% 9.79/2.26  % (4176515)Instruction limit reached! 
% 9.79/2.26  % (4176515)------------------------------
% 9.79/2.26  % (4176515)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.26  % (4176515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.26  % (4176515)CaDiCaL version: 2.1.3
% 9.79/2.26  % (4176515)Termination reason: Instruction limit
% 9.79/2.26  % (4176515)Termination phase: Saturation
% 9.79/2.26  % (4176515)Time elapsed: 0.073 s
% 9.79/2.26  % (4176515)Peak memory usage: 91 MB
% 9.79/2.26  % (4176515)Instructions burned: 251 (million)
% 9.79/2.26  % (4176518)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3282013940:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 9.79/2.26  % (4176520)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2804137820:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 9.79/2.26  % (4176513)Instruction limit reached! 
% 9.79/2.26  % (4176513)------------------------------
% 9.79/2.26  % (4176513)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.26  % (4176513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.26  % (4176513)CaDiCaL version: 2.1.3
% 9.79/2.26  % (4176513)Termination reason: Instruction limit
% 9.79/2.26  % (4176513)Termination phase: Saturation
% 9.79/2.26  % (4176513)Time elapsed: 0.211 s
% 9.79/2.26  % (4176513)Peak memory usage: 91 MB
% 9.79/2.26  % (4176513)Instructions burned: 325 (million)
% 9.79/2.26  % (4176521)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=179127187:cts=off:i=113:fsr=off:ss=included:sgt=4_2995 on theBenchmark for (2995ds/113Mi)
% 9.79/2.26  % (4176521)Instruction limit reached! 
% 9.79/2.26  % (4176521)------------------------------
% 9.79/2.26  % (4176521)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.26  % (4176521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.26  % (4176521)CaDiCaL version: 2.1.3
% 9.79/2.26  % (4176521)Termination reason: Instruction limit
% 9.79/2.26  % (4176521)Termination phase: Saturation
% 9.79/2.26  % (4176521)Time elapsed: 0.039 s
% 9.79/2.26  % (4176521)Peak memory usage: 89 MB
% 9.79/2.27  % (4176521)Instructions burned: 115 (million)
% 9.79/2.27  % (4176524)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=3581651530:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 9.79/2.27  % (4176526)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=1292801519:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2993 on theBenchmark for (2993ds/114Mi)
% 9.79/2.27  % (4176518)Instruction limit reached! 
% 9.79/2.27  % (4176518)------------------------------
% 9.79/2.27  % (4176518)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.27  % (4176518)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.27  % (4176518)CaDiCaL version: 2.1.3
% 9.79/2.27  % (4176518)Termination reason: Instruction limit
% 9.79/2.27  % (4176518)Termination phase: Saturation
% 9.79/2.27  % (4176518)Time elapsed: 0.176 s
% 9.79/2.27  % (4176518)Peak memory usage: 88 MB
% 9.79/2.27  % (4176518)Instructions burned: 294 (million)
% 9.79/2.27  % (4176526)Instruction limit reached! 
% 9.79/2.27  % (4176526)------------------------------
% 9.79/2.27  % (4176526)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.27  % (4176526)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.27  % (4176526)CaDiCaL version: 2.1.3
% 9.79/2.27  % (4176526)Termination reason: Instruction limit
% 9.79/2.27  % (4176526)Termination phase: Saturation
% 9.79/2.27  % (4176526)Time elapsed: 0.032 s
% 9.79/2.27  % (4176526)Peak memory usage: 88 MB
% 9.79/2.27  % (4176526)Instructions burned: 114 (million)
% 9.79/2.27  % (4176524)Instruction limit reached! 
% 9.79/2.27  % (4176524)------------------------------
% 9.79/2.27  % (4176524)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.27  % (4176524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.27  % (4176524)CaDiCaL version: 2.1.3
% 9.79/2.27  % (4176524)Termination reason: Instruction limit
% 9.79/2.27  % (4176524)Termination phase: Saturation
% 9.79/2.27  % (4176524)Time elapsed: 0.058 s
% 9.79/2.27  % (4176524)Peak memory usage: 88 MB
% 9.79/2.27  % (4176524)Instructions burned: 127 (million)
% 9.79/2.27  % (4176530)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=543990959:i=437:sd=1:aac=none:ss=included_2992 on theBenchmark for (2992ds/437Mi)
% 9.79/2.27  % (4176529)lrs+10_1_sil=8000:sp=occurrence:random_seed=2165626913:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2992 on theBenchmark for (2992ds/907Mi)
% 9.79/2.27  % (4176531)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1630043368:i=5202:ss=axioms:sgt=16_2992 on theBenchmark for (2992ds/5202Mi)
% 9.79/2.27  % (4176530)Instruction limit reached! 
% 9.79/2.27  % (4176530)------------------------------
% 9.79/2.27  % (4176530)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.27  % (4176530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.27  % (4176530)CaDiCaL version: 2.1.3
% 9.79/2.27  % (4176530)Termination reason: Instruction limit
% 9.79/2.27  % (4176530)Termination phase: Saturation
% 9.79/2.27  % (4176530)Time elapsed: 0.119 s
% 9.79/2.27  % (4176530)Peak memory usage: 90 MB
% 9.79/2.27  % (4176530)Instructions burned: 439 (million)
% 9.79/2.27  % (4176535)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=1556323435:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2990 on theBenchmark for (2990ds/134Mi)
% 9.79/2.27  % (4176535)Instruction limit reached! 
% 9.79/2.27  % (4176535)------------------------------
% 9.79/2.27  % (4176535)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.27  % (4176535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.27  % (4176535)CaDiCaL version: 2.1.3
% 9.79/2.27  % (4176535)Termination reason: Instruction limit
% 9.79/2.27  % (4176535)Termination phase: Saturation
% 9.79/2.27  % (4176535)Time elapsed: 0.043 s
% 9.79/2.27  % (4176535)Peak memory usage: 90 MB
% 9.79/2.27  % (4176535)Instructions burned: 137 (million)
% 9.79/2.27  % (4176497)First to succeed.
% 9.79/2.27  % (4176497)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4176492"
% 9.79/2.27  % (4176537)lrs+1002_8_sil=8000:sp=occurrence:sos=on:sac=on:random_seed=3290800057:st=8:i=592:sd=3:ep=RST:ss=axioms_2989 on theBenchmark for (2989ds/592Mi)
% 9.79/2.27  % (4176520)Also succeeded, but the first one will report.
% 9.79/2.27  % (4176529)Instruction limit reached! 
% 9.79/2.27  % (4176529)------------------------------
% 9.79/2.27  % (4176529)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.79/2.27  % (4176529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/2.27  % (4176529)CaDiCaL version: 2.1.3
% 9.79/2.27  % (4176529)Termination reason: Instruction limit
% 9.79/2.27  % (4176529)Termination phase: Saturation
% 9.79/2.27  % (4176529)Time elapsed: 0.532 s
% 9.79/2.27  % (4176529)Peak memory usage: 97 MB
% 9.79/2.27  % (4176529)Instructions burned: 909 (million)
% 9.79/2.27  % (4176497)Refutation found. Thanks to Tanya!
% 9.79/2.27  % SZS status Theorem for theBenchmark
% 9.79/2.27  % SZS output start Proof for theBenchmark
% See solution above
% 10.42/2.46  % (4176497)------------------------------
% 10.42/2.46  % (4176497)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.42/2.46  % (4176497)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.42/2.46  % (4176497)CaDiCaL version: 2.1.3
% 10.42/2.46  % (4176497)Termination reason: Refutation
% 10.42/2.46  % (4176497)Time elapsed: 0.981 s
% 10.42/2.46  % (4176497)Peak memory usage: 133 MB
% 10.42/2.46  % (4176497)Instructions burned: 1432 (million)
% 10.42/2.46  % (4176497)------------------------------
% 10.42/2.46  % (4176497)------------------------------
% 10.42/2.46  % (4176492)Success in time 1.391 s
% 10.42/2.46  % Vampire exiting
%------------------------------------------------------------------------------