↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEU622^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 : n006.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:30:22 AM UTC 2026

% Result   : Theorem 0.21s 0.27s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   34 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :  327 (  88 equ;   0 cnn)
%            Maximal formula atoms :    6 (   9 avg)
%            Number of connectives :  310 (  39   ~;  28   |;  21   &; 200   @)
%                                         (   4 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   17 (  14 usr;  11 con; 0-2 aty)
%            Number of variables   :   56 (   0   ^;  44   !;  12   ?;  56   :)

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

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

thf(func_def_2,type,
    setadjoin: $i > $i > $i ).

thf(func_def_3,type,
    powerset: $i > $i ).

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

thf(func_def_5,type,
    powersetI1: $o ).

thf(func_def_7,type,
    singletonsubset: $o ).

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

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

thf(f3,conjecture,
    ( powersetI1
   => ( singletonsubset
     => ! [X1: $i,X0: $i] :
          ( ( in @ X1 @ X0 )
         => ( in @ ( setadjoin @ X1 @ emptyset ) @ ( powerset @ X0 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',singletoninpowerset) ).

thf(f4,negated_conjecture,
    ~ ( powersetI1
     => ( singletonsubset
       => ! [X1: $i,X0: $i] :
            ( ( in @ X1 @ X0 )
           => ( in @ ( setadjoin @ X1 @ emptyset ) @ ( powerset @ X0 ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f5,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( subset @ X0 @ X1 )
       => ( in @ X0 @ ( powerset @ X1 ) ) )
      = powersetI1 ),
    inference(rectify,[],[f1]) ).

thf(f6,plain,
    ( ( powersetI1 = $true )
  <=> ! [X0: $i,X1: $i] :
        ( ( ( subset @ X0 @ X1 )
          = $true )
       => ( ( in @ X0 @ ( powerset @ X1 ) )
          = $true ) ) ),
    inference(fool_elimination,[],[f5]) ).

thf(f7,plain,
    ~ ( powersetI1
     => ( singletonsubset
       => ! [X0: $i,X1: $i] :
            ( ( in @ X0 @ X1 )
           => ( in @ ( setadjoin @ X0 @ emptyset ) @ ( powerset @ X1 ) ) ) ) ),
    inference(rectify,[],[f4]) ).

thf(f8,plain,
    ~ ( ( powersetI1 = $true )
     => ( ( singletonsubset = $true )
       => ! [X1: $i,X0: $i] :
            ( ( $true
              = ( in @ X0 @ X1 ) )
           => ( ( in @ ( setadjoin @ X0 @ emptyset ) @ ( powerset @ X1 ) )
              = $true ) ) ) ),
    inference(fool_elimination,[],[f7]) ).

thf(f9,plain,
    ( singletonsubset
    = ( ! [X0: $i,X1: $i] :
          ( ( in @ X1 @ X0 )
         => ( subset @ ( setadjoin @ X1 @ emptyset ) @ X0 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f10,plain,
    ( ( singletonsubset = $true )
  <=> ! [X1: $i,X0: $i] :
        ( ( ( in @ X1 @ X0 )
          = $true )
       => ( ( subset @ ( setadjoin @ X1 @ emptyset ) @ X0 )
          = $true ) ) ),
    inference(fool_elimination,[],[f9]) ).

thf(f11,plain,
    ( ! [X1: $i,X0: $i] :
        ( ( ( in @ X0 @ ( powerset @ X1 ) )
          = $true )
        | ( ( subset @ X0 @ X1 )
         != $true ) )
  <=> ( powersetI1 = $true ) ),
    inference(ennf_transformation,[],[f6]) ).

thf(f12,plain,
    ( ! [X0: $i,X1: $i] :
        ( ( ( in @ X1 @ X0 )
         != $true )
        | ( ( subset @ ( setadjoin @ X1 @ emptyset ) @ X0 )
          = $true ) )
  <=> ( singletonsubset = $true ) ),
    inference(ennf_transformation,[],[f10]) ).

thf(f13,plain,
    ( ? [X0: $i,X1: $i] :
        ( ( ( in @ ( setadjoin @ X0 @ emptyset ) @ ( powerset @ X1 ) )
         != $true )
        & ( $true
          = ( in @ X0 @ X1 ) ) )
    & ( singletonsubset = $true )
    & ( powersetI1 = $true ) ),
    inference(ennf_transformation,[],[f8]) ).

thf(f14,plain,
    ( ( singletonsubset = $true )
    & ? [X0: $i,X1: $i] :
        ( ( ( in @ ( setadjoin @ X0 @ emptyset ) @ ( powerset @ X1 ) )
         != $true )
        & ( $true
          = ( in @ X0 @ X1 ) ) )
    & ( powersetI1 = $true ) ),
    inference(flattening,[],[f13]) ).

thf(f15,plain,
    ( ( ! [X1: $i,X0: $i] :
          ( ( ( in @ X0 @ ( powerset @ X1 ) )
            = $true )
          | ( ( subset @ X0 @ X1 )
           != $true ) )
      | ( powersetI1 != $true ) )
    & ( ( powersetI1 = $true )
      | ? [X1: $i,X0: $i] :
          ( ( ( in @ X0 @ ( powerset @ X1 ) )
           != $true )
          & ( ( subset @ X0 @ X1 )
            = $true ) ) ) ),
    inference(nnf_transformation,[],[f11]) ).

thf(f16,plain,
    ( ( ! [X0: $i,X1: $i] :
          ( ( ( in @ X1 @ ( powerset @ X0 ) )
            = $true )
          | ( ( subset @ X1 @ X0 )
           != $true ) )
      | ( powersetI1 != $true ) )
    & ( ( powersetI1 = $true )
      | ? [X2: $i,X3: $i] :
          ( ( ( in @ X3 @ ( powerset @ X2 ) )
           != $true )
          & ( ( subset @ X3 @ X2 )
            = $true ) ) ) ),
    inference(rectify,[],[f15]) ).

thf(f17,plain,
    ( ( ! [X0: $i,X1: $i] :
          ( ( ( in @ X1 @ ( powerset @ X0 ) )
            = $true )
          | ( ( subset @ X1 @ X0 )
           != $true ) )
      | ( powersetI1 != $true ) )
    & ( ( powersetI1 = $true )
      | ( ( ( in @ sK1 @ ( powerset @ sK0 ) )
         != $true )
        & ( ( subset @ sK1 @ sK0 )
          = $true ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0),skolemize(X3,sK1)],[f16]) ).

thf(f18,plain,
    ( ( singletonsubset = $true )
    & ( $true
     != ( in @ ( setadjoin @ sK2 @ emptyset ) @ ( powerset @ sK3 ) ) )
    & ( ( in @ sK2 @ sK3 )
      = $true )
    & ( powersetI1 = $true ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f14]) ).

thf(f19,plain,
    ( ( ! [X0: $i,X1: $i] :
          ( ( ( in @ X1 @ X0 )
           != $true )
          | ( ( subset @ ( setadjoin @ X1 @ emptyset ) @ X0 )
            = $true ) )
      | ( singletonsubset != $true ) )
    & ( ( singletonsubset = $true )
      | ? [X0: $i,X1: $i] :
          ( ( ( in @ X1 @ X0 )
            = $true )
          & ( ( subset @ ( setadjoin @ X1 @ emptyset ) @ X0 )
           != $true ) ) ) ),
    inference(nnf_transformation,[],[f12]) ).

thf(f20,plain,
    ( ( ! [X0: $i,X1: $i] :
          ( ( ( in @ X1 @ X0 )
           != $true )
          | ( ( subset @ ( setadjoin @ X1 @ emptyset ) @ X0 )
            = $true ) )
      | ( singletonsubset != $true ) )
    & ( ( singletonsubset = $true )
      | ? [X2: $i,X3: $i] :
          ( ( ( in @ X3 @ X2 )
            = $true )
          & ( ( subset @ ( setadjoin @ X3 @ emptyset ) @ X2 )
           != $true ) ) ) ),
    inference(rectify,[],[f19]) ).

thf(f21,plain,
    ( ( ! [X0: $i,X1: $i] :
          ( ( ( in @ X1 @ X0 )
           != $true )
          | ( ( subset @ ( setadjoin @ X1 @ emptyset ) @ X0 )
            = $true ) )
      | ( singletonsubset != $true ) )
    & ( ( singletonsubset = $true )
      | ( ( ( in @ sK5 @ sK4 )
          = $true )
        & ( ( subset @ ( setadjoin @ sK5 @ emptyset ) @ sK4 )
         != $true ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X2,sK4),skolemize(X3,sK5)],[f20]) ).

thf(f24,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( subset @ X1 @ X0 )
       != $true )
      | ( ( in @ X1 @ ( powerset @ X0 ) )
        = $true )
      | ( powersetI1 != $true ) ),
    inference(cnf_transformation,[],[f17]) ).

thf(f25,plain,
    powersetI1 = $true,
    inference(cnf_transformation,[],[f18]) ).

thf(f26,plain,
    ( ( in @ sK2 @ sK3 )
    = $true ),
    inference(cnf_transformation,[],[f18]) ).

thf(f27,plain,
    ( $true
   != ( in @ ( setadjoin @ sK2 @ emptyset ) @ ( powerset @ sK3 ) ) ),
    inference(cnf_transformation,[],[f18]) ).

thf(f28,plain,
    singletonsubset = $true,
    inference(cnf_transformation,[],[f18]) ).

thf(f31,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( subset @ ( setadjoin @ X1 @ emptyset ) @ X0 )
        = $true )
      | ( singletonsubset != $true )
      | ( ( in @ X1 @ X0 )
       != $true ) ),
    inference(cnf_transformation,[],[f21]) ).

thf(f35,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( in @ X1 @ ( powerset @ X0 ) )
        = $true )
      | ( ( subset @ X1 @ X0 )
       != $true ) ),
    inference(forward_subsumption_resolution,[],[f24,f25]) ).

thf(f36,plain,
    ( ( ( subset @ ( setadjoin @ sK2 @ emptyset ) @ sK3 )
     != $true )
    | ( $true != $true ) ),
    inference(superposition,[],[f27,f35]) ).

thf(f37,plain,
    ( ( subset @ ( setadjoin @ sK2 @ emptyset ) @ sK3 )
   != $true ),
    inference(trivial_inequality_removal,[],[f36]) ).

thf(f38,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( subset @ ( setadjoin @ X1 @ emptyset ) @ X0 )
        = $true )
      | ( ( in @ X1 @ X0 )
       != $true ) ),
    inference(forward_subsumption_resolution,[],[f31,f28]) ).

thf(f39,plain,
    ( ( $true != $true )
    | ( ( in @ sK2 @ sK3 )
     != $true ) ),
    inference(superposition,[],[f37,f38]) ).

thf(f40,plain,
    ( ( in @ sK2 @ sK3 )
   != $true ),
    inference(trivial_inequality_removal,[],[f39]) ).

thf(f41,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f40,f26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU622^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.09/0.19  % Computer : n006.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 13:58:40 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.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  % (758570)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.27  % (758579)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1042194950:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.27  % (758579) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-758570-758579"...
% 0.21/0.27  % (758579)...printing done.
% 0.21/0.27  % (758579)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  % (758579)------------------------------
% 0.21/0.27  % (758579)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27  % (758579)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27  % (758579)CaDiCaL version: 2.1.3
% 0.21/0.27  % (758579)Termination reason: Refutation
% 0.21/0.27  % (758579)Time elapsed: 0.002 s
% 0.21/0.27  % (758579)Peak memory usage: 12 MB
% 0.21/0.27  % (758579)Instructions burned: 4 (million)
% 0.21/0.27  % (758570)Success in time 0.033 s
% 0.21/0.27  % Vampire exiting
%------------------------------------------------------------------------------