↑ 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  : SEU647^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n005.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 : Wed Sep 30 08:32:49 AM UTC 2026

% Result   : Theorem 0.25s 0.33s
% Output   : Refutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   37 (  27 unt;   0 typ;   0 def)
%            Number of atoms       :  293 (  66 equ;   0 cnn)
%            Maximal formula atoms :    4 (   7 avg)
%            Number of connectives :  508 (   7   ~;   3   |;   9   &; 443   @)
%                                         (   0 <=>;  23  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   22 (  18 usr;  10 con; 0-4 aty)
%                                         (  23  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   86 (  28   ^;  50   !;   8   ?;  86   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    in: $i > $i > $o ).

thf(func_def_2,type,
    setadjoin: $i > $i > $i ).

thf(func_def_3,type,
    setadjoinIL: $o ).

thf(func_def_5,type,
    setukpairinjL1: $o ).

thf(func_def_6,type,
    vPI: 
      !>[X0: $tType] : ( ( X0 > $o ) > $o ) ).

thf(func_def_7,type,
    db0: 
      !>[X0: $tType] : X0 ).

thf(func_def_8,type,
    db1: 
      !>[X0: $tType] : X0 ).

thf(func_def_9,type,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

thf(func_def_10,type,
    vIMP: $o > $o > $o ).

thf(func_def_11,type,
    db2: 
      !>[X0: $tType] : X0 ).

thf(func_def_12,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(func_def_19,type,
    vNOT: $o > $o ).

thf(f1,axiom,
    ( setadjoinIL
    = ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ X1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL) ).

thf(f2,axiom,
    ( setukpairinjL1
    = ( ! [X0: $i,X1: $i,X2: $i] :
          ( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
         => ( X0 = X2 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL1) ).

thf(f3,conjecture,
    ( setadjoinIL
   => ( setukpairinjL1
     => ! [X0: $i,X1: $i,X2: $i,X3: $i] :
          ( ( ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) )
            = ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) )
         => ( X0 = X2 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL2) ).

thf(f4,negated_conjecture,
    ~ ( setadjoinIL
     => ( setukpairinjL1
       => ! [X0: $i,X1: $i,X2: $i,X3: $i] :
            ( ( ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) )
              = ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) )
           => ( X0 = X2 ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f5,plain,
    ( setadjoinIL
    = ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ X1 ) ) ) ),
    inference(rectify,[],[f1]) ).

thf(f6,plain,
    ( setadjoinIL
    = ( !! @ $i
      @ ^ [Y0: $i] :
          ( !! @ $i
          @ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
    inference(fool_elimination,[],[f5]) ).

thf(f7,plain,
    ( setukpairinjL1
    = ( ! [X0: $i,X1: $i,X2: $i] :
          ( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
         => ( X0 = X2 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f8,plain,
    ( setukpairinjL1
    = ( !! @ $i
      @ ^ [Y0: $i] :
          ( !! @ $i
          @ ^ [Y1: $i] :
              ( !! @ $i
              @ ^ [Y2: $i] :
                  ( ( in @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) )
                 => ( Y2 = Y0 ) ) ) ) ) ),
    inference(fool_elimination,[],[f7]) ).

thf(f9,plain,
    ~ ( setadjoinIL
     => ( setukpairinjL1
       => ! [X0: $i,X1: $i,X2: $i,X3: $i] :
            ( ( ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) )
              = ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) )
           => ( X0 = X2 ) ) ) ),
    inference(rectify,[],[f4]) ).

thf(f10,plain,
    ~ ( ( setadjoinIL = $true )
     => ( ( setukpairinjL1 = $true )
       => ! [X0: $i,X1: $i,X2: $i,X3: $i] :
            ( ( ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) )
              = ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) )
           => ( X0 = X2 ) ) ) ),
    inference(fool_elimination,[],[f9]) ).

thf(f11,plain,
    ( ? [X0: $i,X1: $i,X2: $i,X3: $i] :
        ( ( X0 != X2 )
        & ( ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) )
          = ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) )
    & ( setukpairinjL1 = $true )
    & ( setadjoinIL = $true ) ),
    inference(ennf_transformation,[],[f10]) ).

thf(f12,plain,
    ( ? [X0: $i,X1: $i,X2: $i,X3: $i] :
        ( ( X0 != X2 )
        & ( ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) )
          = ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) )
    & ( setukpairinjL1 = $true )
    & ( setadjoinIL = $true ) ),
    inference(flattening,[],[f11]) ).

thf(f13,plain,
    ( ( sK0 != sK2 )
    & ( ( setadjoin @ ( setadjoin @ sK0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) )
      = ( setadjoin @ ( setadjoin @ sK2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ emptyset ) ) )
    & ( setukpairinjL1 = $true )
    & ( setadjoinIL = $true ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f12]) ).

thf(f14,plain,
    ( setadjoinIL
    = ( !! @ $i
      @ ^ [Y0: $i] :
          ( !! @ $i
          @ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
    inference(cnf_transformation,[],[f6]) ).

thf(f15,plain,
    ( setukpairinjL1
    = ( !! @ $i
      @ ^ [Y0: $i] :
          ( !! @ $i
          @ ^ [Y1: $i] :
              ( !! @ $i
              @ ^ [Y2: $i] :
                  ( ( in @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) )
                 => ( Y2 = Y0 ) ) ) ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f16,plain,
    setadjoinIL = $true,
    inference(cnf_transformation,[],[f13]) ).

thf(f17,plain,
    setukpairinjL1 = $true,
    inference(cnf_transformation,[],[f13]) ).

thf(f18,plain,
    ( ( setadjoin @ ( setadjoin @ sK0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) )
    = ( setadjoin @ ( setadjoin @ sK2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK2 @ ( setadjoin @ sK3 @ emptyset ) ) @ emptyset ) ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f19,plain,
    sK0 != sK2,
    inference(cnf_transformation,[],[f13]) ).

thf(f22,plain,
    ( ( !! @ $i
      @ ^ [Y0: $i] :
          ( !! @ $i
          @ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) )
    = $true ),
    inference(definition_unfolding,[],[f14,f16]) ).

thf(f23,plain,
    ( ( !! @ $i
      @ ^ [Y0: $i] :
          ( !! @ $i
          @ ^ [Y1: $i] :
              ( !! @ $i
              @ ^ [Y2: $i] :
                  ( ( in @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) )
                 => ( Y2 = Y0 ) ) ) ) )
    = $true ),
    inference(definition_unfolding,[],[f15,f17]) ).

thf(f24,plain,
    ! [X1: $i] :
      ( $true
      = ( ^ [Y0: $i] :
            ( !! @ $i
            @ ^ [Y1: $i] :
                ( !! @ $i
                @ ^ [Y2: $i] :
                    ( ( in @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) )
                   => ( Y2 = Y0 ) ) ) )
        @ X1 ) ),
    inference(pi_proxy_clausification,[],[f23]) ).

thf(f25,plain,
    ! [X1: $i] :
      ( $true
      = ( !! @ $i
        @ ^ [Y0: $i] :
            ( !! @ $i
            @ ^ [Y1: $i] :
                ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) ) )
               => ( Y1 = X1 ) ) ) ) ),
    inference(beta-eta_normalization,[],[f24]) ).

thf(f26,plain,
    ! [X2: $i,X1: $i] :
      ( $true
      = ( ^ [Y0: $i] :
            ( !! @ $i
            @ ^ [Y1: $i] :
                ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) ) )
               => ( Y1 = X1 ) ) )
        @ X2 ) ),
    inference(pi_proxy_clausification,[],[f25]) ).

thf(f27,plain,
    ! [X2: $i,X1: $i] :
      ( $true
      = ( !! @ $i
        @ ^ [Y0: $i] :
            ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
           => ( Y0 = X1 ) ) ) ),
    inference(beta-eta_normalization,[],[f26]) ).

thf(f28,plain,
    ! [X2: $i,X3: $i,X1: $i] :
      ( $true
      = ( ^ [Y0: $i] :
            ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
           => ( Y0 = X1 ) )
        @ X3 ) ),
    inference(pi_proxy_clausification,[],[f27]) ).

thf(f29,plain,
    ! [X2: $i,X3: $i,X1: $i] :
      ( $true
      = ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
       => ( X3 = X1 ) ) ),
    inference(beta-eta_normalization,[],[f28]) ).

thf(f30,plain,
    ! [X2: $i,X3: $i,X1: $i] :
      ( ( $false
        = ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) )
      | ( $true
        = ( X3 = X1 ) ) ),
    inference(imp_proxy_clausification,[],[f29]) ).

thf(f31,plain,
    ! [X2: $i,X3: $i,X1: $i] :
      ( ( $false
        = ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) )
      | ( X1 = X3 ) ),
    inference(equality_proxy_clausification,[],[f30]) ).

thf(f32,plain,
    ! [X1: $i] :
      ( $true
      = ( ^ [Y0: $i] :
            ( !! @ $i
            @ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) )
        @ X1 ) ),
    inference(pi_proxy_clausification,[],[f22]) ).

thf(f33,plain,
    ! [X1: $i] :
      ( $true
      = ( !! @ $i
        @ ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ X1 ) ) ) ),
    inference(beta-eta_normalization,[],[f32]) ).

thf(f34,plain,
    ! [X2: $i,X1: $i] :
      ( $true
      = ( ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ X1 ) )
        @ X2 ) ),
    inference(pi_proxy_clausification,[],[f33]) ).

thf(f35,plain,
    ! [X2: $i,X1: $i] :
      ( $true
      = ( in @ X2 @ ( setadjoin @ X2 @ X1 ) ) ),
    inference(beta-eta_normalization,[],[f34]) ).

thf(f45,plain,
    ( $true
    = ( in @ ( setadjoin @ sK2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) ) ),
    inference(constrained_superposition,[],[f35,f18]) ).

thf(f49,plain,
    ( ( $true = $false )
    | ( sK0 = sK2 ) ),
    inference(constrained_superposition,[],[f31,f45]) ).

thf(f50,plain,
    sK0 = sK2,
    inference(trivial_inequality_removal,[],[f49]) ).

thf(f52,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f50,f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SEU647^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23  % Computer : n005.cluster.edu
% 0.10/0.23  % Model    : x86_64 x86_64
% 0.10/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.23  % Memory   : 8046.5625MB
% 0.10/0.23  % OS       : Linux 6.8.0-71-generic
% 0.10/0.23  % CPULimit : 300
% 0.10/0.23  % WCLimit  : 300
% 0.10/0.23  % DateTime : Tue Sep 29 14:02:01 UTC 2026
% 0.10/0.23  % CPUTime  : 
% 0.10/0.23  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.25/0.28  Running first-order model finding
% 0.25/0.28  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.25/0.33  % (1716429)Will run a generic schedule for satisfiability detection.
% 0.25/0.33  % (1716434)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=187778352_2999 on theBenchmark for (2999ds/0Mi)
% 0.25/0.33  % Exception at run slice level
% 0.25/0.33  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.25/0.33  % (1716435)% WARNING: option uhcvi not known.
% 0.25/0.33  % (1716435)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4067801838:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.25/0.33  % (1716436)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2257480186:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.25/0.33  % (1716437)dis+10_1_sil=32000:sp=arity:random_seed=2327718503:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.25/0.33  % (1716435)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.25/0.33  % (1716438)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2871976542:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.25/0.33  % (1716439)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2658629415:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.25/0.33  % (1716440)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3199625137:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.25/0.33  % (1716435)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.25/0.33  % (1716438)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.25/0.33  % (1716435) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1716429-1716435"...
% 0.25/0.33  % (1716437) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1716429-1716437"...
% 0.25/0.33  % (1716438) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1716429-1716438"...
% 0.25/0.33  % (1716439) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1716429-1716439"...
% 0.25/0.33  % (1716440) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1716429-1716440"...
% 0.25/0.33  % (1716436) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1716429-1716436"...
% 0.25/0.33  % (1716435)...printing done.
% 0.25/0.33  % (1716437)...printing done.
% 0.25/0.33  % (1716438)...printing done.
% 0.25/0.33  % (1716439)...printing done.
% 0.25/0.33  % (1716437)Refutation found. Thanks to Tanya!
% 0.25/0.33  % SZS status Theorem for theBenchmark
% 0.25/0.33  % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.33  % (1716437)------------------------------
% 0.25/0.33  % (1716437)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.33  % (1716437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.33  % (1716437)CaDiCaL version: 2.1.3
% 0.25/0.33  % (1716437)Termination reason: Refutation
% 0.25/0.33  % (1716437)Time elapsed: 0.008 s
% 0.25/0.33  % (1716437)Peak memory usage: 12 MB
% 0.25/0.33  % (1716437)Instructions burned: 7 (million)
% 0.25/0.33  % (1716429)Success in time 0.045 s
% 0.25/0.33  % Vampire exiting
%------------------------------------------------------------------------------