TSTP Solution File: SET812+4 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET812+4 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n003.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 : Sun May  5 09:08:34 EDT 2024

% Result   : Theorem 0.54s 0.76s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   60 (   5 unt;   0 def)
%            Number of atoms       :  197 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  211 (  74   ~;  71   |;  45   &)
%                                         (  12 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   3 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   89 (  80   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f313,plain,
    $false,
    inference(avatar_sat_refutation,[],[f166,f288,f312]) ).

fof(f312,plain,
    spl13_2,
    inference(avatar_contradiction_clause,[],[f311]) ).

fof(f311,plain,
    ( $false
    | spl13_2 ),
    inference(subsumption_resolution,[],[f307,f165]) ).

fof(f165,plain,
    ( ~ subset(intersection(sK1,power_set(sK1)),sK1)
    | spl13_2 ),
    inference(avatar_component_clause,[],[f163]) ).

fof(f163,plain,
    ( spl13_2
  <=> subset(intersection(sK1,power_set(sK1)),sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).

fof(f307,plain,
    ( subset(intersection(sK1,power_set(sK1)),sK1)
    | spl13_2 ),
    inference(resolution,[],[f304,f114]) ).

fof(f114,plain,
    ! [X0,X1] :
      ( ~ member(sK6(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f70]) ).

fof(f70,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ member(sK6(X0,X1),X1)
          & member(sK6(X0,X1),X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f68,f69]) ).

fof(f69,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ~ member(X2,X1)
          & member(X2,X0) )
     => ( ~ member(sK6(X0,X1),X1)
        & member(sK6(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f68,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ member(X2,X1)
            & member(X2,X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f67]) ).

fof(f67,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ member(X2,X1)
            & member(X2,X0) ) )
      & ( ! [X2] :
            ( member(X2,X1)
            | ~ member(X2,X0) )
        | ~ subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f42]) ).

fof(f42,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X1)
          | ~ member(X2,X0) ) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X0)
         => member(X2,X1) ) ),
    file('/export/starexec/sandbox/tmp/tmp.CD3PyuytgY/Vampire---4.8_19805',subset) ).

fof(f304,plain,
    ( member(sK6(intersection(sK1,power_set(sK1)),sK1),sK1)
    | spl13_2 ),
    inference(resolution,[],[f291,f98]) ).

fof(f98,plain,
    ! [X2,X0,X1] :
      ( ~ member(X0,intersection(X1,X2))
      | member(X0,X1) ),
    inference(cnf_transformation,[],[f54]) ).

fof(f54,plain,
    ! [X0,X1,X2] :
      ( ( member(X0,intersection(X1,X2))
        | ~ member(X0,X2)
        | ~ member(X0,X1) )
      & ( ( member(X0,X2)
          & member(X0,X1) )
        | ~ member(X0,intersection(X1,X2)) ) ),
    inference(flattening,[],[f53]) ).

fof(f53,plain,
    ! [X0,X1,X2] :
      ( ( member(X0,intersection(X1,X2))
        | ~ member(X0,X2)
        | ~ member(X0,X1) )
      & ( ( member(X0,X2)
          & member(X0,X1) )
        | ~ member(X0,intersection(X1,X2)) ) ),
    inference(nnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1,X2] :
      ( member(X0,intersection(X1,X2))
    <=> ( member(X0,X2)
        & member(X0,X1) ) ),
    inference(rectify,[],[f4]) ).

fof(f4,axiom,
    ! [X2,X0,X1] :
      ( member(X2,intersection(X0,X1))
    <=> ( member(X2,X1)
        & member(X2,X0) ) ),
    file('/export/starexec/sandbox/tmp/tmp.CD3PyuytgY/Vampire---4.8_19805',intersection) ).

fof(f291,plain,
    ( member(sK6(intersection(sK1,power_set(sK1)),sK1),intersection(sK1,power_set(sK1)))
    | spl13_2 ),
    inference(resolution,[],[f165,f113]) ).

fof(f113,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | member(sK6(X0,X1),X0) ),
    inference(cnf_transformation,[],[f70]) ).

fof(f288,plain,
    spl13_1,
    inference(avatar_contradiction_clause,[],[f287]) ).

fof(f287,plain,
    ( $false
    | spl13_1 ),
    inference(subsumption_resolution,[],[f286,f172]) ).

fof(f172,plain,
    ( member(sK6(sK1,intersection(sK1,power_set(sK1))),power_set(sK1))
    | spl13_1 ),
    inference(resolution,[],[f170,f97]) ).

fof(f97,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | member(X0,power_set(X1)) ),
    inference(cnf_transformation,[],[f52]) ).

fof(f52,plain,
    ! [X0,X1] :
      ( ( member(X0,power_set(X1))
        | ~ subset(X0,X1) )
      & ( subset(X0,X1)
        | ~ member(X0,power_set(X1)) ) ),
    inference(nnf_transformation,[],[f22]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( member(X0,power_set(X1))
    <=> subset(X0,X1) ),
    inference(rectify,[],[f3]) ).

fof(f3,axiom,
    ! [X2,X0] :
      ( member(X2,power_set(X0))
    <=> subset(X2,X0) ),
    file('/export/starexec/sandbox/tmp/tmp.CD3PyuytgY/Vampire---4.8_19805',power_set) ).

fof(f170,plain,
    ( subset(sK6(sK1,intersection(sK1,power_set(sK1))),sK1)
    | spl13_1 ),
    inference(resolution,[],[f167,f168]) ).

fof(f168,plain,
    ! [X0] :
      ( ~ member(X0,sK1)
      | subset(X0,sK1) ),
    inference(resolution,[],[f104,f94]) ).

fof(f94,plain,
    member(sK1,on),
    inference(cnf_transformation,[],[f51]) ).

fof(f51,plain,
    ( ~ equal_set(sK1,intersection(sK1,power_set(sK1)))
    & member(sK1,on) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f36,f50]) ).

fof(f50,plain,
    ( ? [X0] :
        ( ~ equal_set(X0,intersection(X0,power_set(X0)))
        & member(X0,on) )
   => ( ~ equal_set(sK1,intersection(sK1,power_set(sK1)))
      & member(sK1,on) ) ),
    introduced(choice_axiom,[]) ).

fof(f36,plain,
    ? [X0] :
      ( ~ equal_set(X0,intersection(X0,power_set(X0)))
      & member(X0,on) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f21,negated_conjecture,
    ~ ! [X0] :
        ( member(X0,on)
       => equal_set(X0,intersection(X0,power_set(X0))) ),
    inference(negated_conjecture,[],[f20]) ).

fof(f20,conjecture,
    ! [X0] :
      ( member(X0,on)
     => equal_set(X0,intersection(X0,power_set(X0))) ),
    file('/export/starexec/sandbox/tmp/tmp.CD3PyuytgY/Vampire---4.8_19805',thV10) ).

fof(f104,plain,
    ! [X2,X0] :
      ( ~ member(X0,on)
      | ~ member(X2,X0)
      | subset(X2,X0) ),
    inference(cnf_transformation,[],[f59]) ).

fof(f59,plain,
    ! [X0] :
      ( ( member(X0,on)
        | ( ~ subset(sK2(X0),X0)
          & member(sK2(X0),X0) )
        | ~ strict_well_order(member_predicate,X0)
        | ~ set(X0) )
      & ( ( ! [X2] :
              ( subset(X2,X0)
              | ~ member(X2,X0) )
          & strict_well_order(member_predicate,X0)
          & set(X0) )
        | ~ member(X0,on) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f57,f58]) ).

fof(f58,plain,
    ! [X0] :
      ( ? [X1] :
          ( ~ subset(X1,X0)
          & member(X1,X0) )
     => ( ~ subset(sK2(X0),X0)
        & member(sK2(X0),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f57,plain,
    ! [X0] :
      ( ( member(X0,on)
        | ? [X1] :
            ( ~ subset(X1,X0)
            & member(X1,X0) )
        | ~ strict_well_order(member_predicate,X0)
        | ~ set(X0) )
      & ( ( ! [X2] :
              ( subset(X2,X0)
              | ~ member(X2,X0) )
          & strict_well_order(member_predicate,X0)
          & set(X0) )
        | ~ member(X0,on) ) ),
    inference(rectify,[],[f56]) ).

fof(f56,plain,
    ! [X0] :
      ( ( member(X0,on)
        | ? [X1] :
            ( ~ subset(X1,X0)
            & member(X1,X0) )
        | ~ strict_well_order(member_predicate,X0)
        | ~ set(X0) )
      & ( ( ! [X1] :
              ( subset(X1,X0)
              | ~ member(X1,X0) )
          & strict_well_order(member_predicate,X0)
          & set(X0) )
        | ~ member(X0,on) ) ),
    inference(flattening,[],[f55]) ).

fof(f55,plain,
    ! [X0] :
      ( ( member(X0,on)
        | ? [X1] :
            ( ~ subset(X1,X0)
            & member(X1,X0) )
        | ~ strict_well_order(member_predicate,X0)
        | ~ set(X0) )
      & ( ( ! [X1] :
              ( subset(X1,X0)
              | ~ member(X1,X0) )
          & strict_well_order(member_predicate,X0)
          & set(X0) )
        | ~ member(X0,on) ) ),
    inference(nnf_transformation,[],[f39]) ).

fof(f39,plain,
    ! [X0] :
      ( member(X0,on)
    <=> ( ! [X1] :
            ( subset(X1,X0)
            | ~ member(X1,X0) )
        & strict_well_order(member_predicate,X0)
        & set(X0) ) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f24,plain,
    ! [X0] :
      ( member(X0,on)
    <=> ( ! [X1] :
            ( member(X1,X0)
           => subset(X1,X0) )
        & strict_well_order(member_predicate,X0)
        & set(X0) ) ),
    inference(rectify,[],[f12]) ).

fof(f12,axiom,
    ! [X0] :
      ( member(X0,on)
    <=> ( ! [X2] :
            ( member(X2,X0)
           => subset(X2,X0) )
        & strict_well_order(member_predicate,X0)
        & set(X0) ) ),
    file('/export/starexec/sandbox/tmp/tmp.CD3PyuytgY/Vampire---4.8_19805',ordinal_number) ).

fof(f167,plain,
    ( member(sK6(sK1,intersection(sK1,power_set(sK1))),sK1)
    | spl13_1 ),
    inference(resolution,[],[f161,f113]) ).

fof(f161,plain,
    ( ~ subset(sK1,intersection(sK1,power_set(sK1)))
    | spl13_1 ),
    inference(avatar_component_clause,[],[f159]) ).

fof(f159,plain,
    ( spl13_1
  <=> subset(sK1,intersection(sK1,power_set(sK1))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_1])]) ).

fof(f286,plain,
    ( ~ member(sK6(sK1,intersection(sK1,power_set(sK1))),power_set(sK1))
    | spl13_1 ),
    inference(subsumption_resolution,[],[f284,f167]) ).

fof(f284,plain,
    ( ~ member(sK6(sK1,intersection(sK1,power_set(sK1))),sK1)
    | ~ member(sK6(sK1,intersection(sK1,power_set(sK1))),power_set(sK1))
    | spl13_1 ),
    inference(resolution,[],[f180,f161]) ).

fof(f180,plain,
    ! [X2,X0,X1] :
      ( subset(X0,intersection(X1,X2))
      | ~ member(sK6(X0,intersection(X1,X2)),X1)
      | ~ member(sK6(X0,intersection(X1,X2)),X2) ),
    inference(resolution,[],[f100,f114]) ).

fof(f100,plain,
    ! [X2,X0,X1] :
      ( member(X0,intersection(X1,X2))
      | ~ member(X0,X2)
      | ~ member(X0,X1) ),
    inference(cnf_transformation,[],[f54]) ).

fof(f166,plain,
    ( ~ spl13_1
    | ~ spl13_2 ),
    inference(avatar_split_clause,[],[f157,f163,f159]) ).

fof(f157,plain,
    ( ~ subset(intersection(sK1,power_set(sK1)),sK1)
    | ~ subset(sK1,intersection(sK1,power_set(sK1))) ),
    inference(resolution,[],[f101,f95]) ).

fof(f95,plain,
    ~ equal_set(sK1,intersection(sK1,power_set(sK1))),
    inference(cnf_transformation,[],[f51]) ).

fof(f101,plain,
    ! [X0,X1] :
      ( equal_set(X0,X1)
      | ~ subset(X1,X0)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f38]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( equal_set(X0,X1)
      | ~ subset(X1,X0)
      | ~ subset(X0,X1) ),
    inference(flattening,[],[f37]) ).

fof(f37,plain,
    ! [X0,X1] :
      ( equal_set(X0,X1)
      | ~ subset(X1,X0)
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f35]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( ( subset(X1,X0)
        & subset(X0,X1) )
     => equal_set(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( equal_set(X0,X1)
    <=> ( subset(X1,X0)
        & subset(X0,X1) ) ),
    file('/export/starexec/sandbox/tmp/tmp.CD3PyuytgY/Vampire---4.8_19805',equal_set) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : SET812+4 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31  % Computer : n003.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   : Fri May  3 16:34:52 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.10/0.31  This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.CD3PyuytgY/Vampire---4.8_19805
% 0.54/0.75  % (19915)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.54/0.75  % (19918)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.54/0.75  % (19919)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.54/0.75  % (19913)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.54/0.75  % (19916)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.54/0.75  % (19917)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.54/0.75  % (19914)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.54/0.75  % (19920)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.54/0.75  % (19920)Refutation not found, incomplete strategy% (19920)------------------------------
% 0.54/0.75  % (19920)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75  % (19920)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75  
% 0.54/0.75  % (19920)Memory used [KB]: 1061
% 0.54/0.75  % (19920)Time elapsed: 0.003 s
% 0.54/0.75  % (19920)Instructions burned: 3 (million)
% 0.54/0.75  % (19920)------------------------------
% 0.54/0.75  % (19920)------------------------------
% 0.54/0.75  % (19913)Refutation not found, incomplete strategy% (19913)------------------------------
% 0.54/0.75  % (19913)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75  % (19913)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75  
% 0.54/0.75  % (19913)Memory used [KB]: 1077
% 0.54/0.75  % (19913)Time elapsed: 0.004 s
% 0.54/0.75  % (19913)Instructions burned: 4 (million)
% 0.54/0.75  % (19913)------------------------------
% 0.54/0.75  % (19913)------------------------------
% 0.54/0.75  % (19921)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.54/0.75  % (19922)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.54/0.76  % (19915)First to succeed.
% 0.54/0.76  % (19915)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-19912"
% 0.54/0.76  % (19915)Refutation found. Thanks to Tanya!
% 0.54/0.76  % SZS status Theorem for Vampire---4
% 0.54/0.76  % SZS output start Proof for Vampire---4
% See solution above
% 0.54/0.76  % (19915)------------------------------
% 0.54/0.76  % (19915)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.76  % (19915)Termination reason: Refutation
% 0.54/0.76  
% 0.54/0.76  % (19915)Memory used [KB]: 1188
% 0.54/0.76  % (19915)Time elapsed: 0.011 s
% 0.54/0.76  % (19915)Instructions burned: 21 (million)
% 0.54/0.76  % (19912)Success in time 0.441 s
% 0.54/0.76  % Vampire---4.8 exiting
%------------------------------------------------------------------------------