↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 0.24s 0.35s
% Output   : Refutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :  103 (  42 equ;   0 cnn)
%            Maximal formula atoms :    6 (   6 avg)
%            Number of connectives :  110 (  19   ~;  10   |;  17   &;  52   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   28 (   0   ^;  16   !;  12   ?;  28   :)

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

thf(type_def_6,type,
    a: $tType ).

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

thf(func_def_0,type,
    cF: b > a ).

thf(func_def_1,type,
    cV: b > $o ).

thf(func_def_2,type,
    cU: b > $o ).

thf(func_def_6,type,
    sK0: a ).

thf(func_def_7,type,
    sK1: b ).

thf(f1,conjecture,
    ( ! [X0: b] :
        ( ( cU @ X0 )
       => ( cV @ X0 ) )
   => ! [X0: a] :
        ( ? [X1: b] :
            ( ( X0
              = ( cF @ X1 ) )
            & ( cU @ X1 ) )
       => ? [X1: b] :
            ( ( X0
              = ( cF @ X1 ) )
            & ( cV @ X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM30A_pme) ).

thf(f2,negated_conjecture,
    ~ ( ! [X0: b] :
          ( ( cU @ X0 )
         => ( cV @ X0 ) )
     => ! [X0: a] :
          ( ? [X1: b] :
              ( ( X0
                = ( cF @ X1 ) )
              & ( cU @ X1 ) )
         => ? [X1: b] :
              ( ( X0
                = ( cF @ X1 ) )
              & ( cV @ X1 ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ( ! [X0: b] :
          ( ( cU @ X0 )
         => ( cV @ X0 ) )
     => ! [X1: a] :
          ( ? [X2: b] :
              ( ( ( cF @ X2 )
                = X1 )
              & ( cU @ X2 ) )
         => ? [X3: b] :
              ( ( ( cF @ X3 )
                = X1 )
              & ( cV @ X3 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ( ! [X0: b] :
          ( ( ( cU @ X0 )
            = $true )
         => ( ( cV @ X0 )
            = $true ) )
     => ! [X1: a] :
          ( ? [X2: b] :
              ( ( $true
                = ( cU @ X2 ) )
              & ( ( cF @ X2 )
                = X1 ) )
         => ? [X3: b] :
              ( ( $true
                = ( cV @ X3 ) )
              & ( ( cF @ X3 )
                = X1 ) ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ( ! [X0: b] :
        ( ( ( cV @ X0 )
          = $true )
        | ( ( cU @ X0 )
         != $true ) )
    & ? [X1: a] :
        ( ! [X3: b] :
            ( ( ( cF @ X3 )
             != X1 )
            | ( $true
             != ( cV @ X3 ) ) )
        & ? [X2: b] :
            ( ( $true
              = ( cU @ X2 ) )
            & ( ( cF @ X2 )
              = X1 ) ) ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ( ! [X0: b] :
        ( ( ( cV @ X0 )
          = $true )
        | ( ( cU @ X0 )
         != $true ) )
    & ? [X1: a] :
        ( ! [X2: b] :
            ( ( ( cF @ X2 )
             != X1 )
            | ( $true
             != ( cV @ X2 ) ) )
        & ? [X3: b] :
            ( ( $true
              = ( cU @ X3 ) )
            & ( ( cF @ X3 )
              = X1 ) ) ) ),
    inference(rectify,[],[f5]) ).

thf(f7,plain,
    ( ! [X0: b] :
        ( ( ( cV @ X0 )
          = $true )
        | ( ( cU @ X0 )
         != $true ) )
    & ! [X2: b] :
        ( ( ( cF @ X2 )
         != sK0 )
        | ( $true
         != ( cV @ X2 ) ) )
    & ( ( cU @ sK1 )
      = $true )
    & ( ( cF @ sK1 )
      = sK0 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X1,sK0),skolemize(X3,sK1)],[f6]) ).

thf(f8,plain,
    ( ( cF @ sK1 )
    = sK0 ),
    inference(cnf_transformation,[],[f7]) ).

thf(f9,plain,
    ( ( cU @ sK1 )
    = $true ),
    inference(cnf_transformation,[],[f7]) ).

thf(f10,plain,
    ! [X2: b] :
      ( ( $true
       != ( cV @ X2 ) )
      | ( ( cF @ X2 )
       != sK0 ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f11,plain,
    ! [X0: b] :
      ( ( ( cU @ X0 )
       != $true )
      | ( ( cV @ X0 )
        = $true ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f14,plain,
    ( ( $true != $true )
    | ( $true
      = ( cV @ sK1 ) ) ),
    inference(constrained_superposition,[],[f11,f9]) ).

thf(f15,plain,
    ( $true
    = ( cV @ sK1 ) ),
    inference(trivial_inequality_removal,[],[f14]) ).

thf(f16,plain,
    ( ( ( cF @ sK1 )
     != sK0 )
    | ( $true != $true ) ),
    inference(constrained_superposition,[],[f10,f15]) ).

thf(f17,plain,
    ( ( cF @ sK1 )
   != sK0 ),
    inference(trivial_inequality_removal,[],[f16]) ).

thf(f18,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f17,f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SEU885^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23  % Computer : n020.cluster.edu
% 0.10/0.23  % Model    : x86_64 x86_64
% 0.10/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.23  % Memory   : 8046.5625MB
% 0.10/0.23  % OS       : Linux 6.8.0-71-generic
% 0.10/0.23  % CPULimit : 300
% 0.10/0.23  % WCLimit  : 300
% 0.10/0.23  % DateTime : Tue Sep 29 14:44:49 UTC 2026
% 0.10/0.24  % CPUTime  : 
% 0.10/0.24  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.30  Running higher-order theorem proving
% 0.24/0.31  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.24/0.35  % (1145543)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.24/0.35  % (1145550)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=190949766:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.24/0.35  % (1145550) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1145543-1145550"...
% 0.24/0.35  % (1145550)...printing done.
% 0.24/0.35  % (1145550)Refutation found. Thanks to Tanya!
% 0.24/0.35  % SZS status Theorem for theBenchmark
% 0.24/0.35  % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.35  % (1145550)------------------------------
% 0.24/0.35  % (1145550)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.35  % (1145550)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.35  % (1145550)CaDiCaL version: 2.1.3
% 0.24/0.35  % (1145550)Termination reason: Refutation
% 0.24/0.35  % (1145550)Time elapsed: 0.002 s
% 0.24/0.35  % (1145550)Peak memory usage: 12 MB
% 0.24/0.35  % (1145550)Instructions burned: 1 (million)
% 0.24/0.35  % (1145543)Success in time 0.032 s
% 0.24/0.35  % Vampire exiting
%------------------------------------------------------------------------------