↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEV179^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n014.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:37:58 AM UTC 2026

% Result   : Theorem 0.20s 0.27s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   30 (  23 unt;   0 typ;   0 def)
%            Number of atoms       :  131 (  57 equ;   0 cnn)
%            Maximal formula atoms :    2 (   4 avg)
%            Number of connectives :  268 (  39   ~;   4   |;  25   &; 181   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   70 (  70   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   18 (  14 usr;   3 con; 0-4 aty)
%                                         (   0  !!;  19  ??;   0 @@+;   0 @@-)
%            Number of variables   :   59 (  46   ^;  10   !;   3   ?;  59   :)

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

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

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

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

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

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

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

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

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

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

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

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

thf(func_def_14,type,
    sK2: $i > $o ).

thf(func_def_15,type,
    sK3: $i > $o ).

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

thf(f2,conjecture,
    ! [X0: ( $i > $o ) > $i] : ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM144C_pme) ).

thf(f3,negated_conjecture,
    ~ ! [X0: ( $i > $o ) > $i] : ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

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

thf(f5,plain,
    ( cD_FOR_X5309
    = ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ~ ( Y2 @ ( Y0 @ Y2 ) )
              & ( ( Y0 @ Y2 )
                = Y1 ) ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f6,plain,
    ~ ! [X0: ( $i > $o ) > $i] : ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) ),
    inference(rectify,[],[f3]) ).

thf(f7,plain,
    ~ ! [X0: ( $i > $o ) > $i] :
        ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
        = $true ),
    inference(fool_elimination,[],[f6]) ).

thf(f8,plain,
    ? [X0: ( $i > $o ) > $i] :
      ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
     != $true ),
    inference(ennf_transformation,[],[f7]) ).

thf(f9,plain,
    ( $true
   != ( cD_FOR_X5309 @ sK0 @ ( sK0 @ ( cD_FOR_X5309 @ sK0 ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f8]) ).

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

thf(f11,plain,
    ( cD_FOR_X5309
    = ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ~ ( Y2 @ ( Y0 @ Y2 ) )
              & ( ( Y0 @ Y2 )
                = Y1 ) ) ) ) ),
    inference(cnf_transformation,[],[f5]) ).

thf(f14,plain,
    ( ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ~ ( Y2 @ ( Y0 @ Y2 ) )
              & ( ( Y0 @ Y2 )
                = Y1 ) ) )
      @ sK0
      @ ( sK0
        @ ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y2: $i > $o] :
                  ( ~ ( Y2 @ ( Y0 @ Y2 ) )
                  & ( ( Y0 @ Y2 )
                    = Y1 ) ) )
          @ sK0 ) ) )
   != $true ),
    inference(definition_unfolding,[],[f10,f11,f11]) ).

thf(f15,plain,
    ( $true
   != ( ?? @ ( $i > $o )
      @ ^ [Y0: $i > $o] :
          ( ~ ( Y0 @ ( sK0 @ Y0 ) )
          & ( ( sK0 @ Y0 )
            = ( sK0
              @ ^ [Y1: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y2: $i > $o] :
                      ( ~ ( Y2 @ ( sK0 @ Y2 ) )
                      & ( ( sK0 @ Y2 )
                        = Y1 ) ) ) ) ) ) ) ),
    inference(beta-eta_normalization,[],[f14]) ).

thf(f16,plain,
    ! [X1: $i > $o] :
      ( $false
      = ( ^ [Y0: $i > $o] :
            ( ~ ( Y0 @ ( sK0 @ Y0 ) )
            & ( ( sK0 @ Y0 )
              = ( sK0
                @ ^ [Y1: $i] :
                    ( ?? @ ( $i > $o )
                    @ ^ [Y2: $i > $o] :
                        ( ~ ( Y2 @ ( sK0 @ Y2 ) )
                        & ( ( sK0 @ Y2 )
                          = Y1 ) ) ) ) ) )
        @ X1 ) ),
    inference(pi_proxy_clausification,[],[f15]) ).

thf(f17,plain,
    ! [X1: $i > $o] :
      ( $false
      = ( ~ ( X1 @ ( sK0 @ X1 ) )
        & ( ( sK0 @ X1 )
          = ( sK0
            @ ^ [Y0: $i] :
                ( ?? @ ( $i > $o )
                @ ^ [Y1: $i > $o] :
                    ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                    & ( ( sK0 @ Y1 )
                      = Y0 ) ) ) ) ) ) ),
    inference(beta-eta_normalization,[],[f16]) ).

thf(f18,plain,
    ! [X1: $i > $o] :
      ( ( $false
        = ( ( sK0 @ X1 )
          = ( sK0
            @ ^ [Y0: $i] :
                ( ?? @ ( $i > $o )
                @ ^ [Y1: $i > $o] :
                    ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                    & ( ( sK0 @ Y1 )
                      = Y0 ) ) ) ) ) )
      | ( ( ~ ( X1 @ ( sK0 @ X1 ) ) )
        = $false ) ),
    inference(and_proxy_clausification,[],[f17]) ).

thf(f19,plain,
    ! [X1: $i > $o] :
      ( ( ( sK0
          @ ^ [Y0: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y1: $i > $o] :
                  ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                  & ( ( sK0 @ Y1 )
                    = Y0 ) ) ) )
       != ( sK0 @ X1 ) )
      | ( ( ~ ( X1 @ ( sK0 @ X1 ) ) )
        = $false ) ),
    inference(equality_proxy_clausification,[],[f18]) ).

thf(f20,plain,
    ! [X1: $i > $o] :
      ( ( ( sK0
          @ ^ [Y0: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y1: $i > $o] :
                  ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                  & ( ( sK0 @ Y1 )
                    = Y0 ) ) ) )
       != ( sK0 @ X1 ) )
      | ( ( X1 @ ( sK0 @ X1 ) )
        = $true ) ),
    inference(not_proxy_clausification,[],[f19]) ).

thf(f21,plain,
    ( $true
    = ( ^ [Y0: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y1: $i > $o] :
              ( ~ ( Y1 @ ( sK0 @ Y1 ) )
              & ( ( sK0 @ Y1 )
                = Y0 ) ) )
      @ ( sK0
        @ ^ [Y0: $i] :
            ( ?? @ ( $i > $o )
            @ ^ [Y1: $i > $o] :
                ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                & ( ( sK0 @ Y1 )
                  = Y0 ) ) ) ) ) ),
    inference(equality_resolution,[],[f20]) ).

thf(f22,plain,
    ( $true
    = ( ?? @ ( $i > $o )
      @ ^ [Y0: $i > $o] :
          ( ~ ( Y0 @ ( sK0 @ Y0 ) )
          & ( ( sK0 @ Y0 )
            = ( sK0
              @ ^ [Y1: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y2: $i > $o] :
                      ( ~ ( Y2 @ ( sK0 @ Y2 ) )
                      & ( ( sK0 @ Y2 )
                        = Y1 ) ) ) ) ) ) ) ),
    inference(beta-eta_normalization,[],[f21]) ).

thf(f23,plain,
    ( $true
    = ( ^ [Y0: $i > $o] :
          ( ~ ( Y0 @ ( sK0 @ Y0 ) )
          & ( ( sK0 @ Y0 )
            = ( sK0
              @ ^ [Y1: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y2: $i > $o] :
                      ( ~ ( Y2 @ ( sK0 @ Y2 ) )
                      & ( ( sK0 @ Y2 )
                        = Y1 ) ) ) ) ) )
      @ sK1 ) ),
    inference(sigma_proxy_clausification,[],[f22]) ).

thf(f24,plain,
    ( $true
    = ( ~ ( sK1 @ ( sK0 @ sK1 ) )
      & ( ( sK0 @ sK1 )
        = ( sK0
          @ ^ [Y0: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y1: $i > $o] :
                  ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                  & ( ( sK0 @ Y1 )
                    = Y0 ) ) ) ) ) ) ),
    inference(beta-eta_normalization,[],[f23]) ).

thf(f25,plain,
    ( $true
    = ( ( sK0 @ sK1 )
      = ( sK0
        @ ^ [Y0: $i] :
            ( ?? @ ( $i > $o )
            @ ^ [Y1: $i > $o] :
                ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                & ( ( sK0 @ Y1 )
                  = Y0 ) ) ) ) ) ),
    inference(and_proxy_clausification,[],[f24]) ).

thf(f26,plain,
    ( $true
    = ( ~ ( sK1 @ ( sK0 @ sK1 ) ) ) ),
    inference(and_proxy_clausification,[],[f24]) ).

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

thf(f28,plain,
    ( ( sK0 @ sK1 )
    = ( sK0
      @ ^ [Y0: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y1: $i > $o] :
              ( ~ ( Y1 @ ( sK0 @ Y1 ) )
              & ( ( sK0 @ Y1 )
                = Y0 ) ) ) ) ),
    inference(equality_proxy_clausification,[],[f25]) ).

thf(f29,plain,
    ! [X0: $i > $o] :
      ( ( ( sK0 @ X0 )
       != ( sK0 @ sK1 ) )
      | ( $true
        = ( X0 @ ( sK0 @ X0 ) ) ) ),
    inference(constrained_superposition,[],[f20,f28]) ).

thf(f42,plain,
    ( ( sK1 @ ( sK0 @ sK1 ) )
    = $true ),
    inference(equality_resolution,[],[f29]) ).

thf(f52,plain,
    $false = $true,
    inference(forward_demodulation,[],[f42,f27]) ).

thf(f53,plain,
    $false,
    inference(trivial_inequality_removal,[],[f52]) ).

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