↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEU136+2 : 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:22 PM UTC 2026

% Result   : Theorem 1.76s 1.30s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   74 (  15 unt;   5 def)
%            Number of atoms       :  273 (  34 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  319 ( 120   ~; 133   |;  52   &)
%                                         (  12 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :  126 (   0 sgn 116   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ( subset(X0,X1)
        & subset(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).

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

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

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

fof(f35,axiom,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => subset(set_difference(X0,X2),set_difference(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_xboole_1) ).

fof(f42,conjecture,
    ! [X0,X1] : set_difference(set_union2(X0,X1),X1) = set_difference(X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t40_xboole_1) ).

fof(f43,negated_conjecture,
    ~ ! [X0,X1] : set_difference(set_union2(X0,X1),X1) = set_difference(X0,X1),
    inference(negated_conjecture,[status(cth)],[f42]) ).

fof(f48,axiom,
    ! [X0,X1] : subset(X0,set_union2(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).

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

fof(f69,plain,
    ! [X0,X1,X2] :
      ( subset(set_difference(X0,X2),set_difference(X1,X2))
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f35]) ).

fof(f72,plain,
    ? [X0,X1] : set_difference(X0,X1) != set_difference(set_union2(X0,X1),X1),
    inference(ennf_transformation,[],[f43]) ).

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

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

fof(f84,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(f85,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,[],[f84]) ).

fof(f86,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,[],[f85]) ).

fof(f87,plain,
    ! [X0,X1,X2] :
      ( ( X2 = set_union2(X0,X1)
        | ( ( ( ~ in(sK1(X0,X1,X2),X0)
              & ~ in(sK1(X0,X1,X2),X1) )
            | ~ in(sK1(X0,X1,X2),X2) )
          & ( in(sK1(X0,X1,X2),X0)
            | in(sK1(X0,X1,X2),X1)
            | in(sK1(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,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f86]) ).

fof(f88,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,[],[f57]) ).

fof(f89,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,[],[f88]) ).

fof(f90,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))],[f89]) ).

fof(f95,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(f96,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,[],[f95]) ).

fof(f97,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,[],[f96]) ).

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

fof(f107,plain,
    set_difference(sK9,sK10) != set_difference(set_union2(sK9,sK10),sK10),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X0,sK9),skolemize(X1,sK10)],[f72]) ).

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

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

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

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

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

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

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

fof(f162,plain,
    ! [X2,X0,X1] :
      ( subset(set_difference(X0,X2),set_difference(X1,X2))
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f69]) ).

fof(f172,plain,
    set_difference(sK9,sK10) != set_difference(set_union2(sK9,sK10),sK10),
    inference(cnf_transformation,[],[f107]) ).

fof(f178,plain,
    ! [X0,X1] : subset(X0,set_union2(X0,X1)),
    inference(cnf_transformation,[],[f48]) ).

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

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

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

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

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

fof(f196,plain,
    ! [X0,X1] :
      ( sQ12_eqProxy(X0,X1)
      | ~ subset(X0,X1)
      | ~ subset(X1,X0) ),
    inference(equality_proxy_replacement,[],[f114,f193]) ).

fof(f224,plain,
    ~ sQ12_eqProxy(set_difference(sK9,sK10),set_difference(set_union2(sK9,sK10),sK10)),
    inference(equality_proxy_replacement,[],[f172,f193]) ).

fof(f323,plain,
    ( ~ subset(set_difference(sK9,sK10),set_difference(set_union2(sK9,sK10),sK10))
    | ~ subset(set_difference(set_union2(sK9,sK10),sK10),set_difference(sK9,sK10)) ),
    inference(resolution,[],[f196,f224]) ).

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

fof(f330,plain,
    ( ~ subset(set_difference(sK9,sK10),set_difference(set_union2(sK9,sK10),sK10))
    | spl13_6 ),
    inference(avatar_component_clause,[],[f329]) ).

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

fof(f333,plain,
    ( ~ subset(set_difference(set_union2(sK9,sK10),sK10),set_difference(sK9,sK10))
    | spl13_7 ),
    inference(avatar_component_clause,[],[f332]) ).

fof(f335,plain,
    ( ~ spl13_7
    | ~ spl13_6 ),
    inference(avatar_split_clause,[],[f323,f329,f332]) ).

fof(f546,plain,
    ( ~ subset(sK9,set_union2(sK9,sK10))
    | spl13_6 ),
    inference(resolution,[],[f162,f330]) ).

fof(f562,plain,
    ( $false
    | spl13_6 ),
    inference(resolution,[],[f546,f178]) ).

fof(f566,plain,
    spl13_6,
    inference(avatar_contradiction_clause,[],[f562]) ).

fof(f569,plain,
    ( ~ in(sK2(set_difference(set_union2(sK9,sK10),sK10),set_difference(sK9,sK10)),set_difference(sK9,sK10))
    | spl13_7 ),
    inference(resolution,[],[f333,f125]) ).

fof(f570,plain,
    ( in(sK2(set_difference(set_union2(sK9,sK10),sK10),set_difference(sK9,sK10)),set_difference(set_union2(sK9,sK10),sK10))
    | spl13_7 ),
    inference(resolution,[],[f333,f124]) ).

fof(f589,plain,
    ( ~ in(sK2(set_difference(set_union2(sK9,sK10),sK10),set_difference(sK9,sK10)),sK10)
    | spl13_7 ),
    inference(resolution,[],[f570,f192]) ).

fof(f590,plain,
    ( in(sK2(set_difference(set_union2(sK9,sK10),sK10),set_difference(sK9,sK10)),set_union2(sK9,sK10))
    | spl13_7 ),
    inference(resolution,[],[f570,f191]) ).

fof(f1354,plain,
    ( in(sK2(set_difference(set_union2(sK9,sK10),sK10),set_difference(sK9,sK10)),sK10)
    | in(sK2(set_difference(set_union2(sK9,sK10),sK10),set_difference(sK9,sK10)),sK9)
    | spl13_7 ),
    inference(resolution,[],[f186,f590]) ).

fof(f1359,definition,
    ( spl13_20
  <=> in(sK2(set_difference(set_union2(sK9,sK10),sK10),set_difference(sK9,sK10)),sK9) ),
    introduced(definition,[new_symbols(definition,[spl13_20])],[avatar_definition]) ).

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

fof(f1363,plain,
    ( in(sK2(set_difference(set_union2(sK9,sK10),sK10),set_difference(sK9,sK10)),sK10)
    | ~ spl13_21 ),
    inference(avatar_component_clause,[],[f1362]) ).

fof(f1364,plain,
    ( spl13_20
    | spl13_21
    | spl13_7 ),
    inference(avatar_split_clause,[],[f1354,f332,f1362,f1359]) ).

fof(f1854,plain,
    ( ~ in(sK2(set_difference(set_union2(sK9,sK10),sK10),set_difference(sK9,sK10)),sK9)
    | in(sK2(set_difference(set_union2(sK9,sK10),sK10),set_difference(sK9,sK10)),sK10)
    | spl13_7 ),
    inference(resolution,[],[f190,f569]) ).

fof(f1863,plain,
    ( spl13_21
    | ~ spl13_20
    | spl13_7 ),
    inference(avatar_split_clause,[],[f1854,f332,f1359,f1362]) ).

fof(f1864,plain,
    ( $false
    | spl13_7
    | ~ spl13_21 ),
    inference(resolution,[],[f1363,f589]) ).

fof(f1867,plain,
    ( spl13_7
    | ~ spl13_21 ),
    inference(avatar_contradiction_clause,[],[f1864]) ).

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

cnf(s9,plain,
    spl13_6,
    inference(sat_conversion,[],[f566]) ).

cnf(s16,plain,
    ( spl13_7
    | spl13_20
    | spl13_21 ),
    inference(sat_conversion,[],[f1364]) ).

cnf(s29,plain,
    ( spl13_7
    | ~ spl13_20
    | spl13_21 ),
    inference(sat_conversion,[],[f1863]) ).

cnf(s30,plain,
    ( spl13_7
    | ~ spl13_21 ),
    inference(sat_conversion,[],[f1867]) ).

cnf(s33,plain,
    ~ spl13_7,
    inference(rat,[],[s8,s9]) ).

cnf(s34,plain,
    ~ spl13_21,
    inference(rat,[],[s30,s33]) ).

cnf(s35,plain,
    ~ spl13_20,
    inference(rat,[],[s29,s34,s33]) ).

cnf(s39,plain,
    $false,
    inference(rat,[],[s16,s34,s35,s33]) ).

fof(f1868,plain,
    $false,
    inference(avatar_sat_refutation,[],[s39]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU136+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n002.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 28 03:43:36 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40  Running first-order theorem proving
% 0.11/0.40  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
% 1.76/1.30  % (4127435)Detected formulas, will run a generic FOF schedule.
% 1.76/1.30  % (4127440)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=2766953237:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.76/1.30  % (4127443)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2254182173:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.76/1.30  % (4127446)dis-21_1_sil=8000:lcm=predicate:random_seed=1845768455: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)
% 1.76/1.30  % (4127444)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1589960280:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.76/1.30  % (4127441)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=1212548160:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.76/1.30  % (4127442)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=3917994101:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.76/1.30  % (4127445)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1050771842:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.76/1.30  % (4127446)First to succeed.
% 1.76/1.30  % (4127446)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4127435"
% 1.76/1.30  % (4127443)Instruction limit reached! 
% 1.76/1.30  % (4127443)------------------------------
% 1.76/1.30  % (4127443)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.76/1.30  % (4127443)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/1.30  % (4127443)CaDiCaL version: 2.1.3
% 1.76/1.30  % (4127443)Termination reason: Instruction limit
% 1.76/1.30  % (4127443)Termination phase: Saturation
% 1.76/1.30  % (4127443)Time elapsed: 0.074 s
% 1.76/1.30  % (4127443)Peak memory usage: 89 MB
% 1.76/1.30  % (4127443)Instructions burned: 110 (million)
% 1.76/1.30  % (4127444)Instruction limit reached! 
% 1.76/1.30  % (4127444)------------------------------
% 1.76/1.30  % (4127444)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.76/1.30  % (4127444)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/1.30  % (4127444)CaDiCaL version: 2.1.3
% 1.76/1.30  % (4127444)Termination reason: Instruction limit
% 1.76/1.30  % (4127444)Termination phase: Saturation
% 1.76/1.30  % (4127444)Time elapsed: 0.078 s
% 1.76/1.30  % (4127444)Peak memory usage: 88 MB
% 1.76/1.30  % (4127444)Instructions burned: 120 (million)
% 1.76/1.30  % (4127445)Instruction limit reached! 
% 1.76/1.30  % (4127445)------------------------------
% 1.76/1.30  % (4127445)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.76/1.30  % (4127445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/1.30  % (4127445)CaDiCaL version: 2.1.3
% 1.76/1.30  % (4127445)Termination reason: Instruction limit
% 1.76/1.30  % (4127445)Termination phase: Saturation
% 1.76/1.30  % (4127445)Time elapsed: 0.092 s
% 1.76/1.30  % (4127445)Peak memory usage: 89 MB
% 1.76/1.30  % (4127445)Instructions burned: 140 (million)
% 1.76/1.30  % (4127455)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1070902375:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 1.76/1.30  % (4127454)lrs+10_1_sil=8000:sp=occurrence:random_seed=321559206:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 1.76/1.30  % (4127456)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1446440376:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 1.76/1.30  % (4127446)Refutation found. Thanks to Tanya!
% 1.76/1.30  % SZS status Theorem for theBenchmark
% 1.76/1.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/1.40  % (4127446)------------------------------
% 0.18/1.40  % (4127446)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.40  % (4127446)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.40  % (4127446)CaDiCaL version: 2.1.3
% 0.18/1.40  % (4127446)Termination reason: Refutation
% 0.18/1.40  % (4127446)Time elapsed: 0.032 s
% 0.18/1.40  % (4127446)Peak memory usage: 89 MB
% 0.18/1.40  % (4127446)Instructions burned: 48 (million)
% 0.18/1.40  % (4127446)------------------------------
% 0.18/1.40  % (4127446)------------------------------
% 0.18/1.40  % (4127435)Success in time 0.458 s
% 0.18/1.40  % Vampire exiting
%------------------------------------------------------------------------------