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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET639+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 : n024.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:27 EDT 2024

% Result   : Theorem 0.57s 0.75s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   21 (   7 unt;   0 def)
%            Number of atoms       :   47 (  12 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   43 (  17   ~;  11   |;   7   &)
%                                         (   5 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   34 (  30   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f68,plain,
    $false,
    inference(unit_resulting_resolution,[],[f18,f35,f65,f21]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( member(sK2(X0,X1),X1)
      | member(sK2(X0,X1),X0)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f9]) ).

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

fof(f65,plain,
    ! [X0] : ~ member(X0,sK0),
    inference(subsumption_resolution,[],[f64,f41]) ).

fof(f41,plain,
    ! [X0] :
      ( member(X0,sK1)
      | ~ member(X0,sK0) ),
    inference(resolution,[],[f16,f32]) ).

fof(f32,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X0,X1)
      | member(X2,X1)
      | ~ member(X2,X0) ),
    inference(cnf_transformation,[],[f15]) ).

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

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

fof(f16,plain,
    subset(sK0,sK1),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ? [X0,X1] :
      ( empty_set != X0
      & empty_set = intersection(X1,X0)
      & subset(X0,X1) ),
    inference(flattening,[],[f12]) ).

fof(f12,plain,
    ? [X0,X1] :
      ( empty_set != X0
      & empty_set = intersection(X1,X0)
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f11,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( empty_set = intersection(X1,X0)
          & subset(X0,X1) )
       => empty_set = X0 ),
    inference(negated_conjecture,[],[f10]) ).

fof(f10,conjecture,
    ! [X0,X1] :
      ( ( empty_set = intersection(X1,X0)
        & subset(X0,X1) )
     => empty_set = X0 ),
    file('/export/starexec/sandbox/tmp/tmp.bhn2DwyqMK/Vampire---4.8_24013',prove_th121) ).

fof(f64,plain,
    ! [X0] :
      ( ~ member(X0,sK0)
      | ~ member(X0,sK1) ),
    inference(subsumption_resolution,[],[f61,f35]) ).

fof(f61,plain,
    ! [X0] :
      ( member(X0,empty_set)
      | ~ member(X0,sK0)
      | ~ member(X0,sK1) ),
    inference(superposition,[],[f30,f17]) ).

fof(f17,plain,
    empty_set = intersection(sK1,sK0),
    inference(cnf_transformation,[],[f13]) ).

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

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

fof(f35,plain,
    ! [X0] : ~ member(X0,empty_set),
    inference(cnf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0] : ~ member(X0,empty_set),
    file('/export/starexec/sandbox/tmp/tmp.bhn2DwyqMK/Vampire---4.8_24013',empty_set_defn) ).

fof(f18,plain,
    empty_set != sK0,
    inference(cnf_transformation,[],[f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SET639+3 : TPTP v8.1.2. Released v2.2.0.
% 0.08/0.15  % 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.15/0.36  % Computer : n024.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Tue Apr 30 17:11:06 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36  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.bhn2DwyqMK/Vampire---4.8_24013
% 0.57/0.75  % (24278)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 (2996ds/83Mi)
% 0.57/0.75  % (24272)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 (2996ds/34Mi)
% 0.57/0.75  % (24274)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.57/0.75  % (24273)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 (2996ds/51Mi)
% 0.57/0.75  % (24276)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 (2996ds/34Mi)
% 0.57/0.75  % (24275)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.75  % (24277)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.75  % (24278)First to succeed.
% 0.57/0.75  % (24277)Also succeeded, but the first one will report.
% 0.57/0.75  % (24273)Also succeeded, but the first one will report.
% 0.57/0.75  % (24278)Refutation found. Thanks to Tanya!
% 0.57/0.75  % SZS status Theorem for Vampire---4
% 0.57/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.75  % (24278)------------------------------
% 0.57/0.75  % (24278)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75  % (24278)Termination reason: Refutation
% 0.57/0.75  
% 0.57/0.75  % (24278)Memory used [KB]: 982
% 0.57/0.75  % (24278)Time elapsed: 0.003 s
% 0.57/0.75  % (24278)Instructions burned: 4 (million)
% 0.57/0.75  % (24278)------------------------------
% 0.57/0.75  % (24278)------------------------------
% 0.57/0.75  % (24268)Success in time 0.382 s
% 0.57/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------