↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEU549^2 : 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 : n017.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:30:01 AM UTC 2026

% Result   : Theorem 0.24s 0.29s
% Output   : Refutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   31 (  19 unt;   0 typ;   0 def)
%            Number of atoms       :  162 (  61 equ;   0 cnn)
%            Maximal formula atoms :    4 (   5 avg)
%            Number of connectives :  149 (   8   ~;   4   |;  17   &;  83   @)
%                                         (   0 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   21 (  16 usr;   7 con; 0-4 aty)
%                                         (   7  !!;   4  ??;   0 @@+;   0 @@-)
%            Number of variables   :   57 (  28   ^;  21   !;   8   ?;  57   :)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

thf(f3,negated_conjecture,
    ~ ! [X0: $i > $o] :
        ( ( exu
          @ ^ [X1: $i] : ( X0 @ X1 ) )
       => ! [X1: $i,X2: $i] :
            ( ( X0 @ X1 )
           => ( ( X0 @ X2 )
             => ( X1 = X2 ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

thf(f4,plain,
    ~ ! [X0: $i > $o] :
        ( ( exu
          @ ^ [X1: $i] : ( X0 @ X1 ) )
       => ! [X2: $i,X3: $i] :
            ( ( X0 @ X2 )
           => ( ( X0 @ X3 )
             => ( X2 = X3 ) ) ) ),
    inference(rectify,[],[f3]) ).

thf(f5,plain,
    ~ ! [X0: $i > $o] :
        ( ( ( exu
            @ ^ [Y0: $i] : ( X0 @ Y0 ) )
          = $true )
       => ! [X2: $i,X3: $i] :
            ( ( ( X0 @ X2 )
              = $true )
           => ( ( $true
                = ( X0 @ X3 ) )
             => ( X2 = X3 ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f6,plain,
    ( exu
    = ( ^ [X0: $i > $o] :
        ? [X1: $i] :
          ( ( X0 @ X1 )
          & ! [X2: $i] :
              ( ( X0 @ X2 )
             => ( X1 = X2 ) ) ) ) ),
    inference(rectify,[],[f1]) ).

thf(f7,plain,
    ( exu
    = ( ^ [Y0: $i > $o] :
          ( ?? @ $i
          @ ^ [Y1: $i] :
              ( ( !! @ $i
                @ ^ [Y2: $i] :
                    ( ( Y0 @ Y2 )
                   => ( Y1 = Y2 ) ) )
              & ( Y0 @ Y1 ) ) ) ) ),
    inference(fool_elimination,[],[f6]) ).

thf(f8,plain,
    ~ ! [X0: $i > $o] :
        ( ( ( exu
            @ ^ [Y0: $i] : ( X0 @ Y0 ) )
          = $true )
       => ! [X2: $i,X1: $i] :
            ( ( ( X0 @ X1 )
              = $true )
           => ( ( ( X0 @ X2 )
                = $true )
             => ( X1 = X2 ) ) ) ),
    inference(rectify,[],[f5]) ).

thf(f9,plain,
    ? [X0: $i > $o] :
      ( ? [X2: $i,X1: $i] :
          ( ( X1 != X2 )
          & ( ( X0 @ X2 )
            = $true )
          & ( ( X0 @ X1 )
            = $true ) )
      & ( ( exu
          @ ^ [Y0: $i] : ( X0 @ Y0 ) )
        = $true ) ),
    inference(ennf_transformation,[],[f8]) ).

thf(f10,plain,
    ? [X0: $i > $o] :
      ( ? [X1: $i,X2: $i] :
          ( ( ( X0 @ X2 )
            = $true )
          & ( X1 != X2 )
          & ( ( X0 @ X1 )
            = $true ) )
      & ( ( exu
          @ ^ [Y0: $i] : ( X0 @ Y0 ) )
        = $true ) ),
    inference(flattening,[],[f9]) ).

thf(f11,plain,
    ( ( ( sK0 @ sK2 )
      = $true )
    & ( sK2 != sK1 )
    & ( $true
      = ( sK0 @ sK1 ) )
    & ( ( exu
        @ ^ [Y0: $i] : ( sK0 @ Y0 ) )
      = $true ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f10]) ).

thf(f12,plain,
    ( ( exu
      @ ^ [Y0: $i] : ( sK0 @ Y0 ) )
    = $true ),
    inference(cnf_transformation,[],[f11]) ).

thf(f13,plain,
    ( $true
    = ( sK0 @ sK1 ) ),
    inference(cnf_transformation,[],[f11]) ).

thf(f14,plain,
    sK2 != sK1,
    inference(cnf_transformation,[],[f11]) ).

thf(f15,plain,
    ( ( sK0 @ sK2 )
    = $true ),
    inference(cnf_transformation,[],[f11]) ).

thf(f16,plain,
    ( exu
    = ( ^ [Y0: $i > $o] :
          ( ?? @ $i
          @ ^ [Y1: $i] :
              ( ( !! @ $i
                @ ^ [Y2: $i] :
                    ( ( Y0 @ Y2 )
                   => ( Y1 = Y2 ) ) )
              & ( Y0 @ Y1 ) ) ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f19,plain,
    ( ( ^ [Y0: $i > $o] :
          ( ?? @ $i
          @ ^ [Y1: $i] :
              ( ( !! @ $i
                @ ^ [Y2: $i] :
                    ( ( Y0 @ Y2 )
                   => ( Y1 = Y2 ) ) )
              & ( Y0 @ Y1 ) ) )
      @ ^ [Y0: $i] : ( sK0 @ Y0 ) )
    = $true ),
    inference(definition_unfolding,[],[f12,f16]) ).

thf(f20,plain,
    ( ( ?? @ $i
      @ ^ [Y0: $i] :
          ( ( !! @ $i
            @ ^ [Y1: $i] :
                ( ( sK0 @ Y1 )
               => ( Y0 = Y1 ) ) )
          & ( sK0 @ Y0 ) ) )
    = $true ),
    inference(beta-eta_normalization,[],[f19]) ).

thf(f21,plain,
    ( ( ^ [Y0: $i] :
          ( ( !! @ $i
            @ ^ [Y1: $i] :
                ( ( sK0 @ Y1 )
               => ( Y0 = Y1 ) ) )
          & ( sK0 @ Y0 ) )
      @ sK3 )
    = $true ),
    inference(sigma_proxy_clausification,[],[f20]) ).

thf(f22,plain,
    ( $true
    = ( ( !! @ $i
        @ ^ [Y0: $i] :
            ( ( sK0 @ Y0 )
           => ( sK3 = Y0 ) ) )
      & ( sK0 @ sK3 ) ) ),
    inference(beta-eta_normalization,[],[f21]) ).

thf(f24,plain,
    ( ( !! @ $i
      @ ^ [Y0: $i] :
          ( ( sK0 @ Y0 )
         => ( sK3 = Y0 ) ) )
    = $true ),
    inference(and_proxy_clausification,[],[f22]) ).

thf(f25,plain,
    ! [X1: $i] :
      ( ( ^ [Y0: $i] :
            ( ( sK0 @ Y0 )
           => ( sK3 = Y0 ) )
        @ X1 )
      = $true ),
    inference(pi_proxy_clausification,[],[f24]) ).

thf(f26,plain,
    ! [X1: $i] :
      ( ( ( sK0 @ X1 )
       => ( sK3 = X1 ) )
      = $true ),
    inference(beta-eta_normalization,[],[f25]) ).

thf(f27,plain,
    ! [X1: $i] :
      ( ( $false
        = ( sK0 @ X1 ) )
      | ( $true
        = ( sK3 = X1 ) ) ),
    inference(imp_proxy_clausification,[],[f26]) ).

thf(f28,plain,
    ! [X1: $i] :
      ( ( $false
        = ( sK0 @ X1 ) )
      | ( sK3 = X1 ) ),
    inference(equality_proxy_clausification,[],[f27]) ).

thf(f29,plain,
    ( ( sK3 = sK1 )
    | ( $false = $true ) ),
    inference(constrained_superposition,[],[f28,f13]) ).

thf(f30,plain,
    ( ( sK2 = sK3 )
    | ( $false = $true ) ),
    inference(constrained_superposition,[],[f28,f15]) ).

thf(f33,plain,
    sK3 = sK1,
    inference(trivial_inequality_removal,[],[f29]) ).

thf(f34,plain,
    sK2 = sK3,
    inference(trivial_inequality_removal,[],[f30]) ).

thf(f37,plain,
    sK2 = sK1,
    inference(forward_demodulation,[],[f34,f33]) ).

thf(f39,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f37,f14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU549^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20  % Computer : n017.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:45:07 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.24  Running higher-order theorem proving
% 0.08/0.25  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.24/0.29  % (364313)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.24/0.29  % (364318)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3859386584:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.24/0.29  % (364318) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-364313-364318"...
% 0.24/0.29  % (364318)...printing done.
% 0.24/0.29  % (364318)Refutation found. Thanks to Tanya!
% 0.24/0.29  % SZS status Theorem for theBenchmark
% 0.24/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.29  % (364318)------------------------------
% 0.24/0.29  % (364318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.29  % (364318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.29  % (364318)CaDiCaL version: 2.1.3
% 0.24/0.29  % (364318)Termination reason: Refutation
% 0.24/0.29  % (364318)Time elapsed: 0.002 s
% 0.24/0.29  % (364318)Peak memory usage: 12 MB
% 0.24/0.29  % (364318)Instructions burned: 3 (million)
% 0.24/0.29  % (364313)Success in time 0.028 s
% 0.24/0.29  % Vampire exiting
%------------------------------------------------------------------------------