↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEU735^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 : n010.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:02 AM UTC 2026

% Result   : Theorem 0.11s 0.26s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   39 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :  426 ( 115 equ;   0 cnn)
%            Maximal formula atoms :    8 (  10 avg)
%            Number of connectives :  570 (  49   ~;  42   |;  27   &; 423   @)
%                                         (   4 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   20 (  17 usr;  12 con; 0-2 aty)
%            Number of variables   :   80 (   0   ^;  64   !;  16   ?;  80   :)

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

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

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

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

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

thf(func_def_5,type,
    binintersect: $i > $i > $i ).

thf(func_def_6,type,
    setminus: $i > $i > $i ).

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

thf(func_def_18,type,
    vNOT: $o > $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,
    ! [X1: $i,X0: $i] :
      ( ( ( in @ X1 @ ( powerset @ X0 ) )
       => ! [X2: $i] :
            ( ( in @ X2 @ ( powerset @ X0 ) )
           => ( subset @ ( setminus @ X0 @ X1 ) @ ( setminus @ X0 @ ( binintersect @ X1 @ X2 ) ) ) ) )
      = complementSubsetComplementIntersect ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',complementSubsetComplementIntersect) ).

thf(f3,conjecture,
    ( powersetI1
   => ( complementSubsetComplementIntersect
     => ! [X0: $i,X1: $i] :
          ( ( in @ X1 @ ( powerset @ X0 ) )
         => ! [X2: $i] :
              ( ( in @ X2 @ ( powerset @ X0 ) )
             => ( in @ ( setminus @ X0 @ X1 ) @ ( powerset @ ( setminus @ X0 @ ( binintersect @ X1 @ X2 ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',complementInPowersetComplementIntersect) ).

thf(f4,negated_conjecture,
    ~ ( powersetI1
     => ( complementSubsetComplementIntersect
       => ! [X0: $i,X1: $i] :
            ( ( in @ X1 @ ( powerset @ X0 ) )
           => ! [X2: $i] :
                ( ( in @ X2 @ ( powerset @ X0 ) )
               => ( in @ ( setminus @ X0 @ X1 ) @ ( powerset @ ( setminus @ X0 @ ( binintersect @ X1 @ X2 ) ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f5,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( in @ X0 @ ( powerset @ X1 ) )
       => ! [X2: $i] :
            ( ( in @ X2 @ ( powerset @ X1 ) )
           => ( subset @ ( setminus @ X1 @ X0 ) @ ( setminus @ X1 @ ( binintersect @ X0 @ X2 ) ) ) ) )
      = complementSubsetComplementIntersect ),
    inference(rectify,[],[f2]) ).

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

thf(f7,plain,
    ~ ( powersetI1
     => ( complementSubsetComplementIntersect
       => ! [X0: $i,X1: $i] :
            ( ( in @ X1 @ ( powerset @ X0 ) )
           => ! [X2: $i] :
                ( ( in @ X2 @ ( powerset @ X0 ) )
               => ( in @ ( setminus @ X0 @ X1 ) @ ( powerset @ ( setminus @ X0 @ ( binintersect @ X1 @ X2 ) ) ) ) ) ) ) ),
    inference(rectify,[],[f4]) ).

thf(f8,plain,
    ~ ( ( powersetI1 = $true )
     => ( ( complementSubsetComplementIntersect = $true )
       => ! [X0: $i,X1: $i] :
            ( ( ( in @ X1 @ ( powerset @ X0 ) )
              = $true )
           => ! [X2: $i] :
                ( ( ( in @ X2 @ ( powerset @ X0 ) )
                  = $true )
               => ( ( in @ ( setminus @ X0 @ X1 ) @ ( powerset @ ( setminus @ X0 @ ( binintersect @ X1 @ X2 ) ) ) )
                  = $true ) ) ) ) ),
    inference(fool_elimination,[],[f7]) ).

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

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

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

thf(f12,plain,
    ( ? [X0: $i,X1: $i] :
        ( ( ( in @ X1 @ ( powerset @ X0 ) )
          = $true )
        & ? [X2: $i] :
            ( ( ( in @ ( setminus @ X0 @ X1 ) @ ( powerset @ ( setminus @ X0 @ ( binintersect @ X1 @ X2 ) ) ) )
             != $true )
            & ( ( in @ X2 @ ( powerset @ X0 ) )
              = $true ) ) )
    & ( complementSubsetComplementIntersect = $true )
    & ( powersetI1 = $true ) ),
    inference(ennf_transformation,[],[f8]) ).

thf(f13,plain,
    ( ( powersetI1 = $true )
    & ? [X0: $i,X1: $i] :
        ( ( ( in @ X1 @ ( powerset @ X0 ) )
          = $true )
        & ? [X2: $i] :
            ( ( ( in @ ( setminus @ X0 @ X1 ) @ ( powerset @ ( setminus @ X0 @ ( binintersect @ X1 @ X2 ) ) ) )
             != $true )
            & ( ( in @ X2 @ ( powerset @ X0 ) )
              = $true ) ) )
    & ( complementSubsetComplementIntersect = $true ) ),
    inference(flattening,[],[f12]) ).

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

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

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

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

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

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

thf(f20,plain,
    ( ( ( powersetI1 = $true )
      | ( ( $true
         != ( in @ sK4 @ ( powerset @ sK3 ) ) )
        & ( $true
          = ( subset @ sK4 @ sK3 ) ) ) )
    & ( ! [X2: $i,X3: $i] :
          ( ( $true
            = ( in @ X3 @ ( powerset @ X2 ) ) )
          | ( $true
           != ( subset @ X3 @ X2 ) ) )
      | ( powersetI1 != $true ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f19]) ).

thf(f21,plain,
    ( ( powersetI1 = $true )
    & ( $true
      = ( in @ sK6 @ ( powerset @ sK5 ) ) )
    & ( $true
     != ( in @ ( setminus @ sK5 @ sK6 ) @ ( powerset @ ( setminus @ sK5 @ ( binintersect @ sK6 @ sK7 ) ) ) ) )
    & ( $true
      = ( in @ sK7 @ ( powerset @ sK5 ) ) )
    & ( complementSubsetComplementIntersect = $true ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7)],[f13]) ).

thf(f25,plain,
    ! [X2: $i,X0: $i,X1: $i] :
      ( ( ( in @ X1 @ ( powerset @ X0 ) )
       != $true )
      | ( ( subset @ ( setminus @ X0 @ X1 ) @ ( setminus @ X0 @ ( binintersect @ X1 @ X2 ) ) )
        = $true )
      | ( ( in @ X2 @ ( powerset @ X0 ) )
       != $true )
      | ( complementSubsetComplementIntersect != $true ) ),
    inference(cnf_transformation,[],[f17]) ).

thf(f26,plain,
    ! [X2: $i,X3: $i] :
      ( ( $true
        = ( in @ X3 @ ( powerset @ X2 ) ) )
      | ( $true
       != ( subset @ X3 @ X2 ) )
      | ( powersetI1 != $true ) ),
    inference(cnf_transformation,[],[f20]) ).

thf(f29,plain,
    complementSubsetComplementIntersect = $true,
    inference(cnf_transformation,[],[f21]) ).

thf(f30,plain,
    ( $true
    = ( in @ sK7 @ ( powerset @ sK5 ) ) ),
    inference(cnf_transformation,[],[f21]) ).

thf(f31,plain,
    ( $true
   != ( in @ ( setminus @ sK5 @ sK6 ) @ ( powerset @ ( setminus @ sK5 @ ( binintersect @ sK6 @ sK7 ) ) ) ) ),
    inference(cnf_transformation,[],[f21]) ).

thf(f32,plain,
    ( $true
    = ( in @ sK6 @ ( powerset @ sK5 ) ) ),
    inference(cnf_transformation,[],[f21]) ).

thf(f33,plain,
    powersetI1 = $true,
    inference(cnf_transformation,[],[f21]) ).

thf(f36,plain,
    ! [X2: $i,X0: $i,X1: $i] :
      ( ( ( in @ X1 @ ( powerset @ X0 ) )
       != $true )
      | ( ( in @ X2 @ ( powerset @ X0 ) )
       != $true )
      | ( $true != $true )
      | ( ( subset @ ( setminus @ X0 @ X1 ) @ ( setminus @ X0 @ ( binintersect @ X1 @ X2 ) ) )
        = $true ) ),
    inference(definition_unfolding,[],[f25,f29]) ).

thf(f42,plain,
    ! [X2: $i,X3: $i] :
      ( ( $true != $true )
      | ( $true
       != ( subset @ X3 @ X2 ) )
      | ( $true
        = ( in @ X3 @ ( powerset @ X2 ) ) ) ),
    inference(definition_unfolding,[],[f26,f33]) ).

thf(f43,plain,
    ! [X2: $i,X0: $i,X1: $i] :
      ( ( ( in @ X2 @ ( powerset @ X0 ) )
       != $true )
      | ( ( in @ X1 @ ( powerset @ X0 ) )
       != $true )
      | ( ( subset @ ( setminus @ X0 @ X1 ) @ ( setminus @ X0 @ ( binintersect @ X1 @ X2 ) ) )
        = $true ) ),
    inference(trivial_inequality_removal,[],[f36]) ).

thf(f44,plain,
    ! [X2: $i,X3: $i] :
      ( ( $true
       != ( subset @ X3 @ X2 ) )
      | ( $true
        = ( in @ X3 @ ( powerset @ X2 ) ) ) ),
    inference(trivial_inequality_removal,[],[f42]) ).

thf(f45,plain,
    ! [X0: $i] :
      ( ( $true != $true )
      | ( $true
        = ( subset @ ( setminus @ sK5 @ X0 ) @ ( setminus @ sK5 @ ( binintersect @ X0 @ sK7 ) ) ) )
      | ( $true
       != ( in @ X0 @ ( powerset @ sK5 ) ) ) ),
    inference(constrained_superposition,[],[f43,f30]) ).

thf(f47,plain,
    ! [X0: $i] :
      ( ( $true
       != ( in @ X0 @ ( powerset @ sK5 ) ) )
      | ( $true
        = ( subset @ ( setminus @ sK5 @ X0 ) @ ( setminus @ sK5 @ ( binintersect @ X0 @ sK7 ) ) ) ) ),
    inference(trivial_inequality_removal,[],[f45]) ).

thf(f50,plain,
    ( ( $true != $true )
    | ( $true
      = ( subset @ ( setminus @ sK5 @ sK6 ) @ ( setminus @ sK5 @ ( binintersect @ sK6 @ sK7 ) ) ) ) ),
    inference(constrained_superposition,[],[f47,f32]) ).

thf(f52,plain,
    ( $true
    = ( subset @ ( setminus @ sK5 @ sK6 ) @ ( setminus @ sK5 @ ( binintersect @ sK6 @ sK7 ) ) ) ),
    inference(trivial_inequality_removal,[],[f50]) ).

thf(f55,plain,
    ( ( $true != $true )
    | ( $true
      = ( in @ ( setminus @ sK5 @ sK6 ) @ ( powerset @ ( setminus @ sK5 @ ( binintersect @ sK6 @ sK7 ) ) ) ) ) ),
    inference(constrained_superposition,[],[f44,f52]) ).

thf(f56,plain,
    ( $true
    = ( in @ ( setminus @ sK5 @ sK6 ) @ ( powerset @ ( setminus @ sK5 @ ( binintersect @ sK6 @ sK7 ) ) ) ) ),
    inference(trivial_inequality_removal,[],[f55]) ).

thf(f57,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f56,f31]) ).

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