↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

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

% Computer : n007.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:24:59 PM UTC 2026

% Result   : Theorem 2.13s 0.86s
% Output   : Refutation 2.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   81 (  24 unt;   4 def)
%            Number of atoms       :  185 (  33 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  178 (  74   ~;  68   |;  18   &)
%                                         (  11 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   5 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :   49 (   0 sgn  48   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0] :
      ( X0 = slcrc0
    <=> ( aSet0(X0)
        & ~ ? [X1] : aElementOf0(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).

fof(f9,axiom,
    ! [X0] :
      ( ( aSet0(X0)
        & isCountable0(X0) )
     => X0 != slcrc0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCountNFin_01) ).

fof(f10,axiom,
    ! [X0] :
      ( aSet0(X0)
     => ! [X1] :
          ( aSubsetOf0(X1,X0)
        <=> ( aSet0(X1)
            & ! [X2] :
                ( aElementOf0(X2,X1)
               => aElementOf0(X2,X0) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).

fof(f23,axiom,
    ( aSet0(szNzAzT0)
    & isCountable0(szNzAzT0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).

fof(f47,axiom,
    ! [X0] :
      ( ( aSubsetOf0(X0,szNzAzT0)
        & X0 != slcrc0 )
     => ! [X1] :
          ( X1 = szmzizndt0(X0)
        <=> ( aElementOf0(X1,X0)
            & ! [X2] :
                ( aElementOf0(X2,X0)
               => sdtlseqdt0(X1,X2) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefMin) ).

fof(f75,axiom,
    ( aSubsetOf0(xS,szNzAzT0)
    & isCountable0(xS) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).

fof(f82,axiom,
    ! [X0] :
      ( aElementOf0(X0,szNzAzT0)
     => ( aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
        & isCountable0(sdtlpdtrp0(xN,X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3671) ).

fof(f91,axiom,
    ( aFunction0(xe)
    & szDzozmdt0(xe) = szNzAzT0
    & ! [X0] :
        ( aElementOf0(X0,szNzAzT0)
       => sdtlpdtrp0(xe,X0) = szmzizndt0(sdtlpdtrp0(xN,X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4660) ).

fof(f99,axiom,
    ( aElementOf0(xi,szNzAzT0)
    & sdtlpdtrp0(xe,xi) = xx ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5034) ).

fof(f100,axiom,
    aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5045) ).

fof(f101,conjecture,
    aElementOf0(xx,xS),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f102,negated_conjecture,
    ~ aElementOf0(xx,xS),
    inference(negated_conjecture,[status(cth)],[f101]) ).

fof(f103,plain,
    ~ aElementOf0(xx,xS),
    inference(flattening,[],[f102]) ).

fof(f109,plain,
    ! [X0] :
      ( X0 = slcrc0
    <=> ( aSet0(X0)
        & ! [X1] : ~ aElementOf0(X1,X0) ) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f114,plain,
    ! [X0] :
      ( X0 != slcrc0
      | ~ aSet0(X0)
      | ~ isCountable0(X0) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f115,plain,
    ! [X0] :
      ( X0 != slcrc0
      | ~ aSet0(X0)
      | ~ isCountable0(X0) ),
    inference(flattening,[],[f114]) ).

fof(f116,plain,
    ! [X0] :
      ( ! [X1] :
          ( aSubsetOf0(X1,X0)
        <=> ( aSet0(X1)
            & ! [X2] :
                ( aElementOf0(X2,X0)
                | ~ aElementOf0(X2,X1) ) ) )
      | ~ aSet0(X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f173,plain,
    ! [X0] :
      ( ! [X1] :
          ( X1 = szmzizndt0(X0)
        <=> ( aElementOf0(X1,X0)
            & ! [X2] :
                ( sdtlseqdt0(X1,X2)
                | ~ aElementOf0(X2,X0) ) ) )
      | ~ aSubsetOf0(X0,szNzAzT0)
      | slcrc0 = X0 ),
    inference(ennf_transformation,[],[f47]) ).

fof(f174,plain,
    ! [X0] :
      ( ! [X1] :
          ( X1 = szmzizndt0(X0)
        <=> ( aElementOf0(X1,X0)
            & ! [X2] :
                ( sdtlseqdt0(X1,X2)
                | ~ aElementOf0(X2,X0) ) ) )
      | ~ aSubsetOf0(X0,szNzAzT0)
      | slcrc0 = X0 ),
    inference(flattening,[],[f173]) ).

fof(f218,plain,
    ! [X0] :
      ( ( aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
        & isCountable0(sdtlpdtrp0(xN,X0)) )
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(ennf_transformation,[],[f82]) ).

fof(f234,plain,
    ( aFunction0(xe)
    & szDzozmdt0(xe) = szNzAzT0
    & ! [X0] :
        ( sdtlpdtrp0(xe,X0) = szmzizndt0(sdtlpdtrp0(xN,X0))
        | ~ aElementOf0(X0,szNzAzT0) ) ),
    inference(ennf_transformation,[],[f91]) ).

fof(f240,plain,
    ! [X0] :
      ( aSet0(X0)
      | slcrc0 != X0 ),
    inference(cnf_transformation,[],[f109]) ).

fof(f244,plain,
    ! [X0] :
      ( ~ isCountable0(X0)
      | ~ aSet0(X0)
      | slcrc0 != X0 ),
    inference(cnf_transformation,[],[f115]) ).

fof(f247,plain,
    ! [X2,X0,X1] :
      ( ~ aSet0(X0)
      | ~ aElementOf0(X2,X1)
      | aElementOf0(X2,X0)
      | ~ aSubsetOf0(X1,X0) ),
    inference(cnf_transformation,[],[f116]) ).

fof(f248,plain,
    ! [X0,X1] :
      ( ~ aSubsetOf0(X1,X0)
      | aSet0(X1)
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f116]) ).

fof(f278,plain,
    aSet0(szNzAzT0),
    inference(cnf_transformation,[],[f23]) ).

fof(f309,plain,
    ! [X0,X1] :
      ( slcrc0 = X0
      | ~ aSubsetOf0(X0,szNzAzT0)
      | aElementOf0(X1,X0)
      | szmzizndt0(X0) != X1 ),
    inference(cnf_transformation,[],[f174]) ).

fof(f379,plain,
    aSubsetOf0(xS,szNzAzT0),
    inference(cnf_transformation,[],[f75]) ).

fof(f396,plain,
    ! [X0] :
      ( ~ aElementOf0(X0,szNzAzT0)
      | isCountable0(sdtlpdtrp0(xN,X0)) ),
    inference(cnf_transformation,[],[f218]) ).

fof(f397,plain,
    ! [X0] :
      ( ~ aElementOf0(X0,szNzAzT0)
      | aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) ),
    inference(cnf_transformation,[],[f218]) ).

fof(f414,plain,
    ! [X0] :
      ( ~ aElementOf0(X0,szNzAzT0)
      | szmzizndt0(sdtlpdtrp0(xN,X0)) = sdtlpdtrp0(xe,X0) ),
    inference(cnf_transformation,[],[f234]) ).

fof(f431,plain,
    xx = sdtlpdtrp0(xe,xi),
    inference(cnf_transformation,[],[f99]) ).

fof(f432,plain,
    aElementOf0(xi,szNzAzT0),
    inference(cnf_transformation,[],[f99]) ).

fof(f433,plain,
    aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(cnf_transformation,[],[f100]) ).

fof(f434,plain,
    ~ aElementOf0(xx,xS),
    inference(cnf_transformation,[],[f103]) ).

fof(f435,plain,
    aSet0(slcrc0),
    inference(equality_resolution,[],[f240]) ).

fof(f437,plain,
    ( ~ isCountable0(slcrc0)
    | ~ aSet0(slcrc0) ),
    inference(equality_resolution,[],[f244]) ).

fof(f451,plain,
    ! [X0] :
      ( slcrc0 = X0
      | ~ aSubsetOf0(X0,szNzAzT0)
      | aElementOf0(szmzizndt0(X0),X0) ),
    inference(equality_resolution,[],[f309]) ).

fof(f484,plain,
    ( isCountable0(slcrc0)
    | ~ aSet0(slcrc0) ),
    inference(consistent_polarity_flipping,[],[f437]) ).

fof(f485,plain,
    ! [X2,X0,X1] :
      ( ~ aElementOf0(X2,X0)
      | aElementOf0(X2,X1)
      | ~ aSet0(X0)
      | ~ aSubsetOf0(X1,X0) ),
    inference(consistent_polarity_flipping,[],[f247]) ).

fof(f537,plain,
    ! [X0] :
      ( ~ aSubsetOf0(X0,szNzAzT0)
      | slcrc0 = X0
      | ~ aElementOf0(szmzizndt0(X0),X0) ),
    inference(consistent_polarity_flipping,[],[f451]) ).

fof(f608,plain,
    ! [X0] :
      ( aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
      | aElementOf0(X0,szNzAzT0) ),
    inference(consistent_polarity_flipping,[],[f397]) ).

fof(f609,plain,
    ! [X0] :
      ( ~ isCountable0(sdtlpdtrp0(xN,X0))
      | aElementOf0(X0,szNzAzT0) ),
    inference(consistent_polarity_flipping,[],[f396]) ).

fof(f624,plain,
    ! [X0] :
      ( aElementOf0(X0,szNzAzT0)
      | szmzizndt0(sdtlpdtrp0(xN,X0)) = sdtlpdtrp0(xe,X0) ),
    inference(consistent_polarity_flipping,[],[f414]) ).

fof(f633,plain,
    ~ aElementOf0(xi,szNzAzT0),
    inference(consistent_polarity_flipping,[],[f432]) ).

fof(f634,plain,
    aElementOf0(xx,xS),
    inference(consistent_polarity_flipping,[],[f434]) ).

fof(f642,definition,
    ( spl25_2
  <=> aSet0(slcrc0) ),
    introduced(definition,[new_symbols(definition,[spl25_2])],[avatar_definition]) ).

fof(f647,definition,
    ( spl25_3
  <=> isCountable0(slcrc0) ),
    introduced(definition,[new_symbols(definition,[spl25_3])],[avatar_definition]) ).

fof(f649,plain,
    ( isCountable0(slcrc0)
    | ~ spl25_3 ),
    inference(avatar_component_clause,[],[f647]) ).

fof(f650,plain,
    ( ~ spl25_2
    | spl25_3 ),
    inference(avatar_split_clause,[],[f484,f647,f642]) ).

fof(f651,plain,
    spl25_2,
    inference(avatar_split_clause,[],[f435,f642]) ).

fof(f672,plain,
    ( aSet0(xS)
    | ~ aSet0(szNzAzT0) ),
    inference(resolution,[],[f248,f379]) ).

fof(f674,plain,
    aSet0(xS),
    inference(forward_subsumption_resolution,[],[f672,f278]) ).

fof(f678,definition,
    ( spl25_4
  <=> aSet0(xS) ),
    introduced(definition,[new_symbols(definition,[spl25_4])],[avatar_definition]) ).

fof(f679,plain,
    ( aSet0(xS)
    | ~ spl25_4 ),
    inference(avatar_component_clause,[],[f678]) ).

fof(f686,plain,
    spl25_4,
    inference(avatar_split_clause,[],[f674,f678]) ).

fof(f818,plain,
    ! [X0] :
      ( ~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X0)),sdtlpdtrp0(xN,X0))
      | slcrc0 = sdtlpdtrp0(xN,X0)
      | aElementOf0(X0,szNzAzT0) ),
    inference(resolution,[],[f537,f608]) ).

fof(f862,plain,
    sdtlpdtrp0(xe,xi) = szmzizndt0(sdtlpdtrp0(xN,xi)),
    inference(resolution,[],[f624,f633]) ).

fof(f868,plain,
    xx = szmzizndt0(sdtlpdtrp0(xN,xi)),
    inference(forward_demodulation,[],[f862,f431]) ).

fof(f875,plain,
    ! [X0] :
      ( aElementOf0(xx,X0)
      | ~ aSet0(xS)
      | ~ aSubsetOf0(X0,xS) ),
    inference(resolution,[],[f485,f634]) ).

fof(f888,plain,
    ( ! [X0] :
        ( ~ aSubsetOf0(X0,xS)
        | aElementOf0(xx,X0) )
    | ~ spl25_4 ),
    inference(forward_subsumption_resolution,[],[f875,f679]) ).

fof(f890,plain,
    ( aElementOf0(xx,sdtlpdtrp0(xN,xi))
    | ~ spl25_4 ),
    inference(resolution,[],[f888,f433]) ).

fof(f3274,definition,
    ( spl25_188
  <=> slcrc0 = sdtlpdtrp0(xN,xi) ),
    introduced(definition,[new_symbols(definition,[spl25_188])],[avatar_definition]) ).

fof(f3276,plain,
    ( slcrc0 = sdtlpdtrp0(xN,xi)
    | ~ spl25_188 ),
    inference(avatar_component_clause,[],[f3274]) ).

fof(f7483,plain,
    ( ~ aElementOf0(xx,sdtlpdtrp0(xN,xi))
    | slcrc0 = sdtlpdtrp0(xN,xi)
    | aElementOf0(xi,szNzAzT0) ),
    inference(superposition,[],[f818,f868]) ).

fof(f7489,plain,
    ( slcrc0 = sdtlpdtrp0(xN,xi)
    | aElementOf0(xi,szNzAzT0)
    | ~ spl25_4 ),
    inference(forward_subsumption_resolution,[],[f7483,f890]) ).

fof(f7500,plain,
    ( slcrc0 = sdtlpdtrp0(xN,xi)
    | ~ spl25_4 ),
    inference(forward_subsumption_resolution,[],[f7489,f633]) ).

fof(f7501,plain,
    ( spl25_188
    | ~ spl25_4 ),
    inference(avatar_split_clause,[],[f7500,f678,f3274]) ).

fof(f24364,plain,
    ( ~ isCountable0(slcrc0)
    | aElementOf0(xi,szNzAzT0)
    | ~ spl25_188 ),
    inference(superposition,[],[f609,f3276]) ).

fof(f24435,plain,
    ( aElementOf0(xi,szNzAzT0)
    | ~ spl25_3
    | ~ spl25_188 ),
    inference(forward_subsumption_resolution,[],[f24364,f649]) ).

fof(f24501,plain,
    ( $false
    | ~ spl25_3
    | ~ spl25_188 ),
    inference(forward_subsumption_resolution,[],[f24435,f633]) ).

fof(f24502,plain,
    ( ~ spl25_3
    | ~ spl25_188 ),
    inference(avatar_contradiction_clause,[],[f24501]) ).

cnf(s2,plain,
    ( ~ spl25_2
    | spl25_3 ),
    inference(sat_conversion,[],[f650]) ).

cnf(s3,plain,
    spl25_2,
    inference(sat_conversion,[],[f651]) ).

cnf(s5,plain,
    spl25_4,
    inference(sat_conversion,[],[f686]) ).

cnf(s471,plain,
    ( ~ spl25_4
    | spl25_188 ),
    inference(sat_conversion,[],[f7501]) ).

cnf(s1799,plain,
    ( ~ spl25_3
    | ~ spl25_188 ),
    inference(sat_conversion,[],[f24502]) ).

cnf(s1948,plain,
    spl25_188,
    inference(rat,[],[s471,s5]) ).

cnf(s1959,plain,
    ~ spl25_3,
    inference(rat,[],[s1799,s1948]) ).

cnf(s2174,plain,
    $false,
    inference(rat,[],[s2,s1959,s3]) ).

fof(f24507,plain,
    $false,
    inference(avatar_sat_refutation,[],[s2174]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM604+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38  % Computer : n007.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 20:41:10 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41  Running first-order model finding
% 0.10/0.41  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.13/0.86  % (1761701)Will run a generic schedule for satisfiability detection.
% 2.13/0.86  % (1761707)% WARNING: option uhcvi not known.
% 2.13/0.86  % (1761707)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1632311174:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.13/0.86  % (1761706)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=664343027_2999 on theBenchmark for (2999ds/0Mi)
% 2.13/0.86  % (1761708)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1558839214:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.13/0.86  % (1761711)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3148006957:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.13/0.86  % (1761709)dis+10_1_sil=32000:sp=arity:random_seed=3737266455:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.13/0.86  % (1761710)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2150686705:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.13/0.86  % (1761712)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1653121350:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.13/0.86  % TRYING [1]
% 2.13/0.86  % TRYING [2]
% 2.13/0.86  % TRYING [3]
% 2.13/0.86  % TRYING [4]
% 2.13/0.86  % (1761709)Instruction limit reached! 
% 2.13/0.86  % (1761709)------------------------------
% 2.13/0.86  % (1761709)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.13/0.86  % (1761709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.13/0.86  % (1761709)CaDiCaL version: 2.1.3
% 2.13/0.86  % (1761709)Termination reason: Instruction limit
% 2.13/0.86  % (1761709)Termination phase: Saturation
% 2.13/0.86  % (1761709)Time elapsed: 0.067 s
% 2.13/0.86  % (1761709)Peak memory usage: 13 MB
% 2.13/0.86  % (1761709)Instructions burned: 103 (million)
% 2.13/0.86  % (1761710)Instruction limit reached! 
% 2.13/0.86  % (1761710)------------------------------
% 2.13/0.86  % (1761710)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.13/0.86  % (1761710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.13/0.86  % (1761710)CaDiCaL version: 2.1.3
% 2.13/0.86  % (1761710)Termination reason: Instruction limit
% 2.13/0.86  % (1761710)Termination phase: Saturation
% 2.13/0.86  % (1761710)Time elapsed: 0.076 s
% 2.13/0.86  % (1761710)Peak memory usage: 13 MB
% 2.13/0.86  % (1761710)Instructions burned: 119 (million)
% 2.13/0.86  % (1761711)Instruction limit reached! 
% 2.13/0.86  % (1761711)------------------------------
% 2.13/0.86  % (1761711)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.13/0.86  % (1761711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.13/0.86  % (1761711)CaDiCaL version: 2.1.3
% 2.13/0.86  % (1761711)Termination reason: Instruction limit
% 2.13/0.86  % (1761711)Termination phase: Saturation
% 2.13/0.86  % (1761711)Time elapsed: 0.079 s
% 2.13/0.86  % (1761711)Peak memory usage: 13 MB
% 2.13/0.86  % (1761711)Instructions burned: 131 (million)
% 2.13/0.86  % (1761720)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=755218437:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 2.13/0.86  % (1761721)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2826299267:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.13/0.86  % (1761722)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3408386674:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.13/0.86  % (1761712)Instruction limit reached! 
% 2.13/0.86  % (1761712)------------------------------
% 2.13/0.86  % (1761712)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.13/0.86  % (1761712)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.13/0.86  % (1761712)CaDiCaL version: 2.1.3
% 2.13/0.86  % (1761712)Termination reason: Instruction limit
% 2.13/0.86  % (1761712)Termination phase: Saturation
% 2.13/0.86  % (1761712)Time elapsed: 0.099 s
% 2.13/0.86  % (1761712)Peak memory usage: 15 MB
% 2.13/0.86  % (1761712)Instructions burned: 160 (million)
% 2.13/0.86  % TRYING [1]
% 2.13/0.86  % TRYING [2]
% 2.13/0.86  % TRYING [3]
% 2.13/0.86  % (1761726)ott-21_1_sil=16000:fs=off:random_seed=3756898790:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.13/0.86  % TRYING [5]
% 2.13/0.86  % TRYING [4]
% 2.13/0.86  % (1761721)Instruction limit reached! 
% 2.13/0.86  % (1761721)------------------------------
% 2.13/0.86  % (1761721)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.13/0.86  % (1761721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.13/0.86  % (1761721)CaDiCaL version: 2.1.3
% 2.13/0.86  % (1761721)Termination reason: Instruction limit
% 2.13/0.86  % (1761721)Termination phase: Saturation
% 2.13/0.86  % (1761721)Time elapsed: 0.087 s
% 2.13/0.86  % (1761721)Peak memory usage: 13 MB
% 2.13/0.86  % (1761721)Instructions burned: 132 (million)
% 2.13/0.86  % (1761728)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3410621558:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.13/0.86  % TRYING [5]
% 2.13/0.86  % (1761726)Instruction limit reached! 
% 2.13/0.86  % (1761726)------------------------------
% 2.13/0.86  % (1761726)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.13/0.86  % (1761726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.13/0.86  % (1761726)CaDiCaL version: 2.1.3
% 2.13/0.86  % (1761726)Termination reason: Instruction limit
% 2.13/0.86  % (1761726)Termination phase: Saturation
% 2.13/0.86  % (1761726)Time elapsed: 0.104 s
% 2.13/0.86  % (1761726)Peak memory usage: 13 MB
% 2.13/0.86  % (1761726)Instructions burned: 181 (million)
% 2.13/0.86  % (1761730)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3780369951:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.13/0.86  % TRYING [1]
% 2.13/0.86  % TRYING [2]
% 2.13/0.86  % TRYING [6]
% 2.13/0.86  % TRYING [3]
% 2.13/0.86  % TRYING [6]
% 2.13/0.86  % (1761720)Instruction limit reached! 
% 2.13/0.86  % (1761720)------------------------------
% 2.13/0.86  % (1761720)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.13/0.86  % (1761720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.13/0.86  % (1761720)CaDiCaL version: 2.1.3
% 2.13/0.86  % (1761720)Termination reason: Instruction limit
% 2.13/0.86  % (1761720)Termination phase: Finite model building constraint generation
% 2.13/0.86  % (1761720)Time elapsed: 0.290 s
% 2.13/0.86  % (1761720)Peak memory usage: 34 MB
% 2.13/0.86  % (1761720)Instructions burned: 715 (million)
% 2.13/0.86  % TRYING [4]
% 2.13/0.86  % (1761707) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1761701-1761707"...
% 2.13/0.86  % (1761707)...printing done.
% 2.13/0.86  % (1761707)Refutation found. Thanks to Tanya!
% 2.13/0.86  % SZS status Theorem for theBenchmark
% 2.13/0.86  % SZS output start Proof for theBenchmark
% See solution above
% 2.13/0.86  % (1761707)------------------------------
% 2.13/0.86  % (1761707)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.13/0.86  % (1761707)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.13/0.86  % (1761707)CaDiCaL version: 2.1.3
% 2.13/0.86  % (1761707)Termination reason: Refutation
% 2.13/0.86  % (1761707)Time elapsed: 0.406 s
% 2.13/0.86  % (1761707)Peak memory usage: 25 MB
% 2.13/0.86  % (1761707)Instructions burned: 1270 (million)
% 2.13/0.86  % (1761701)Success in time 0.443 s
% 2.13/0.86  % Vampire exiting
%------------------------------------------------------------------------------