↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n005.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:46:16 AM UTC 2026

% Result   : Theorem 0.21s 0.30s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   32 (  25 unt;   0 typ;   0 def)
%            Number of atoms       :  107 (  32 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :  153 (   8   ~;   1   |;   2   &; 114   @)
%                                         (   0 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   59 (  59   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   19 (  15 usr;   4 con; 0-4 aty)
%                                         (   8  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   53 (  30   ^;  20   !;   3   ?;  53   :)

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

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

thf(func_def_2,type,
    leibeq2: ( $i > $i ) > ( $i > $i ) > $o ).

thf(func_def_3,type,
    vPI: 
      !>[X0: $tType] : ( ( X0 > $o ) > $o ) ).

thf(func_def_4,type,
    vIMP: $o > $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,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

thf(func_def_11,type,
    sK0: $i > $i ).

thf(func_def_12,type,
    sK1: $i > $i ).

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

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

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

thf(f1,axiom,
    ( ( ^ [X0: $i,X1: $i] :
        ! [X2: $i > $o] :
          ( ( X2 @ X0 )
         => ( X2 @ X1 ) ) )
    = leibeq1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',leibeq1) ).

thf(f2,axiom,
    ( ( ^ [X0: $i > $i,X1: $i > $i] :
        ! [X2: ( $i > $i ) > $o] :
          ( ( X2 @ X0 )
         => ( X2 @ X1 ) ) )
    = leibeq2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',leibeq2) ).

thf(f3,conjecture,
    ! [X1: $i > $i,X0: $i > $i] :
      ( ( leibeq2 @ X0 @ X1 )
     => ! [X2: $i] : ( leibeq1 @ ( X0 @ X2 ) @ ( X1 @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

thf(f4,negated_conjecture,
    ~ ! [X1: $i > $i,X0: $i > $i] :
        ( ( leibeq2 @ X0 @ X1 )
       => ! [X2: $i] : ( leibeq1 @ ( X0 @ X2 ) @ ( X1 @ X2 ) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f5,plain,
    ( ( ^ [X0: $i > $i,X1: $i > $i] :
        ! [X2: ( $i > $i ) > $o] :
          ( ( X2 @ X0 )
         => ( X2 @ X1 ) ) )
    = leibeq2 ),
    inference(rectify,[],[f2]) ).

thf(f6,plain,
    ( leibeq2
    = ( ^ [Y0: $i > $i,Y1: $i > $i] :
          ( !! @ ( ( $i > $i ) > $o )
          @ ^ [Y2: ( $i > $i ) > $o] :
              ( ( Y2 @ Y0 )
             => ( Y2 @ Y1 ) ) ) ) ),
    inference(fool_elimination,[],[f5]) ).

thf(f7,plain,
    ( ( ^ [X0: $i,X1: $i] :
        ! [X2: $i > $o] :
          ( ( X2 @ X0 )
         => ( X2 @ X1 ) ) )
    = leibeq1 ),
    inference(rectify,[],[f1]) ).

thf(f8,plain,
    ( leibeq1
    = ( ^ [Y0: $i,Y1: $i] :
          ( !! @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ( Y2 @ Y0 )
             => ( Y2 @ Y1 ) ) ) ) ),
    inference(fool_elimination,[],[f7]) ).

thf(f9,plain,
    ~ ! [X0: $i > $i,X1: $i > $i] :
        ( ( leibeq2 @ X1 @ X0 )
       => ! [X2: $i] : ( leibeq1 @ ( X1 @ X2 ) @ ( X0 @ X2 ) ) ),
    inference(rectify,[],[f4]) ).

thf(f10,plain,
    ~ ! [X0: $i > $i,X1: $i > $i] :
        ( ( ( leibeq2 @ X1 @ X0 )
          = $true )
       => ! [X2: $i] :
            ( ( leibeq1 @ ( X1 @ X2 ) @ ( X0 @ X2 ) )
            = $true ) ),
    inference(fool_elimination,[],[f9]) ).

thf(f11,plain,
    ? [X0: $i > $i,X1: $i > $i] :
      ( ( ( leibeq2 @ X1 @ X0 )
        = $true )
      & ? [X2: $i] :
          ( ( leibeq1 @ ( X1 @ X2 ) @ ( X0 @ X2 ) )
         != $true ) ),
    inference(ennf_transformation,[],[f10]) ).

thf(f12,plain,
    ( ( ( leibeq2 @ sK1 @ sK0 )
      = $true )
    & ( ( leibeq1 @ ( sK1 @ sK2 ) @ ( sK0 @ sK2 ) )
     != $true ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f11]) ).

thf(f13,plain,
    ( leibeq1
    = ( ^ [Y0: $i,Y1: $i] :
          ( !! @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ( Y2 @ Y0 )
             => ( Y2 @ Y1 ) ) ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f14,plain,
    ( leibeq2
    = ( ^ [Y0: $i > $i,Y1: $i > $i] :
          ( !! @ ( ( $i > $i ) > $o )
          @ ^ [Y2: ( $i > $i ) > $o] :
              ( ( Y2 @ Y0 )
             => ( Y2 @ Y1 ) ) ) ) ),
    inference(cnf_transformation,[],[f6]) ).

thf(f15,plain,
    ( ( leibeq1 @ ( sK1 @ sK2 ) @ ( sK0 @ sK2 ) )
   != $true ),
    inference(cnf_transformation,[],[f12]) ).

thf(f16,plain,
    ( ( leibeq2 @ sK1 @ sK0 )
    = $true ),
    inference(cnf_transformation,[],[f12]) ).

thf(f19,plain,
    ( ( ^ [Y0: $i > $i,Y1: $i > $i] :
          ( !! @ ( ( $i > $i ) > $o )
          @ ^ [Y2: ( $i > $i ) > $o] :
              ( ( Y2 @ Y0 )
             => ( Y2 @ Y1 ) ) )
      @ sK1
      @ sK0 )
    = $true ),
    inference(definition_unfolding,[],[f16,f14]) ).

thf(f20,plain,
    ( ( ^ [Y0: $i,Y1: $i] :
          ( !! @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ( Y2 @ Y0 )
             => ( Y2 @ Y1 ) ) )
      @ ( sK1 @ sK2 )
      @ ( sK0 @ sK2 ) )
   != $true ),
    inference(definition_unfolding,[],[f15,f13]) ).

thf(f21,plain,
    ( $true
    = ( !! @ ( ( $i > $i ) > $o )
      @ ^ [Y0: ( $i > $i ) > $o] :
          ( ( Y0 @ sK1 )
         => ( Y0 @ sK0 ) ) ) ),
    inference(beta-eta_normalization,[],[f19]) ).

thf(f22,plain,
    ! [X1: ( $i > $i ) > $o] :
      ( ( ^ [Y0: ( $i > $i ) > $o] :
            ( ( Y0 @ sK1 )
           => ( Y0 @ sK0 ) )
        @ X1 )
      = $true ),
    inference(pi_proxy_clausification,[],[f21]) ).

thf(f23,plain,
    ! [X1: ( $i > $i ) > $o] :
      ( ( ( X1 @ sK1 )
       => ( X1 @ sK0 ) )
      = $true ),
    inference(beta-eta_normalization,[],[f22]) ).

thf(f24,plain,
    ! [X1: ( $i > $i ) > $o] :
      ( ( ( X1 @ sK1 )
        = $false )
      | ( $true
        = ( X1 @ sK0 ) ) ),
    inference(imp_proxy_clausification,[],[f23]) ).

thf(f25,plain,
    ( ( !! @ ( $i > $o )
      @ ^ [Y0: $i > $o] :
          ( ( Y0 @ ( sK1 @ sK2 ) )
         => ( Y0 @ ( sK0 @ sK2 ) ) ) )
   != $true ),
    inference(beta-eta_normalization,[],[f20]) ).

thf(f26,plain,
    ( $false
    = ( ^ [Y0: $i > $o] :
          ( ( Y0 @ ( sK1 @ sK2 ) )
         => ( Y0 @ ( sK0 @ sK2 ) ) )
      @ sK3 ) ),
    inference(sigma_proxy_clausification,[],[f25]) ).

thf(f27,plain,
    ( $false
    = ( ( sK3 @ ( sK1 @ sK2 ) )
     => ( sK3 @ ( sK0 @ sK2 ) ) ) ),
    inference(beta-eta_normalization,[],[f26]) ).

thf(f28,plain,
    ( ( sK3 @ ( sK0 @ sK2 ) )
    = $false ),
    inference(imp_proxy_clausification,[],[f27]) ).

thf(f29,plain,
    ( $true
    = ( sK3 @ ( sK1 @ sK2 ) ) ),
    inference(imp_proxy_clausification,[],[f27]) ).

thf(f31,plain,
    sK1 = sK0,
    inference(leibniz_equality_elimination,[],[f24]) ).

thf(f40,plain,
    ! [X1: $i] :
      ( ( sK0 @ X1 )
      = ( sK1 @ X1 ) ),
    inference(argument_congruence,[],[f31]) ).

thf(f42,plain,
    ( ( sK3 @ ( sK0 @ sK2 ) )
    = $true ),
    inference(constrained_superposition,[],[f29,f40]) ).

thf(f43,plain,
    $false = $true,
    inference(forward_demodulation,[],[f42,f28]) ).

thf(f44,plain,
    $false,
    inference(trivial_inequality_removal,[],[f43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO005^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20  % Computer : n005.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Tue Sep 29 16:20:46 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23  Running higher-order theorem proving
% 0.09/0.25  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.30  % (1869719)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.30  % (1869730)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.30  % (1869730)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.21/0.30  % (1869727)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=798907943:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.21/0.30  % (1869724)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2579037728:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.30  % (1869725)lrs+10_16_si=on:nwc=1.5:random_seed=1340796275:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.30  % (1869726)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=4166146267:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.30  % (1869728)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=919776870:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.30  % (1869729)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2447051647:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.30  % (1869730)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=3779086577:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.30  % (1869726)Refutation not found, incomplete strategy
% 0.21/0.30  % (1869726)------------------------------
% 0.21/0.30  % (1869726)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30  % (1869726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30  % (1869726)CaDiCaL version: 2.1.3
% 0.21/0.30  % (1869726)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.30  % (1869726)Time elapsed: 0.001 s
% 0.21/0.30  % (1869726)Peak memory usage: 12 MB
% 0.21/0.30  % (1869726)Instructions burned: 1 (million)
% 0.21/0.30  % (1869724) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1869719-1869724"...
% 0.21/0.30  % (1869726)------------------------------
% 0.21/0.30  % (1869726)------------------------------
% 0.21/0.30  % (1869725) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1869719-1869725"...
% 0.21/0.30  % (1869729) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1869719-1869729"...
% 0.21/0.30  % (1869730)Refutation not found, incomplete strategy
% 0.21/0.30  % (1869730)------------------------------
% 0.21/0.30  % (1869730)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30  % (1869730)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30  % (1869730)CaDiCaL version: 2.1.3
% 0.21/0.30  % (1869730)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.30  % (1869730)Time elapsed: 0.003 s
% 0.21/0.30  % (1869730)Peak memory usage: 12 MB
% 0.21/0.30  % (1869730)Instructions burned: 3 (million)
% 0.21/0.30  % (1869724)...printing done.
% 0.21/0.30  % (1869730)------------------------------
% 0.21/0.30  % (1869730)------------------------------
% 0.21/0.30  % (1869725)...printing done.
% 0.21/0.30  % (1869724)Refutation found. Thanks to Tanya!
% 0.21/0.30  % SZS status Theorem for theBenchmark
% 0.21/0.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.30  % (1869724)------------------------------
% 0.21/0.30  % (1869724)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30  % (1869724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30  % (1869724)CaDiCaL version: 2.1.3
% 0.21/0.30  % (1869724)Termination reason: Refutation
% 0.21/0.30  % (1869724)Time elapsed: 0.003 s
% 0.21/0.30  % (1869724)Peak memory usage: 12 MB
% 0.21/0.30  % (1869724)Instructions burned: 3 (million)
% 0.21/0.30  % (1869719)Success in time 0.043 s
% 0.21/0.30  % Vampire exiting
%------------------------------------------------------------------------------