TSTP Solution File: SET910+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET910+1 : TPTP v8.1.2. Released v3.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 : 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 : Sun May  5 09:09:01 EDT 2024

% Result   : Theorem 0.58s 0.75s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   15 (   5 unt;   0 def)
%            Number of atoms       :   27 (  11 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   21 (   9   ~;   3   |;   4   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (  14   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f28,plain,
    $false,
    inference(subsumption_resolution,[],[f27,f16]) ).

fof(f16,plain,
    ~ in(sK1,sK0),
    inference(cnf_transformation,[],[f14]) ).

fof(f14,plain,
    ( ~ in(sK1,sK0)
    & singleton(sK1) = set_intersection2(sK0,singleton(sK1)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f10,f13]) ).

fof(f13,plain,
    ( ? [X0,X1] :
        ( ~ in(X1,X0)
        & singleton(X1) = set_intersection2(X0,singleton(X1)) )
   => ( ~ in(sK1,sK0)
      & singleton(sK1) = set_intersection2(sK0,singleton(sK1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f10,plain,
    ? [X0,X1] :
      ( ~ in(X1,X0)
      & singleton(X1) = set_intersection2(X0,singleton(X1)) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,negated_conjecture,
    ~ ! [X0,X1] :
        ( singleton(X1) = set_intersection2(X0,singleton(X1))
       => in(X1,X0) ),
    inference(negated_conjecture,[],[f6]) ).

fof(f6,conjecture,
    ! [X0,X1] :
      ( singleton(X1) = set_intersection2(X0,singleton(X1))
     => in(X1,X0) ),
    file('/export/starexec/sandbox2/tmp/tmp.YjIQuBZYwb/Vampire---4.8_21046',t51_zfmisc_1) ).

fof(f27,plain,
    in(sK1,sK0),
    inference(resolution,[],[f22,f25]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ~ sQ2_eqProxy(singleton(X1),set_intersection2(X0,singleton(X1)))
      | in(X1,X0) ),
    inference(equality_proxy_replacement,[],[f20,f21]) ).

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

fof(f20,plain,
    ! [X0,X1] :
      ( in(X1,X0)
      | singleton(X1) != set_intersection2(X0,singleton(X1)) ),
    inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( in(X1,X0)
      | singleton(X1) != set_intersection2(X0,singleton(X1)) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( singleton(X1) = set_intersection2(X0,singleton(X1))
     => in(X1,X0) ),
    file('/export/starexec/sandbox2/tmp/tmp.YjIQuBZYwb/Vampire---4.8_21046',l30_zfmisc_1) ).

fof(f22,plain,
    sQ2_eqProxy(singleton(sK1),set_intersection2(sK0,singleton(sK1))),
    inference(equality_proxy_replacement,[],[f15,f21]) ).

fof(f15,plain,
    singleton(sK1) = set_intersection2(sK0,singleton(sK1)),
    inference(cnf_transformation,[],[f14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SET910+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.15  % 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.15/0.36  % Computer : n021.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   : Fri May  3 16:56:38 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37  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.YjIQuBZYwb/Vampire---4.8_21046
% 0.58/0.75  % (21450)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 (2996ds/56Mi)
% 0.58/0.75  % (21447)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.58/0.75  % (21450)First to succeed.
% 0.58/0.75  % (21443)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.58/0.75  % (21450)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-21261"
% 0.58/0.75  % (21445)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.58/0.75  % (21444)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.58/0.75  % (21446)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.58/0.75  % (21447)Also succeeded, but the first one will report.
% 0.58/0.75  % (21448)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.58/0.75  % (21449)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.58/0.75  % (21450)Refutation found. Thanks to Tanya!
% 0.58/0.75  % SZS status Theorem for Vampire---4
% 0.58/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.75  % (21450)------------------------------
% 0.58/0.75  % (21450)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75  % (21450)Termination reason: Refutation
% 0.58/0.75  
% 0.58/0.75  % (21450)Memory used [KB]: 972
% 0.58/0.75  % (21450)Time elapsed: 0.002 s
% 0.58/0.75  % (21450)Instructions burned: 2 (million)
% 0.58/0.75  % (21261)Success in time 0.381 s
% 0.58/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------