↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n008.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:15 AM UTC 2026

% Result   : Theorem 0.07s 0.28s
% Output   : Refutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :   87 (  27 equ;   0 cnn)
%            Maximal formula atoms :    3 (   4 avg)
%            Number of connectives :   96 (   7   ~;  21   |;  13   &;  55   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   10 (  10   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   3 con; 0-4 aty)
%            Number of variables   :   20 (  10   ^;   8   !;   2   ?;  20   :)

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

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

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

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

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

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

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

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

thf(func_def_9,type,
    sK2: a ).

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

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

thf(f3,plain,
    ~ ! [X0: a > $o,X1: a > $o] :
        ( X1
        = ( ^ [X2: a] :
              ( ( ( X1 @ X2 )
                & ( X0 @ X2 ) )
              | ( X1 @ X2 ) ) ) ),
    inference(rectify,[],[f2]) ).

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

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

thf(f6,plain,
    ( sK1
   != ( ^ [Y0: a] :
          ( ( sK1 @ Y0 )
          | ( ( sK0 @ Y0 )
            & ( sK1 @ Y0 ) ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f5]) ).

thf(f7,plain,
    ( sK1
   != ( ^ [Y0: a] :
          ( ( sK1 @ Y0 )
          | ( ( sK0 @ Y0 )
            & ( sK1 @ Y0 ) ) ) ) ),
    inference(cnf_transformation,[],[f6]) ).

thf(f10,plain,
    ( ( sK1 @ sK2 )
   != ( ^ [Y0: a] :
          ( ( sK1 @ Y0 )
          | ( ( sK0 @ Y0 )
            & ( sK1 @ Y0 ) ) )
      @ sK2 ) ),
    inference(negative_extensionality,[],[f7]) ).

thf(f11,plain,
    ( ( ( ^ [Y0: a] :
            ( ( sK1 @ Y0 )
            | ( ( sK0 @ Y0 )
              & ( sK1 @ Y0 ) ) )
        @ sK2 )
      = $true )
    | ( ( sK1 @ sK2 )
      = $true ) ),
    inference(xor_proxy_clausification,[],[f10]) ).

thf(f12,plain,
    ( ( $false
      = ( ^ [Y0: a] :
            ( ( sK1 @ Y0 )
            | ( ( sK0 @ Y0 )
              & ( sK1 @ Y0 ) ) )
        @ sK2 ) )
    | ( $false
      = ( sK1 @ sK2 ) ) ),
    inference(xor_proxy_clausification,[],[f10]) ).

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

thf(f15,plain,
    ( ( $false
      = ( sK1 @ sK2 ) )
    | ( $false
      = ( sK1 @ sK2 ) ) ),
    inference(or_proxy_clausification,[],[f13]) ).

thf(f16,plain,
    ( $false
    = ( sK1 @ sK2 ) ),
    inference(duplicate_literal_removal,[],[f15]) ).

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

thf(f20,plain,
    ( ( $true
      = ( ( sK0 @ sK2 )
        & ( sK1 @ sK2 ) ) )
    | ( ( sK1 @ sK2 )
      = $true )
    | ( ( sK1 @ sK2 )
      = $true ) ),
    inference(or_proxy_clausification,[],[f19]) ).

thf(f21,plain,
    ( ( ( sK1 @ sK2 )
      = $true )
    | ( ( sK1 @ sK2 )
      = $true )
    | ( ( sK1 @ sK2 )
      = $true ) ),
    inference(and_proxy_clausification,[],[f20]) ).

thf(f24,plain,
    ( ( sK1 @ sK2 )
    = $true ),
    inference(duplicate_literal_removal,[],[f21]) ).

thf(f27,plain,
    $false = $true,
    inference(forward_demodulation,[],[f24,f16]) ).

thf(f28,plain,
    $false,
    inference(trivial_inequality_removal,[],[f27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET175^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19  % Computer : n008.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 13:37:54 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.23  Running higher-order theorem proving
% 0.07/0.24  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.28  % (3160189)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.07/0.28  % (3160212)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1597304575:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.07/0.28  % (3160212) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3160189-3160212"...
% 0.07/0.28  % (3160212)...printing done.
% 0.07/0.28  % (3160212)Refutation found. Thanks to Tanya!
% 0.07/0.28  % SZS status Theorem for theBenchmark
% 0.07/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.28  % (3160212)------------------------------
% 0.07/0.28  % (3160212)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.28  % (3160212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.28  % (3160212)CaDiCaL version: 2.1.3
% 0.07/0.28  % (3160212)Termination reason: Refutation
% 0.07/0.28  % (3160212)Time elapsed: 0.001 s
% 0.07/0.28  % (3160212)Peak memory usage: 12 MB
% 0.07/0.28  % (3160212)Instructions burned: 1 (million)
% 0.07/0.28  % (3160189)Success in time 0.029 s
% 0.07/0.28  % Vampire exiting
%------------------------------------------------------------------------------