↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEU812^2 : 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 : n004.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:31:37 AM UTC 2026

% Result   : Theorem 0.21s 0.27s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   21 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :  120 (  25 equ;   0 cnn)
%            Maximal formula atoms :    3 (   5 avg)
%            Number of connectives :  117 (   6   ~;   2   |;   4   &;  85   @)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  12 usr;   5 con; 0-4 aty)
%                                         (   4  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   25 (  10   ^;  13   !;   2   ?;  25   :)

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

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

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

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

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

thf(func_def_5,type,
    vIMP: $o > $o > $o ).

thf(func_def_6,type,
    db0: 
      !>[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_13,type,
    vNOT: $o > $o ).

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

thf(f2,conjecture,
    ! [X0: $i] :
      ( ( transitiveset @ X0 )
     => ! [X1: $i] :
          ( ( in @ X1 @ X0 )
         => ( subset @ X1 @ X0 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivesetOp1) ).

thf(f3,negated_conjecture,
    ~ ! [X0: $i] :
        ( ( transitiveset @ X0 )
       => ! [X1: $i] :
            ( ( in @ X1 @ X0 )
           => ( subset @ X1 @ X0 ) ) ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

thf(f4,plain,
    ( transitiveset
    = ( ^ [X0: $i] :
        ! [X1: $i] :
          ( ( in @ X1 @ X0 )
         => ( subset @ X1 @ X0 ) ) ) ),
    inference(rectify,[],[f1]) ).

thf(f5,plain,
    ( transitiveset
    = ( ^ [Y0: $i] :
          ( !! @ $i
          @ ^ [Y1: $i] :
              ( ( in @ Y1 @ Y0 )
             => ( subset @ Y1 @ Y0 ) ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f6,plain,
    ~ ! [X0: $i] :
        ( ( transitiveset @ X0 )
       => ! [X1: $i] :
            ( ( in @ X1 @ X0 )
           => ( subset @ X1 @ X0 ) ) ),
    inference(rectify,[],[f3]) ).

thf(f7,plain,
    ~ ! [X0: $i] :
        ( ( ( transitiveset @ X0 )
          = $true )
       => ! [X1: $i] :
            ( ( ( in @ X1 @ X0 )
              = $true )
           => ( ( subset @ X1 @ X0 )
              = $true ) ) ),
    inference(fool_elimination,[],[f6]) ).

thf(f8,plain,
    ? [X0: $i] :
      ( ? [X1: $i] :
          ( ( ( subset @ X1 @ X0 )
           != $true )
          & ( ( in @ X1 @ X0 )
            = $true ) )
      & ( ( transitiveset @ X0 )
        = $true ) ),
    inference(ennf_transformation,[],[f7]) ).

thf(f9,plain,
    ( ( $true
     != ( subset @ sK1 @ sK0 ) )
    & ( ( in @ sK1 @ sK0 )
      = $true )
    & ( ( transitiveset @ sK0 )
      = $true ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f8]) ).

thf(f10,plain,
    ( transitiveset
    = ( ^ [Y0: $i] :
          ( !! @ $i
          @ ^ [Y1: $i] :
              ( ( in @ Y1 @ Y0 )
             => ( subset @ Y1 @ Y0 ) ) ) ) ),
    inference(cnf_transformation,[],[f5]) ).

thf(f11,plain,
    ( ( transitiveset @ sK0 )
    = $true ),
    inference(cnf_transformation,[],[f9]) ).

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

thf(f13,plain,
    ( $true
   != ( subset @ sK1 @ sK0 ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f16,plain,
    ( ( ^ [Y0: $i] :
          ( !! @ $i
          @ ^ [Y1: $i] :
              ( ( in @ Y1 @ Y0 )
             => ( subset @ Y1 @ Y0 ) ) )
      @ sK0 )
    = $true ),
    inference(definition_unfolding,[],[f11,f10]) ).

thf(f17,plain,
    ( ( !! @ $i
      @ ^ [Y0: $i] :
          ( ( in @ Y0 @ sK0 )
         => ( subset @ Y0 @ sK0 ) ) )
    = $true ),
    inference(beta-eta_normalization,[],[f16]) ).

thf(f18,plain,
    ! [X1: $i] :
      ( ( ^ [Y0: $i] :
            ( ( in @ Y0 @ sK0 )
           => ( subset @ Y0 @ sK0 ) )
        @ X1 )
      = $true ),
    inference(pi_proxy_clausification,[],[f17]) ).

thf(f19,plain,
    ! [X1: $i] :
      ( $true
      = ( ( in @ X1 @ sK0 )
       => ( subset @ X1 @ sK0 ) ) ),
    inference(beta-eta_normalization,[],[f18]) ).

thf(f20,plain,
    ! [X1: $i] :
      ( ( $false
        = ( in @ X1 @ sK0 ) )
      | ( $true
        = ( subset @ X1 @ sK0 ) ) ),
    inference(imp_proxy_clausification,[],[f19]) ).

thf(f21,plain,
    ( ( $true
      = ( subset @ sK1 @ sK0 ) )
    | ( $false = $true ) ),
    inference(constrained_superposition,[],[f20,f12]) ).

thf(f23,plain,
    ( $true
    = ( subset @ sK1 @ sK0 ) ),
    inference(trivial_inequality_removal,[],[f21]) ).

thf(f25,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f23,f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU812^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n004.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Sep 29 14:33:37 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running higher-order theorem proving
% 0.08/0.23  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.27  % (1368795)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.27  % (1368806)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1503694459:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.27  % (1368806)Refutation not found, incomplete strategy
% 0.21/0.27  % (1368806)------------------------------
% 0.21/0.27  % (1368806)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27  % (1368806)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27  % (1368806)CaDiCaL version: 2.1.3
% 0.21/0.27  % (1368806)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.27  % (1368806)Time elapsed: 0.001 s
% 0.21/0.27  % (1368806)Peak memory usage: 12 MB
% 0.21/0.27  % (1368806)Instructions burned: 1 (million)
% 0.21/0.27  % (1368806)------------------------------
% 0.21/0.27  % (1368806)------------------------------
% 0.21/0.27  % (1368810)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.27  % (1368810)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.27  % (1368804)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=292901506:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.27  % (1368805)lrs+10_16_si=on:nwc=1.5:random_seed=3296378531:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.27  % (1368808)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=363142249:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.27  % (1368807)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=1915211971: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.27  % (1368809)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3531036107:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.27  % (1368810)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=2488200556:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.27  % (1368804) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1368795-1368804"...
% 0.21/0.27  % (1368805) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1368795-1368805"...
% 0.21/0.27  % (1368808) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1368795-1368808"...
% 0.21/0.27  % (1368809) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1368795-1368809"...
% 0.21/0.27  % (1368804)...printing done.
% 0.21/0.27  % (1368805)...printing done.
% 0.21/0.27  % (1368807) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1368795-1368807"...
% 0.21/0.27  % (1368804)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  % (1368804)------------------------------
% 0.21/0.27  % (1368804)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27  % (1368804)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27  % (1368804)CaDiCaL version: 2.1.3
% 0.21/0.27  % (1368804)Termination reason: Refutation
% 0.21/0.27  % (1368804)Time elapsed: 0.002 s
% 0.21/0.27  % (1368804)Peak memory usage: 12 MB
% 0.21/0.27  % (1368804)Instructions burned: 2 (million)
% 0.21/0.27  % (1368795)Success in time 0.026 s
% 0.21/0.27  % Vampire exiting
%------------------------------------------------------------------------------