TSTP Solution File: SET947+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET947+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n028.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 : Wed Aug 31 18:26:10 EDT 2022

% Result   : Theorem 0.15s 0.47s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   36 (  10 unt;   0 def)
%            Number of atoms       :  111 (  10 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  120 (  45   ~;  45   |;  19   &)
%                                         (   5 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   66 (  58   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f132,plain,
    $false,
    inference(subsumption_resolution,[],[f131,f49]) ).

fof(f49,plain,
    ~ subset(sK2,sF6),
    inference(definition_folding,[],[f37,f48,f47]) ).

fof(f47,plain,
    union(sK2) = sF5,
    introduced(function_definition,[]) ).

fof(f48,plain,
    sF6 = powerset(sF5),
    introduced(function_definition,[]) ).

fof(f37,plain,
    ~ subset(sK2,powerset(union(sK2))),
    inference(cnf_transformation,[],[f24]) ).

fof(f24,plain,
    ~ subset(sK2,powerset(union(sK2))),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f14,f23]) ).

fof(f23,plain,
    ( ? [X0] : ~ subset(X0,powerset(union(X0)))
   => ~ subset(sK2,powerset(union(sK2))) ),
    introduced(choice_axiom,[]) ).

fof(f14,plain,
    ? [X0] : ~ subset(X0,powerset(union(X0))),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,negated_conjecture,
    ~ ! [X0] : subset(X0,powerset(union(X0))),
    inference(negated_conjecture,[],[f8]) ).

fof(f8,conjecture,
    ! [X0] : subset(X0,powerset(union(X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t100_zfmisc_1) ).

fof(f131,plain,
    subset(sK2,sF6),
    inference(duplicate_literal_removal,[],[f128]) ).

fof(f128,plain,
    ( subset(sK2,sF6)
    | subset(sK2,sF6) ),
    inference(resolution,[],[f118,f41]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( ~ in(sK3(X0,X1),X0)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ( subset(X1,X0)
        | ( in(sK3(X0,X1),X1)
          & ~ in(sK3(X0,X1),X0) ) )
      & ( ! [X3] :
            ( ~ in(X3,X1)
            | in(X3,X0) )
        | ~ subset(X1,X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f27,f28]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( in(X2,X1)
          & ~ in(X2,X0) )
     => ( in(sK3(X0,X1),X1)
        & ~ in(sK3(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ( subset(X1,X0)
        | ? [X2] :
            ( in(X2,X1)
            & ~ in(X2,X0) ) )
      & ( ! [X3] :
            ( ~ in(X3,X1)
            | in(X3,X0) )
        | ~ subset(X1,X0) ) ),
    inference(rectify,[],[f26]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ( subset(X1,X0)
        | ? [X2] :
            ( in(X2,X1)
            & ~ in(X2,X0) ) )
      & ( ! [X2] :
            ( ~ in(X2,X1)
            | in(X2,X0) )
        | ~ subset(X1,X0) ) ),
    inference(nnf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( subset(X1,X0)
    <=> ! [X2] :
          ( ~ in(X2,X1)
          | in(X2,X0) ) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,plain,
    ! [X1,X0] :
      ( subset(X1,X0)
    <=> ! [X2] :
          ( in(X2,X1)
         => in(X2,X0) ) ),
    inference(rectify,[],[f3]) ).

fof(f3,axiom,
    ! [X1,X0] :
      ( ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) )
    <=> subset(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).

fof(f118,plain,
    ! [X2] :
      ( in(sK3(X2,sK2),sF6)
      | subset(sK2,X2) ),
    inference(forward_demodulation,[],[f117,f48]) ).

fof(f117,plain,
    ! [X2] :
      ( in(sK3(X2,sK2),powerset(sF5))
      | subset(sK2,X2) ),
    inference(resolution,[],[f99,f45]) ).

fof(f45,plain,
    ! [X2,X1] :
      ( ~ subset(X2,X1)
      | in(X2,powerset(X1)) ),
    inference(equality_resolution,[],[f36]) ).

fof(f36,plain,
    ! [X2,X0,X1] :
      ( in(X2,X0)
      | ~ subset(X2,X1)
      | powerset(X1) != X0 ),
    inference(cnf_transformation,[],[f22]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ( in(X2,X0)
              | ~ subset(X2,X1) )
            & ( subset(X2,X1)
              | ~ in(X2,X0) ) )
        | powerset(X1) != X0 )
      & ( powerset(X1) = X0
        | ( ( ~ subset(sK1(X0,X1),X1)
            | ~ in(sK1(X0,X1),X0) )
          & ( subset(sK1(X0,X1),X1)
            | in(sK1(X0,X1),X0) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f20,f21]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( ( ~ subset(X3,X1)
            | ~ in(X3,X0) )
          & ( subset(X3,X1)
            | in(X3,X0) ) )
     => ( ( ~ subset(sK1(X0,X1),X1)
          | ~ in(sK1(X0,X1),X0) )
        & ( subset(sK1(X0,X1),X1)
          | in(sK1(X0,X1),X0) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ( in(X2,X0)
              | ~ subset(X2,X1) )
            & ( subset(X2,X1)
              | ~ in(X2,X0) ) )
        | powerset(X1) != X0 )
      & ( powerset(X1) = X0
        | ? [X3] :
            ( ( ~ subset(X3,X1)
              | ~ in(X3,X0) )
            & ( subset(X3,X1)
              | in(X3,X0) ) ) ) ),
    inference(rectify,[],[f19]) ).

fof(f19,plain,
    ! [X1,X0] :
      ( ( ! [X2] :
            ( ( in(X2,X1)
              | ~ subset(X2,X0) )
            & ( subset(X2,X0)
              | ~ in(X2,X1) ) )
        | powerset(X0) != X1 )
      & ( powerset(X0) = X1
        | ? [X2] :
            ( ( ~ subset(X2,X0)
              | ~ in(X2,X1) )
            & ( subset(X2,X0)
              | in(X2,X1) ) ) ) ),
    inference(nnf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X1,X0] :
      ( ! [X2] :
          ( in(X2,X1)
        <=> subset(X2,X0) )
    <=> powerset(X0) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).

fof(f99,plain,
    ! [X0] :
      ( subset(sK3(X0,sK2),sF5)
      | subset(sK2,X0) ),
    inference(superposition,[],[f60,f47]) ).

fof(f60,plain,
    ! [X2,X1] :
      ( subset(sK3(X2,X1),union(X1))
      | subset(X1,X2) ),
    inference(resolution,[],[f42,f38]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( ~ in(X1,X0)
      | subset(X1,union(X0)) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ~ in(X1,X0)
      | subset(X1,union(X0)) ),
    inference(rectify,[],[f15]) ).

fof(f15,plain,
    ! [X1,X0] :
      ( ~ in(X0,X1)
      | subset(X0,union(X1)) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X1,X0] :
      ( in(X0,X1)
     => subset(X0,union(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l50_zfmisc_1) ).

fof(f42,plain,
    ! [X0,X1] :
      ( in(sK3(X0,X1),X1)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : SET947+1 : TPTP v8.1.0. Released v3.2.0.
% 0.05/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.31  % Computer : n028.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Tue Aug 30 14:41:03 EDT 2022
% 0.10/0.31  % CPUTime    : 
% 0.15/0.45  % (30438)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.15/0.45  % (30455)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.15/0.45  % (30447)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.15/0.46  % (30454)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.15/0.46  TRYING [1]
% 0.15/0.46  TRYING [2]
% 0.15/0.46  TRYING [3]
% 0.15/0.46  TRYING [4]
% 0.15/0.47  % (30447)First to succeed.
% 0.15/0.47  % (30439)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.15/0.47  % (30446)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.15/0.47  % (30447)Refutation found. Thanks to Tanya!
% 0.15/0.47  % SZS status Theorem for theBenchmark
% 0.15/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47  % (30447)------------------------------
% 0.15/0.47  % (30447)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.47  % (30447)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.47  % (30447)Termination reason: Refutation
% 0.15/0.47  
% 0.15/0.47  % (30447)Memory used [KB]: 1023
% 0.15/0.47  % (30447)Time elapsed: 0.066 s
% 0.15/0.47  % (30447)Instructions burned: 5 (million)
% 0.15/0.47  % (30447)------------------------------
% 0.15/0.47  % (30447)------------------------------
% 0.15/0.47  % (30431)Success in time 0.16 s
%------------------------------------------------------------------------------