TSTP Solution File: SEV421_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV421_1 : TPTP v8.1.2. Released v5.0.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 : n014.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:57:40 EDT 2024

% Result   : Theorem 0.60s 0.80s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   45 (   3 unt;  15 typ;   0 def)
%            Number of atoms       :   92 (  64 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  100 (  38   ~;  27   |;  23   &)
%                                         (   6 <=>;   4  =>;   0  <=;   2 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :   35 (   0 atm;   0 fun;  27 num;   8 var)
%            Number of types       :    4 (   2 usr;   1 ari)
%            Number of type conns  :   14 (   9   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :   12 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :   28 (  13   !;  15   ?;  28   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    set: $tType ).

tff(type_def_6,type,
    element: $tType ).

tff(func_def_0,type,
    empty_set: set ).

tff(func_def_1,type,
    singleton: element > set ).

tff(func_def_2,type,
    intersection: ( set * set ) > set ).

tff(func_def_3,type,
    union: ( set * set ) > set ).

tff(func_def_4,type,
    difference: ( set * set ) > set ).

tff(func_def_5,type,
    complement: set > set ).

tff(func_def_6,type,
    cardinality: set > $int ).

tff(func_def_11,type,
    sK0: element ).

tff(func_def_12,type,
    sK1: set ).

tff(func_def_13,type,
    sK2: $int ).

tff(func_def_14,type,
    sK3: set > element ).

tff(pred_def_1,type,
    member: ( element * set ) > $o ).

tff(pred_def_2,type,
    subset: ( set * set ) > $o ).

tff(f76,plain,
    $false,
    inference(avatar_sat_refutation,[],[f67,f68,f74,f75]) ).

tff(f75,plain,
    ( spl4_2
    | ~ spl4_1 ),
    inference(avatar_split_clause,[],[f71,f60,f64]) ).

tff(f64,plain,
    ( spl4_2
  <=> ( empty_set = sK1 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).

tff(f60,plain,
    ( spl4_1
  <=> ( 0 = sK2 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).

tff(f71,plain,
    ( ( 0 != sK2 )
    | ( empty_set = sK1 ) ),
    inference(superposition,[],[f52,f45]) ).

tff(f45,plain,
    sK2 = cardinality(sK1),
    inference(cnf_transformation,[],[f35]) ).

tff(f35,plain,
    ( ( ( empty_set != sK1 )
      | ( 0 != sK2 ) )
    & ( ( empty_set = sK1 )
      | ( 0 = sK2 ) )
    & ( sK2 = cardinality(sK1) )
    & ~ member(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f33,f34]) ).

tff(f34,plain,
    ( ? [X0: element,X1: set,X2: $int] :
        ( ( ( empty_set != X1 )
          | ( 0 != X2 ) )
        & ( ( empty_set = X1 )
          | ( 0 = X2 ) )
        & ( cardinality(X1) = X2 )
        & ~ member(X0,X1) )
   => ( ( ( empty_set != sK1 )
        | ( 0 != sK2 ) )
      & ( ( empty_set = sK1 )
        | ( 0 = sK2 ) )
      & ( sK2 = cardinality(sK1) )
      & ~ member(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

tff(f33,plain,
    ? [X0: element,X1: set,X2: $int] :
      ( ( ( empty_set != X1 )
        | ( 0 != X2 ) )
      & ( ( empty_set = X1 )
        | ( 0 = X2 ) )
      & ( cardinality(X1) = X2 )
      & ~ member(X0,X1) ),
    inference(flattening,[],[f32]) ).

tff(f32,plain,
    ? [X0: element,X1: set,X2: $int] :
      ( ( ( empty_set != X1 )
        | ( 0 != X2 ) )
      & ( ( empty_set = X1 )
        | ( 0 = X2 ) )
      & ( cardinality(X1) = X2 )
      & ~ member(X0,X1) ),
    inference(nnf_transformation,[],[f31]) ).

tff(f31,plain,
    ? [X0: element,X1: set,X2: $int] :
      ( ( ( 0 = X2 )
      <~> ( empty_set = X1 ) )
      & ( cardinality(X1) = X2 )
      & ~ member(X0,X1) ),
    inference(flattening,[],[f30]) ).

tff(f30,plain,
    ? [X0: element,X1: set,X2: $int] :
      ( ( ( 0 = X2 )
      <~> ( empty_set = X1 ) )
      & ( cardinality(X1) = X2 )
      & ~ member(X0,X1) ),
    inference(ennf_transformation,[],[f27]) ).

tff(f27,plain,
    ~ ! [X0: element,X1: set,X2: $int] :
        ( ( ( cardinality(X1) = X2 )
          & ~ member(X0,X1) )
       => ( ( 0 = X2 )
        <=> ( empty_set = X1 ) ) ),
    inference(rectify,[],[f14]) ).

tff(f14,negated_conjecture,
    ~ ! [X1: element,X6: set,X7: $int] :
        ( ( ( cardinality(X6) = X7 )
          & ~ member(X1,X6) )
       => ( ( 0 = X7 )
        <=> ( empty_set = X6 ) ) ),
    inference(negated_conjecture,[],[f13]) ).

tff(f13,conjecture,
    ! [X1: element,X6: set,X7: $int] :
      ( ( ( cardinality(X6) = X7 )
        & ~ member(X1,X6) )
     => ( ( 0 = X7 )
      <=> ( empty_set = X6 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.nCXmAQKwJb/Vampire---4.8_6804',vc1) ).

tff(f52,plain,
    ! [X0: set] :
      ( ( cardinality(X0) != 0 )
      | ( empty_set = X0 ) ),
    inference(cnf_transformation,[],[f41]) ).

tff(f41,plain,
    ! [X0: set] :
      ( ( ( cardinality(X0) = 0 )
        | ( empty_set != X0 ) )
      & ( ( empty_set = X0 )
        | ( cardinality(X0) != 0 ) ) ),
    inference(nnf_transformation,[],[f8]) ).

tff(f8,axiom,
    ! [X0: set] :
      ( ( cardinality(X0) = 0 )
    <=> ( empty_set = X0 ) ),
    file('/export/starexec/sandbox/tmp/tmp.nCXmAQKwJb/Vampire---4.8_6804',cardinality_empty_set) ).

tff(f74,plain,
    ( spl4_1
    | ~ spl4_2 ),
    inference(avatar_contradiction_clause,[],[f73]) ).

tff(f73,plain,
    ( $false
    | spl4_1
    | ~ spl4_2 ),
    inference(subsumption_resolution,[],[f72,f62]) ).

tff(f62,plain,
    ( ( 0 != sK2 )
    | spl4_1 ),
    inference(avatar_component_clause,[],[f60]) ).

tff(f72,plain,
    ( ( 0 = sK2 )
    | ~ spl4_2 ),
    inference(forward_demodulation,[],[f70,f58]) ).

tff(f58,plain,
    0 = cardinality(empty_set),
    inference(equality_resolution,[],[f53]) ).

tff(f53,plain,
    ! [X0: set] :
      ( ( cardinality(X0) = 0 )
      | ( empty_set != X0 ) ),
    inference(cnf_transformation,[],[f41]) ).

tff(f70,plain,
    ( ( sK2 = cardinality(empty_set) )
    | ~ spl4_2 ),
    inference(superposition,[],[f45,f65]) ).

tff(f65,plain,
    ( ( empty_set = sK1 )
    | ~ spl4_2 ),
    inference(avatar_component_clause,[],[f64]) ).

tff(f68,plain,
    ( spl4_1
    | spl4_2 ),
    inference(avatar_split_clause,[],[f46,f64,f60]) ).

tff(f46,plain,
    ( ( empty_set = sK1 )
    | ( 0 = sK2 ) ),
    inference(cnf_transformation,[],[f35]) ).

tff(f67,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(avatar_split_clause,[],[f47,f64,f60]) ).

tff(f47,plain,
    ( ( empty_set != sK1 )
    | ( 0 != sK2 ) ),
    inference(cnf_transformation,[],[f35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : SEV421_1 : TPTP v8.1.2. Released v5.0.0.
% 0.05/0.11  % 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.10/0.31  % Computer : n014.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Tue Apr 30 16:14:03 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.10/0.31  This is a TF0_THM_EQU_ARI problem
% 0.16/0.31  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.nCXmAQKwJb/Vampire---4.8_6804
% 0.60/0.79  % (6918)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.60/0.79  % (6914)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.60/0.79  % (6916)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.60/0.79  % (6915)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.60/0.79  % (6917)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.60/0.79  % (6920)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.60/0.79  % (6921)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.60/0.79  % (6919)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.60/0.80  % (6921)Refutation not found, incomplete strategy% (6921)------------------------------
% 0.60/0.80  % (6921)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80  % (6921)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.80  
% 0.60/0.80  % (6921)Memory used [KB]: 1026
% 0.60/0.80  % (6921)Time elapsed: 0.003 s
% 0.60/0.80  % (6921)Instructions burned: 3 (million)
% 0.60/0.80  % (6921)------------------------------
% 0.60/0.80  % (6921)------------------------------
% 0.60/0.80  % (6919)First to succeed.
% 0.60/0.80  % (6917)Also succeeded, but the first one will report.
% 0.60/0.80  % (6914)Refutation not found, incomplete strategy% (6914)------------------------------
% 0.60/0.80  % (6914)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80  % (6914)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.80  
% 0.60/0.80  % (6914)Memory used [KB]: 1064
% 0.60/0.80  % (6914)Time elapsed: 0.005 s
% 0.60/0.80  % (6914)Instructions burned: 6 (million)
% 0.60/0.80  % (6914)------------------------------
% 0.60/0.80  % (6914)------------------------------
% 0.60/0.80  % (6919)Refutation found. Thanks to Tanya!
% 0.60/0.80  % SZS status Theorem for Vampire---4
% 0.60/0.80  % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.80  % (6919)------------------------------
% 0.60/0.80  % (6919)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80  % (6919)Termination reason: Refutation
% 0.60/0.80  
% 0.60/0.80  % (6919)Memory used [KB]: 1044
% 0.60/0.80  % (6919)Time elapsed: 0.004 s
% 0.60/0.80  % (6919)Instructions burned: 4 (million)
% 0.60/0.80  % (6919)------------------------------
% 0.60/0.80  % (6919)------------------------------
% 0.60/0.80  % (6913)Success in time 0.479 s
% 0.60/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------