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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SEU173+1 : TPTP v8.1.0. Released v3.3.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 : n001.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:32:19 EDT 2022

% Result   : Theorem 0.18s 0.44s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   42 (  11 unt;   0 def)
%            Number of atoms       :  156 (   9 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  179 (  65   ~;  62   |;  32   &)
%                                         (   9 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   80 (  68   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f150,plain,
    $false,
    inference(subsumption_resolution,[],[f149,f86]) ).

fof(f86,plain,
    ~ empty(sF9),
    inference(superposition,[],[f80,f84]) ).

fof(f84,plain,
    powerset(sK6) = sF9,
    introduced(function_definition,[]) ).

fof(f80,plain,
    ! [X0] : ~ empty(powerset(X0)),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,axiom,
    ! [X0] : ~ empty(powerset(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_subset_1) ).

fof(f149,plain,
    empty(sF9),
    inference(subsumption_resolution,[],[f146,f85]) ).

fof(f85,plain,
    ~ element(sK7,sF9),
    inference(definition_folding,[],[f75,f84]) ).

fof(f75,plain,
    ~ element(sK7,powerset(sK6)),
    inference(cnf_transformation,[],[f52]) ).

fof(f52,plain,
    ( ~ element(sK7,powerset(sK6))
    & ! [X2] :
        ( ~ in(X2,sK7)
        | in(X2,sK6) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f50,f51]) ).

fof(f51,plain,
    ( ? [X0,X1] :
        ( ~ element(X1,powerset(X0))
        & ! [X2] :
            ( ~ in(X2,X1)
            | in(X2,X0) ) )
   => ( ~ element(sK7,powerset(sK6))
      & ! [X2] :
          ( ~ in(X2,sK7)
          | in(X2,sK6) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f50,plain,
    ? [X0,X1] :
      ( ~ element(X1,powerset(X0))
      & ! [X2] :
          ( ~ in(X2,X1)
          | in(X2,X0) ) ),
    inference(rectify,[],[f27]) ).

fof(f27,plain,
    ? [X1,X0] :
      ( ~ element(X0,powerset(X1))
      & ! [X2] :
          ( ~ in(X2,X0)
          | in(X2,X1) ) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f12,negated_conjecture,
    ~ ! [X0,X1] :
        ( ! [X2] :
            ( in(X2,X0)
           => in(X2,X1) )
       => element(X0,powerset(X1)) ),
    inference(negated_conjecture,[],[f11]) ).

fof(f11,conjecture,
    ! [X0,X1] :
      ( ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) )
     => element(X0,powerset(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l71_subset_1) ).

fof(f146,plain,
    ( element(sK7,sF9)
    | empty(sF9) ),
    inference(resolution,[],[f137,f59]) ).

fof(f59,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | element(X0,X1)
      | empty(X1) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f33,plain,
    ! [X0,X1] :
      ( ( empty(X1)
        | ( ( element(X0,X1)
            | ~ in(X0,X1) )
          & ( in(X0,X1)
            | ~ element(X0,X1) ) ) )
      & ( ( ( element(X0,X1)
            | ~ empty(X0) )
          & ( empty(X0)
            | ~ element(X0,X1) ) )
        | ~ empty(X1) ) ),
    inference(rectify,[],[f32]) ).

fof(f32,plain,
    ! [X1,X0] :
      ( ( empty(X0)
        | ( ( element(X1,X0)
            | ~ in(X1,X0) )
          & ( in(X1,X0)
            | ~ element(X1,X0) ) ) )
      & ( ( ( element(X1,X0)
            | ~ empty(X1) )
          & ( empty(X1)
            | ~ element(X1,X0) ) )
        | ~ empty(X0) ) ),
    inference(nnf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X1,X0] :
      ( ( empty(X0)
        | ( element(X1,X0)
        <=> in(X1,X0) ) )
      & ( ( element(X1,X0)
        <=> empty(X1) )
        | ~ empty(X0) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X1,X0] :
      ( ( ~ empty(X0)
       => ( element(X1,X0)
        <=> in(X1,X0) ) )
      & ( empty(X0)
       => ( element(X1,X0)
        <=> empty(X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_subset_1) ).

fof(f137,plain,
    in(sK7,sF9),
    inference(forward_demodulation,[],[f136,f84]) ).

fof(f136,plain,
    in(sK7,powerset(sK6)),
    inference(resolution,[],[f132,f82]) ).

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

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

fof(f39,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])],[f37,f38]) ).

fof(f38,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(f37,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,[],[f36]) ).

fof(f36,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(f132,plain,
    subset(sK7,sK6),
    inference(duplicate_literal_removal,[],[f131]) ).

fof(f131,plain,
    ( subset(sK7,sK6)
    | subset(sK7,sK6) ),
    inference(resolution,[],[f67,f121]) ).

fof(f121,plain,
    ! [X0] :
      ( in(sK2(X0,sK7),sK6)
      | subset(sK7,X0) ),
    inference(resolution,[],[f66,f74]) ).

fof(f74,plain,
    ! [X2] :
      ( ~ in(X2,sK7)
      | in(X2,sK6) ),
    inference(cnf_transformation,[],[f52]) ).

fof(f66,plain,
    ! [X0,X1] :
      ( in(sK2(X0,X1),X1)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f43]) ).

fof(f43,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( in(X2,X0)
            | ~ in(X2,X1) )
        | ~ subset(X1,X0) )
      & ( subset(X1,X0)
        | ( ~ in(sK2(X0,X1),X0)
          & in(sK2(X0,X1),X1) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f41,f42]) ).

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

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

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

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

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

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

fof(f67,plain,
    ! [X0,X1] :
      ( ~ in(sK2(X0,X1),X0)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : SEU173+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n001.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 15:07:46 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.43  % (8285)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.18/0.43  % (8277)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.18/0.44  % (8277)First to succeed.
% 0.18/0.44  % (8277)Refutation found. Thanks to Tanya!
% 0.18/0.44  % SZS status Theorem for theBenchmark
% 0.18/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.44  % (8277)------------------------------
% 0.18/0.44  % (8277)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.44  % (8277)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.44  % (8277)Termination reason: Refutation
% 0.18/0.44  
% 0.18/0.44  % (8277)Memory used [KB]: 1023
% 0.18/0.44  % (8277)Time elapsed: 0.044 s
% 0.18/0.44  % (8277)Instructions burned: 5 (million)
% 0.18/0.44  % (8277)------------------------------
% 0.18/0.44  % (8277)------------------------------
% 0.18/0.44  % (8261)Success in time 0.104 s
%------------------------------------------------------------------------------