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

View Problem - Process Solution

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

% Computer : n022.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:03 EDT 2024

% Result   : Theorem 0.59s 0.80s
% Output   : Refutation 0.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   16
% Syntax   : Number of formulae    :  119 (  21 unt;   0 def)
%            Number of atoms       :  433 ( 193 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  502 ( 188   ~; 227   |;  72   &)
%                                         (   9 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-3 aty)
%            Number of variables   :  188 ( 168   !;  20   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1674,plain,
    $false,
    inference(avatar_sat_refutation,[],[f78,f1211,f1483,f1649]) ).

fof(f1649,plain,
    ~ spl9_2,
    inference(avatar_contradiction_clause,[],[f1648]) ).

fof(f1648,plain,
    ( $false
    | ~ spl9_2 ),
    inference(subsumption_resolution,[],[f1602,f1582]) ).

fof(f1582,plain,
    ( sF6 = sF7
    | ~ spl9_2 ),
    inference(subsumption_resolution,[],[f1556,f79]) ).

fof(f79,plain,
    in(sK0,sF6),
    inference(superposition,[],[f64,f66]) ).

fof(f66,plain,
    singleton(sK0) = sF6,
    introduced(function_definition,[new_symbols(definition,[sF6])]) ).

fof(f64,plain,
    ! [X3] : in(X3,singleton(X3)),
    inference(equality_resolution,[],[f63]) ).

fof(f63,plain,
    ! [X3,X1] :
      ( in(X3,X1)
      | singleton(X3) != X1 ),
    inference(equality_resolution,[],[f52]) ).

fof(f52,plain,
    ! [X3,X0,X1] :
      ( in(X3,X1)
      | X0 != X3
      | singleton(X0) != X1 ),
    inference(cnf_transformation,[],[f31]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( ( singleton(X0) = X1
        | ( ( sK5(X0,X1) != X0
            | ~ in(sK5(X0,X1),X1) )
          & ( sK5(X0,X1) = X0
            | in(sK5(X0,X1),X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | X0 != X3 )
            & ( X0 = X3
              | ~ in(X3,X1) ) )
        | singleton(X0) != X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f29,f30]) ).

fof(f30,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ( X0 != X2
            | ~ in(X2,X1) )
          & ( X0 = X2
            | in(X2,X1) ) )
     => ( ( sK5(X0,X1) != X0
          | ~ in(sK5(X0,X1),X1) )
        & ( sK5(X0,X1) = X0
          | in(sK5(X0,X1),X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ( singleton(X0) = X1
        | ? [X2] :
            ( ( X0 != X2
              | ~ in(X2,X1) )
            & ( X0 = X2
              | in(X2,X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | X0 != X3 )
            & ( X0 = X3
              | ~ in(X3,X1) ) )
        | singleton(X0) != X1 ) ),
    inference(rectify,[],[f28]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ( singleton(X0) = X1
        | ? [X2] :
            ( ( X0 != X2
              | ~ in(X2,X1) )
            & ( X0 = X2
              | in(X2,X1) ) ) )
      & ( ! [X2] :
            ( ( in(X2,X1)
              | X0 != X2 )
            & ( X0 = X2
              | ~ in(X2,X1) ) )
        | singleton(X0) != X1 ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( singleton(X0) = X1
    <=> ! [X2] :
          ( in(X2,X1)
        <=> X0 = X2 ) ),
    file('/export/starexec/sandbox/tmp/tmp.eROqFWyVLE/Vampire---4.8_19309',d1_tarski) ).

fof(f1556,plain,
    ( sF6 = sF7
    | ~ in(sK0,sF6)
    | ~ spl9_2 ),
    inference(superposition,[],[f1554,f913]) ).

fof(f913,plain,
    sF6 = set_intersection2(sF7,sF6),
    inference(duplicate_literal_removal,[],[f899]) ).

fof(f899,plain,
    ( sF6 = set_intersection2(sF7,sF6)
    | sF6 = set_intersection2(sF7,sF6) ),
    inference(resolution,[],[f244,f317]) ).

fof(f317,plain,
    ! [X0] :
      ( in(sK3(X0,sF6,sF6),sF7)
      | sF6 = set_intersection2(X0,sF6) ),
    inference(resolution,[],[f292,f110]) ).

fof(f110,plain,
    ! [X0] :
      ( ~ in(X0,sF8)
      | in(X0,sF7) ),
    inference(superposition,[],[f56,f89]) ).

fof(f89,plain,
    sF8 = set_intersection2(sK1,sF7),
    inference(superposition,[],[f42,f68]) ).

fof(f68,plain,
    set_intersection2(sF7,sK1) = sF8,
    introduced(function_definition,[new_symbols(definition,[sF8])]) ).

fof(f42,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    file('/export/starexec/sandbox/tmp/tmp.eROqFWyVLE/Vampire---4.8_19309',commutativity_k3_xboole_0) ).

fof(f56,plain,
    ! [X0,X1,X4] :
      ( ~ in(X4,set_intersection2(X0,X1))
      | in(X4,X1) ),
    inference(equality_resolution,[],[f37]) ).

fof(f37,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X1)
      | ~ in(X4,X2)
      | set_intersection2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f22]) ).

fof(f22,plain,
    ! [X0,X1,X2] :
      ( ( set_intersection2(X0,X1) = X2
        | ( ( ~ in(sK3(X0,X1,X2),X1)
            | ~ in(sK3(X0,X1,X2),X0)
            | ~ in(sK3(X0,X1,X2),X2) )
          & ( ( in(sK3(X0,X1,X2),X1)
              & in(sK3(X0,X1,X2),X0) )
            | in(sK3(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ~ in(X4,X1)
              | ~ in(X4,X0) )
            & ( ( in(X4,X1)
                & in(X4,X0) )
              | ~ in(X4,X2) ) )
        | set_intersection2(X0,X1) != X2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f20,f21]) ).

fof(f21,plain,
    ! [X0,X1,X2] :
      ( ? [X3] :
          ( ( ~ in(X3,X1)
            | ~ in(X3,X0)
            | ~ in(X3,X2) )
          & ( ( in(X3,X1)
              & in(X3,X0) )
            | in(X3,X2) ) )
     => ( ( ~ in(sK3(X0,X1,X2),X1)
          | ~ in(sK3(X0,X1,X2),X0)
          | ~ in(sK3(X0,X1,X2),X2) )
        & ( ( in(sK3(X0,X1,X2),X1)
            & in(sK3(X0,X1,X2),X0) )
          | in(sK3(X0,X1,X2),X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f20,plain,
    ! [X0,X1,X2] :
      ( ( set_intersection2(X0,X1) = X2
        | ? [X3] :
            ( ( ~ in(X3,X1)
              | ~ in(X3,X0)
              | ~ in(X3,X2) )
            & ( ( in(X3,X1)
                & in(X3,X0) )
              | in(X3,X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ~ in(X4,X1)
              | ~ in(X4,X0) )
            & ( ( in(X4,X1)
                & in(X4,X0) )
              | ~ in(X4,X2) ) )
        | set_intersection2(X0,X1) != X2 ) ),
    inference(rectify,[],[f19]) ).

fof(f19,plain,
    ! [X0,X1,X2] :
      ( ( set_intersection2(X0,X1) = X2
        | ? [X3] :
            ( ( ~ in(X3,X1)
              | ~ in(X3,X0)
              | ~ in(X3,X2) )
            & ( ( in(X3,X1)
                & in(X3,X0) )
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ~ in(X3,X1)
              | ~ in(X3,X0) )
            & ( ( in(X3,X1)
                & in(X3,X0) )
              | ~ in(X3,X2) ) )
        | set_intersection2(X0,X1) != X2 ) ),
    inference(flattening,[],[f18]) ).

fof(f18,plain,
    ! [X0,X1,X2] :
      ( ( set_intersection2(X0,X1) = X2
        | ? [X3] :
            ( ( ~ in(X3,X1)
              | ~ in(X3,X0)
              | ~ in(X3,X2) )
            & ( ( in(X3,X1)
                & in(X3,X0) )
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ~ in(X3,X1)
              | ~ in(X3,X0) )
            & ( ( in(X3,X1)
                & in(X3,X0) )
              | ~ in(X3,X2) ) )
        | set_intersection2(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f6]) ).

fof(f6,axiom,
    ! [X0,X1,X2] :
      ( set_intersection2(X0,X1) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X1)
            & in(X3,X0) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.eROqFWyVLE/Vampire---4.8_19309',d3_xboole_0) ).

fof(f292,plain,
    ! [X0] :
      ( in(sK3(X0,sF6,sF6),sF8)
      | sF6 = set_intersection2(X0,sF6) ),
    inference(resolution,[],[f275,f198]) ).

fof(f198,plain,
    ! [X0,X1] :
      ( in(sK3(X0,X1,X1),X1)
      | set_intersection2(X0,X1) = X1 ),
    inference(factoring,[],[f40]) ).

fof(f40,plain,
    ! [X2,X0,X1] :
      ( in(sK3(X0,X1,X2),X2)
      | in(sK3(X0,X1,X2),X1)
      | set_intersection2(X0,X1) = X2 ),
    inference(cnf_transformation,[],[f22]) ).

fof(f275,plain,
    ! [X0] :
      ( ~ in(X0,sF6)
      | in(X0,sF8) ),
    inference(resolution,[],[f251,f136]) ).

fof(f136,plain,
    in(sK0,sF8),
    inference(subsumption_resolution,[],[f134,f32]) ).

fof(f32,plain,
    in(sK0,sK1),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,plain,
    ( singleton(sK0) != set_intersection2(unordered_pair(sK0,sK2),sK1)
    & ( sK0 = sK2
      | ~ in(sK2,sK1) )
    & in(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f14,f16]) ).

fof(f16,plain,
    ( ? [X0,X1,X2] :
        ( singleton(X0) != set_intersection2(unordered_pair(X0,X2),X1)
        & ( X0 = X2
          | ~ in(X2,X1) )
        & in(X0,X1) )
   => ( singleton(sK0) != set_intersection2(unordered_pair(sK0,sK2),sK1)
      & ( sK0 = sK2
        | ~ in(sK2,sK1) )
      & in(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f14,plain,
    ? [X0,X1,X2] :
      ( singleton(X0) != set_intersection2(unordered_pair(X0,X2),X1)
      & ( X0 = X2
        | ~ in(X2,X1) )
      & in(X0,X1) ),
    inference(flattening,[],[f13]) ).

fof(f13,plain,
    ? [X0,X1,X2] :
      ( singleton(X0) != set_intersection2(unordered_pair(X0,X2),X1)
      & ( X0 = X2
        | ~ in(X2,X1) )
      & in(X0,X1) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f11,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( in(X0,X1)
       => ( singleton(X0) = set_intersection2(unordered_pair(X0,X2),X1)
          | ( X0 != X2
            & in(X2,X1) ) ) ),
    inference(negated_conjecture,[],[f10]) ).

fof(f10,conjecture,
    ! [X0,X1,X2] :
      ( in(X0,X1)
     => ( singleton(X0) = set_intersection2(unordered_pair(X0,X2),X1)
        | ( X0 != X2
          & in(X2,X1) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.eROqFWyVLE/Vampire---4.8_19309',t60_zfmisc_1) ).

fof(f134,plain,
    ( ~ in(sK0,sK1)
    | in(sK0,sF8) ),
    inference(resolution,[],[f126,f80]) ).

fof(f80,plain,
    in(sK0,sF7),
    inference(superposition,[],[f61,f67]) ).

fof(f67,plain,
    unordered_pair(sK0,sK2) = sF7,
    introduced(function_definition,[new_symbols(definition,[sF7])]) ).

fof(f61,plain,
    ! [X1,X4] : in(X4,unordered_pair(X4,X1)),
    inference(equality_resolution,[],[f60]) ).

fof(f60,plain,
    ! [X2,X1,X4] :
      ( in(X4,X2)
      | unordered_pair(X4,X1) != X2 ),
    inference(equality_resolution,[],[f44]) ).

fof(f44,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | X0 != X4
      | unordered_pair(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f27]) ).

fof(f27,plain,
    ! [X0,X1,X2] :
      ( ( unordered_pair(X0,X1) = X2
        | ( ( ( sK4(X0,X1,X2) != X1
              & sK4(X0,X1,X2) != X0 )
            | ~ in(sK4(X0,X1,X2),X2) )
          & ( sK4(X0,X1,X2) = X1
            | sK4(X0,X1,X2) = X0
            | in(sK4(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ( X1 != X4
                & X0 != X4 ) )
            & ( X1 = X4
              | X0 = X4
              | ~ in(X4,X2) ) )
        | unordered_pair(X0,X1) != X2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f25,f26]) ).

fof(f26,plain,
    ! [X0,X1,X2] :
      ( ? [X3] :
          ( ( ( X1 != X3
              & X0 != X3 )
            | ~ in(X3,X2) )
          & ( X1 = X3
            | X0 = X3
            | in(X3,X2) ) )
     => ( ( ( sK4(X0,X1,X2) != X1
            & sK4(X0,X1,X2) != X0 )
          | ~ in(sK4(X0,X1,X2),X2) )
        & ( sK4(X0,X1,X2) = X1
          | sK4(X0,X1,X2) = X0
          | in(sK4(X0,X1,X2),X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f25,plain,
    ! [X0,X1,X2] :
      ( ( unordered_pair(X0,X1) = X2
        | ? [X3] :
            ( ( ( X1 != X3
                & X0 != X3 )
              | ~ in(X3,X2) )
            & ( X1 = X3
              | X0 = X3
              | in(X3,X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ( X1 != X4
                & X0 != X4 ) )
            & ( X1 = X4
              | X0 = X4
              | ~ in(X4,X2) ) )
        | unordered_pair(X0,X1) != X2 ) ),
    inference(rectify,[],[f24]) ).

fof(f24,plain,
    ! [X0,X1,X2] :
      ( ( unordered_pair(X0,X1) = X2
        | ? [X3] :
            ( ( ( X1 != X3
                & X0 != X3 )
              | ~ in(X3,X2) )
            & ( X1 = X3
              | X0 = X3
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( X1 != X3
                & X0 != X3 ) )
            & ( X1 = X3
              | X0 = X3
              | ~ in(X3,X2) ) )
        | unordered_pair(X0,X1) != X2 ) ),
    inference(flattening,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1,X2] :
      ( ( unordered_pair(X0,X1) = X2
        | ? [X3] :
            ( ( ( X1 != X3
                & X0 != X3 )
              | ~ in(X3,X2) )
            & ( X1 = X3
              | X0 = X3
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( X1 != X3
                & X0 != X3 ) )
            & ( X1 = X3
              | X0 = X3
              | ~ in(X3,X2) ) )
        | unordered_pair(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f5]) ).

fof(f5,axiom,
    ! [X0,X1,X2] :
      ( unordered_pair(X0,X1) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( X1 = X3
            | X0 = X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.eROqFWyVLE/Vampire---4.8_19309',d2_tarski) ).

fof(f126,plain,
    ! [X0] :
      ( ~ in(X0,sF7)
      | ~ in(X0,sK1)
      | in(X0,sF8) ),
    inference(superposition,[],[f55,f68]) ).

fof(f55,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_intersection2(X0,X1))
      | ~ in(X4,X1)
      | ~ in(X4,X0) ),
    inference(equality_resolution,[],[f38]) ).

fof(f38,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | ~ in(X4,X1)
      | ~ in(X4,X0)
      | set_intersection2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f22]) ).

fof(f251,plain,
    ! [X0,X1] :
      ( ~ in(sK0,X0)
      | in(X1,X0)
      | ~ in(X1,sF6) ),
    inference(superposition,[],[f56,f245]) ).

fof(f245,plain,
    ! [X0] :
      ( sF6 = set_intersection2(sF6,X0)
      | ~ in(sK0,X0) ),
    inference(subsumption_resolution,[],[f238,f79]) ).

fof(f238,plain,
    ! [X0] :
      ( ~ in(sK0,sF6)
      | ~ in(sK0,X0)
      | sF6 = set_intersection2(sF6,X0) ),
    inference(duplicate_literal_removal,[],[f237]) ).

fof(f237,plain,
    ! [X0] :
      ( ~ in(sK0,sF6)
      | ~ in(sK0,X0)
      | ~ in(sK0,sF6)
      | sF6 = set_intersection2(sF6,X0)
      | sF6 = set_intersection2(sF6,X0) ),
    inference(superposition,[],[f41,f206]) ).

fof(f206,plain,
    ! [X0] :
      ( sK0 = sK3(sF6,X0,sF6)
      | sF6 = set_intersection2(sF6,X0) ),
    inference(resolution,[],[f185,f102]) ).

fof(f102,plain,
    ! [X0] :
      ( ~ in(X0,sF6)
      | sK0 = X0 ),
    inference(superposition,[],[f65,f66]) ).

fof(f65,plain,
    ! [X3,X0] :
      ( ~ in(X3,singleton(X0))
      | X0 = X3 ),
    inference(equality_resolution,[],[f51]) ).

fof(f51,plain,
    ! [X3,X0,X1] :
      ( X0 = X3
      | ~ in(X3,X1)
      | singleton(X0) != X1 ),
    inference(cnf_transformation,[],[f31]) ).

fof(f185,plain,
    ! [X0,X1] :
      ( in(sK3(X0,X1,X0),X0)
      | set_intersection2(X0,X1) = X0 ),
    inference(factoring,[],[f39]) ).

fof(f39,plain,
    ! [X2,X0,X1] :
      ( in(sK3(X0,X1,X2),X2)
      | in(sK3(X0,X1,X2),X0)
      | set_intersection2(X0,X1) = X2 ),
    inference(cnf_transformation,[],[f22]) ).

fof(f41,plain,
    ! [X2,X0,X1] :
      ( ~ in(sK3(X0,X1,X2),X2)
      | ~ in(sK3(X0,X1,X2),X1)
      | ~ in(sK3(X0,X1,X2),X0)
      | set_intersection2(X0,X1) = X2 ),
    inference(cnf_transformation,[],[f22]) ).

fof(f244,plain,
    ! [X0,X1] :
      ( ~ in(sK3(X0,X1,X1),X0)
      | set_intersection2(X0,X1) = X1 ),
    inference(subsumption_resolution,[],[f239,f198]) ).

fof(f239,plain,
    ! [X0,X1] :
      ( ~ in(sK3(X0,X1,X1),X1)
      | ~ in(sK3(X0,X1,X1),X0)
      | set_intersection2(X0,X1) = X1 ),
    inference(duplicate_literal_removal,[],[f235]) ).

fof(f235,plain,
    ! [X0,X1] :
      ( ~ in(sK3(X0,X1,X1),X1)
      | ~ in(sK3(X0,X1,X1),X0)
      | set_intersection2(X0,X1) = X1
      | set_intersection2(X0,X1) = X1 ),
    inference(resolution,[],[f41,f198]) ).

fof(f1554,plain,
    ( ! [X0] :
        ( sF7 = set_intersection2(sF7,X0)
        | ~ in(sK0,X0) )
    | ~ spl9_2 ),
    inference(duplicate_literal_removal,[],[f1533]) ).

fof(f1533,plain,
    ( ! [X0] :
        ( ~ in(sK0,X0)
        | sF7 = set_intersection2(sF7,X0)
        | sF7 = set_intersection2(sF7,X0) )
    | ~ spl9_2 ),
    inference(superposition,[],[f243,f1276]) ).

fof(f1276,plain,
    ( ! [X0] :
        ( sK0 = sK3(sF7,X0,sF7)
        | sF7 = set_intersection2(sF7,X0) )
    | ~ spl9_2 ),
    inference(resolution,[],[f1264,f185]) ).

fof(f1264,plain,
    ( ! [X0] :
        ( ~ in(X0,sF7)
        | sK0 = X0 )
    | ~ spl9_2 ),
    inference(duplicate_literal_removal,[],[f1253]) ).

fof(f1253,plain,
    ( ! [X0] :
        ( ~ in(X0,sF7)
        | sK0 = X0
        | sK0 = X0 )
    | ~ spl9_2 ),
    inference(superposition,[],[f62,f1248]) ).

fof(f1248,plain,
    ( sF7 = unordered_pair(sK0,sK0)
    | ~ spl9_2 ),
    inference(superposition,[],[f67,f77]) ).

fof(f77,plain,
    ( sK0 = sK2
    | ~ spl9_2 ),
    inference(avatar_component_clause,[],[f75]) ).

fof(f75,plain,
    ( spl9_2
  <=> sK0 = sK2 ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).

fof(f62,plain,
    ! [X0,X1,X4] :
      ( ~ in(X4,unordered_pair(X0,X1))
      | X0 = X4
      | X1 = X4 ),
    inference(equality_resolution,[],[f43]) ).

fof(f43,plain,
    ! [X2,X0,X1,X4] :
      ( X1 = X4
      | X0 = X4
      | ~ in(X4,X2)
      | unordered_pair(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f27]) ).

fof(f243,plain,
    ! [X0,X1] :
      ( ~ in(sK3(X0,X1,X0),X1)
      | set_intersection2(X0,X1) = X0 ),
    inference(subsumption_resolution,[],[f240,f185]) ).

fof(f240,plain,
    ! [X0,X1] :
      ( ~ in(sK3(X0,X1,X0),X1)
      | ~ in(sK3(X0,X1,X0),X0)
      | set_intersection2(X0,X1) = X0 ),
    inference(duplicate_literal_removal,[],[f234]) ).

fof(f234,plain,
    ! [X0,X1] :
      ( ~ in(sK3(X0,X1,X0),X1)
      | ~ in(sK3(X0,X1,X0),X0)
      | set_intersection2(X0,X1) = X0
      | set_intersection2(X0,X1) = X0 ),
    inference(resolution,[],[f41,f185]) ).

fof(f1602,plain,
    ( sF6 != sF7
    | ~ spl9_2 ),
    inference(superposition,[],[f69,f1581]) ).

fof(f1581,plain,
    ( sF7 = sF8
    | ~ spl9_2 ),
    inference(subsumption_resolution,[],[f1555,f32]) ).

fof(f1555,plain,
    ( sF7 = sF8
    | ~ in(sK0,sK1)
    | ~ spl9_2 ),
    inference(superposition,[],[f1554,f68]) ).

fof(f69,plain,
    sF6 != sF8,
    inference(definition_folding,[],[f34,f68,f67,f66]) ).

fof(f34,plain,
    singleton(sK0) != set_intersection2(unordered_pair(sK0,sK2),sK1),
    inference(cnf_transformation,[],[f17]) ).

fof(f1483,plain,
    ~ spl9_12,
    inference(avatar_contradiction_clause,[],[f1482]) ).

fof(f1482,plain,
    ( $false
    | ~ spl9_12 ),
    inference(subsumption_resolution,[],[f1457,f69]) ).

fof(f1457,plain,
    ( sF6 = sF8
    | ~ spl9_12 ),
    inference(superposition,[],[f35,f1446]) ).

fof(f1446,plain,
    ( sF6 = set_intersection2(sF8,sF8)
    | ~ spl9_12 ),
    inference(subsumption_resolution,[],[f1445,f136]) ).

fof(f1445,plain,
    ( ~ in(sK0,sF8)
    | sF6 = set_intersection2(sF8,sF8)
    | ~ spl9_12 ),
    inference(subsumption_resolution,[],[f1442,f79]) ).

fof(f1442,plain,
    ( ~ in(sK0,sF6)
    | ~ in(sK0,sF8)
    | sF6 = set_intersection2(sF8,sF8)
    | ~ spl9_12 ),
    inference(duplicate_literal_removal,[],[f1439]) ).

fof(f1439,plain,
    ( ~ in(sK0,sF6)
    | ~ in(sK0,sF8)
    | ~ in(sK0,sF8)
    | sF6 = set_intersection2(sF8,sF8)
    | ~ spl9_12 ),
    inference(superposition,[],[f41,f1196]) ).

fof(f1196,plain,
    ( sK0 = sK3(sF8,sF8,sF6)
    | ~ spl9_12 ),
    inference(avatar_component_clause,[],[f1194]) ).

fof(f1194,plain,
    ( spl9_12
  <=> sK0 = sK3(sF8,sF8,sF6) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_12])]) ).

fof(f35,plain,
    ! [X0] : set_intersection2(X0,X0) = X0,
    inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
    ! [X0] : set_intersection2(X0,X0) = X0,
    inference(rectify,[],[f7]) ).

fof(f7,axiom,
    ! [X0,X1] : set_intersection2(X0,X0) = X0,
    file('/export/starexec/sandbox/tmp/tmp.eROqFWyVLE/Vampire---4.8_19309',idempotence_k3_xboole_0) ).

fof(f1211,plain,
    ( spl9_12
    | spl9_1 ),
    inference(avatar_split_clause,[],[f1210,f71,f1194]) ).

fof(f71,plain,
    ( spl9_1
  <=> in(sK2,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).

fof(f1210,plain,
    ( in(sK2,sK1)
    | sK0 = sK3(sF8,sF8,sF6) ),
    inference(subsumption_resolution,[],[f1209,f69]) ).

fof(f1209,plain,
    ( sF6 = sF8
    | in(sK2,sK1)
    | sK0 = sK3(sF8,sF8,sF6) ),
    inference(forward_demodulation,[],[f1102,f35]) ).

fof(f1102,plain,
    ( in(sK2,sK1)
    | sF6 = set_intersection2(sF8,sF8)
    | sK0 = sK3(sF8,sF8,sF6) ),
    inference(duplicate_literal_removal,[],[f1096]) ).

fof(f1096,plain,
    ( in(sK2,sK1)
    | sF6 = set_intersection2(sF8,sF8)
    | sK0 = sK3(sF8,sF8,sF6)
    | sF6 = set_intersection2(sF8,sF8) ),
    inference(superposition,[],[f606,f538]) ).

fof(f538,plain,
    ! [X0] :
      ( sK2 = sK3(X0,sF8,sF6)
      | sK0 = sK3(X0,sF8,sF6)
      | sF6 = set_intersection2(X0,sF8) ),
    inference(resolution,[],[f533,f131]) ).

fof(f131,plain,
    ! [X0] :
      ( ~ in(X0,sF7)
      | sK0 = X0
      | sK2 = X0 ),
    inference(superposition,[],[f62,f67]) ).

fof(f533,plain,
    ! [X0] :
      ( in(sK3(X0,sF8,sF6),sF7)
      | sF6 = set_intersection2(X0,sF8) ),
    inference(resolution,[],[f518,f110]) ).

fof(f518,plain,
    ! [X0] :
      ( in(sK3(X0,sF8,sF6),sF8)
      | sF6 = set_intersection2(X0,sF8) ),
    inference(factoring,[],[f289]) ).

fof(f289,plain,
    ! [X0,X1] :
      ( in(sK3(X0,X1,sF6),sF8)
      | in(sK3(X0,X1,sF6),X1)
      | set_intersection2(X0,X1) = sF6 ),
    inference(resolution,[],[f275,f40]) ).

fof(f606,plain,
    ! [X0] :
      ( in(sK3(sF8,X0,sF6),sK1)
      | sF6 = set_intersection2(sF8,X0) ),
    inference(resolution,[],[f602,f109]) ).

fof(f109,plain,
    ! [X0] :
      ( ~ in(X0,sF8)
      | in(X0,sK1) ),
    inference(superposition,[],[f56,f68]) ).

fof(f602,plain,
    ! [X0] :
      ( in(sK3(sF8,X0,sF6),sF8)
      | sF6 = set_intersection2(sF8,X0) ),
    inference(factoring,[],[f290]) ).

fof(f290,plain,
    ! [X0,X1] :
      ( in(sK3(X0,X1,sF6),sF8)
      | in(sK3(X0,X1,sF6),X0)
      | set_intersection2(X0,X1) = sF6 ),
    inference(resolution,[],[f275,f39]) ).

fof(f78,plain,
    ( ~ spl9_1
    | spl9_2 ),
    inference(avatar_split_clause,[],[f33,f75,f71]) ).

fof(f33,plain,
    ( sK0 = sK2
    | ~ in(sK2,sK1) ),
    inference(cnf_transformation,[],[f17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem    : SET919+1 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.15  % 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.15/0.36  % Computer : n022.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:21:23 EDT 2024
% 0.15/0.37  % CPUTime    : 
% 0.15/0.37  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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.eROqFWyVLE/Vampire---4.8_19309
% 0.54/0.74  % (19579)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.54/0.74  % (19572)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.54/0.74  % (19578)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.54/0.74  % (19575)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.54/0.74  % (19573)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.54/0.74  % (19574)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.54/0.74  % (19576)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.54/0.74  % (19577)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.54/0.74  % (19579)Refutation not found, incomplete strategy% (19579)------------------------------
% 0.54/0.74  % (19579)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74  % (19579)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.74  
% 0.54/0.74  % (19579)Memory used [KB]: 1044
% 0.54/0.74  % (19579)Time elapsed: 0.002 s
% 0.54/0.74  % (19579)Instructions burned: 3 (million)
% 0.54/0.74  % (19579)------------------------------
% 0.54/0.74  % (19579)------------------------------
% 0.59/0.75  % (19577)Refutation not found, incomplete strategy% (19577)------------------------------
% 0.59/0.75  % (19577)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75  % (19577)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.75  
% 0.59/0.75  % (19577)Memory used [KB]: 1039
% 0.59/0.75  % (19577)Time elapsed: 0.003 s
% 0.59/0.75  % (19577)Instructions burned: 3 (million)
% 0.59/0.75  % (19576)Refutation not found, incomplete strategy% (19576)------------------------------
% 0.59/0.75  % (19576)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75  % (19576)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.75  
% 0.59/0.75  % (19576)Memory used [KB]: 1046
% 0.59/0.75  % (19576)Time elapsed: 0.003 s
% 0.59/0.75  % (19576)Instructions burned: 3 (million)
% 0.59/0.75  % (19577)------------------------------
% 0.59/0.75  % (19577)------------------------------
% 0.59/0.75  % (19576)------------------------------
% 0.59/0.75  % (19576)------------------------------
% 0.59/0.75  % (19581)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2996ds/50Mi)
% 0.59/0.75  % (19582)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/208Mi)
% 0.59/0.76  % (19580)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.59/0.76  % (19572)Instruction limit reached!
% 0.59/0.76  % (19572)------------------------------
% 0.59/0.76  % (19572)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76  % (19572)Termination reason: Unknown
% 0.59/0.76  % (19572)Termination phase: Saturation
% 0.59/0.76  
% 0.59/0.76  % (19572)Memory used [KB]: 1169
% 0.59/0.76  % (19572)Time elapsed: 0.020 s
% 0.59/0.76  % (19572)Instructions burned: 34 (million)
% 0.59/0.76  % (19572)------------------------------
% 0.59/0.76  % (19572)------------------------------
% 0.59/0.76  % (19575)Instruction limit reached!
% 0.59/0.76  % (19575)------------------------------
% 0.59/0.76  % (19575)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76  % (19575)Termination reason: Unknown
% 0.59/0.76  % (19575)Termination phase: Saturation
% 0.59/0.76  
% 0.59/0.76  % (19575)Memory used [KB]: 1363
% 0.59/0.76  % (19575)Time elapsed: 0.021 s
% 0.59/0.76  % (19575)Instructions burned: 34 (million)
% 0.59/0.76  % (19575)------------------------------
% 0.59/0.76  % (19575)------------------------------
% 0.59/0.77  % (19583)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on Vampire---4 for (2996ds/52Mi)
% 0.59/0.77  % (19584)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on Vampire---4 for (2996ds/518Mi)
% 0.59/0.77  % (19584)Refutation not found, incomplete strategy% (19584)------------------------------
% 0.59/0.77  % (19584)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77  % (19584)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.77  
% 0.59/0.77  % (19584)Memory used [KB]: 1044
% 0.59/0.77  % (19584)Time elapsed: 0.005 s
% 0.59/0.77  % (19584)Instructions burned: 4 (million)
% 0.59/0.77  % (19584)------------------------------
% 0.59/0.77  % (19584)------------------------------
% 0.59/0.77  % (19580)Instruction limit reached!
% 0.59/0.77  % (19580)------------------------------
% 0.59/0.77  % (19580)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77  % (19580)Termination reason: Unknown
% 0.59/0.77  % (19580)Termination phase: Saturation
% 0.59/0.77  
% 0.59/0.77  % (19580)Memory used [KB]: 1606
% 0.59/0.77  % (19580)Time elapsed: 0.019 s
% 0.59/0.77  % (19580)Instructions burned: 56 (million)
% 0.59/0.77  % (19580)------------------------------
% 0.59/0.77  % (19580)------------------------------
% 0.59/0.77  % (19573)Instruction limit reached!
% 0.59/0.77  % (19573)------------------------------
% 0.59/0.77  % (19573)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77  % (19573)Termination reason: Unknown
% 0.59/0.77  % (19573)Termination phase: Saturation
% 0.59/0.77  
% 0.59/0.77  % (19573)Memory used [KB]: 1373
% 0.59/0.77  % (19573)Time elapsed: 0.032 s
% 0.59/0.77  % (19573)Instructions burned: 51 (million)
% 0.59/0.77  % (19573)------------------------------
% 0.59/0.77  % (19573)------------------------------
% 0.59/0.78  % (19581)Instruction limit reached!
% 0.59/0.78  % (19581)------------------------------
% 0.59/0.78  % (19581)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.78  % (19581)Termination reason: Unknown
% 0.59/0.78  % (19581)Termination phase: Saturation
% 0.59/0.78  
% 0.59/0.78  % (19581)Memory used [KB]: 1273
% 0.59/0.78  % (19581)Time elapsed: 0.027 s
% 0.59/0.78  % (19581)Instructions burned: 51 (million)
% 0.59/0.78  % (19581)------------------------------
% 0.59/0.78  % (19581)------------------------------
% 0.59/0.78  % (19585)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on Vampire---4 for (2996ds/42Mi)
% 0.59/0.78  % (19586)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on Vampire---4 for (2996ds/243Mi)
% 0.59/0.78  % (19587)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on Vampire---4 for (2996ds/117Mi)
% 0.59/0.78  % (19585)Refutation not found, incomplete strategy% (19585)------------------------------
% 0.59/0.78  % (19585)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.78  % (19585)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.78  
% 0.59/0.78  % (19585)Memory used [KB]: 1044
% 0.59/0.78  % (19585)Time elapsed: 0.003 s
% 0.59/0.78  % (19585)Instructions burned: 3 (million)
% 0.59/0.78  % (19585)------------------------------
% 0.59/0.78  % (19585)------------------------------
% 0.59/0.78  % (19588)dis+1011_11:1_sil=2000:avsq=on:i=143:avsqr=1,16:ep=RS:rawr=on:aac=none:lsd=100:mep=off:fde=none:newcnf=on:bsr=unit_only_0 on Vampire---4 for (2996ds/143Mi)
% 0.59/0.78  % (19589)lrs+1011_1:2_to=lpo:sil=8000:plsqc=1:plsq=on:plsqr=326,59:sp=weighted_frequency:plsql=on:nwc=10.0:newcnf=on:i=93:awrs=converge:awrsf=200:bd=off:ins=1:rawr=on:alpa=false:avsq=on:avsqr=1,16_0 on Vampire---4 for (2996ds/93Mi)
% 0.59/0.79  % (19574)Instruction limit reached!
% 0.59/0.79  % (19574)------------------------------
% 0.59/0.79  % (19574)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.79  % (19574)Termination reason: Unknown
% 0.59/0.79  % (19574)Termination phase: Saturation
% 0.59/0.79  
% 0.59/0.79  % (19574)Memory used [KB]: 1572
% 0.59/0.79  % (19574)Time elapsed: 0.049 s
% 0.59/0.79  % (19582)First to succeed.
% 0.59/0.79  % (19574)Instructions burned: 79 (million)
% 0.59/0.79  % (19574)------------------------------
% 0.59/0.79  % (19574)------------------------------
% 0.59/0.79  % (19582)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-19568"
% 0.59/0.79  % (19578)Instruction limit reached!
% 0.59/0.79  % (19578)------------------------------
% 0.59/0.79  % (19578)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.79  % (19578)Termination reason: Unknown
% 0.59/0.79  % (19578)Termination phase: Saturation
% 0.59/0.79  
% 0.59/0.79  % (19578)Memory used [KB]: 1734
% 0.59/0.79  % (19578)Time elapsed: 0.052 s
% 0.59/0.79  % (19578)Instructions burned: 83 (million)
% 0.59/0.79  % (19578)------------------------------
% 0.59/0.79  % (19578)------------------------------
% 0.59/0.80  % (19582)Refutation found. Thanks to Tanya!
% 0.59/0.80  % SZS status Theorem for Vampire---4
% 0.59/0.80  % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.80  % (19582)------------------------------
% 0.59/0.80  % (19582)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80  % (19582)Termination reason: Refutation
% 0.59/0.80  
% 0.59/0.80  % (19582)Memory used [KB]: 1514
% 0.59/0.80  % (19582)Time elapsed: 0.045 s
% 0.59/0.80  % (19582)Instructions burned: 78 (million)
% 0.59/0.80  % (19568)Success in time 0.414 s
% 0.59/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------