↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n015.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:38:34 AM UTC 2026

% Result   : Theorem 0.21s 0.28s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :  129 (  31 equ;   0 cnn)
%            Maximal formula atoms :    3 (   6 avg)
%            Number of connectives :  121 (   8   ~;  16   |;  16   &;  71   @)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   3 con; 0-4 aty)
%            Number of variables   :   31 (  20   ^;  10   !;   1   ?;  31   :)

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

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

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

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

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

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

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

thf(f1,conjecture,
    ( ( ( ^ [X0: $i] :
            ( ( cS @ X0 )
            | ( cR @ X0 ) ) )
      = ( ^ [X1: $i] :
            ( ( cR @ X1 )
            & ( cS @ X1 ) ) ) )
   => ! [X1: $i] :
        ( ( cR @ X1 )
       => ( cS @ X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM39_pme) ).

thf(f2,negated_conjecture,
    ~ ( ( ( ^ [X0: $i] :
              ( ( cS @ X0 )
              | ( cR @ X0 ) ) )
        = ( ^ [X1: $i] :
              ( ( cR @ X1 )
              & ( cS @ X1 ) ) ) )
     => ! [X1: $i] :
          ( ( cR @ X1 )
         => ( cS @ X1 ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ( ( ( ^ [X0: $i] :
              ( ( cS @ X0 )
              | ( cR @ X0 ) ) )
        = ( ^ [X1: $i] :
              ( ( cR @ X1 )
              & ( cS @ X1 ) ) ) )
     => ! [X2: $i] :
          ( ( cR @ X2 )
         => ( cS @ X2 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ( ( ( ^ [Y0: $i] :
              ( ( cS @ Y0 )
              & ( cR @ Y0 ) ) )
        = ( ^ [Y0: $i] :
              ( ( cR @ Y0 )
              | ( cS @ Y0 ) ) ) )
     => ! [X2: $i] :
          ( ( $true
            = ( cR @ X2 ) )
         => ( $true
            = ( cS @ X2 ) ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ~ ( ( ( ^ [Y0: $i] :
              ( ( cS @ Y0 )
              & ( cR @ Y0 ) ) )
        = ( ^ [Y0: $i] :
              ( ( cR @ Y0 )
              | ( cS @ Y0 ) ) ) )
     => ! [X0: $i] :
          ( ( ( cR @ X0 )
            = $true )
         => ( ( cS @ X0 )
            = $true ) ) ),
    inference(rectify,[],[f4]) ).

thf(f6,plain,
    ( ( ( ^ [Y0: $i] :
            ( ( cS @ Y0 )
            & ( cR @ Y0 ) ) )
      = ( ^ [Y0: $i] :
            ( ( cR @ Y0 )
            | ( cS @ Y0 ) ) ) )
    & ? [X0: $i] :
        ( ( ( cS @ X0 )
         != $true )
        & ( ( cR @ X0 )
          = $true ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f7,plain,
    ( ( ( ^ [Y0: $i] :
            ( ( cS @ Y0 )
            & ( cR @ Y0 ) ) )
      = ( ^ [Y0: $i] :
            ( ( cR @ Y0 )
            | ( cS @ Y0 ) ) ) )
    & ( $true
     != ( cS @ sK0 ) )
    & ( $true
      = ( cR @ sK0 ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f6]) ).

thf(f8,plain,
    ( $true
    = ( cR @ sK0 ) ),
    inference(cnf_transformation,[],[f7]) ).

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

thf(f10,plain,
    ( ( ^ [Y0: $i] :
          ( ( cS @ Y0 )
          & ( cR @ Y0 ) ) )
    = ( ^ [Y0: $i] :
          ( ( cR @ Y0 )
          | ( cS @ Y0 ) ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f13,plain,
    ! [X1: $i] :
      ( ( ^ [Y0: $i] :
            ( ( cR @ Y0 )
            | ( cS @ Y0 ) )
        @ X1 )
      = ( ^ [Y0: $i] :
            ( ( cS @ Y0 )
            & ( cR @ Y0 ) )
        @ X1 ) ),
    inference(argument_congruence,[],[f10]) ).

thf(f15,plain,
    ! [X1: $i] :
      ( ( $true
        = ( ^ [Y0: $i] :
              ( ( cS @ Y0 )
              & ( cR @ Y0 ) )
          @ X1 ) )
      | ( ( ^ [Y0: $i] :
              ( ( cR @ Y0 )
              | ( cS @ Y0 ) )
          @ X1 )
        = $false ) ),
    inference(iff_proxy_clausification,[],[f13]) ).

thf(f16,plain,
    ! [X1: $i] :
      ( ( ( ( cR @ X1 )
          | ( cS @ X1 ) )
        = $false )
      | ( $true
        = ( ( cS @ X1 )
          & ( cR @ X1 ) ) ) ),
    inference(beta-eta_normalization,[],[f15]) ).

thf(f18,plain,
    ! [X1: $i] :
      ( ( ( cR @ X1 )
        = $false )
      | ( $true
        = ( ( cS @ X1 )
          & ( cR @ X1 ) ) ) ),
    inference(or_proxy_clausification,[],[f16]) ).

thf(f20,plain,
    ! [X1: $i] :
      ( ( ( cS @ X1 )
        = $true )
      | ( ( cR @ X1 )
        = $false ) ),
    inference(and_proxy_clausification,[],[f18]) ).

thf(f26,plain,
    ( ( ( cR @ sK0 )
      = $false )
    | ( $true != $true ) ),
    inference(constrained_superposition,[],[f9,f20]) ).

thf(f27,plain,
    ( ( cR @ sK0 )
    = $false ),
    inference(trivial_inequality_removal,[],[f26]) ).

thf(f28,plain,
    $true = $false,
    inference(forward_demodulation,[],[f27,f8]) ).

thf(f29,plain,
    $false,
    inference(trivial_inequality_removal,[],[f28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV393^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19  % Computer : n015.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 15:47:18 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.24  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.28  % (3692331)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28  % (3692341)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2212744108:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.28  % (3692341) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3692331-3692341"...
% 0.21/0.28  % (3692341)...printing done.
% 0.21/0.28  % (3692341)Refutation found. Thanks to Tanya!
% 0.21/0.28  % SZS status Theorem for theBenchmark
% 0.21/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28  % (3692341)------------------------------
% 0.21/0.28  % (3692341)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28  % (3692341)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28  % (3692341)CaDiCaL version: 2.1.3
% 0.21/0.28  % (3692341)Termination reason: Refutation
% 0.21/0.28  % (3692341)Time elapsed: 0.001 s
% 0.21/0.28  % (3692341)Peak memory usage: 12 MB
% 0.21/0.28  % (3692341)Instructions burned: 2 (million)
% 0.21/0.28  % (3692331)Success in time 0.028 s
% 0.21/0.28  % Vampire exiting
%------------------------------------------------------------------------------