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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET689+4 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n026.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:37 EDT 2024

% Result   : Theorem 0.61s 0.77s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   25 (  10 unt;   0 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   51 (  18   ~;  11   |;  14   &)
%                                         (   3 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   38 (  32   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f41,plain,
    $false,
    inference(subsumption_resolution,[],[f39,f36]) ).

fof(f36,plain,
    member(sK3(sK0,sK2),sK1),
    inference(unit_resulting_resolution,[],[f21,f34,f25]) ).

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

fof(f18,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/sandbox2/tmp/tmp.NFlP6DcRtD/Vampire---4.8_14680',subset) ).

fof(f34,plain,
    member(sK3(sK0,sK2),sK0),
    inference(unit_resulting_resolution,[],[f32,f26]) ).

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

fof(f32,plain,
    ~ subset(sK0,sK2),
    inference(unit_resulting_resolution,[],[f23,f24,f28]) ).

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

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

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

fof(f15,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/sandbox2/tmp/tmp.NFlP6DcRtD/Vampire---4.8_14680',equal_set) ).

fof(f24,plain,
    ~ equal_set(sK0,sK2),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,plain,
    ? [X0,X1,X2] :
      ( ~ equal_set(X0,X2)
      & subset(X2,X0)
      & subset(X1,X2)
      & subset(X0,X1) ),
    inference(flattening,[],[f16]) ).

fof(f16,plain,
    ? [X0,X1,X2] :
      ( ~ equal_set(X0,X2)
      & subset(X2,X0)
      & subset(X1,X2)
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f14,plain,
    ~ ! [X0,X1,X2] :
        ( ( subset(X2,X0)
          & subset(X1,X2)
          & subset(X0,X1) )
       => equal_set(X0,X2) ),
    inference(rectify,[],[f13]) ).

fof(f13,negated_conjecture,
    ~ ! [X0,X1,X5] :
        ( ( subset(X5,X0)
          & subset(X1,X5)
          & subset(X0,X1) )
       => equal_set(X0,X5) ),
    inference(negated_conjecture,[],[f12]) ).

fof(f12,conjecture,
    ! [X0,X1,X5] :
      ( ( subset(X5,X0)
        & subset(X1,X5)
        & subset(X0,X1) )
     => equal_set(X0,X5) ),
    file('/export/starexec/sandbox2/tmp/tmp.NFlP6DcRtD/Vampire---4.8_14680',thI05) ).

fof(f23,plain,
    subset(sK2,sK0),
    inference(cnf_transformation,[],[f17]) ).

fof(f21,plain,
    subset(sK0,sK1),
    inference(cnf_transformation,[],[f17]) ).

fof(f39,plain,
    ~ member(sK3(sK0,sK2),sK1),
    inference(unit_resulting_resolution,[],[f22,f35,f25]) ).

fof(f35,plain,
    ~ member(sK3(sK0,sK2),sK2),
    inference(unit_resulting_resolution,[],[f32,f27]) ).

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

fof(f22,plain,
    subset(sK1,sK2),
    inference(cnf_transformation,[],[f17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SET689+4 : TPTP v8.1.2. Released v2.2.0.
% 0.10/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.31  % Computer : n026.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit   : 300
% 0.11/0.31  % WCLimit    : 300
% 0.11/0.31  % DateTime   : Tue Apr 30 17:34:04 EDT 2024
% 0.11/0.31  % CPUTime    : 
% 0.11/0.31  This is a FOF_THM_RFO_SEQ problem
% 0.16/0.31  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.NFlP6DcRtD/Vampire---4.8_14680
% 0.61/0.77  % (14797)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.77  % (14796)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.77  % (14800)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.77  % (14799)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.77  % (14801)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.77  % (14802)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.77  % (14803)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.77  % (14798)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.77  % (14803)Refutation not found, incomplete strategy% (14803)------------------------------
% 0.61/0.77  % (14803)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77  % (14801)Refutation not found, incomplete strategy% (14801)------------------------------
% 0.61/0.77  % (14801)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77  % (14801)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77  
% 0.61/0.77  % (14801)Memory used [KB]: 962
% 0.61/0.77  % (14801)Time elapsed: 0.003 s
% 0.61/0.77  % (14801)Instructions burned: 2 (million)
% 0.61/0.77  % (14801)------------------------------
% 0.61/0.77  % (14801)------------------------------
% 0.61/0.77  % (14803)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77  
% 0.61/0.77  % (14803)Memory used [KB]: 962
% 0.61/0.77  % (14803)Time elapsed: 0.002 s
% 0.61/0.77  % (14803)Instructions burned: 2 (million)
% 0.61/0.77  % (14803)------------------------------
% 0.61/0.77  % (14803)------------------------------
% 0.61/0.77  % (14802)First to succeed.
% 0.61/0.77  % (14800)Refutation not found, incomplete strategy% (14800)------------------------------
% 0.61/0.77  % (14800)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77  % (14800)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77  
% 0.61/0.77  % (14800)Memory used [KB]: 1037
% 0.61/0.77  % (14800)Time elapsed: 0.003 s
% 0.61/0.77  % (14800)Instructions burned: 3 (million)
% 0.61/0.77  % (14800)------------------------------
% 0.61/0.77  % (14800)------------------------------
% 0.61/0.77  % (14799)Also succeeded, but the first one will report.
% 0.61/0.77  % (14802)Refutation found. Thanks to Tanya!
% 0.61/0.77  % SZS status Theorem for Vampire---4
% 0.61/0.77  % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.77  % (14802)------------------------------
% 0.61/0.77  % (14802)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77  % (14802)Termination reason: Refutation
% 0.61/0.77  
% 0.61/0.77  % (14802)Memory used [KB]: 972
% 0.61/0.77  % (14802)Time elapsed: 0.003 s
% 0.61/0.77  % (14802)Instructions burned: 3 (million)
% 0.61/0.77  % (14802)------------------------------
% 0.61/0.77  % (14802)------------------------------
% 0.61/0.77  % (14793)Success in time 0.46 s
% 0.61/0.77  % Vampire---4.8 exiting
%------------------------------------------------------------------------------