↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n020.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:23:19 AM UTC 2026

% Result   : Theorem 0.23s 0.30s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   57 (  12 unt;   0 typ;   5 def)
%            Number of atoms       :  260 (  71 equ;   0 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :  262 (  47   ~;  51   |;  43   &; 106   @)
%                                         (   5 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   24 (  24   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  13 usr;   8 con; 0-4 aty)
%            Number of variables   :   95 (  28 sgn  30   !;   9   ?;  95   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    a: $tType ).

thf(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

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

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

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

thf(func_def_6,type,
    sK0: a > $o ).

thf(func_def_7,type,
    sK1: a > $o ).

thf(func_def_8,type,
    sK2: a > $o ).

thf(func_def_10,type,
    sK4: a ).

thf(f1,conjecture,
    ! [X1: a > $o,X2: a > $o,X0: a > $o] :
      ( ( ( ( ^ [X3: a] :
                ( ( X2 @ X3 )
                & ( X1 @ X3 ) ) )
          = ( ^ [X3: a] : $false ) )
        & ! [X3: a] :
            ( ( X0 @ X3 )
           => ( X1 @ X3 ) ) )
     => ( ( ^ [X3: a] : $false )
        = ( ^ [X3: a] :
              ( ( X0 @ X3 )
              & ( X2 @ X3 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_55_pme) ).

thf(f2,negated_conjecture,
    ~ ! [X1: a > $o,X2: a > $o,X0: a > $o] :
        ( ( ( ( ^ [X3: a] :
                  ( ( X2 @ X3 )
                  & ( X1 @ X3 ) ) )
            = ( ^ [X3: a] : $false ) )
          & ! [X3: a] :
              ( ( X0 @ X3 )
             => ( X1 @ X3 ) ) )
       => ( ( ^ [X3: a] : $false )
          = ( ^ [X3: a] :
                ( ( X0 @ X3 )
                & ( X2 @ X3 ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ( ( ^ [X3: a] :
                  ( ( X1 @ X3 )
                  & ( X0 @ X3 ) ) )
            = ( ^ [X4: a] : $false ) )
          & ! [X5: a] :
              ( ( X2 @ X5 )
             => ( X0 @ X5 ) ) )
       => ( ( ^ [X6: a] : $false )
          = ( ^ [X7: a] :
                ( ( X2 @ X7 )
                & ( X1 @ X7 ) ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ( ( ^ [Y0: a] :
                  ( ( X0 @ Y0 )
                  & ( X1 @ Y0 ) ) )
            = ( ^ [Y0: a] : $false ) )
          & ! [X5: a] :
              ( ( ( X2 @ X5 )
                = $true )
             => ( ( X0 @ X5 )
                = $true ) ) )
       => ( ( ^ [Y0: a] :
                ( ( X1 @ Y0 )
                & ( X2 @ Y0 ) ) )
          = ( ^ [Y0: a] : $false ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ~ ! [X0: a > $o,X2: a > $o,X1: a > $o] :
        ( ( ! [X3: a] :
              ( ( ( X2 @ X3 )
                = $true )
             => ( ( X0 @ X3 )
                = $true ) )
          & ( ( ^ [Y0: a] :
                  ( ( X0 @ Y0 )
                  & ( X1 @ Y0 ) ) )
            = ( ^ [Y0: a] : $false ) ) )
       => ( ( ^ [Y0: a] :
                ( ( X1 @ Y0 )
                & ( X2 @ Y0 ) ) )
          = ( ^ [Y0: a] : $false ) ) ),
    inference(rectify,[],[f4]) ).

thf(f6,plain,
    ? [X0: a > $o,X2: a > $o,X1: a > $o] :
      ( ( ( ^ [Y0: a] :
              ( ( X1 @ Y0 )
              & ( X2 @ Y0 ) ) )
       != ( ^ [Y0: a] : $false ) )
      & ! [X3: a] :
          ( ( ( X2 @ X3 )
           != $true )
          | ( ( X0 @ X3 )
            = $true ) )
      & ( ( ^ [Y0: a] :
              ( ( X0 @ Y0 )
              & ( X1 @ Y0 ) ) )
        = ( ^ [Y0: a] : $false ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f7,plain,
    ? [X2: a > $o,X0: a > $o,X1: a > $o] :
      ( ( ( ^ [Y0: a] :
              ( ( X0 @ Y0 )
              & ( X1 @ Y0 ) ) )
        = ( ^ [Y0: a] : $false ) )
      & ! [X3: a] :
          ( ( ( X2 @ X3 )
           != $true )
          | ( ( X0 @ X3 )
            = $true ) )
      & ( ( ^ [Y0: a] :
              ( ( X1 @ Y0 )
              & ( X2 @ Y0 ) ) )
       != ( ^ [Y0: a] : $false ) ) ),
    inference(flattening,[],[f6]) ).

thf(f8,plain,
    ? [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ( ( ^ [Y0: a] :
              ( ( X1 @ Y0 )
              & ( X2 @ Y0 ) ) )
        = ( ^ [Y0: a] : $false ) )
      & ! [X3: a] :
          ( ( ( X0 @ X3 )
           != $true )
          | ( ( X1 @ X3 )
            = $true ) )
      & ( ( ^ [Y0: a] :
              ( ( X2 @ Y0 )
              & ( X0 @ Y0 ) ) )
       != ( ^ [Y0: a] : $false ) ) ),
    inference(rectify,[],[f7]) ).

thf(f9,plain,
    ( ( ( ^ [Y0: a] :
            ( ( sK1 @ Y0 )
            & ( sK2 @ Y0 ) ) )
      = ( ^ [Y0: a] : $false ) )
    & ! [X3: a] :
        ( ( ( sK0 @ X3 )
         != $true )
        | ( $true
          = ( sK1 @ X3 ) ) )
    & ( ( ^ [Y0: a] :
            ( ( sK2 @ Y0 )
            & ( sK0 @ Y0 ) ) )
     != ( ^ [Y0: a] : $false ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f8]) ).

thf(f10,plain,
    ( ( ^ [Y0: a] :
          ( ( sK2 @ Y0 )
          & ( sK0 @ Y0 ) ) )
   != ( ^ [Y0: a] : $false ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f11,plain,
    ! [X3: a] :
      ( ( $true
        = ( sK1 @ X3 ) )
      | ( ( sK0 @ X3 )
       != $true ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f12,plain,
    ( ( ^ [Y0: a] :
          ( ( sK1 @ Y0 )
          & ( sK2 @ Y0 ) ) )
    = ( ^ [Y0: a] : $false ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f15,definition,
    ( spl3_1
  <=> ( ( ^ [Y0: a] :
            ( ( sK1 @ Y0 )
            & ( sK2 @ Y0 ) ) )
      = ( ^ [Y0: a] : $false ) ) ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

thf(f17,plain,
    ( ( ( ^ [Y0: a] :
            ( ( sK1 @ Y0 )
            & ( sK2 @ Y0 ) ) )
      = ( ^ [Y0: a] : $false ) )
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f15]) ).

thf(f18,plain,
    spl3_1,
    inference(avatar_split_clause,[],[f12,f15]) ).

thf(f20,definition,
    ( spl3_2
  <=> ( ( ^ [Y0: a] :
            ( ( sK2 @ Y0 )
            & ( sK0 @ Y0 ) ) )
      = ( ^ [Y0: a] : $false ) ) ),
    introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).

thf(f22,plain,
    ( ( ( ^ [Y0: a] :
            ( ( sK2 @ Y0 )
            & ( sK0 @ Y0 ) ) )
     != ( ^ [Y0: a] : $false ) )
    | spl3_2 ),
    inference(avatar_component_clause,[],[f20]) ).

thf(f23,plain,
    ~ spl3_2,
    inference(avatar_split_clause,[],[f10,f20]) ).

thf(f24,plain,
    ( ! [X1: a] :
        ( ( ^ [Y0: a] :
              ( ( sK1 @ Y0 )
              & ( sK2 @ Y0 ) )
          @ X1 )
        = ( ^ [Y0: a] : $false
          @ X1 ) )
    | ~ spl3_1 ),
    inference(argument_congruence,[],[f17]) ).

thf(f26,plain,
    ( ! [X1: a] :
        ( ( ( ^ [Y0: a] :
                ( ( sK1 @ Y0 )
                & ( sK2 @ Y0 ) )
            @ X1 )
          = $false )
        | ( $true
          = ( ^ [Y0: a] : $false
            @ X1 ) ) )
    | ~ spl3_1 ),
    inference(iff_proxy_clausification,[],[f24]) ).

thf(f27,plain,
    ( ! [X1: a] :
        ( ( $false = $true )
        | ( $false
          = ( ( sK1 @ X1 )
            & ( sK2 @ X1 ) ) ) )
    | ~ spl3_1 ),
    inference(beta-eta_normalization,[],[f26]) ).

thf(f28,plain,
    ( ! [X1: a] :
        ( ( $false
          = ( sK1 @ X1 ) )
        | ( $false = $true )
        | ( $false
          = ( sK2 @ X1 ) ) )
    | ~ spl3_1 ),
    inference(and_proxy_clausification,[],[f27]) ).

thf(f29,plain,
    ( ! [X1: a] :
        ( ( $false
          = ( sK2 @ X1 ) )
        | ( $false
          = ( sK1 @ X1 ) ) )
    | ~ spl3_1 ),
    inference(trivial_inequality_removal,[],[f28]) ).

thf(f33,plain,
    ( ( ( ^ [Y0: a] : $false
        @ sK4 )
     != ( ^ [Y0: a] :
            ( ( sK2 @ Y0 )
            & ( sK0 @ Y0 ) )
        @ sK4 ) )
    | spl3_2 ),
    inference(negative_extensionality,[],[f22]) ).

thf(f34,plain,
    ( ( ( ^ [Y0: a] :
            ( ( sK2 @ Y0 )
            & ( sK0 @ Y0 ) )
        @ sK4 )
      = $true )
    | ( ( ^ [Y0: a] : $false
        @ sK4 )
      = $true )
    | spl3_2 ),
    inference(xor_proxy_clausification,[],[f33]) ).

thf(f38,plain,
    ( ( $false = $true )
    | ( $true
      = ( ( sK2 @ sK4 )
        & ( sK0 @ sK4 ) ) )
    | spl3_2 ),
    inference(beta-eta_normalization,[],[f34]) ).

thf(f39,plain,
    ( ( $false = $true )
    | ( ( sK0 @ sK4 )
      = $true )
    | spl3_2 ),
    inference(and_proxy_clausification,[],[f38]) ).

thf(f40,plain,
    ( ( ( sK2 @ sK4 )
      = $true )
    | ( $false = $true )
    | spl3_2 ),
    inference(and_proxy_clausification,[],[f38]) ).

thf(f41,plain,
    ( ( ( sK2 @ sK4 )
      = $true )
    | spl3_2 ),
    inference(trivial_inequality_removal,[],[f40]) ).

thf(f42,plain,
    ( ( ( sK0 @ sK4 )
      = $true )
    | spl3_2 ),
    inference(trivial_inequality_removal,[],[f39]) ).

thf(f44,definition,
    ( spl3_3
  <=> ( ( sK2 @ sK4 )
      = $true ) ),
    introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).

thf(f46,plain,
    ( ( ( sK2 @ sK4 )
      = $true )
    | ~ spl3_3 ),
    inference(avatar_component_clause,[],[f44]) ).

thf(f47,plain,
    ( spl3_3
    | spl3_2 ),
    inference(avatar_split_clause,[],[f41,f20,f44]) ).

thf(f49,definition,
    ( spl3_4
  <=> ( ( sK0 @ sK4 )
      = $true ) ),
    introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).

thf(f51,plain,
    ( ( ( sK0 @ sK4 )
      = $true )
    | ~ spl3_4 ),
    inference(avatar_component_clause,[],[f49]) ).

thf(f52,plain,
    ( spl3_4
    | spl3_2 ),
    inference(avatar_split_clause,[],[f42,f20,f49]) ).

thf(f54,plain,
    ( ( ( sK1 @ sK4 )
      = $false )
    | ( $false = $true )
    | ~ spl3_1
    | ~ spl3_3 ),
    inference(superposition,[],[f29,f46]) ).

thf(f55,plain,
    ( ( ( sK1 @ sK4 )
      = $false )
    | ~ spl3_1
    | ~ spl3_3 ),
    inference(trivial_inequality_removal,[],[f54]) ).

thf(f58,definition,
    ( spl3_5
  <=> ( ( sK1 @ sK4 )
      = $false ) ),
    introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition]) ).

thf(f60,plain,
    ( ( ( sK1 @ sK4 )
      = $false )
    | ~ spl3_5 ),
    inference(avatar_component_clause,[],[f58]) ).

thf(f61,plain,
    ( spl3_5
    | ~ spl3_1
    | ~ spl3_3 ),
    inference(avatar_split_clause,[],[f55,f44,f15,f58]) ).

thf(f62,plain,
    ( ( $false = $true )
    | ( ( sK0 @ sK4 )
     != $true )
    | ~ spl3_5 ),
    inference(superposition,[],[f60,f11]) ).

thf(f65,plain,
    ( ( ( sK0 @ sK4 )
     != $true )
    | ~ spl3_5 ),
    inference(trivial_inequality_removal,[],[f62]) ).

thf(f68,plain,
    ( $false
    | ~ spl3_4
    | ~ spl3_5 ),
    inference(forward_subsumption_resolution,[],[f65,f51]) ).

thf(f69,plain,
    ( ~ spl3_4
    | ~ spl3_5 ),
    inference(avatar_contradiction_clause,[],[f68]) ).

cnf(s1,plain,
    spl3_1,
    inference(sat_conversion,[],[f18]) ).

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

cnf(s3,plain,
    ( spl3_2
    | spl3_3 ),
    inference(sat_conversion,[],[f47]) ).

cnf(s4,plain,
    ( spl3_2
    | spl3_4 ),
    inference(sat_conversion,[],[f52]) ).

cnf(s5,plain,
    ( ~ spl3_1
    | ~ spl3_3
    | spl3_5 ),
    inference(sat_conversion,[],[f61]) ).

cnf(s8,plain,
    ( ~ spl3_4
    | ~ spl3_5 ),
    inference(sat_conversion,[],[f69]) ).

cnf(s9,plain,
    spl3_4,
    inference(rat,[],[s4,s2]) ).

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

cnf(s11,plain,
    ~ spl3_5,
    inference(rat,[],[s8,s9]) ).

cnf(s12,plain,
    ~ spl3_1,
    inference(rat,[],[s5,s11,s10]) ).

cnf(s13,plain,
    $false,
    inference(rat,[],[s1,s12]) ).

thf(f70,plain,
    $false,
    inference(avatar_sat_refutation,[],[s13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET596^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.20  % Computer : n020.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Tue Sep 29 13:39:19 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24  Running higher-order theorem proving
% 0.08/0.25  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.23/0.30  % (1060832)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.23/0.30  % (1060852)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=220339362:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.23/0.30  % (1060852) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1060832-1060852"...
% 0.23/0.30  % (1060852)...printing done.
% 0.23/0.30  % (1060855)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.23/0.30  % (1060855)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.23/0.30  % (1060852)Refutation found. Thanks to Tanya!
% 0.23/0.30  % SZS status Theorem for theBenchmark
% 0.23/0.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.30  % (1060852)------------------------------
% 0.23/0.30  % (1060852)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.30  % (1060852)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.30  % (1060852)CaDiCaL version: 2.1.3
% 0.23/0.30  % (1060852)Termination reason: Refutation
% 0.23/0.30  % (1060852)Time elapsed: 0.002 s
% 0.23/0.30  % (1060852)Peak memory usage: 13 MB
% 0.23/0.30  % (1060852)Instructions burned: 4 (million)
% 0.23/0.30  % (1060832)Success in time 0.035 s
% 0.23/0.30  % Vampire exiting
%------------------------------------------------------------------------------