↑ Up

Vampire---5.0.1.THM-Ref.s

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

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

% Result   : Theorem 2.99s 6.08s
% Output   : Refutation 3.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   88 (  12 unt;   7 def)
%            Number of atoms       :  311 (  36 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  361 ( 138   ~; 155   |;  53   &)
%                                         (  14 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   7 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :  127 (   0 sgn 117   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ( subset(X0,X1)
        & subset(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_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_intersection2(X0,X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X0)
            & in(X3,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).

fof(f9,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(f44,conjecture,
    ! [X0,X1] : set_difference(X0,set_difference(X0,X1)) = set_intersection2(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_xboole_1) ).

fof(f45,negated_conjecture,
    ~ ! [X0,X1] : set_difference(X0,set_difference(X0,X1)) = set_intersection2(X0,X1),
    inference(negated_conjecture,[status(cth)],[f44]) ).

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

fof(f75,plain,
    ? [X0,X1] : set_intersection2(X0,X1) != set_difference(X0,set_difference(X0,X1)),
    inference(ennf_transformation,[],[f45]) ).

fof(f82,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X0,X1)
        | ~ subset(X1,X0) )
      & ( ( subset(X0,X1)
          & subset(X1,X0) )
        | X0 != X1 ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f83,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X0,X1)
        | ~ subset(X1,X0) )
      & ( ( subset(X0,X1)
          & subset(X1,X0) )
        | X0 != X1 ) ),
    inference(flattening,[],[f82]) ).

fof(f91,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,[],[f59]) ).

fof(f92,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,[],[f91]) ).

fof(f93,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))],[f92]) ).

fof(f94,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f8]) ).

fof(f95,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
    inference(flattening,[],[f94]) ).

fof(f96,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
    inference(rectify,[],[f95]) ).

fof(f97,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_intersection2(X0,X1)
        | ( ( ~ in(sK3(X0,X1,X2),X0)
            | ~ in(sK3(X0,X1,X2),X1)
            | ~ in(sK3(X0,X1,X2),X2) )
          & ( ( in(sK3(X0,X1,X2),X0)
              & in(sK3(X0,X1,X2),X1) )
            | in(sK3(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ~ in(X4,X0)
              | ~ in(X4,X1) )
            & ( ( in(X4,X0)
                & in(X4,X1) )
              | ~ in(X4,X2) ) )
        | set_intersection2(X0,X1) != X2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f96]) ).

fof(f98,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,[],[f9]) ).

fof(f99,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,[],[f98]) ).

fof(f100,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,[],[f99]) ).

fof(f101,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))],[f100]) ).

fof(f110,plain,
    set_intersection2(sK9,sK10) != set_difference(sK9,set_difference(sK9,sK10)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X0,sK9),skolemize(X1,sK10)],[f75]) ).

fof(f117,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ subset(X0,X1)
      | ~ subset(X1,X0) ),
    inference(cnf_transformation,[],[f83]) ).

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

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

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

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

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

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

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

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

fof(f177,plain,
    set_intersection2(sK9,sK10) != set_difference(sK9,set_difference(sK9,sK10)),
    inference(cnf_transformation,[],[f110]) ).

fof(f192,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_intersection2(X0,X1))
      | ~ in(X4,X0)
      | ~ in(X4,X1) ),
    inference(equality_resolution,[],[f131]) ).

fof(f193,plain,
    ! [X0,X1,X4] :
      ( ~ in(X4,set_intersection2(X0,X1))
      | in(X4,X0) ),
    inference(equality_resolution,[],[f130]) ).

fof(f194,plain,
    ! [X0,X1,X4] :
      ( ~ in(X4,set_intersection2(X0,X1))
      | in(X4,X1) ),
    inference(equality_resolution,[],[f129]) ).

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

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

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

fof(f198,definition,
    ! [X0,X1] :
      ( sQ12_eqProxy(X0,X1)
    <=> X0 = X1 ),
    introduced(definition,[new_symbols(definition,[sQ12_eqProxy])],[equality_proxy_definition]) ).

fof(f201,plain,
    ! [X0,X1] :
      ( sQ12_eqProxy(X0,X1)
      | ~ subset(X0,X1)
      | ~ subset(X1,X0) ),
    inference(equality_proxy_replacement,[],[f117,f198]) ).

fof(f231,plain,
    ~ sQ12_eqProxy(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),
    inference(equality_proxy_replacement,[],[f177,f198]) ).

fof(f332,plain,
    ( ~ subset(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10)))
    | ~ subset(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)) ),
    inference(resolution,[],[f201,f231]) ).

fof(f338,definition,
    ( spl13_6
  <=> subset(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))) ),
    introduced(definition,[new_symbols(definition,[spl13_6])],[avatar_definition]) ).

fof(f339,plain,
    ( ~ subset(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10)))
    | spl13_6 ),
    inference(avatar_component_clause,[],[f338]) ).

fof(f341,definition,
    ( spl13_7
  <=> subset(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)) ),
    introduced(definition,[new_symbols(definition,[spl13_7])],[avatar_definition]) ).

fof(f342,plain,
    ( ~ subset(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10))
    | spl13_7 ),
    inference(avatar_component_clause,[],[f341]) ).

fof(f344,plain,
    ( ~ spl13_7
    | ~ spl13_6 ),
    inference(avatar_split_clause,[],[f332,f338,f341]) ).

fof(f1210,plain,
    ( ~ in(sK2(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)),set_intersection2(sK9,sK10))
    | spl13_7 ),
    inference(resolution,[],[f342,f128]) ).

fof(f1211,plain,
    ( in(sK2(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)),set_difference(sK9,set_difference(sK9,sK10)))
    | spl13_7 ),
    inference(resolution,[],[f342,f127]) ).

fof(f1244,plain,
    ( ~ in(sK2(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)),set_difference(sK9,sK10))
    | spl13_7 ),
    inference(resolution,[],[f1211,f197]) ).

fof(f1245,plain,
    ( in(sK2(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)),sK9)
    | spl13_7 ),
    inference(resolution,[],[f1211,f196]) ).

fof(f1575,plain,
    ( ~ in(sK2(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)),sK9)
    | ~ in(sK2(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)),sK10)
    | spl13_7 ),
    inference(resolution,[],[f192,f1210]) ).

fof(f1586,definition,
    ( spl13_21
  <=> in(sK2(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)),sK10) ),
    introduced(definition,[new_symbols(definition,[spl13_21])],[avatar_definition]) ).

fof(f1589,definition,
    ( spl13_22
  <=> in(sK2(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)),sK9) ),
    introduced(definition,[new_symbols(definition,[spl13_22])],[avatar_definition]) ).

fof(f1590,plain,
    ( ~ in(sK2(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)),sK9)
    | spl13_22 ),
    inference(avatar_component_clause,[],[f1589]) ).

fof(f1591,plain,
    ( ~ spl13_21
    | ~ spl13_22
    | spl13_7 ),
    inference(avatar_split_clause,[],[f1575,f341,f1589,f1586]) ).

fof(f1592,plain,
    ( $false
    | spl13_7
    | spl13_22 ),
    inference(resolution,[],[f1590,f1245]) ).

fof(f1593,plain,
    ( spl13_7
    | spl13_22 ),
    inference(avatar_contradiction_clause,[],[f1592]) ).

fof(f1754,plain,
    ( ~ in(sK2(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)),sK9)
    | in(sK2(set_difference(sK9,set_difference(sK9,sK10)),set_intersection2(sK9,sK10)),sK10)
    | spl13_7 ),
    inference(resolution,[],[f195,f1244]) ).

fof(f1765,plain,
    ( spl13_21
    | ~ spl13_22
    | spl13_7 ),
    inference(avatar_split_clause,[],[f1754,f341,f1589,f1586]) ).

fof(f1767,plain,
    ( ~ in(sK2(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,set_difference(sK9,sK10)))
    | spl13_6 ),
    inference(resolution,[],[f339,f128]) ).

fof(f1768,plain,
    ( in(sK2(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),set_intersection2(sK9,sK10))
    | spl13_6 ),
    inference(resolution,[],[f339,f127]) ).

fof(f1784,plain,
    ( in(sK2(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),sK10)
    | spl13_6 ),
    inference(resolution,[],[f1768,f194]) ).

fof(f1785,plain,
    ( in(sK2(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),sK9)
    | spl13_6 ),
    inference(resolution,[],[f1768,f193]) ).

fof(f1788,plain,
    ( ~ in(sK2(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),sK9)
    | in(sK2(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,sK10))
    | spl13_6 ),
    inference(resolution,[],[f1767,f195]) ).

fof(f1790,definition,
    ( spl13_25
  <=> in(sK2(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,sK10)) ),
    introduced(definition,[new_symbols(definition,[spl13_25])],[avatar_definition]) ).

fof(f1791,plain,
    ( in(sK2(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),set_difference(sK9,sK10))
    | ~ spl13_25 ),
    inference(avatar_component_clause,[],[f1790]) ).

fof(f1793,definition,
    ( spl13_26
  <=> in(sK2(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),sK9) ),
    introduced(definition,[new_symbols(definition,[spl13_26])],[avatar_definition]) ).

fof(f1794,plain,
    ( ~ in(sK2(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),sK9)
    | spl13_26 ),
    inference(avatar_component_clause,[],[f1793]) ).

fof(f1795,plain,
    ( spl13_25
    | ~ spl13_26
    | spl13_6 ),
    inference(avatar_split_clause,[],[f1788,f338,f1793,f1790]) ).

fof(f1816,plain,
    ( $false
    | spl13_6
    | spl13_26 ),
    inference(resolution,[],[f1794,f1785]) ).

fof(f1817,plain,
    ( spl13_6
    | spl13_26 ),
    inference(avatar_contradiction_clause,[],[f1816]) ).

fof(f1830,plain,
    ( ~ in(sK2(set_intersection2(sK9,sK10),set_difference(sK9,set_difference(sK9,sK10))),sK10)
    | ~ spl13_25 ),
    inference(resolution,[],[f1791,f197]) ).

fof(f1984,plain,
    ( $false
    | spl13_6
    | ~ spl13_25 ),
    inference(resolution,[],[f1830,f1784]) ).

fof(f1985,plain,
    ( spl13_6
    | ~ spl13_25 ),
    inference(avatar_contradiction_clause,[],[f1984]) ).

cnf(s8,plain,
    ( ~ spl13_6
    | ~ spl13_7 ),
    inference(sat_conversion,[],[f344]) ).

cnf(s20,plain,
    ( spl13_7
    | ~ spl13_21
    | ~ spl13_22 ),
    inference(sat_conversion,[],[f1591]) ).

cnf(s21,plain,
    ( spl13_7
    | spl13_22 ),
    inference(sat_conversion,[],[f1593]) ).

cnf(s23,plain,
    ( spl13_7
    | spl13_21
    | ~ spl13_22 ),
    inference(sat_conversion,[],[f1765]) ).

cnf(s24,plain,
    ( spl13_6
    | spl13_25
    | ~ spl13_26 ),
    inference(sat_conversion,[],[f1795]) ).

cnf(s25,plain,
    ( spl13_6
    | spl13_26 ),
    inference(sat_conversion,[],[f1817]) ).

cnf(s30,plain,
    ( spl13_6
    | ~ spl13_25 ),
    inference(sat_conversion,[],[f1985]) ).

cnf(s34,plain,
    spl13_6,
    inference(rat,[],[s24,s25,s30]) ).

cnf(s35,plain,
    ~ spl13_7,
    inference(rat,[],[s8,s34]) ).

cnf(s36,plain,
    spl13_22,
    inference(rat,[],[s21,s35]) ).

cnf(s37,plain,
    ~ spl13_21,
    inference(rat,[],[s20,s36,s35]) ).

cnf(s38,plain,
    $false,
    inference(rat,[],[s23,s35,s36,s37]) ).

fof(f1986,plain,
    $false,
    inference(avatar_sat_refutation,[],[s38]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU138+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.40  % Computer : n018.cluster.edu
% 0.11/5.40  % Model    : x86_64 x86_64
% 0.11/5.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.40  % Memory   : 8046.5625MB
% 0.11/5.40  % OS       : Linux 6.8.0-71-generic
% 0.16/5.40  % CPULimit : 300
% 0.16/5.40  % WCLimit  : 300
% 0.16/5.40  % DateTime : Mon Sep 28 03:44:16 UTC 2026
% 0.16/5.40  % CPUTime  : 
% 0.16/5.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.43  Running first-order theorem proving
% 0.16/5.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
% 2.99/6.08  % (2973884)Detected formulas, will run a generic FOF schedule.
% 2.99/6.08  % (2973894)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2254964480:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.99/6.08  % (2973889)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=726248026:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.99/6.08  % (2973895)dis-21_1_sil=8000:lcm=predicate:random_seed=3445643231: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)
% 2.99/6.08  % (2973891)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=2482059928:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.99/6.08  % (2973893)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1643225499:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.99/6.08  % (2973892)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1124787336:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.99/6.08  % (2973890)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=3716901625:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.99/6.08  % (2973895)First to succeed.
% 2.99/6.08  % (2973895)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2973884"
% 2.99/6.08  % (2973892)Instruction limit reached! 
% 2.99/6.08  % (2973892)------------------------------
% 2.99/6.08  % (2973892)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/6.08  % (2973892)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/6.08  % (2973892)CaDiCaL version: 2.1.3
% 2.99/6.08  % (2973892)Termination reason: Instruction limit
% 2.99/6.08  % (2973892)Termination phase: Saturation
% 2.99/6.08  % (2973892)Time elapsed: 0.071 s
% 2.99/6.08  % (2973892)Peak memory usage: 89 MB
% 2.99/6.08  % (2973892)Instructions burned: 110 (million)
% 2.99/6.08  % (2973893)Instruction limit reached! 
% 2.99/6.08  % (2973893)------------------------------
% 2.99/6.08  % (2973893)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/6.08  % (2973893)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/6.08  % (2973893)CaDiCaL version: 2.1.3
% 2.99/6.08  % (2973893)Termination reason: Instruction limit
% 2.99/6.08  % (2973893)Termination phase: Saturation
% 2.99/6.08  % (2973893)Time elapsed: 0.076 s
% 2.99/6.08  % (2973893)Peak memory usage: 88 MB
% 2.99/6.08  % (2973893)Instructions burned: 119 (million)
% 2.99/6.08  % (2973894)Instruction limit reached! 
% 2.99/6.08  % (2973894)------------------------------
% 2.99/6.08  % (2973894)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/6.08  % (2973894)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/6.08  % (2973894)CaDiCaL version: 2.1.3
% 2.99/6.08  % (2973894)Termination reason: Instruction limit
% 2.99/6.08  % (2973894)Termination phase: Saturation
% 2.99/6.08  % (2973894)Time elapsed: 0.088 s
% 2.99/6.08  % (2973894)Peak memory usage: 89 MB
% 2.99/6.08  % (2973894)Instructions burned: 139 (million)
% 2.99/6.08  % (2973904)lrs+10_1_sil=32000:urr=on:br=off:random_seed=627235904:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.99/6.08  % (2973903)lrs+10_1_sil=8000:sp=occurrence:random_seed=2889629600:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.99/6.08  % (2973905)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3060094784:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.99/6.08  % (2973895)Refutation found. Thanks to Tanya!
% 2.99/6.08  % SZS status Theorem for theBenchmark
% 2.99/6.08  % SZS output start Proof for theBenchmark
% See solution above
% 3.54/6.28  % (2973895)------------------------------
% 3.54/6.28  % (2973895)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.54/6.28  % (2973895)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.54/6.28  % (2973895)CaDiCaL version: 2.1.3
% 3.54/6.28  % (2973895)Termination reason: Refutation
% 3.54/6.28  % (2973895)Time elapsed: 0.033 s
% 3.54/6.28  % (2973895)Peak memory usage: 89 MB
% 3.54/6.28  % (2973895)Instructions burned: 48 (million)
% 3.54/6.28  % (2973895)------------------------------
% 3.54/6.28  % (2973895)------------------------------
% 3.54/6.28  % (2973884)Success in time 0.448 s
% 3.54/6.28  % Vampire exiting
%------------------------------------------------------------------------------