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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET638+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 : n013.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:07:46 EDT 2024

% Result   : Theorem 0.62s 0.81s
% Output   : Refutation 0.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   26 (  11 unt;   0 def)
%            Number of atoms       :   53 (   5 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   47 (  20   ~;  13   |;   7   &)
%                                         (   4 <=>;   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    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   41 (  35   !;   6   ?)

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

fof(f95,plain,
    member(sK4(sK0,sK1),union(sK1,sK2)),
    inference(unit_resulting_resolution,[],[f21,f52,f39]) ).

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

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

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

fof(f52,plain,
    member(sK4(sK0,sK1),sK0),
    inference(unit_resulting_resolution,[],[f23,f40]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( member(sK4(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f20]) ).

fof(f23,plain,
    ~ subset(sK0,sK1),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,plain,
    ? [X0,X1,X2] :
      ( ~ subset(X0,X1)
      & empty_set = intersection(X0,X2)
      & subset(X0,union(X1,X2)) ),
    inference(flattening,[],[f17]) ).

fof(f17,plain,
    ? [X0,X1,X2] :
      ( ~ subset(X0,X1)
      & empty_set = intersection(X0,X2)
      & subset(X0,union(X1,X2)) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f16,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( empty_set = intersection(X0,X2)
          & subset(X0,union(X1,X2)) )
       => subset(X0,X1) ),
    inference(negated_conjecture,[],[f15]) ).

fof(f15,conjecture,
    ! [X0,X1,X2] :
      ( ( empty_set = intersection(X0,X2)
        & subset(X0,union(X1,X2)) )
     => subset(X0,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.mk9XP9RBiI/Vampire---4.8_31644',prove_th120) ).

fof(f21,plain,
    subset(sK0,union(sK1,sK2)),
    inference(cnf_transformation,[],[f18]) ).

fof(f150,plain,
    ~ member(sK4(sK0,sK1),union(sK1,sK2)),
    inference(unit_resulting_resolution,[],[f53,f129,f45]) ).

fof(f45,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,union(X0,X1))
      | member(X2,X1)
      | member(X2,X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f5,axiom,
    ! [X0,X1,X2] :
      ( member(X2,union(X0,X1))
    <=> ( member(X2,X1)
        | member(X2,X0) ) ),
    file('/export/starexec/sandbox/tmp/tmp.mk9XP9RBiI/Vampire---4.8_31644',union_defn) ).

fof(f129,plain,
    ~ member(sK4(sK0,sK1),sK2),
    inference(unit_resulting_resolution,[],[f52,f73]) ).

fof(f73,plain,
    ! [X0] :
      ( ~ member(X0,sK2)
      | ~ member(X0,sK0) ),
    inference(subsumption_resolution,[],[f69,f42]) ).

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

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

fof(f69,plain,
    ! [X0] :
      ( member(X0,empty_set)
      | ~ member(X0,sK2)
      | ~ member(X0,sK0) ),
    inference(superposition,[],[f35,f22]) ).

fof(f22,plain,
    empty_set = intersection(sK0,sK2),
    inference(cnf_transformation,[],[f18]) ).

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

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

fof(f53,plain,
    ~ member(sK4(sK0,sK1),sK1),
    inference(unit_resulting_resolution,[],[f23,f41]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( ~ member(sK4(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10  % Problem    : SET638+3 : TPTP v8.1.2. Released v2.2.0.
% 0.10/0.12  % 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.32  % Computer : n013.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Fri May  3 16:54:38 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.11/0.32  This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32  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.mk9XP9RBiI/Vampire---4.8_31644
% 0.62/0.80  % (31756)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.62/0.80  % (31758)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.62/0.80  % (31760)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.62/0.80  % (31757)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.62/0.80  % (31755)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.62/0.80  % (31759)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.62/0.80  % (31761)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.62/0.80  % (31762)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.62/0.81  % (31759)Refutation not found, incomplete strategy% (31759)------------------------------
% 0.62/0.81  % (31759)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81  % (31759)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.81  
% 0.62/0.81  % (31759)Memory used [KB]: 973
% 0.62/0.81  % (31759)Time elapsed: 0.003 s
% 0.62/0.81  % (31759)Instructions burned: 3 (million)
% 0.62/0.81  % (31759)------------------------------
% 0.62/0.81  % (31759)------------------------------
% 0.62/0.81  % (31762)Refutation not found, incomplete strategy% (31762)------------------------------
% 0.62/0.81  % (31762)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81  % (31762)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.81  
% 0.62/0.81  % (31762)Memory used [KB]: 974
% 0.62/0.81  % (31762)Time elapsed: 0.003 s
% 0.62/0.81  % (31762)Instructions burned: 3 (million)
% 0.62/0.81  % (31762)------------------------------
% 0.62/0.81  % (31762)------------------------------
% 0.62/0.81  % (31761)First to succeed.
% 0.62/0.81  % (31761)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-31752"
% 0.62/0.81  % (31761)Refutation found. Thanks to Tanya!
% 0.62/0.81  % SZS status Theorem for Vampire---4
% 0.62/0.81  % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.81  % (31761)------------------------------
% 0.62/0.81  % (31761)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81  % (31761)Termination reason: Refutation
% 0.62/0.81  
% 0.62/0.81  % (31761)Memory used [KB]: 1059
% 0.62/0.81  % (31761)Time elapsed: 0.005 s
% 0.62/0.81  % (31761)Instructions burned: 7 (million)
% 0.62/0.81  % (31752)Success in time 0.481 s
% 0.62/0.81  % Vampire---4.8 exiting
%------------------------------------------------------------------------------