↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 0.23s 0.27s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   99 (  42 equ;   0 cnn)
%            Maximal formula atoms :    7 (   7 avg)
%            Number of connectives :  134 (  22   ~;  14   |;  20   &;  62   @)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   21 (  21   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   45 (   0   ^;  33   !;  12   ?;  45   :)

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

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

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

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

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

thf(func_def_6,type,
    sK3: a ).

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

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

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

thf(f4,plain,
    ~ ! [X0: a > $o,X2: a > $o,X1: a > $o] :
        ( ( ! [X4: a] :
              ( ( $true
                = ( X0 @ X4 ) )
             => ( ( X1 @ X4 )
                = $true ) )
          & ! [X3: a] :
              ( ( ( X0 @ X3 )
                = $true )
             => ( ( X2 @ X3 )
                = $true ) ) )
       => ! [X5: a] :
            ( ( ( X0 @ X5 )
              = $true )
           => ( ( ( X1 @ X5 )
                = $true )
              | ( ( X2 @ X5 )
                = $true ) ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ? [X0: a > $o,X2: a > $o,X1: a > $o] :
      ( ? [X5: a] :
          ( ( ( X1 @ X5 )
           != $true )
          & ( ( X2 @ X5 )
           != $true )
          & ( ( X0 @ X5 )
            = $true ) )
      & ! [X4: a] :
          ( ( $true
           != ( X0 @ X4 ) )
          | ( ( X1 @ X4 )
            = $true ) )
      & ! [X3: a] :
          ( ( ( X2 @ X3 )
            = $true )
          | ( ( X0 @ X3 )
           != $true ) ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ? [X1: a > $o,X0: a > $o,X2: a > $o] :
      ( ! [X4: a] :
          ( ( $true
           != ( X0 @ X4 ) )
          | ( ( X1 @ X4 )
            = $true ) )
      & ? [X5: a] :
          ( ( ( X2 @ X5 )
           != $true )
          & ( ( X0 @ X5 )
            = $true )
          & ( ( X1 @ X5 )
           != $true ) )
      & ! [X3: a] :
          ( ( ( X2 @ X3 )
            = $true )
          | ( ( X0 @ X3 )
           != $true ) ) ),
    inference(flattening,[],[f5]) ).

thf(f7,plain,
    ? [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ! [X3: a] :
          ( ( ( X1 @ X3 )
           != $true )
          | ( ( X0 @ X3 )
            = $true ) )
      & ? [X4: a] :
          ( ( ( X2 @ X4 )
           != $true )
          & ( ( X1 @ X4 )
            = $true )
          & ( $true
           != ( X0 @ X4 ) ) )
      & ! [X5: a] :
          ( ( ( X2 @ X5 )
            = $true )
          | ( ( X1 @ X5 )
           != $true ) ) ),
    inference(rectify,[],[f6]) ).

thf(f8,plain,
    ( ! [X3: a] :
        ( ( ( sK1 @ X3 )
         != $true )
        | ( $true
          = ( sK0 @ X3 ) ) )
    & ( $true
     != ( sK2 @ sK3 ) )
    & ( ( sK1 @ sK3 )
      = $true )
    & ( ( sK0 @ sK3 )
     != $true )
    & ! [X5: a] :
        ( ( ( sK2 @ X5 )
          = $true )
        | ( ( sK1 @ X5 )
         != $true ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X4,sK3)],[f7]) ).

thf(f9,plain,
    ! [X5: a] :
      ( ( ( sK1 @ X5 )
       != $true )
      | ( ( sK2 @ X5 )
        = $true ) ),
    inference(cnf_transformation,[],[f8]) ).

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

thf(f12,plain,
    ( $true
   != ( sK2 @ sK3 ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f16,plain,
    ( ( $true != $true )
    | ( $true
      = ( sK2 @ sK3 ) ) ),
    inference(constrained_superposition,[],[f9,f11]) ).

thf(f17,plain,
    ( $true
    = ( sK2 @ sK3 ) ),
    inference(trivial_inequality_removal,[],[f16]) ).

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

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