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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU160+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s

% Computer : n020.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 : Thu Aug 31 17:56:23 EDT 2023

% Result   : Theorem 0.21s 0.42s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (   9 unt;   0 def)
%            Number of atoms       :   85 (  53 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :   91 (  35   ~;  37   |;  14   &)
%                                         (   3 <=>;   1  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   27 (;  19   !;   8   ?)

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

fof(f45,plain,
    empty_set = sK0,
    inference(trivial_inequality_removal,[],[f42]) ).

fof(f42,plain,
    ( sK0 != sK0
    | empty_set = sK0 ),
    inference(superposition,[],[f34,f39]) ).

fof(f39,plain,
    ( sK0 = singleton(sK1)
    | empty_set = sK0 ),
    inference(resolution,[],[f25,f37]) ).

fof(f37,plain,
    subset(sK0,singleton(sK1)),
    inference(subsumption_resolution,[],[f35,f36]) ).

fof(f35,plain,
    ( empty_set = sK0
    | subset(sK0,singleton(sK1)) ),
    inference(subsumption_resolution,[],[f20,f34]) ).

fof(f20,plain,
    ( sK0 = singleton(sK1)
    | empty_set = sK0
    | subset(sK0,singleton(sK1)) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ( ( ( sK0 != singleton(sK1)
        & empty_set != sK0 )
      | ~ subset(sK0,singleton(sK1)) )
    & ( sK0 = singleton(sK1)
      | empty_set = sK0
      | subset(sK0,singleton(sK1)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f11,f12]) ).

fof(f12,plain,
    ( ? [X0,X1] :
        ( ( ( singleton(X1) != X0
            & empty_set != X0 )
          | ~ subset(X0,singleton(X1)) )
        & ( singleton(X1) = X0
          | empty_set = X0
          | subset(X0,singleton(X1)) ) )
   => ( ( ( sK0 != singleton(sK1)
          & empty_set != sK0 )
        | ~ subset(sK0,singleton(sK1)) )
      & ( sK0 = singleton(sK1)
        | empty_set = sK0
        | subset(sK0,singleton(sK1)) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f11,plain,
    ? [X0,X1] :
      ( ( ( singleton(X1) != X0
          & empty_set != X0 )
        | ~ subset(X0,singleton(X1)) )
      & ( singleton(X1) = X0
        | empty_set = X0
        | subset(X0,singleton(X1)) ) ),
    inference(flattening,[],[f10]) ).

fof(f10,plain,
    ? [X0,X1] :
      ( ( ( singleton(X1) != X0
          & empty_set != X0 )
        | ~ subset(X0,singleton(X1)) )
      & ( singleton(X1) = X0
        | empty_set = X0
        | subset(X0,singleton(X1)) ) ),
    inference(nnf_transformation,[],[f9]) ).

fof(f9,plain,
    ? [X0,X1] :
      ( subset(X0,singleton(X1))
    <~> ( singleton(X1) = X0
        | empty_set = X0 ) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f6,negated_conjecture,
    ~ ! [X0,X1] :
        ( subset(X0,singleton(X1))
      <=> ( singleton(X1) = X0
          | empty_set = X0 ) ),
    inference(negated_conjecture,[],[f5]) ).

fof(f5,conjecture,
    ! [X0,X1] :
      ( subset(X0,singleton(X1))
    <=> ( singleton(X1) = X0
        | empty_set = X0 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.sxihj8rH30/Vampire---4.8_8157',t39_zfmisc_1) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ~ subset(X0,singleton(X1))
      | empty_set = X0
      | singleton(X1) = X0 ),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ( subset(X0,singleton(X1))
        | ( singleton(X1) != X0
          & empty_set != X0 ) )
      & ( singleton(X1) = X0
        | empty_set = X0
        | ~ subset(X0,singleton(X1)) ) ),
    inference(flattening,[],[f14]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ( subset(X0,singleton(X1))
        | ( singleton(X1) != X0
          & empty_set != X0 ) )
      & ( singleton(X1) = X0
        | empty_set = X0
        | ~ subset(X0,singleton(X1)) ) ),
    inference(nnf_transformation,[],[f7]) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( subset(X0,singleton(X1))
    <=> ( singleton(X1) = X0
        | empty_set = X0 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.sxihj8rH30/Vampire---4.8_8157',l4_zfmisc_1) ).

fof(f34,plain,
    sK0 != singleton(sK1),
    inference(subsumption_resolution,[],[f32,f24]) ).

fof(f24,plain,
    ! [X0] : subset(X0,X0),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ! [X0] : subset(X0,X0),
    inference(rectify,[],[f1]) ).

fof(f1,axiom,
    ! [X0,X1] : subset(X0,X0),
    file('/export/starexec/sandbox2/tmp/tmp.sxihj8rH30/Vampire---4.8_8157',reflexivity_r1_tarski) ).

fof(f32,plain,
    ( sK0 != singleton(sK1)
    | ~ subset(sK0,sK0) ),
    inference(inner_rewriting,[],[f22]) ).

fof(f22,plain,
    ( sK0 != singleton(sK1)
    | ~ subset(sK0,singleton(sK1)) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f36,plain,
    empty_set != sK0,
    inference(subsumption_resolution,[],[f33,f31]) ).

fof(f31,plain,
    ! [X1] : subset(empty_set,singleton(X1)),
    inference(equality_resolution,[],[f26]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( subset(X0,singleton(X1))
      | empty_set != X0 ),
    inference(cnf_transformation,[],[f15]) ).

fof(f33,plain,
    ( empty_set != sK0
    | ~ subset(empty_set,singleton(sK1)) ),
    inference(inner_rewriting,[],[f21]) ).

fof(f21,plain,
    ( empty_set != sK0
    | ~ subset(sK0,singleton(sK1)) ),
    inference(cnf_transformation,[],[f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU160+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14  % Command    : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.15/0.35  % Computer : n020.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Wed Aug 23 15:22:31 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35  Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/tmp/tmp.sxihj8rH30/Vampire---4.8_8157
% 0.15/0.35  % (8364)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.41  % (8369)ott+1003_4:1_av=off:cond=on:drc=off:fsd=off:fsr=off:fde=none:gsp=on:nm=2:nwc=1.5:sos=all:sp=reverse_arity:tgt=full_871 on Vampire---4 for (871ds/0Mi)
% 0.21/0.41  % (8367)ott-4_11_av=off:bd=preordered:bce=on:drc=off:flr=on:fsr=off:lma=on:nwc=2.0:sp=occurrence:tgt=ground:urr=ec_only_1010 on Vampire---4 for (1010ds/0Mi)
% 0.21/0.41  % (8368)lrs+3_20_av=off:bd=preordered:drc=off:fsd=off:fsr=off:fde=unused:irw=on:lcm=reverse:sos=theory:stl=315_961 on Vampire---4 for (961ds/0Mi)
% 0.21/0.41  % (8366)lrs-11_28_aac=none:afr=on:anc=none:bs=on:drc=off:fde=unused:gs=on:nm=2:nwc=1.3:sp=frequency:stl=188_1092 on Vampire---4 for (1092ds/0Mi)
% 0.21/0.41  % (8370)lrs-11_32_av=off:bd=off:bs=on:bsr=on:drc=off:flr=on:fsd=off:fsr=off:fde=none:gsp=on:irw=on:lcm=predicate:nm=4:sp=scramble:stl=125_825 on Vampire---4 for (825ds/0Mi)
% 0.21/0.41  % (8365)lrs+10_11_cond=on:drc=off:flr=on:fsr=off:gsp=on:gs=on:gsem=off:lma=on:msp=off:nm=4:nwc=1.5:nicw=on:sas=z3:sims=off:sp=scramble:stl=188_1169 on Vampire---4 for (1169ds/0Mi)
% 0.21/0.41  % (8369)Refutation not found, incomplete strategy% (8369)------------------------------
% 0.21/0.41  % (8369)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.21/0.41  % (8369)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.21/0.41  % (8369)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.41  
% 0.21/0.41  % (8369)Memory used [KB]: 895
% 0.21/0.41  % (8369)Time elapsed: 0.004 s
% 0.21/0.41  % (8369)------------------------------
% 0.21/0.41  % (8369)------------------------------
% 0.21/0.41  % (8370)First to succeed.
% 0.21/0.41  % (8371)ott+11_14_av=off:bs=on:bsr=on:cond=on:flr=on:fsd=off:fde=unused:gsp=on:nm=4:nwc=1.5:tgt=full_501 on Vampire---4 for (501ds/0Mi)
% 0.21/0.42  % (8367)Also succeeded, but the first one will report.
% 0.21/0.42  % (8366)Also succeeded, but the first one will report.
% 0.21/0.42  % (8370)Refutation found. Thanks to Tanya!
% 0.21/0.42  % SZS status Theorem for Vampire---4
% 0.21/0.42  % SZS output start Proof for Vampire---4
% See solution above
% 0.21/0.42  % (8370)------------------------------
% 0.21/0.42  % (8370)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.21/0.42  % (8370)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.21/0.42  % (8370)Termination reason: Refutation
% 0.21/0.42  
% 0.21/0.42  % (8370)Memory used [KB]: 895
% 0.21/0.42  % (8370)Time elapsed: 0.004 s
% 0.21/0.42  % (8370)------------------------------
% 0.21/0.42  % (8370)------------------------------
% 0.21/0.42  % (8364)Success in time 0.061 s
% 0.21/0.42  % Vampire---4.8 exiting
%------------------------------------------------------------------------------