↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

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

% 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:39:06 AM UTC 2026

% Result   : Theorem 0.21s 0.27s
% Output   : Refutation 0.21s
% 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/sandbox/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/sandbox/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,
    ( 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(f11,plain,
    ( $true
   != ( cD_FOR_X5309 @ sK0 @ ( sK0 @ ( cD_FOR_X5309 @ sK0 ) ) ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f14,plain,
    ( $true
   != ( ^ [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 ) ) ) ),
    inference(definition_unfolding,[],[f11,f10,f10]) ).

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 ) ) ) ) ) )
      | ( $false
        = ( ~ ( X1 @ ( sK0 @ X1 ) ) ) ) ),
    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 ) )
      | ( $false
        = ( ~ ( X1 @ ( sK0 @ X1 ) ) ) ) ),
    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 ) )
      | ( $true
        = ( X1 @ ( sK0 @ X1 ) ) ) ),
    inference(not_proxy_clausification,[],[f19]) ).

thf(f28,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(f29,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,[],[f28]) ).

thf(f30,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,[],[f29]) ).

thf(f31,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,[],[f30]) ).

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

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

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

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

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

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

thf(f60,plain,
    $true = $false,
    inference(forward_demodulation,[],[f51,f34]) ).

thf(f61,plain,
    $false,
    inference(trivial_inequality_removal,[],[f60]) ).

%------------------------------------------------------------------------------
%----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/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18  % Computer : n014.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.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Tue Sep 29 15:18:30 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.22  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.27  % (2793497)Will run a generic schedule for satisfiability detection.
% 0.21/0.27  % (2793506)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2345254625:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.27  % (2793506)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.27  % (2793506)Refutation not found, incomplete strategy
% 0.21/0.27  % (2793506)------------------------------
% 0.21/0.27  % (2793506)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27  % (2793506)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27  % (2793506)CaDiCaL version: 2.1.3
% 0.21/0.27  % (2793506)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.27  % (2793506)Time elapsed: 0.002 s
% 0.21/0.27  % (2793506)Peak memory usage: 12 MB
% 0.21/0.27  % (2793506)Instructions burned: 4 (million)
% 0.21/0.27  % (2793506)------------------------------
% 0.21/0.27  % (2793506)------------------------------
% 0.21/0.27  % (2793503)% WARNING: option uhcvi not known.
% 0.21/0.27  % (2793502)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2568010481_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.27  % (2793503)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4247488923:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.27  % (2793504)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=479029898:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.27  % (2793505)dis+10_1_sil=32000:sp=arity:random_seed=1176610003:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.27  % (2793503)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.27  % (2793503)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.21/0.27  % Exception at run slice level
% 0.21/0.27  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.27  % (2793505) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2793497-2793505"...
% 0.21/0.27  % (2793503) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2793497-2793503"...
% 0.21/0.27  % (2793504) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2793497-2793504"...
% 0.21/0.27  % (2793505)...printing done.
% 0.21/0.27  % (2793503)...printing done.
% 0.21/0.27  % (2793503)Refutation found. Thanks to Tanya!
% 0.21/0.27  % SZS status Theorem for theBenchmark
% 0.21/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.27  % (2793503)------------------------------
% 0.21/0.27  % (2793503)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27  % (2793503)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27  % (2793503)CaDiCaL version: 2.1.3
% 0.21/0.27  % (2793503)Termination reason: Refutation
% 0.21/0.27  % (2793503)Time elapsed: 0.004 s
% 0.21/0.27  % (2793503)Peak memory usage: 12 MB
% 0.21/0.27  % (2793503)Instructions burned: 4 (million)
% 0.21/0.27  % (2793497)Success in time 0.039 s
% 0.21/0.27  % Vampire exiting
%------------------------------------------------------------------------------