TSTP Solution File: SET867+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SET867+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 03:24:39 EDT 2024

% Result   : Theorem 0.14s 0.38s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   30 (  10 unt;   0 def)
%            Number of atoms       :  113 (  20 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  132 (  49   ~;  44   |;  29   &)
%                                         (   6 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   71 (  55   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f62,plain,
    $false,
    inference(trivial_inequality_removal,[],[f60]) ).

fof(f60,plain,
    empty_set != empty_set,
    inference(superposition,[],[f28,f56]) ).

fof(f56,plain,
    empty_set = union(empty_set),
    inference(resolution,[],[f55,f31]) ).

fof(f31,plain,
    ! [X0] :
      ( in(sK1(X0),X0)
      | empty_set = X0 ),
    inference(cnf_transformation,[],[f16]) ).

fof(f16,plain,
    ! [X0] :
      ( ( empty_set = X0
        | in(sK1(X0),X0) )
      & ( ! [X2] : ~ in(X2,X0)
        | empty_set != X0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f14,f15]) ).

fof(f15,plain,
    ! [X0] :
      ( ? [X1] : in(X1,X0)
     => in(sK1(X0),X0) ),
    introduced(choice_axiom,[]) ).

fof(f14,plain,
    ! [X0] :
      ( ( empty_set = X0
        | ? [X1] : in(X1,X0) )
      & ( ! [X2] : ~ in(X2,X0)
        | empty_set != X0 ) ),
    inference(rectify,[],[f13]) ).

fof(f13,plain,
    ! [X0] :
      ( ( empty_set = X0
        | ? [X1] : in(X1,X0) )
      & ( ! [X1] : ~ in(X1,X0)
        | empty_set != X0 ) ),
    inference(nnf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0] :
      ( empty_set = X0
    <=> ! [X1] : ~ in(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).

fof(f55,plain,
    ! [X0] : ~ in(X0,union(empty_set)),
    inference(resolution,[],[f54,f44]) ).

fof(f44,plain,
    ! [X0] : sP0(X0,union(X0)),
    inference(equality_resolution,[],[f39]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( sP0(X0,X1)
      | union(X0) != X1 ),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ( union(X0) = X1
        | ~ sP0(X0,X1) )
      & ( sP0(X0,X1)
        | union(X0) != X1 ) ),
    inference(nnf_transformation,[],[f12]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( union(X0) = X1
    <=> sP0(X0,X1) ),
    inference(definition_folding,[],[f3,f11]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( sP0(X0,X1)
    <=> ! [X2] :
          ( in(X2,X1)
        <=> ? [X3] :
              ( in(X3,X0)
              & in(X2,X3) ) ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( union(X0) = X1
    <=> ! [X2] :
          ( in(X2,X1)
        <=> ? [X3] :
              ( in(X3,X0)
              & in(X2,X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).

fof(f54,plain,
    ! [X0,X1] :
      ( ~ sP0(empty_set,X1)
      | ~ in(X0,X1) ),
    inference(resolution,[],[f34,f43]) ).

fof(f43,plain,
    ! [X2] : ~ in(X2,empty_set),
    inference(equality_resolution,[],[f30]) ).

fof(f30,plain,
    ! [X2,X0] :
      ( ~ in(X2,X0)
      | empty_set != X0 ),
    inference(cnf_transformation,[],[f16]) ).

fof(f34,plain,
    ! [X0,X1,X5] :
      ( in(sK4(X0,X5),X0)
      | ~ in(X5,X1)
      | ~ sP0(X0,X1) ),
    inference(cnf_transformation,[],[f22]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ( sP0(X0,X1)
        | ( ( ! [X3] :
                ( ~ in(X3,X0)
                | ~ in(sK2(X0,X1),X3) )
            | ~ in(sK2(X0,X1),X1) )
          & ( ( in(sK3(X0,X1),X0)
              & in(sK2(X0,X1),sK3(X0,X1)) )
            | in(sK2(X0,X1),X1) ) ) )
      & ( ! [X5] :
            ( ( in(X5,X1)
              | ! [X6] :
                  ( ~ in(X6,X0)
                  | ~ in(X5,X6) ) )
            & ( ( in(sK4(X0,X5),X0)
                & in(X5,sK4(X0,X5)) )
              | ~ in(X5,X1) ) )
        | ~ sP0(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f18,f21,f20,f19]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ( ! [X3] :
                ( ~ in(X3,X0)
                | ~ in(X2,X3) )
            | ~ in(X2,X1) )
          & ( ? [X4] :
                ( in(X4,X0)
                & in(X2,X4) )
            | in(X2,X1) ) )
     => ( ( ! [X3] :
              ( ~ in(X3,X0)
              | ~ in(sK2(X0,X1),X3) )
          | ~ in(sK2(X0,X1),X1) )
        & ( ? [X4] :
              ( in(X4,X0)
              & in(sK2(X0,X1),X4) )
          | in(sK2(X0,X1),X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ? [X4] :
          ( in(X4,X0)
          & in(sK2(X0,X1),X4) )
     => ( in(sK3(X0,X1),X0)
        & in(sK2(X0,X1),sK3(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f21,plain,
    ! [X0,X5] :
      ( ? [X7] :
          ( in(X7,X0)
          & in(X5,X7) )
     => ( in(sK4(X0,X5),X0)
        & in(X5,sK4(X0,X5)) ) ),
    introduced(choice_axiom,[]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ( sP0(X0,X1)
        | ? [X2] :
            ( ( ! [X3] :
                  ( ~ in(X3,X0)
                  | ~ in(X2,X3) )
              | ~ in(X2,X1) )
            & ( ? [X4] :
                  ( in(X4,X0)
                  & in(X2,X4) )
              | in(X2,X1) ) ) )
      & ( ! [X5] :
            ( ( in(X5,X1)
              | ! [X6] :
                  ( ~ in(X6,X0)
                  | ~ in(X5,X6) ) )
            & ( ? [X7] :
                  ( in(X7,X0)
                  & in(X5,X7) )
              | ~ in(X5,X1) ) )
        | ~ sP0(X0,X1) ) ),
    inference(rectify,[],[f17]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ( sP0(X0,X1)
        | ? [X2] :
            ( ( ! [X3] :
                  ( ~ in(X3,X0)
                  | ~ in(X2,X3) )
              | ~ in(X2,X1) )
            & ( ? [X3] :
                  ( in(X3,X0)
                  & in(X2,X3) )
              | in(X2,X1) ) ) )
      & ( ! [X2] :
            ( ( in(X2,X1)
              | ! [X3] :
                  ( ~ in(X3,X0)
                  | ~ in(X2,X3) ) )
            & ( ? [X3] :
                  ( in(X3,X0)
                  & in(X2,X3) )
              | ~ in(X2,X1) ) )
        | ~ sP0(X0,X1) ) ),
    inference(nnf_transformation,[],[f11]) ).

fof(f28,plain,
    empty_set != union(empty_set),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    empty_set != union(empty_set),
    inference(flattening,[],[f8]) ).

fof(f8,negated_conjecture,
    empty_set != union(empty_set),
    inference(negated_conjecture,[],[f7]) ).

fof(f7,conjecture,
    empty_set = union(empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_zfmisc_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET867+1 : TPTP v8.2.0. Released v3.2.0.
% 0.12/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 13:05:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.36  % (11255)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (11260)WARNING: value z3 for option sas not known
% 0.14/0.38  % (11261)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38  % (11263)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.38  % (11260)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.38  % (11258)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38  % (11259)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38  % (11264)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.38  % (11262)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  % (11263)First to succeed.
% 0.14/0.38  TRYING [3]
% 0.14/0.38  % (11263)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11255"
% 0.14/0.38  % (11264)Also succeeded, but the first one will report.
% 0.14/0.38  % (11260)Also succeeded, but the first one will report.
% 0.14/0.38  % (11263)Refutation found. Thanks to Tanya!
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38  % (11263)------------------------------
% 0.14/0.38  % (11263)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.38  % (11263)Termination reason: Refutation
% 0.14/0.38  
% 0.14/0.38  % (11263)Memory used [KB]: 770
% 0.14/0.38  % (11263)Time elapsed: 0.006 s
% 0.14/0.38  % (11263)Instructions burned: 4 (million)
% 0.14/0.38  % (11255)Success in time 0.023 s
%------------------------------------------------------------------------------