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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET934+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 : n006.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:06 EDT 2024

% Result   : Theorem 0.68s 0.87s
% Output   : Refutation 0.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   60 (  14 unt;   0 def)
%            Number of atoms       :  225 (  21 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  269 ( 104   ~; 107   |;  44   &)
%                                         (   8 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :  120 ( 106   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f599,plain,
    $false,
    inference(avatar_sat_refutation,[],[f129,f582,f598]) ).

fof(f598,plain,
    ~ spl7_1,
    inference(avatar_contradiction_clause,[],[f597]) ).

fof(f597,plain,
    ( $false
    | ~ spl7_1 ),
    inference(subsumption_resolution,[],[f596,f44]) ).

fof(f44,plain,
    ~ subset(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1))),
    inference(cnf_transformation,[],[f26]) ).

fof(f26,plain,
    ~ subset(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1))),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f18,f25]) ).

fof(f25,plain,
    ( ? [X0,X1] : ~ subset(set_union2(powerset(X0),powerset(X1)),powerset(set_union2(X0,X1)))
   => ~ subset(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1))) ),
    introduced(choice_axiom,[]) ).

fof(f18,plain,
    ? [X0,X1] : ~ subset(set_union2(powerset(X0),powerset(X1)),powerset(set_union2(X0,X1))),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,negated_conjecture,
    ~ ! [X0,X1] : subset(set_union2(powerset(X0),powerset(X1)),powerset(set_union2(X0,X1))),
    inference(negated_conjecture,[],[f14]) ).

fof(f14,conjecture,
    ! [X0,X1] : subset(set_union2(powerset(X0),powerset(X1)),powerset(set_union2(X0,X1))),
    file('/export/starexec/sandbox2/tmp/tmp.h4A0BI0z3o/Vampire---4.8_21833',t81_zfmisc_1) ).

fof(f596,plain,
    ( subset(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1)))
    | ~ spl7_1 ),
    inference(subsumption_resolution,[],[f595,f78]) ).

fof(f78,plain,
    ! [X0,X1] : subset(X0,set_union2(X1,X0)),
    inference(superposition,[],[f45,f55]) ).

fof(f55,plain,
    ! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
    inference(cnf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
    file('/export/starexec/sandbox2/tmp/tmp.h4A0BI0z3o/Vampire---4.8_21833',commutativity_k2_xboole_0) ).

fof(f45,plain,
    ! [X0,X1] : subset(X0,set_union2(X0,X1)),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,axiom,
    ! [X0,X1] : subset(X0,set_union2(X0,X1)),
    file('/export/starexec/sandbox2/tmp/tmp.h4A0BI0z3o/Vampire---4.8_21833',t7_xboole_1) ).

fof(f595,plain,
    ( ~ subset(sK1,set_union2(sK0,sK1))
    | subset(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1)))
    | ~ spl7_1 ),
    inference(resolution,[],[f584,f199]) ).

fof(f199,plain,
    ! [X2,X0,X1] :
      ( ~ subset(sK4(X0,powerset(X1)),X2)
      | ~ subset(X2,X1)
      | subset(X0,powerset(X1)) ),
    inference(resolution,[],[f89,f60]) ).

fof(f60,plain,
    ! [X2,X0,X1] :
      ( subset(X0,X2)
      | ~ subset(X1,X2)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f22]) ).

fof(f22,plain,
    ! [X0,X1,X2] :
      ( subset(X0,X2)
      | ~ subset(X1,X2)
      | ~ subset(X0,X1) ),
    inference(flattening,[],[f21]) ).

fof(f21,plain,
    ! [X0,X1,X2] :
      ( subset(X0,X2)
      | ~ subset(X1,X2)
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f12,axiom,
    ! [X0,X1,X2] :
      ( ( subset(X1,X2)
        & subset(X0,X1) )
     => subset(X0,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.h4A0BI0z3o/Vampire---4.8_21833',t1_xboole_1) ).

fof(f89,plain,
    ! [X0,X1] :
      ( ~ subset(sK4(X0,powerset(X1)),X1)
      | subset(X0,powerset(X1)) ),
    inference(resolution,[],[f64,f71]) ).

fof(f71,plain,
    ! [X3,X0] :
      ( in(X3,powerset(X0))
      | ~ subset(X3,X0) ),
    inference(equality_resolution,[],[f57]) ).

fof(f57,plain,
    ! [X3,X0,X1] :
      ( in(X3,X1)
      | ~ subset(X3,X0)
      | powerset(X0) != X1 ),
    inference(cnf_transformation,[],[f35]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( ( powerset(X0) = X1
        | ( ( ~ subset(sK3(X0,X1),X0)
            | ~ in(sK3(X0,X1),X1) )
          & ( subset(sK3(X0,X1),X0)
            | in(sK3(X0,X1),X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | ~ subset(X3,X0) )
            & ( subset(X3,X0)
              | ~ in(X3,X1) ) )
        | powerset(X0) != X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f33,f34]) ).

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

fof(f33,plain,
    ! [X0,X1] :
      ( ( powerset(X0) = X1
        | ? [X2] :
            ( ( ~ subset(X2,X0)
              | ~ in(X2,X1) )
            & ( subset(X2,X0)
              | in(X2,X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | ~ subset(X3,X0) )
            & ( subset(X3,X0)
              | ~ in(X3,X1) ) )
        | powerset(X0) != X1 ) ),
    inference(rectify,[],[f32]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( ( powerset(X0) = X1
        | ? [X2] :
            ( ( ~ subset(X2,X0)
              | ~ in(X2,X1) )
            & ( subset(X2,X0)
              | in(X2,X1) ) ) )
      & ( ! [X2] :
            ( ( in(X2,X1)
              | ~ subset(X2,X0) )
            & ( subset(X2,X0)
              | ~ in(X2,X1) ) )
        | powerset(X0) != X1 ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( powerset(X0) = X1
    <=> ! [X2] :
          ( in(X2,X1)
        <=> subset(X2,X0) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.h4A0BI0z3o/Vampire---4.8_21833',d1_zfmisc_1) ).

fof(f64,plain,
    ! [X0,X1] :
      ( ~ in(sK4(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f39]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ in(sK4(X0,X1),X1)
          & in(sK4(X0,X1),X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f37,f38]) ).

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

fof(f37,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f36]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X2] :
            ( in(X2,X1)
            | ~ in(X2,X0) )
        | ~ subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X1)
          | ~ in(X2,X0) ) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.h4A0BI0z3o/Vampire---4.8_21833',d3_tarski) ).

fof(f584,plain,
    ( subset(sK4(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1))),sK1)
    | ~ spl7_1 ),
    inference(resolution,[],[f124,f72]) ).

fof(f72,plain,
    ! [X3,X0] :
      ( ~ in(X3,powerset(X0))
      | subset(X3,X0) ),
    inference(equality_resolution,[],[f56]) ).

fof(f56,plain,
    ! [X3,X0,X1] :
      ( subset(X3,X0)
      | ~ in(X3,X1)
      | powerset(X0) != X1 ),
    inference(cnf_transformation,[],[f35]) ).

fof(f124,plain,
    ( in(sK4(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1))),powerset(sK1))
    | ~ spl7_1 ),
    inference(avatar_component_clause,[],[f122]) ).

fof(f122,plain,
    ( spl7_1
  <=> in(sK4(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1))),powerset(sK1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).

fof(f582,plain,
    ~ spl7_2,
    inference(avatar_contradiction_clause,[],[f581]) ).

fof(f581,plain,
    ( $false
    | ~ spl7_2 ),
    inference(subsumption_resolution,[],[f580,f44]) ).

fof(f580,plain,
    ( subset(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1)))
    | ~ spl7_2 ),
    inference(subsumption_resolution,[],[f573,f45]) ).

fof(f573,plain,
    ( ~ subset(sK0,set_union2(sK0,sK1))
    | subset(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1)))
    | ~ spl7_2 ),
    inference(resolution,[],[f199,f130]) ).

fof(f130,plain,
    ( subset(sK4(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1))),sK0)
    | ~ spl7_2 ),
    inference(resolution,[],[f128,f72]) ).

fof(f128,plain,
    ( in(sK4(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1))),powerset(sK0))
    | ~ spl7_2 ),
    inference(avatar_component_clause,[],[f126]) ).

fof(f126,plain,
    ( spl7_2
  <=> in(sK4(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1))),powerset(sK0)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).

fof(f129,plain,
    ( spl7_1
    | spl7_2 ),
    inference(avatar_split_clause,[],[f115,f126,f122]) ).

fof(f115,plain,
    ( in(sK4(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1))),powerset(sK0))
    | in(sK4(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1))),powerset(sK1)) ),
    inference(resolution,[],[f70,f87]) ).

fof(f87,plain,
    in(sK4(set_union2(powerset(sK0),powerset(sK1)),powerset(set_union2(sK0,sK1))),set_union2(powerset(sK0),powerset(sK1))),
    inference(resolution,[],[f63,f44]) ).

fof(f63,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | in(sK4(X0,X1),X0) ),
    inference(cnf_transformation,[],[f39]) ).

fof(f70,plain,
    ! [X0,X1,X4] :
      ( ~ in(X4,set_union2(X0,X1))
      | in(X4,X0)
      | in(X4,X1) ),
    inference(equality_resolution,[],[f49]) ).

fof(f49,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X1)
      | in(X4,X0)
      | ~ in(X4,X2)
      | set_union2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f31]) ).

fof(f31,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(X0,X1) = X2
        | ( ( ( ~ in(sK2(X0,X1,X2),X1)
              & ~ in(sK2(X0,X1,X2),X0) )
            | ~ in(sK2(X0,X1,X2),X2) )
          & ( in(sK2(X0,X1,X2),X1)
            | in(sK2(X0,X1,X2),X0)
            | in(sK2(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ( ~ in(X4,X1)
                & ~ in(X4,X0) ) )
            & ( in(X4,X1)
              | in(X4,X0)
              | ~ in(X4,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f29,f30]) ).

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

fof(f29,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(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_union2(X0,X1) != X2 ) ),
    inference(rectify,[],[f28]) ).

fof(f28,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(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_union2(X0,X1) != X2 ) ),
    inference(flattening,[],[f27]) ).

fof(f27,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(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_union2(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0,X1,X2] :
      ( set_union2(X0,X1) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X1)
            | in(X3,X0) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.h4A0BI0z3o/Vampire---4.8_21833',d2_xboole_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET934+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.13  % 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.13/0.34  % Computer : n006.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri May  3 17:06:23 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35  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.h4A0BI0z3o/Vampire---4.8_21833
% 0.65/0.84  % (22126)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.65/0.84  % (22124)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.65/0.84  % (22125)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.65/0.84  % (22127)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.65/0.84  % (22128)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.65/0.84  % (22129)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.65/0.84  % (22130)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.65/0.84  % (22131)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.68/0.86  % (22127)Instruction limit reached!
% 0.68/0.86  % (22127)------------------------------
% 0.68/0.86  % (22127)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.68/0.86  % (22127)Termination reason: Unknown
% 0.68/0.86  % (22127)Termination phase: Saturation
% 0.68/0.86  
% 0.68/0.86  % (22127)Memory used [KB]: 1261
% 0.68/0.86  % (22127)Time elapsed: 0.019 s
% 0.68/0.86  % (22127)Instructions burned: 34 (million)
% 0.68/0.86  % (22127)------------------------------
% 0.68/0.86  % (22127)------------------------------
% 0.68/0.86  % (22124)Instruction limit reached!
% 0.68/0.86  % (22124)------------------------------
% 0.68/0.86  % (22124)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.68/0.86  % (22124)Termination reason: Unknown
% 0.68/0.86  % (22124)Termination phase: Saturation
% 0.68/0.86  
% 0.68/0.86  % (22124)Memory used [KB]: 1182
% 0.68/0.86  % (22124)Time elapsed: 0.022 s
% 0.68/0.86  % (22124)Instructions burned: 34 (million)
% 0.68/0.86  % (22124)------------------------------
% 0.68/0.86  % (22124)------------------------------
% 0.68/0.86  % (22128)Instruction limit reached!
% 0.68/0.86  % (22128)------------------------------
% 0.68/0.86  % (22128)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.68/0.86  % (22128)Termination reason: Unknown
% 0.68/0.86  % (22128)Termination phase: Saturation
% 0.68/0.86  
% 0.68/0.86  % (22128)Memory used [KB]: 1355
% 0.68/0.86  % (22128)Time elapsed: 0.022 s
% 0.68/0.86  % (22128)Instructions burned: 34 (million)
% 0.68/0.86  % (22128)------------------------------
% 0.68/0.86  % (22128)------------------------------
% 0.68/0.86  % (22132)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 (2995ds/55Mi)
% 0.68/0.86  % (22133)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 (2995ds/50Mi)
% 0.68/0.86  % (22134)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 (2995ds/208Mi)
% 0.68/0.86  % (22129)Instruction limit reached!
% 0.68/0.86  % (22129)------------------------------
% 0.68/0.86  % (22129)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.68/0.86  % (22129)Termination reason: Unknown
% 0.68/0.87  % (22129)Termination phase: Saturation
% 0.68/0.87  
% 0.68/0.87  % (22129)Memory used [KB]: 1279
% 0.68/0.87  % (22129)Time elapsed: 0.027 s
% 0.68/0.87  % (22129)Instructions burned: 46 (million)
% 0.68/0.87  % (22129)------------------------------
% 0.68/0.87  % (22129)------------------------------
% 0.68/0.87  % (22126)First to succeed.
% 0.68/0.87  % (22126)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22041"
% 0.68/0.87  % (22126)Refutation found. Thanks to Tanya!
% 0.68/0.87  % SZS status Theorem for Vampire---4
% 0.68/0.87  % SZS output start Proof for Vampire---4
% See solution above
% 0.68/0.87  % (22126)------------------------------
% 0.68/0.87  % (22126)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.68/0.87  % (22126)Termination reason: Refutation
% 0.68/0.87  
% 0.68/0.87  % (22126)Memory used [KB]: 1312
% 0.68/0.87  % (22126)Time elapsed: 0.028 s
% 0.68/0.87  % (22126)Instructions burned: 54 (million)
% 0.68/0.87  % (22041)Success in time 0.522 s
% 0.68/0.87  % Vampire---4.8 exiting
%------------------------------------------------------------------------------