↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n009.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:29:43 AM UTC 2026

% Result   : Theorem 0.32s 0.40s
% Output   : Refutation 0.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   26
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   64 (  29 unt;   0 typ;   4 def)
%            Number of atoms       :  457 (  75 equ;   0 cnn)
%            Maximal formula atoms :    6 (   7 avg)
%            Number of connectives :  430 (  33   ~; 101   |;   0   &; 288   @)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   50 (  50   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   54 (  50 usr;   9 con; 0-4 aty)
%                                         (   4  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   53 (   0 sgn   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,
    db2: 
      !>[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,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

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

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

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

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

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

thf(func_def_43,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,
    ( ( ^ [X0: ( $i > $i > $o ) > $i > $i > $o] :
        ! [X1: $i > $i > $o] :
          ( ( X0 @ ( X0 @ X1 ) )
          = ( X0 @ X1 ) ) )
    = idem ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',idempotent) ).

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

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

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

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

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

thf(f63,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(f80,plain,
    ( ( ^ [X0: $i > $i > $o,X1: $i,X2: $i] :
          ( ( X0 @ X1 @ X2 )
          | ( X0 @ X2 @ X1 ) ) )
    = sc ),
    inference(rectify,[],[f12]) ).

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

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

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

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

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

thf(f136,plain,
    ( ( ^ [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 ) ) )
   != $true ),
    inference(definition_unfolding,[],[f95,f108,f92]) ).

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 @ sK1 @ Y0 )
          | ( sK0 @ Y0 @ sK1 )
          | ( sK0 @ Y0 @ sK1 )
          | ( sK0 @ sK1 @ Y0 ) ) )
   != ( ^ [Y0: $i] :
          ( ( sK0 @ Y0 @ sK1 )
          | ( sK0 @ sK1 @ Y0 ) ) ) ),
    inference(beta-eta_normalization,[],[f141]) ).

thf(f143,plain,
    ( ( ^ [Y0: $i] :
          ( ( sK0 @ sK1 @ Y0 )
          | ( sK0 @ Y0 @ sK1 )
          | ( sK0 @ Y0 @ sK1 )
          | ( sK0 @ sK1 @ Y0 ) )
      @ sK2 )
   != ( ^ [Y0: $i] :
          ( ( 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 @ sK1 @ sK2 )
        | ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK1 @ sK2 ) ) )
    | ( $false
      = ( ( sK0 @ sK2 @ sK1 )
        | ( sK0 @ sK1 @ sK2 ) ) ) ),
    inference(beta-eta_normalization,[],[f145]) ).

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

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

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(f155,plain,
    ( ( $false
      = ( sK0 @ sK1 @ sK2 ) )
    | ( $false
      = ( sK0 @ sK1 @ sK2 ) ) ),
    inference(or_proxy_clausification,[],[f149]) ).

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

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

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

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

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

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

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

thf(f168,definition,
    ( spl3_1
  <=> ( $false
      = ( sK0 @ sK1 @ sK2 ) ) ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

thf(f170,plain,
    ( ( $false
      = ( sK0 @ sK1 @ sK2 ) )
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f168]) ).

thf(f172,definition,
    ( spl3_2
  <=> ( $false
      = ( sK0 @ sK2 @ sK1 ) ) ),
    introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).

thf(f174,plain,
    ( ( $false
      = ( sK0 @ sK2 @ sK1 ) )
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f172]) ).

thf(f176,plain,
    spl3_2,
    inference(avatar_split_clause,[],[f153,f172]) ).

thf(f177,plain,
    spl3_1,
    inference(avatar_split_clause,[],[f156,f168]) ).

thf(f180,definition,
    ( spl3_3
  <=> ( ( sK0 @ sK1 @ sK2 )
      = $true ) ),
    introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).

thf(f182,plain,
    ( ( ( sK0 @ sK1 @ sK2 )
      = $true )
    | ~ spl3_3 ),
    inference(avatar_component_clause,[],[f180]) ).

thf(f184,definition,
    ( spl3_4
  <=> ( $true
      = ( sK0 @ sK2 @ sK1 ) ) ),
    introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).

thf(f186,plain,
    ( ( $true
      = ( sK0 @ sK2 @ sK1 ) )
    | ~ spl3_4 ),
    inference(avatar_component_clause,[],[f184]) ).

thf(f187,plain,
    ( spl3_3
    | spl3_4 ),
    inference(avatar_split_clause,[],[f166,f184,f180]) ).

thf(f189,plain,
    ( ( $false = $true )
    | ~ spl3_2
    | ~ spl3_4 ),
    inference(constrained_superposition,[],[f186,f174]) ).

thf(f192,plain,
    ( $false
    | ~ spl3_2
    | ~ spl3_4 ),
    inference(trivial_inequality_removal,[],[f189]) ).

thf(f193,plain,
    ( ~ spl3_2
    | ~ spl3_4 ),
    inference(avatar_contradiction_clause,[],[f192]) ).

thf(f194,plain,
    ( ( $false = $true )
    | ~ spl3_1
    | ~ spl3_3 ),
    inference(forward_demodulation,[],[f182,f170]) ).

thf(f195,plain,
    ( $false
    | ~ spl3_1
    | ~ spl3_3 ),
    inference(trivial_inequality_removal,[],[f194]) ).

thf(f196,plain,
    ( ~ spl3_1
    | ~ spl3_3 ),
    inference(avatar_contradiction_clause,[],[f195]) ).

cnf(s2,plain,
    spl3_2,
    inference(sat_conversion,[],[f176]) ).

cnf(s3,plain,
    spl3_1,
    inference(sat_conversion,[],[f177]) ).

cnf(s7,plain,
    ( spl3_3
    | spl3_4 ),
    inference(sat_conversion,[],[f187]) ).

cnf(s9,plain,
    ( ~ spl3_2
    | ~ spl3_4 ),
    inference(sat_conversion,[],[f193]) ).

cnf(s10,plain,
    ( ~ spl3_1
    | ~ spl3_3 ),
    inference(sat_conversion,[],[f196]) ).

cnf(s11,plain,
    ~ spl3_3,
    inference(rat,[],[s10,s3]) ).

cnf(s12,plain,
    spl3_4,
    inference(rat,[],[s7,s11]) ).

cnf(s13,plain,
    ~ spl3_2,
    inference(rat,[],[s9,s12]) ).

cnf(s14,plain,
    $false,
    inference(rat,[],[s2,s13]) ).

thf(f198,plain,
    $false,
    inference(avatar_sat_refutation,[],[s14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SEU458^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.07  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.27  % Computer : n009.cluster.edu
% 0.09/0.27  % Model    : x86_64 x86_64
% 0.09/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27  % Memory   : 8046.5625MB
% 0.09/0.27  % OS       : Linux 6.8.0-71-generic
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 300
% 0.09/0.28  % DateTime : Tue Sep 29 13:41:45 UTC 2026
% 0.09/0.28  % CPUTime  : 
% 0.09/0.28  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.33  Running higher-order theorem proving
% 0.26/0.35  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.32/0.40  % (4007962)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.32/0.40  % (4007968)lrs+10_16_si=on:nwc=1.5:random_seed=3991980446:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.32/0.40  % (4007968) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4007962-4007968"...
% 0.32/0.40  % (4007973)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.32/0.40  % (4007973)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.32/0.40  % (4007968)...printing done.
% 0.32/0.40  % (4007968)Refutation found. Thanks to Tanya!
% 0.32/0.40  % SZS status Theorem for theBenchmark
% 0.32/0.40  % SZS output start Proof for theBenchmark
% See solution above
% 0.32/0.40  % (4007968)------------------------------
% 0.32/0.40  % (4007968)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.40  % (4007968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.40  % (4007968)CaDiCaL version: 2.1.3
% 0.32/0.40  % (4007968)Termination reason: Refutation
% 0.32/0.40  % (4007968)Time elapsed: 0.007 s
% 0.32/0.40  % (4007968)Peak memory usage: 13 MB
% 0.32/0.40  % (4007968)Instructions burned: 13 (million)
% 0.32/0.40  % (4007962)Success in time 0.034 s
% 0.32/0.40  % Vampire exiting
%------------------------------------------------------------------------------