TSTP Solution File: SET199+3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET199+3 : TPTP v8.1.2. Released v2.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 : n021.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 May  1 03:45:44 EDT 2024

% Result   : Theorem 0.61s 0.82s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   39 (   8 unt;   0 def)
%            Number of atoms       :  106 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  108 (  41   ~;  32   |;  25   &)
%                                         (   5 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   56 (  44   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f49,plain,
    $false,
    inference(avatar_sat_refutation,[],[f42,f45,f48]) ).

fof(f48,plain,
    spl4_2,
    inference(avatar_contradiction_clause,[],[f47]) ).

fof(f47,plain,
    ( $false
    | spl4_2 ),
    inference(subsumption_resolution,[],[f46,f31]) ).

fof(f31,plain,
    member(sK3(sK0,intersection(sK1,sK2)),sK0),
    inference(resolution,[],[f21,f27]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | member(sK3(X0,X1),X0) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ member(sK3(X0,X1),X1)
          & member(sK3(X0,X1),X0) ) )
      & ( ! [X3] :
            ( member(X3,X1)
            | ~ member(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f16,f17]) ).

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

fof(f16,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,[],[f15]) ).

fof(f15,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,[],[f10]) ).

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

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

fof(f21,plain,
    ~ subset(sK0,intersection(sK1,sK2)),
    inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
    ( ~ subset(sK0,intersection(sK1,sK2))
    & subset(sK0,sK2)
    & subset(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f11]) ).

fof(f11,plain,
    ( ? [X0,X1,X2] :
        ( ~ subset(X0,intersection(X1,X2))
        & subset(X0,X2)
        & subset(X0,X1) )
   => ( ~ subset(sK0,intersection(sK1,sK2))
      & subset(sK0,sK2)
      & subset(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ? [X0,X1,X2] :
      ( ~ subset(X0,intersection(X1,X2))
      & subset(X0,X2)
      & subset(X0,X1) ),
    inference(flattening,[],[f8]) ).

fof(f8,plain,
    ? [X0,X1,X2] :
      ( ~ subset(X0,intersection(X1,X2))
      & subset(X0,X2)
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( subset(X0,X2)
          & subset(X0,X1) )
       => subset(X0,intersection(X1,X2)) ),
    inference(negated_conjecture,[],[f6]) ).

fof(f6,conjecture,
    ! [X0,X1,X2] :
      ( ( subset(X0,X2)
        & subset(X0,X1) )
     => subset(X0,intersection(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/tmp.UuoUqQxxGn/Vampire---4.8_2409',prove_intersection_of_subsets) ).

fof(f46,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),sK0)
    | spl4_2 ),
    inference(resolution,[],[f41,f30]) ).

fof(f30,plain,
    ! [X0] :
      ( member(X0,sK2)
      | ~ member(X0,sK0) ),
    inference(resolution,[],[f20,f26]) ).

fof(f26,plain,
    ! [X3,X0,X1] :
      ( ~ subset(X0,X1)
      | ~ member(X3,X0)
      | member(X3,X1) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f20,plain,
    subset(sK0,sK2),
    inference(cnf_transformation,[],[f12]) ).

fof(f41,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),sK2)
    | spl4_2 ),
    inference(avatar_component_clause,[],[f39]) ).

fof(f39,plain,
    ( spl4_2
  <=> member(sK3(sK0,intersection(sK1,sK2)),sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).

fof(f45,plain,
    spl4_1,
    inference(avatar_contradiction_clause,[],[f44]) ).

fof(f44,plain,
    ( $false
    | spl4_1 ),
    inference(subsumption_resolution,[],[f43,f31]) ).

fof(f43,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),sK0)
    | spl4_1 ),
    inference(resolution,[],[f37,f29]) ).

fof(f29,plain,
    ! [X0] :
      ( member(X0,sK1)
      | ~ member(X0,sK0) ),
    inference(resolution,[],[f19,f26]) ).

fof(f19,plain,
    subset(sK0,sK1),
    inference(cnf_transformation,[],[f12]) ).

fof(f37,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),sK1)
    | spl4_1 ),
    inference(avatar_component_clause,[],[f35]) ).

fof(f35,plain,
    ( spl4_1
  <=> member(sK3(sK0,intersection(sK1,sK2)),sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).

fof(f42,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(avatar_split_clause,[],[f33,f39,f35]) ).

fof(f33,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),sK2)
    | ~ member(sK3(sK0,intersection(sK1,sK2)),sK1) ),
    inference(resolution,[],[f32,f24]) ).

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

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

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

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

fof(f32,plain,
    ~ member(sK3(sK0,intersection(sK1,sK2)),intersection(sK1,sK2)),
    inference(resolution,[],[f21,f28]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ member(sK3(X0,X1),X1) ),
    inference(cnf_transformation,[],[f18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : SET199+3 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.13  % 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.11/0.33  % Computer : n021.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Tue Apr 30 17:17:40 EDT 2024
% 0.11/0.34  % CPUTime    : 
% 0.11/0.34  This is a FOF_THM_RFO_SEQ problem
% 0.11/0.34  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.UuoUqQxxGn/Vampire---4.8_2409
% 0.61/0.82  % (2530)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.61/0.82  % (2529)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.61/0.82  % (2527)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.61/0.82  % (2531)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.61/0.82  % (2532)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.61/0.82  % (2528)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.61/0.82  % (2533)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.61/0.82  % (2534)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.61/0.82  % (2532)Refutation not found, incomplete strategy% (2532)------------------------------
% 0.61/0.82  % (2532)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82  % (2532)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.82  
% 0.61/0.82  % (2532)Memory used [KB]: 953
% 0.61/0.82  % (2532)Time elapsed: 0.003 s
% 0.61/0.82  % (2532)Instructions burned: 2 (million)
% 0.61/0.82  % (2532)------------------------------
% 0.61/0.82  % (2532)------------------------------
% 0.61/0.82  % (2534)First to succeed.
% 0.61/0.82  % (2533)Also succeeded, but the first one will report.
% 0.61/0.82  % (2534)Refutation found. Thanks to Tanya!
% 0.61/0.82  % SZS status Theorem for Vampire---4
% 0.61/0.82  % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.82  % (2534)------------------------------
% 0.61/0.82  % (2534)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82  % (2534)Termination reason: Refutation
% 0.61/0.82  
% 0.61/0.82  % (2534)Memory used [KB]: 984
% 0.61/0.82  % (2534)Time elapsed: 0.003 s
% 0.61/0.82  % (2534)Instructions burned: 3 (million)
% 0.61/0.82  % (2534)------------------------------
% 0.61/0.82  % (2534)------------------------------
% 0.61/0.82  % (2522)Success in time 0.48 s
% 0.61/0.82  % Vampire---4.8 exiting
%------------------------------------------------------------------------------