TSTP Solution File: SEU136+2 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU136+2 : TPTP v8.1.2. Released v3.3.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 : n010.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:50:12 EDT 2024

% Result   : Theorem 0.65s 0.82s
% Output   : Refutation 0.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   60 (   8 unt;   0 def)
%            Number of atoms       :  254 (  34 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  315 ( 121   ~; 135   |;  49   &)
%                                         (   7 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-3 aty)
%            Number of variables   :  117 ( 105   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f653,plain,
    $false,
    inference(avatar_sat_refutation,[],[f257,f260,f487,f652]) ).

fof(f652,plain,
    ( ~ spl13_1
    | spl13_2 ),
    inference(avatar_contradiction_clause,[],[f651]) ).

fof(f651,plain,
    ( $false
    | ~ spl13_1
    | spl13_2 ),
    inference(subsumption_resolution,[],[f650,f255]) ).

fof(f255,plain,
    ( ~ in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK9)
    | spl13_2 ),
    inference(avatar_component_clause,[],[f254]) ).

fof(f254,plain,
    ( spl13_2
  <=> in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK9) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).

fof(f650,plain,
    ( in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK9)
    | ~ spl13_1 ),
    inference(subsumption_resolution,[],[f639,f258]) ).

fof(f258,plain,
    ~ in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK10),
    inference(subsumption_resolution,[],[f242,f202]) ).

fof(f202,plain,
    ! [X0,X1,X4] :
      ( ~ in(X4,X1)
      | ~ in(X4,set_difference(X0,X1)) ),
    inference(equality_resolution,[],[f144]) ).

fof(f144,plain,
    ! [X2,X0,X1,X4] :
      ( ~ in(X4,X1)
      | ~ in(X4,X2)
      | set_difference(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f103]) ).

fof(f103,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(X0,X1) = X2
        | ( ( in(sK4(X0,X1,X2),X1)
            | ~ in(sK4(X0,X1,X2),X0)
            | ~ in(sK4(X0,X1,X2),X2) )
          & ( ( ~ in(sK4(X0,X1,X2),X1)
              & in(sK4(X0,X1,X2),X0) )
            | in(sK4(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | in(X4,X1)
              | ~ in(X4,X0) )
            & ( ( ~ in(X4,X1)
                & in(X4,X0) )
              | ~ in(X4,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f101,f102]) ).

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

fof(f101,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(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_difference(X0,X1) != X2 ) ),
    inference(rectify,[],[f100]) ).

fof(f100,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(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_difference(X0,X1) != X2 ) ),
    inference(flattening,[],[f99]) ).

fof(f99,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(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_difference(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f9]) ).

fof(f9,axiom,
    ! [X0,X1,X2] :
      ( set_difference(X0,X1) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( ~ in(X3,X1)
            & in(X3,X0) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.HoIhphz75y/Vampire---4.8_30828',d4_xboole_0) ).

fof(f242,plain,
    ( ~ in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK10)
    | in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),set_difference(set_union2(sK9,sK10),sK10)) ),
    inference(resolution,[],[f235,f216]) ).

fof(f216,plain,
    ! [X2,X0,X1] :
      ( sQ12_eqProxy(set_difference(X0,X1),X2)
      | ~ in(sK4(X0,X1,X2),X1)
      | in(sK4(X0,X1,X2),X2) ),
    inference(equality_proxy_replacement,[],[f147,f204]) ).

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

fof(f147,plain,
    ! [X2,X0,X1] :
      ( set_difference(X0,X1) = X2
      | ~ in(sK4(X0,X1,X2),X1)
      | in(sK4(X0,X1,X2),X2) ),
    inference(cnf_transformation,[],[f103]) ).

fof(f235,plain,
    ~ sQ12_eqProxy(set_difference(sK9,sK10),set_difference(set_union2(sK9,sK10),sK10)),
    inference(equality_proxy_replacement,[],[f183,f204]) ).

fof(f183,plain,
    set_difference(sK9,sK10) != set_difference(set_union2(sK9,sK10),sK10),
    inference(cnf_transformation,[],[f117]) ).

fof(f117,plain,
    set_difference(sK9,sK10) != set_difference(set_union2(sK9,sK10),sK10),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f72,f116]) ).

fof(f116,plain,
    ( ? [X0,X1] : set_difference(X0,X1) != set_difference(set_union2(X0,X1),X1)
   => set_difference(sK9,sK10) != set_difference(set_union2(sK9,sK10),sK10) ),
    introduced(choice_axiom,[]) ).

fof(f72,plain,
    ? [X0,X1] : set_difference(X0,X1) != set_difference(set_union2(X0,X1),X1),
    inference(ennf_transformation,[],[f43]) ).

fof(f43,negated_conjecture,
    ~ ! [X0,X1] : set_difference(X0,X1) = set_difference(set_union2(X0,X1),X1),
    inference(negated_conjecture,[],[f42]) ).

fof(f42,conjecture,
    ! [X0,X1] : set_difference(X0,X1) = set_difference(set_union2(X0,X1),X1),
    file('/export/starexec/sandbox2/tmp/tmp.HoIhphz75y/Vampire---4.8_30828',t40_xboole_1) ).

fof(f639,plain,
    ( in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK10)
    | in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK9)
    | ~ spl13_1 ),
    inference(resolution,[],[f538,f197]) ).

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

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

fof(f89,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(X0,X1) = X2
        | ( ( ( ~ in(sK1(X0,X1,X2),X1)
              & ~ in(sK1(X0,X1,X2),X0) )
            | ~ in(sK1(X0,X1,X2),X2) )
          & ( in(sK1(X0,X1,X2),X1)
            | in(sK1(X0,X1,X2),X0)
            | in(sK1(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,[sK1])],[f87,f88]) ).

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

fof(f87,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,[],[f86]) ).

fof(f86,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,[],[f85]) ).

fof(f85,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,[],[f6]) ).

fof(f6,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.HoIhphz75y/Vampire---4.8_30828',d2_xboole_0) ).

fof(f538,plain,
    ( in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),set_union2(sK9,sK10))
    | ~ spl13_1 ),
    inference(resolution,[],[f252,f203]) ).

fof(f203,plain,
    ! [X0,X1,X4] :
      ( in(X4,X0)
      | ~ in(X4,set_difference(X0,X1)) ),
    inference(equality_resolution,[],[f143]) ).

fof(f143,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X0)
      | ~ in(X4,X2)
      | set_difference(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f103]) ).

fof(f252,plain,
    ( in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),set_difference(set_union2(sK9,sK10),sK10))
    | ~ spl13_1 ),
    inference(avatar_component_clause,[],[f250]) ).

fof(f250,plain,
    ( spl13_1
  <=> in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),set_difference(set_union2(sK9,sK10),sK10)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_1])]) ).

fof(f487,plain,
    ( spl13_1
    | ~ spl13_2 ),
    inference(avatar_contradiction_clause,[],[f486]) ).

fof(f486,plain,
    ( $false
    | spl13_1
    | ~ spl13_2 ),
    inference(subsumption_resolution,[],[f477,f256]) ).

fof(f256,plain,
    ( in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK9)
    | ~ spl13_2 ),
    inference(avatar_component_clause,[],[f254]) ).

fof(f477,plain,
    ( ~ in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK9)
    | spl13_1 ),
    inference(resolution,[],[f472,f196]) ).

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

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

fof(f472,plain,
    ( ~ in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),set_union2(sK9,sK10))
    | spl13_1 ),
    inference(subsumption_resolution,[],[f464,f258]) ).

fof(f464,plain,
    ( in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK10)
    | ~ in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),set_union2(sK9,sK10))
    | spl13_1 ),
    inference(resolution,[],[f251,f201]) ).

fof(f201,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_difference(X0,X1))
      | in(X4,X1)
      | ~ in(X4,X0) ),
    inference(equality_resolution,[],[f145]) ).

fof(f145,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | in(X4,X1)
      | ~ in(X4,X0)
      | set_difference(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f103]) ).

fof(f251,plain,
    ( ~ in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),set_difference(set_union2(sK9,sK10),sK10))
    | spl13_1 ),
    inference(avatar_component_clause,[],[f250]) ).

fof(f260,plain,
    ( ~ spl13_1
    | ~ spl13_2 ),
    inference(avatar_split_clause,[],[f259,f254,f250]) ).

fof(f259,plain,
    ( ~ in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK9)
    | ~ in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),set_difference(set_union2(sK9,sK10),sK10)) ),
    inference(subsumption_resolution,[],[f243,f258]) ).

fof(f243,plain,
    ( in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK10)
    | ~ in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK9)
    | ~ in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),set_difference(set_union2(sK9,sK10),sK10)) ),
    inference(resolution,[],[f235,f215]) ).

fof(f215,plain,
    ! [X2,X0,X1] :
      ( sQ12_eqProxy(set_difference(X0,X1),X2)
      | in(sK4(X0,X1,X2),X1)
      | ~ in(sK4(X0,X1,X2),X0)
      | ~ in(sK4(X0,X1,X2),X2) ),
    inference(equality_proxy_replacement,[],[f148,f204]) ).

fof(f148,plain,
    ! [X2,X0,X1] :
      ( set_difference(X0,X1) = X2
      | in(sK4(X0,X1,X2),X1)
      | ~ in(sK4(X0,X1,X2),X0)
      | ~ in(sK4(X0,X1,X2),X2) ),
    inference(cnf_transformation,[],[f103]) ).

fof(f257,plain,
    ( spl13_1
    | spl13_2 ),
    inference(avatar_split_clause,[],[f241,f254,f250]) ).

fof(f241,plain,
    ( in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),sK9)
    | in(sK4(sK9,sK10,set_difference(set_union2(sK9,sK10),sK10)),set_difference(set_union2(sK9,sK10),sK10)) ),
    inference(resolution,[],[f235,f217]) ).

fof(f217,plain,
    ! [X2,X0,X1] :
      ( sQ12_eqProxy(set_difference(X0,X1),X2)
      | in(sK4(X0,X1,X2),X0)
      | in(sK4(X0,X1,X2),X2) ),
    inference(equality_proxy_replacement,[],[f146,f204]) ).

fof(f146,plain,
    ! [X2,X0,X1] :
      ( set_difference(X0,X1) = X2
      | in(sK4(X0,X1,X2),X0)
      | in(sK4(X0,X1,X2),X2) ),
    inference(cnf_transformation,[],[f103]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEU136+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14  % 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.35  % Computer : n010.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   : Tue Apr 30 15:59:49 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36  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.HoIhphz75y/Vampire---4.8_30828
% 0.65/0.81  % (31051)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.81  % (31057)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.65/0.81  % (31050)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.81  % (31052)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.81  % (31053)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.81  % (31054)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.81  % (31055)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.81  % (31056)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.82  % (31054)First to succeed.
% 0.65/0.82  % (31054)Refutation found. Thanks to Tanya!
% 0.65/0.82  % SZS status Theorem for Vampire---4
% 0.65/0.82  % SZS output start Proof for Vampire---4
% See solution above
% 0.65/0.82  % (31054)------------------------------
% 0.65/0.82  % (31054)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.65/0.82  % (31054)Termination reason: Refutation
% 0.65/0.82  
% 0.65/0.82  % (31054)Memory used [KB]: 1181
% 0.65/0.82  % (31054)Time elapsed: 0.010 s
% 0.65/0.82  % (31054)Instructions burned: 14 (million)
% 0.65/0.82  % (31054)------------------------------
% 0.65/0.82  % (31054)------------------------------
% 0.65/0.82  % (30998)Success in time 0.453 s
% 0.65/0.82  % Vampire---4.8 exiting
%------------------------------------------------------------------------------