↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n010.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:41:47 AM UTC 2026

% Result   : Theorem 0.21s 0.27s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   19 (  19 unt;   0 typ;   0 def)
%            Number of atoms       :   62 (  15 equ;   0 cnn)
%            Maximal formula atoms :    1 (   3 avg)
%            Number of connectives :   63 (   8   ~;   0   |;   0   &;  43   @)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (  11   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  11 usr;   4 con; 0-4 aty)
%                                         (   4  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   22 (  15   ^;   6   !;   1   ?;  22   :)

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

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

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

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

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

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

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

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

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

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

thf(f1,axiom,
    ( leibeq
    = ( ^ [X0: $i,X1: $i] :
        ! [X2: $i > $o] :
          ( ( X2 @ X0 )
         => ( X2 @ X1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',leibeq) ).

thf(f2,conjecture,
    ! [X0: $i] : ( leibeq @ X0 @ X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

thf(f3,negated_conjecture,
    ~ ! [X0: $i] : ( leibeq @ X0 @ X0 ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

thf(f4,plain,
    ( leibeq
    = ( ^ [X0: $i,X1: $i] :
        ! [X2: $i > $o] :
          ( ( X2 @ X0 )
         => ( X2 @ X1 ) ) ) ),
    inference(rectify,[],[f1]) ).

thf(f5,plain,
    ( leibeq
    = ( ^ [Y0: $i,Y1: $i] :
          ( !! @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ( Y2 @ Y0 )
             => ( Y2 @ Y1 ) ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f6,plain,
    ~ ! [X0: $i] : ( leibeq @ X0 @ X0 ),
    inference(rectify,[],[f3]) ).

thf(f7,plain,
    ~ ! [X0: $i] :
        ( ( leibeq @ X0 @ X0 )
        = $true ),
    inference(fool_elimination,[],[f6]) ).

thf(f8,plain,
    ? [X0: $i] :
      ( ( leibeq @ X0 @ X0 )
     != $true ),
    inference(ennf_transformation,[],[f7]) ).

thf(f9,plain,
    ( ( leibeq @ sK0 @ sK0 )
   != $true ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f8]) ).

thf(f10,plain,
    ( ( leibeq @ sK0 @ sK0 )
   != $true ),
    inference(cnf_transformation,[],[f9]) ).

thf(f11,plain,
    ( leibeq
    = ( ^ [Y0: $i,Y1: $i] :
          ( !! @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ( Y2 @ Y0 )
             => ( Y2 @ Y1 ) ) ) ) ),
    inference(cnf_transformation,[],[f5]) ).

thf(f14,plain,
    ( ( ^ [Y0: $i,Y1: $i] :
          ( !! @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ( Y2 @ Y0 )
             => ( Y2 @ Y1 ) ) )
      @ sK0
      @ sK0 )
   != $true ),
    inference(definition_unfolding,[],[f10,f11]) ).

thf(f15,plain,
    ( ( !! @ ( $i > $o )
      @ ^ [Y0: $i > $o] :
          ( ( Y0 @ sK0 )
         => ( Y0 @ sK0 ) ) )
   != $true ),
    inference(beta-eta_normalization,[],[f14]) ).

thf(f16,plain,
    ( ( ^ [Y0: $i > $o] :
          ( ( Y0 @ sK0 )
         => ( Y0 @ sK0 ) )
      @ sK1 )
    = $false ),
    inference(sigma_proxy_clausification,[],[f15]) ).

thf(f17,plain,
    ( ( ( sK1 @ sK0 )
     => ( sK1 @ sK0 ) )
    = $false ),
    inference(beta-eta_normalization,[],[f16]) ).

thf(f18,plain,
    ( ( sK1 @ sK0 )
    = $false ),
    inference(imp_proxy_clausification,[],[f17]) ).

thf(f19,plain,
    ( ( sK1 @ sK0 )
    = $true ),
    inference(imp_proxy_clausification,[],[f17]) ).

thf(f20,plain,
    $false = $true,
    inference(forward_demodulation,[],[f18,f19]) ).

thf(f21,plain,
    $false,
    inference(trivial_inequality_removal,[],[f20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN998^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18  % Computer : n010.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Tue Sep 29 16:20:48 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running higher-order theorem proving
% 0.09/0.23  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.21/0.27  % (3069034)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.27  % (3069039)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2084387096:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.27  % (3069039) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3069034-3069039"...
% 0.21/0.27  % (3069039)...printing done.
% 0.21/0.27  % (3069039)Refutation found. Thanks to Tanya!
% 0.21/0.27  % SZS status Theorem for theBenchmark
% 0.21/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.27  % (3069039)------------------------------
% 0.21/0.27  % (3069039)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27  % (3069039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27  % (3069039)CaDiCaL version: 2.1.3
% 0.21/0.27  % (3069039)Termination reason: Refutation
% 0.21/0.27  % (3069039)Time elapsed: 0.001 s
% 0.21/0.27  % (3069039)Peak memory usage: 12 MB
% 0.21/0.27  % (3069039)Instructions burned: 1 (million)
% 0.21/0.27  % (3069034)Success in time 0.025 s
% 0.21/0.27  % Vampire exiting
%------------------------------------------------------------------------------