↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEU561^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 : n004.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:04 AM UTC 2026

% Result   : Theorem 0.09s 0.27s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   21 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :  110 (  28 equ;   0 cnn)
%            Maximal formula atoms :    3 (   5 avg)
%            Number of connectives :   98 (   9   ~;   0   |;   6   &;  63   @)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   19 (  15 usr;   7 con; 0-4 aty)
%                                         (   4  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   29 (  15   ^;  10   !;   4   ?;  29   :)

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

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

thf(func_def_1,type,
    subset: $i > $i > $o ).

thf(func_def_3,type,
    subsetI1: $o ).

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

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

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

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

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

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

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

thf(func_def_15,type,
    sK2: $i > $i > $i ).

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

thf(f3,conjecture,
    ( subsetI1
   => ! [X0: $i,X1: $i] :
        ( ( X0 = X1 )
       => ( subset @ X0 @ X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',eqimpsubset1) ).

thf(f4,negated_conjecture,
    ~ ( subsetI1
     => ! [X0: $i,X1: $i] :
          ( ( X0 = X1 )
         => ( subset @ X0 @ X1 ) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f5,plain,
    ( ( ^ [X0: $i,X1: $i] :
        ! [X2: $i] :
          ( ( in @ X2 @ X0 )
         => ( in @ X2 @ X1 ) ) )
    = subset ),
    inference(rectify,[],[f1]) ).

thf(f6,plain,
    ( subset
    = ( ^ [Y0: $i,Y1: $i] :
          ( !! @ $i
          @ ^ [Y2: $i] :
              ( ( in @ Y2 @ Y0 )
             => ( in @ Y2 @ Y1 ) ) ) ) ),
    inference(fool_elimination,[],[f5]) ).

thf(f9,plain,
    ~ ( subsetI1
     => ! [X0: $i,X1: $i] :
          ( ( X0 = X1 )
         => ( subset @ X0 @ X1 ) ) ),
    inference(rectify,[],[f4]) ).

thf(f10,plain,
    ~ ( ( subsetI1 = $true )
     => ! [X0: $i,X1: $i] :
          ( ( X0 = X1 )
         => ( ( subset @ X0 @ X1 )
            = $true ) ) ),
    inference(fool_elimination,[],[f9]) ).

thf(f11,plain,
    ( ? [X1: $i,X0: $i] :
        ( ( X0 = X1 )
        & ( ( subset @ X0 @ X1 )
         != $true ) )
    & ( subsetI1 = $true ) ),
    inference(ennf_transformation,[],[f10]) ).

thf(f12,plain,
    ( ? [X0: $i,X1: $i] :
        ( ( X0 = X1 )
        & ( ( subset @ X1 @ X0 )
         != $true ) )
    & ( subsetI1 = $true ) ),
    inference(rectify,[],[f11]) ).

thf(f13,plain,
    ( ( sK1 = sK0 )
    & ( $true
     != ( subset @ sK1 @ sK0 ) )
    & ( subsetI1 = $true ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f12]) ).

thf(f14,plain,
    ( subset
    = ( ^ [Y0: $i,Y1: $i] :
          ( !! @ $i
          @ ^ [Y2: $i] :
              ( ( in @ Y2 @ Y0 )
             => ( in @ Y2 @ Y1 ) ) ) ) ),
    inference(cnf_transformation,[],[f6]) ).

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

thf(f17,plain,
    sK1 = sK0,
    inference(cnf_transformation,[],[f13]) ).

thf(f21,plain,
    ( $true
   != ( ^ [Y0: $i,Y1: $i] :
          ( !! @ $i
          @ ^ [Y2: $i] :
              ( ( in @ Y2 @ Y0 )
             => ( in @ Y2 @ Y1 ) ) )
      @ sK0
      @ sK0 ) ),
    inference(definition_unfolding,[],[f16,f14,f17]) ).

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

thf(f36,plain,
    ( $false
    = ( ^ [Y0: $i] :
          ( ( in @ Y0 @ sK0 )
         => ( in @ Y0 @ sK0 ) )
      @ sK3 ) ),
    inference(sigma_proxy_clausification,[],[f35]) ).

thf(f37,plain,
    ( $false
    = ( ( in @ sK3 @ sK0 )
     => ( in @ sK3 @ sK0 ) ) ),
    inference(beta-eta_normalization,[],[f36]) ).

thf(f38,plain,
    ( ( in @ sK3 @ sK0 )
    = $false ),
    inference(imp_proxy_clausification,[],[f37]) ).

thf(f39,plain,
    ( ( in @ sK3 @ sK0 )
    = $true ),
    inference(imp_proxy_clausification,[],[f37]) ).

thf(f41,plain,
    $false = $true,
    inference(constrained_superposition,[],[f38,f39]) ).

thf(f42,plain,
    $false,
    inference(trivial_inequality_removal,[],[f41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU561^2 : 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 : n004.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 13:50:07 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.09/0.27  % (1319485)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.09/0.27  % (1319491)lrs+10_16_si=on:nwc=1.5:random_seed=1719230848:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.09/0.27  % (1319491) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1319485-1319491"...
% 0.09/0.27  % (1319491)...printing done.
% 0.09/0.27  % (1319491)Refutation found. Thanks to Tanya!
% 0.09/0.27  % SZS status Theorem for theBenchmark
% 0.09/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.27  % (1319491)------------------------------
% 0.09/0.27  % (1319491)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.27  % (1319491)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.27  % (1319491)CaDiCaL version: 2.1.3
% 0.09/0.27  % (1319491)Termination reason: Refutation
% 0.09/0.27  % (1319491)Time elapsed: 0.001 s
% 0.09/0.27  % (1319491)Peak memory usage: 12 MB
% 0.09/0.27  % (1319491)Instructions burned: 2 (million)
% 0.09/0.27  % (1319485)Success in time 0.027 s
% 0.09/0.27  % Vampire exiting
%------------------------------------------------------------------------------