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

% Computer : n012.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:08 AM UTC 2026

% Result   : Theorem 0.08s 0.16s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   42 (  23 unt;   0 typ;   0 def)
%            Number of atoms       :  411 (  71 equ;   0 cnn)
%            Maximal formula atoms :    6 (   9 avg)
%            Number of connectives :  392 (  11   ~;  89   |;   0   &; 288   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   50 (  50   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   50 (  46 usr;   5 con; 0-4 aty)
%                                         (   4  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   53 (  52   ^;   1   !;   0   ?;  53   :)

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

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

thf(func_def_2,type,
    inv: ( $i > $i > $o ) > $i > $i > $o ).

thf(func_def_3,type,
    idem: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).

thf(func_def_4,type,
    infl: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).

thf(func_def_5,type,
    mono: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).

thf(func_def_6,type,
    refl: ( $i > $i > $o ) > $o ).

thf(func_def_7,type,
    irrefl: ( $i > $i > $o ) > $o ).

thf(func_def_8,type,
    rc: ( $i > $i > $o ) > $i > $i > $o ).

thf(func_def_9,type,
    symm: ( $i > $i > $o ) > $o ).

thf(func_def_10,type,
    antisymm: ( $i > $i > $o ) > $o ).

thf(func_def_11,type,
    asymm: ( $i > $i > $o ) > $o ).

thf(func_def_12,type,
    sc: ( $i > $i > $o ) > $i > $i > $o ).

thf(func_def_13,type,
    trans: ( $i > $i > $o ) > $o ).

thf(func_def_14,type,
    tc: ( $i > $i > $o ) > $i > $i > $o ).

thf(func_def_15,type,
    trc: ( $i > $i > $o ) > $i > $i > $o ).

thf(func_def_16,type,
    trsc: ( $i > $i > $o ) > $i > $i > $o ).

thf(func_def_17,type,
    po: ( $i > $i > $o ) > $o ).

thf(func_def_18,type,
    so: ( $i > $i > $o ) > $o ).

thf(func_def_19,type,
    total: ( $i > $i > $o ) > $o ).

thf(func_def_20,type,
    term: ( $i > $i > $o ) > $o ).

thf(func_def_21,type,
    ind: ( $i > $i > $o ) > $o ).

thf(func_def_22,type,
    innf: ( $i > $i > $o ) > $i > $o ).

thf(func_def_23,type,
    nfof: ( $i > $i > $o ) > $i > $i > $o ).

thf(func_def_24,type,
    norm: ( $i > $i > $o ) > $o ).

thf(func_def_25,type,
    join: ( $i > $i > $o ) > $i > $i > $o ).

thf(func_def_26,type,
    lconfl: ( $i > $i > $o ) > $o ).

thf(func_def_27,type,
    sconfl: ( $i > $i > $o ) > $o ).

thf(func_def_28,type,
    confl: ( $i > $i > $o ) > $o ).

thf(func_def_29,type,
    cr: ( $i > $i > $o ) > $o ).

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

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

thf(func_def_32,type,
    db3: 
      !>[X0: $tType] : X0 ).

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

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

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

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

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

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

thf(func_def_39,type,
    vOR: $o > $o > $o ).

thf(func_def_40,type,
    vAND: $o > $o > $o ).

thf(func_def_41,type,
    vSIGMA: 
      !>[X0: $tType] : ( ( X0 > $o ) > $o ) ).

thf(func_def_44,type,
    db4: 
      !>[X0: $tType] : X0 ).

thf(func_def_45,type,
    sK0: $i > $i > $o ).

thf(f3,axiom,
    ( idem
    = ( ^ [X0: ( $i > $i > $o ) > $i > $i > $o] :
        ! [X1: $i > $i > $o] :
          ( ( X0 @ ( X0 @ X1 ) )
          = ( X0 @ X1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',idempotent) ).

thf(f12,axiom,
    ( sc
    = ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
          ( ( X0 @ X1 @ X2 )
          | ( X0 @ X2 @ X1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',symmetric_closure) ).

thf(f30,conjecture,
    idem @ sc,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetric_closure_op_is_idempotent) ).

thf(f31,negated_conjecture,
    ~ ( idem @ sc ),
    inference(negated_conjecture,[status(cth)],[f30]) ).

thf(f35,plain,
    ( idem
    = ( ^ [Y0: ( $i > $i > $o ) > $i > $i > $o] :
          ( !! @ ( $i > $i > $o )
          @ ^ [Y1: $i > $i > $o] :
              ( ( Y0 @ Y1 )
              = ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f52,plain,
    ( sc
    = ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
          ( ( X0 @ X1 @ X2 )
          | ( X0 @ X2 @ X1 ) ) ) ),
    inference(rectify,[],[f12]) ).

thf(f53,plain,
    ( sc
    = ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
          ( ( Y0 @ Y2 @ Y1 )
          | ( Y0 @ Y1 @ Y2 ) ) ) ),
    inference(fool_elimination,[],[f52]) ).

thf(f86,plain,
    ~ ( idem @ sc ),
    inference(rectify,[],[f31]) ).

thf(f87,plain,
    ( ( idem @ sc )
   != $true ),
    inference(fool_elimination,[],[f86]) ).

thf(f88,plain,
    ( ( idem @ sc )
   != $true ),
    inference(flattening,[],[f87]) ).

thf(f91,plain,
    ( idem
    = ( ^ [Y0: ( $i > $i > $o ) > $i > $i > $o] :
          ( !! @ ( $i > $i > $o )
          @ ^ [Y1: $i > $i > $o] :
              ( ( Y0 @ Y1 )
              = ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ),
    inference(cnf_transformation,[],[f35]) ).

thf(f100,plain,
    ( sc
    = ( ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
          ( ( Y0 @ Y2 @ Y1 )
          | ( Y0 @ Y1 @ Y2 ) ) ) ),
    inference(cnf_transformation,[],[f53]) ).

thf(f118,plain,
    ( ( idem @ sc )
   != $true ),
    inference(cnf_transformation,[],[f88]) ).

thf(f136,plain,
    ( $true
   != ( ^ [Y0: ( $i > $i > $o ) > $i > $i > $o] :
          ( !! @ ( $i > $i > $o )
          @ ^ [Y1: $i > $i > $o] :
              ( ( Y0 @ Y1 )
              = ( Y0 @ ( Y0 @ Y1 ) ) ) )
      @ ^ [Y0: $i > $i > $o,Y1: $i,Y2: $i] :
          ( ( Y0 @ Y2 @ Y1 )
          | ( Y0 @ Y1 @ Y2 ) ) ) ),
    inference(definition_unfolding,[],[f118,f91,f100]) ).

thf(f137,plain,
    ( $true
   != ( !! @ ( $i > $i > $o )
      @ ^ [Y0: $i > $i > $o] :
          ( ( ^ [Y1: $i,Y2: $i] :
                ( ( Y0 @ Y2 @ Y1 )
                | ( Y0 @ Y1 @ Y2 ) ) )
          = ( ^ [Y1: $i,Y2: $i] :
                ( ( Y0 @ Y1 @ Y2 )
                | ( Y0 @ Y2 @ Y1 )
                | ( Y0 @ Y2 @ Y1 )
                | ( Y0 @ Y1 @ Y2 ) ) ) ) ) ),
    inference(beta-eta_normalization,[],[f136]) ).

thf(f138,plain,
    ( $false
    = ( ^ [Y0: $i > $i > $o] :
          ( ( ^ [Y1: $i,Y2: $i] :
                ( ( Y0 @ Y2 @ Y1 )
                | ( Y0 @ Y1 @ Y2 ) ) )
          = ( ^ [Y1: $i,Y2: $i] :
                ( ( Y0 @ Y1 @ Y2 )
                | ( Y0 @ Y2 @ Y1 )
                | ( Y0 @ Y2 @ Y1 )
                | ( Y0 @ Y1 @ Y2 ) ) ) )
      @ sK0 ) ),
    inference(sigma_proxy_clausification,[],[f137]) ).

thf(f139,plain,
    ( $false
    = ( ( ^ [Y0: $i,Y1: $i] :
            ( ( sK0 @ Y1 @ Y0 )
            | ( sK0 @ Y0 @ Y1 ) ) )
      = ( ^ [Y0: $i,Y1: $i] :
            ( ( sK0 @ Y0 @ Y1 )
            | ( sK0 @ Y1 @ Y0 )
            | ( sK0 @ Y1 @ Y0 )
            | ( sK0 @ Y0 @ Y1 ) ) ) ) ),
    inference(beta-eta_normalization,[],[f138]) ).

thf(f140,plain,
    ( ( ^ [Y0: $i,Y1: $i] :
          ( ( sK0 @ Y1 @ Y0 )
          | ( sK0 @ Y0 @ Y1 ) ) )
   != ( ^ [Y0: $i,Y1: $i] :
          ( ( sK0 @ Y0 @ Y1 )
          | ( sK0 @ Y1 @ Y0 )
          | ( sK0 @ Y1 @ Y0 )
          | ( sK0 @ Y0 @ Y1 ) ) ) ),
    inference(equality_proxy_clausification,[],[f139]) ).

thf(f141,plain,
    ( ( ^ [Y0: $i,Y1: $i] :
          ( ( sK0 @ Y1 @ Y0 )
          | ( sK0 @ Y0 @ Y1 ) )
      @ sK1 )
   != ( ^ [Y0: $i,Y1: $i] :
          ( ( sK0 @ Y0 @ Y1 )
          | ( sK0 @ Y1 @ Y0 )
          | ( sK0 @ Y1 @ Y0 )
          | ( sK0 @ Y0 @ Y1 ) )
      @ sK1 ) ),
    inference(negative_extensionality,[],[f140]) ).

thf(f142,plain,
    ( ( ^ [Y0: $i] :
          ( ( sK0 @ Y0 @ sK1 )
          | ( sK0 @ sK1 @ Y0 ) ) )
   != ( ^ [Y0: $i] :
          ( ( sK0 @ sK1 @ Y0 )
          | ( sK0 @ Y0 @ sK1 )
          | ( sK0 @ Y0 @ sK1 )
          | ( sK0 @ sK1 @ Y0 ) ) ) ),
    inference(beta-eta_normalization,[],[f141]) ).

thf(f143,plain,
    ( ( ^ [Y0: $i] :
          ( ( sK0 @ Y0 @ sK1 )
          | ( sK0 @ sK1 @ Y0 ) )
      @ sK2 )
   != ( ^ [Y0: $i] :
          ( ( sK0 @ sK1 @ Y0 )
          | ( sK0 @ Y0 @ sK1 )
          | ( sK0 @ Y0 @ sK1 )
          | ( sK0 @ sK1 @ Y0 ) )
      @ sK2 ) ),
    inference(negative_extensionality,[],[f142]) ).

thf(f144,plain,
    ( ( $true
      = ( ^ [Y0: $i] :
            ( ( sK0 @ Y0 @ sK1 )
            | ( sK0 @ sK1 @ Y0 ) )
        @ sK2 ) )
    | ( $true
      = ( ^ [Y0: $i] :
            ( ( sK0 @ sK1 @ Y0 )
            | ( sK0 @ Y0 @ sK1 )
            | ( sK0 @ Y0 @ sK1 )
            | ( sK0 @ sK1 @ Y0 ) )
        @ sK2 ) ) ),
    inference(xor_proxy_clausification,[],[f143]) ).

thf(f145,plain,
    ( ( $false
      = ( ^ [Y0: $i] :
            ( ( sK0 @ Y0 @ sK1 )
            | ( sK0 @ sK1 @ Y0 ) )
        @ sK2 ) )
    | ( $false
      = ( ^ [Y0: $i] :
            ( ( sK0 @ sK1 @ Y0 )
            | ( sK0 @ Y0 @ sK1 )
            | ( sK0 @ Y0 @ sK1 )
            | ( sK0 @ sK1 @ Y0 ) )
        @ sK2 ) ) ),
    inference(xor_proxy_clausification,[],[f143]) ).

thf(f146,plain,
    ( ( $false
      = ( ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK1 @ sK2 ) ) )
    | ( $false
      = ( ( sK0 @ sK1 @ sK2 )
        | ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK1 @ sK2 ) ) ) ),
    inference(beta-eta_normalization,[],[f145]) ).

thf(f147,plain,
    ( ( $false
      = ( sK0 @ sK1 @ sK2 ) )
    | ( $false
      = ( ( sK0 @ sK1 @ sK2 )
        | ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK1 @ sK2 ) ) ) ),
    inference(or_proxy_clausification,[],[f146]) ).

thf(f148,plain,
    ( ( $false
      = ( sK0 @ sK2 @ sK1 ) )
    | ( $false
      = ( ( sK0 @ sK1 @ sK2 )
        | ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK1 @ sK2 ) ) ) ),
    inference(or_proxy_clausification,[],[f146]) ).

thf(f150,plain,
    ( ( $false
      = ( sK0 @ sK2 @ sK1 ) )
    | ( $false
      = ( ( sK0 @ sK1 @ sK2 )
        | ( sK0 @ sK2 @ sK1 ) ) ) ),
    inference(or_proxy_clausification,[],[f148]) ).

thf(f151,plain,
    ( ( $false
      = ( sK0 @ sK2 @ sK1 ) )
    | ( $false
      = ( sK0 @ sK2 @ sK1 ) ) ),
    inference(or_proxy_clausification,[],[f150]) ).

thf(f153,plain,
    ( $false
    = ( sK0 @ sK2 @ sK1 ) ),
    inference(duplicate_literal_removal,[],[f151]) ).

thf(f158,plain,
    ( ( $false
      = ( sK0 @ sK1 @ sK2 ) )
    | ( $false
      = ( ( sK0 @ sK1 @ sK2 )
        | ( sK0 @ sK2 @ sK1 ) ) ) ),
    inference(or_proxy_clausification,[],[f147]) ).

thf(f160,plain,
    ( ( $false
      = ( sK0 @ sK1 @ sK2 ) )
    | ( $false
      = ( sK0 @ sK1 @ sK2 ) ) ),
    inference(or_proxy_clausification,[],[f158]) ).

thf(f161,plain,
    ( $false
    = ( sK0 @ sK1 @ sK2 ) ),
    inference(duplicate_literal_removal,[],[f160]) ).

thf(f165,plain,
    ( ( $true
      = ( ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK1 @ sK2 ) ) )
    | ( $true
      = ( ( sK0 @ sK1 @ sK2 )
        | ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK1 @ sK2 ) ) ) ),
    inference(beta-eta_normalization,[],[f144]) ).

thf(f166,plain,
    ( ( $true
      = ( sK0 @ sK1 @ sK2 ) )
    | ( $true
      = ( ( sK0 @ sK1 @ sK2 )
        | ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK1 @ sK2 ) ) )
    | ( $true
      = ( sK0 @ sK2 @ sK1 ) ) ),
    inference(or_proxy_clausification,[],[f165]) ).

thf(f167,plain,
    ( ( $true
      = ( sK0 @ sK1 @ sK2 ) )
    | ( $true
      = ( ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK1 @ sK2 ) ) )
    | ( $true
      = ( sK0 @ sK2 @ sK1 ) )
    | ( $true
      = ( ( sK0 @ sK1 @ sK2 )
        | ( sK0 @ sK2 @ sK1 ) ) ) ),
    inference(or_proxy_clausification,[],[f166]) ).

thf(f168,plain,
    ( ( $true
      = ( sK0 @ sK1 @ sK2 ) )
    | ( $true
      = ( sK0 @ sK1 @ sK2 ) )
    | ( $true
      = ( sK0 @ sK2 @ sK1 ) )
    | ( $true
      = ( ( sK0 @ sK1 @ sK2 )
        | ( sK0 @ sK2 @ sK1 ) ) )
    | ( $true
      = ( sK0 @ sK2 @ sK1 ) ) ),
    inference(or_proxy_clausification,[],[f167]) ).

thf(f169,plain,
    ( ( $true
      = ( sK0 @ sK1 @ sK2 ) )
    | ( $true
      = ( sK0 @ sK1 @ sK2 ) )
    | ( $true
      = ( sK0 @ sK2 @ sK1 ) )
    | ( $true
      = ( sK0 @ sK2 @ sK1 ) )
    | ( $true
      = ( sK0 @ sK2 @ sK1 ) )
    | ( $true
      = ( sK0 @ sK1 @ sK2 ) ) ),
    inference(or_proxy_clausification,[],[f168]) ).

thf(f170,plain,
    ( ( $true
      = ( sK0 @ sK1 @ sK2 ) )
    | ( $true
      = ( sK0 @ sK2 @ sK1 ) ) ),
    inference(duplicate_literal_removal,[],[f169]) ).

thf(f174,plain,
    ( ( $true = $false )
    | ( $true
      = ( sK0 @ sK2 @ sK1 ) ) ),
    inference(forward_demodulation,[],[f170,f161]) ).

thf(f175,plain,
    ( $true
    = ( sK0 @ sK2 @ sK1 ) ),
    inference(trivial_inequality_removal,[],[f174]) ).

thf(f176,plain,
    $true = $false,
    inference(forward_demodulation,[],[f175,f153]) ).

thf(f177,plain,
    $false,
    inference(trivial_inequality_removal,[],[f176]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SEU458^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.03  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10  % Computer : n012.cluster.edu
% 0.00/0.10  % Model    : x86_64 x86_64
% 0.00/0.10  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10  % Memory   : 8046.5625MB
% 0.00/0.10  % OS       : Linux 6.8.0-71-generic
% 0.00/0.10  % CPULimit : 300
% 0.00/0.10  % WCLimit  : 300
% 0.00/0.10  % DateTime : Tue Sep 29 13:41:19 UTC 2026
% 0.00/0.11  % CPUTime  : 
% 0.00/0.11  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12  Running first-order model finding
% 0.08/0.12  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.08/0.16  % (119146)Will run a generic schedule for satisfiability detection.
% 0.08/0.16  % (119152)% WARNING: option uhcvi not known.
% 0.08/0.16  % (119152)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=921696164:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.16  % (119151)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2296752412_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.16  % (119153)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1797701167:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.16  % (119154)dis+10_1_sil=32000:sp=arity:random_seed=2857980806:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.16  % (119155)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2004705702:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.16  % (119157)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2816586785:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.16  % (119156)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=355136104:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.16  % (119152)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.16  % (119155)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.16  % Exception at run slice level
% 0.08/0.16  % (119152)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.16  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.16  % (119153) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-119146-119153"...
% 0.08/0.16  % (119155) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-119146-119155"...
% 0.08/0.16  % (119156) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-119146-119156"...
% 0.08/0.16  % (119154) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-119146-119154"...
% 0.08/0.16  % (119152) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-119146-119152"...
% 0.08/0.16  % (119157) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-119146-119157"...
% 0.08/0.16  % (119153)...printing done.
% 0.08/0.16  % (119155)...printing done.
% 0.08/0.16  % (119156)...printing done.
% 0.08/0.16  % (119154)...printing done.
% 0.08/0.16  % (119152)...printing done.
% 0.08/0.16  % (119157)...printing done.
% 0.08/0.16  % (119153)Refutation found. Thanks to Tanya!
% 0.08/0.16  % SZS status Theorem for theBenchmark
% 0.08/0.16  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.16  % (119153)------------------------------
% 0.08/0.16  % (119153)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.16  % (119153)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.16  % (119153)CaDiCaL version: 2.1.3
% 0.08/0.16  % (119153)Termination reason: Refutation
% 0.08/0.16  % (119153)Time elapsed: 0.004 s
% 0.08/0.16  % (119153)Peak memory usage: 12 MB
% 0.08/0.16  % (119153)Instructions burned: 14 (million)
% 0.08/0.16  % (119146)Success in time 0.03 s
% 0.08/0.16  % Vampire exiting
%------------------------------------------------------------------------------