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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET578+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 : n032.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:48:06 EDT 2024

% Result   : Theorem 0.42s 0.61s
% Output   : Refutation 0.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   57 (   3 unt;   0 def)
%            Number of atoms       :  197 (  19 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  229 (  89   ~;  90   |;  35   &)
%                                         (  11 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   5 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   74 (  59   !;  15   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f75,plain,
    $false,
    inference(avatar_sat_refutation,[],[f50,f51,f58,f68,f71,f74]) ).

fof(f74,plain,
    ( ~ spl5_1
    | spl5_4 ),
    inference(avatar_contradiction_clause,[],[f73]) ).

fof(f73,plain,
    ( $false
    | ~ spl5_1
    | spl5_4 ),
    inference(subsumption_resolution,[],[f72,f45]) ).

fof(f45,plain,
    ( member(sK3(sK0,intersection(sK1,sK2)),sK0)
    | ~ spl5_1 ),
    inference(avatar_component_clause,[],[f43]) ).

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

fof(f72,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),sK0)
    | spl5_4 ),
    inference(resolution,[],[f67,f21]) ).

fof(f21,plain,
    ! [X3] :
      ( member(X3,sK2)
      | ~ member(X3,sK0) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ( sK0 != intersection(sK1,sK2)
    & ! [X3] :
        ( ( member(X3,sK0)
          | ~ member(X3,sK2)
          | ~ member(X3,sK1) )
        & ( ( member(X3,sK2)
            & member(X3,sK1) )
          | ~ member(X3,sK0) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f11,f12]) ).

fof(f12,plain,
    ( ? [X0,X1,X2] :
        ( intersection(X1,X2) != X0
        & ! [X3] :
            ( ( member(X3,X0)
              | ~ member(X3,X2)
              | ~ member(X3,X1) )
            & ( ( member(X3,X2)
                & member(X3,X1) )
              | ~ member(X3,X0) ) ) )
   => ( sK0 != intersection(sK1,sK2)
      & ! [X3] :
          ( ( member(X3,sK0)
            | ~ member(X3,sK2)
            | ~ member(X3,sK1) )
          & ( ( member(X3,sK2)
              & member(X3,sK1) )
            | ~ member(X3,sK0) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f11,plain,
    ? [X0,X1,X2] :
      ( intersection(X1,X2) != X0
      & ! [X3] :
          ( ( member(X3,X0)
            | ~ member(X3,X2)
            | ~ member(X3,X1) )
          & ( ( member(X3,X2)
              & member(X3,X1) )
            | ~ member(X3,X0) ) ) ),
    inference(flattening,[],[f10]) ).

fof(f10,plain,
    ? [X0,X1,X2] :
      ( intersection(X1,X2) != X0
      & ! [X3] :
          ( ( member(X3,X0)
            | ~ member(X3,X2)
            | ~ member(X3,X1) )
          & ( ( member(X3,X2)
              & member(X3,X1) )
            | ~ member(X3,X0) ) ) ),
    inference(nnf_transformation,[],[f9]) ).

fof(f9,plain,
    ? [X0,X1,X2] :
      ( intersection(X1,X2) != X0
      & ! [X3] :
          ( member(X3,X0)
        <=> ( member(X3,X2)
            & member(X3,X1) ) ) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f8,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ! [X3] :
            ( member(X3,X0)
          <=> ( member(X3,X2)
              & member(X3,X1) ) )
       => intersection(X1,X2) = X0 ),
    inference(negated_conjecture,[],[f7]) ).

fof(f7,conjecture,
    ! [X0,X1,X2] :
      ( ! [X3] :
          ( member(X3,X0)
        <=> ( member(X3,X2)
            & member(X3,X1) ) )
     => intersection(X1,X2) = X0 ),
    file('/export/starexec/sandbox/tmp/tmp.8UlfbeCbUt/Vampire---4.8_19628',prove_th19) ).

fof(f67,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),sK2)
    | spl5_4 ),
    inference(avatar_component_clause,[],[f65]) ).

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

fof(f71,plain,
    ( ~ spl5_1
    | spl5_3 ),
    inference(avatar_contradiction_clause,[],[f70]) ).

fof(f70,plain,
    ( $false
    | ~ spl5_1
    | spl5_3 ),
    inference(subsumption_resolution,[],[f69,f45]) ).

fof(f69,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),sK0)
    | spl5_3 ),
    inference(resolution,[],[f63,f20]) ).

fof(f20,plain,
    ! [X3] :
      ( member(X3,sK1)
      | ~ member(X3,sK0) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f63,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),sK1)
    | spl5_3 ),
    inference(avatar_component_clause,[],[f61]) ).

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

fof(f68,plain,
    ( ~ spl5_3
    | ~ spl5_4
    | spl5_2 ),
    inference(avatar_split_clause,[],[f59,f47,f65,f61]) ).

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

fof(f59,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),sK2)
    | ~ member(sK3(sK0,intersection(sK1,sK2)),sK1)
    | spl5_2 ),
    inference(resolution,[],[f48,f31]) ).

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

fof(f19,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,[],[f18]) ).

fof(f18,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.8UlfbeCbUt/Vampire---4.8_19628',intersection_defn) ).

fof(f48,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),intersection(sK1,sK2))
    | spl5_2 ),
    inference(avatar_component_clause,[],[f47]) ).

fof(f58,plain,
    ( spl5_1
    | ~ spl5_2 ),
    inference(avatar_contradiction_clause,[],[f57]) ).

fof(f57,plain,
    ( $false
    | spl5_1
    | ~ spl5_2 ),
    inference(subsumption_resolution,[],[f56,f53]) ).

fof(f53,plain,
    ( member(sK3(sK0,intersection(sK1,sK2)),sK1)
    | ~ spl5_2 ),
    inference(resolution,[],[f49,f29]) ).

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

fof(f49,plain,
    ( member(sK3(sK0,intersection(sK1,sK2)),intersection(sK1,sK2))
    | ~ spl5_2 ),
    inference(avatar_component_clause,[],[f47]) ).

fof(f56,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),sK1)
    | spl5_1
    | ~ spl5_2 ),
    inference(subsumption_resolution,[],[f55,f44]) ).

fof(f44,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),sK0)
    | spl5_1 ),
    inference(avatar_component_clause,[],[f43]) ).

fof(f55,plain,
    ( member(sK3(sK0,intersection(sK1,sK2)),sK0)
    | ~ member(sK3(sK0,intersection(sK1,sK2)),sK1)
    | ~ spl5_2 ),
    inference(resolution,[],[f54,f22]) ).

fof(f22,plain,
    ! [X3] :
      ( ~ member(X3,sK2)
      | member(X3,sK0)
      | ~ member(X3,sK1) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f54,plain,
    ( member(sK3(sK0,intersection(sK1,sK2)),sK2)
    | ~ spl5_2 ),
    inference(resolution,[],[f49,f30]) ).

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

fof(f51,plain,
    ( ~ spl5_1
    | ~ spl5_2 ),
    inference(avatar_split_clause,[],[f41,f47,f43]) ).

fof(f41,plain,
    ( ~ member(sK3(sK0,intersection(sK1,sK2)),intersection(sK1,sK2))
    | ~ member(sK3(sK0,intersection(sK1,sK2)),sK0) ),
    inference(resolution,[],[f35,f36]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( sQ4_eqProxy(X0,X1)
      | ~ member(sK3(X0,X1),X1)
      | ~ member(sK3(X0,X1),X0) ),
    inference(equality_proxy_replacement,[],[f27,f34]) ).

fof(f34,plain,
    ! [X0,X1] :
      ( sQ4_eqProxy(X0,X1)
    <=> X0 = X1 ),
    introduced(equality_proxy_definition,[new_symbols(naming,[sQ4_eqProxy])]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ member(sK3(X0,X1),X1)
      | ~ member(sK3(X0,X1),X0) ),
    inference(cnf_transformation,[],[f17]) ).

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

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

fof(f15,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ? [X2] :
            ( ( ~ member(X2,X1)
              | ~ member(X2,X0) )
            & ( member(X2,X1)
              | member(X2,X0) ) ) )
      & ( ! [X3] :
            ( ( member(X3,X0)
              | ~ member(X3,X1) )
            & ( member(X3,X1)
              | ~ member(X3,X0) ) )
        | X0 != X1 ) ),
    inference(rectify,[],[f14]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ? [X2] :
            ( ( ~ member(X2,X1)
              | ~ member(X2,X0) )
            & ( member(X2,X1)
              | member(X2,X0) ) ) )
      & ( ! [X2] :
            ( ( member(X2,X0)
              | ~ member(X2,X1) )
            & ( member(X2,X1)
              | ~ member(X2,X0) ) )
        | X0 != X1 ) ),
    inference(nnf_transformation,[],[f6]) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ! [X2] :
          ( member(X2,X0)
        <=> member(X2,X1) ) ),
    file('/export/starexec/sandbox/tmp/tmp.8UlfbeCbUt/Vampire---4.8_19628',equal_member_defn) ).

fof(f35,plain,
    ~ sQ4_eqProxy(sK0,intersection(sK1,sK2)),
    inference(equality_proxy_replacement,[],[f23,f34]) ).

fof(f23,plain,
    sK0 != intersection(sK1,sK2),
    inference(cnf_transformation,[],[f13]) ).

fof(f50,plain,
    ( spl5_1
    | spl5_2 ),
    inference(avatar_split_clause,[],[f40,f47,f43]) ).

fof(f40,plain,
    ( member(sK3(sK0,intersection(sK1,sK2)),intersection(sK1,sK2))
    | member(sK3(sK0,intersection(sK1,sK2)),sK0) ),
    inference(resolution,[],[f35,f37]) ).

fof(f37,plain,
    ! [X0,X1] :
      ( sQ4_eqProxy(X0,X1)
      | member(sK3(X0,X1),X1)
      | member(sK3(X0,X1),X0) ),
    inference(equality_proxy_replacement,[],[f26,f34]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( X0 = X1
      | member(sK3(X0,X1),X1)
      | member(sK3(X0,X1),X0) ),
    inference(cnf_transformation,[],[f17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09  % Problem    : SET578+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.10  % 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.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit   : 300
% 0.10/0.29  % WCLimit    : 300
% 0.10/0.29  % DateTime   : Tue Apr 30 17:21:06 EDT 2024
% 0.10/0.29  % CPUTime    : 
% 0.10/0.29  This is a FOF_THM_RFO_SEQ problem
% 0.10/0.29  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.8UlfbeCbUt/Vampire---4.8_19628
% 0.42/0.60  % (19872)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2997ds/78Mi)
% 0.42/0.60  % (19876)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 (2997ds/83Mi)
% 0.42/0.60  % (19870)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 (2997ds/34Mi)
% 0.42/0.60  % (19871)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 (2997ds/51Mi)
% 0.42/0.60  % (19875)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2997ds/45Mi)
% 0.42/0.60  % (19873)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2997ds/33Mi)
% 0.42/0.60  % (19877)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 (2997ds/56Mi)
% 0.42/0.60  % (19874)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 (2997ds/34Mi)
% 0.42/0.60  % (19875)Refutation not found, incomplete strategy% (19875)------------------------------
% 0.42/0.60  % (19875)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.42/0.60  % (19873)Refutation not found, incomplete strategy% (19873)------------------------------
% 0.42/0.60  % (19873)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.42/0.60  % (19873)Termination reason: Refutation not found, incomplete strategy
% 0.42/0.60  
% 0.42/0.60  % (19873)Memory used [KB]: 969
% 0.42/0.60  % (19873)Time elapsed: 0.004 s
% 0.42/0.60  % (19873)Instructions burned: 2 (million)
% 0.42/0.60  % (19873)------------------------------
% 0.42/0.60  % (19873)------------------------------
% 0.42/0.60  % (19875)Termination reason: Refutation not found, incomplete strategy
% 0.42/0.60  
% 0.42/0.60  % (19875)Memory used [KB]: 968
% 0.42/0.60  % (19875)Time elapsed: 0.004 s
% 0.42/0.60  % (19875)Instructions burned: 3 (million)
% 0.42/0.60  % (19875)------------------------------
% 0.42/0.60  % (19875)------------------------------
% 0.42/0.60  % (19877)First to succeed.
% 0.42/0.60  % (19874)Also succeeded, but the first one will report.
% 0.42/0.60  % (19870)Also succeeded, but the first one will report.
% 0.42/0.61  % (19877)Refutation found. Thanks to Tanya!
% 0.42/0.61  % SZS status Theorem for Vampire---4
% 0.42/0.61  % SZS output start Proof for Vampire---4
% See solution above
% 0.42/0.61  % (19877)------------------------------
% 0.42/0.61  % (19877)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.42/0.61  % (19877)Termination reason: Refutation
% 0.42/0.61  
% 0.42/0.61  % (19877)Memory used [KB]: 989
% 0.42/0.61  % (19877)Time elapsed: 0.005 s
% 0.42/0.61  % (19877)Instructions burned: 4 (million)
% 0.42/0.61  % (19877)------------------------------
% 0.42/0.61  % (19877)------------------------------
% 0.42/0.61  % (19866)Success in time 0.301 s
% 0.42/0.61  % Vampire---4.8 exiting
%------------------------------------------------------------------------------