TSTP Solution File: SEU164+3 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SEU164+3 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n012.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 Aug 31 18:27:01 EDT 2022

% Result   : Theorem 0.20s 0.53s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   70 (  12 unt;   0 def)
%            Number of atoms       :  250 (  27 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  289 ( 109   ~; 117   |;  43   &)
%                                         (  13 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   7 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   1 con; 0-2 aty)
%            Number of variables   :  116 (  96   !;  20   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f323,plain,
    $false,
    inference(avatar_sat_refutation,[],[f112,f154,f185,f194,f308,f318,f322]) ).

fof(f322,plain,
    ( spl9_8
    | ~ spl9_17 ),
    inference(avatar_split_clause,[],[f319,f310,f151]) ).

fof(f151,plain,
    ( spl9_8
  <=> subset(sK6(powerset(sK1),sK1),sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_8])]) ).

fof(f310,plain,
    ( spl9_17
  <=> in(sK6(powerset(sK1),sK1),powerset(sK1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_17])]) ).

fof(f319,plain,
    ( subset(sK6(powerset(sK1),sK1),sK1)
    | ~ spl9_17 ),
    inference(resolution,[],[f311,f71]) ).

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

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

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

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

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

fof(f29,plain,
    ! [X1,X0] :
      ( ( 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,
    ! [X1,X0] :
      ( powerset(X0) = X1
    <=> ! [X2] :
          ( in(X2,X1)
        <=> subset(X2,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).

fof(f311,plain,
    ( in(sK6(powerset(sK1),sK1),powerset(sK1))
    | ~ spl9_17 ),
    inference(avatar_component_clause,[],[f310]) ).

fof(f318,plain,
    ( spl9_7
    | spl9_4
    | spl9_17 ),
    inference(avatar_split_clause,[],[f315,f310,f109,f130]) ).

fof(f130,plain,
    ( spl9_7
  <=> sQ8_eqProxy(union(powerset(sK1)),sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_7])]) ).

fof(f109,plain,
    ( spl9_4
  <=> in(sK5(powerset(sK1),sK1),sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).

fof(f315,plain,
    ( in(sK5(powerset(sK1),sK1),sK1)
    | sQ8_eqProxy(union(powerset(sK1)),sK1)
    | spl9_17 ),
    inference(resolution,[],[f312,f88]) ).

fof(f88,plain,
    ! [X0,X1] :
      ( in(sK6(X0,X1),X0)
      | in(sK5(X0,X1),X1)
      | sQ8_eqProxy(union(X0),X1) ),
    inference(equality_proxy_replacement,[],[f65,f78]) ).

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

fof(f65,plain,
    ! [X0,X1] :
      ( union(X0) = X1
      | in(sK5(X0,X1),X1)
      | in(sK6(X0,X1),X0) ),
    inference(cnf_transformation,[],[f42]) ).

fof(f42,plain,
    ! [X0,X1] :
      ( ( union(X0) = X1
        | ( ( ~ in(sK5(X0,X1),X1)
            | ! [X3] :
                ( ~ in(X3,X0)
                | ~ in(sK5(X0,X1),X3) ) )
          & ( in(sK5(X0,X1),X1)
            | ( in(sK6(X0,X1),X0)
              & in(sK5(X0,X1),sK6(X0,X1)) ) ) ) )
      & ( ! [X5] :
            ( ( ( in(sK7(X0,X5),X0)
                & in(X5,sK7(X0,X5)) )
              | ~ in(X5,X1) )
            & ( in(X5,X1)
              | ! [X7] :
                  ( ~ in(X7,X0)
                  | ~ in(X5,X7) ) ) )
        | union(X0) != X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f38,f41,f40,f39]) ).

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

fof(f40,plain,
    ! [X0,X1] :
      ( ? [X4] :
          ( in(X4,X0)
          & in(sK5(X0,X1),X4) )
     => ( in(sK6(X0,X1),X0)
        & in(sK5(X0,X1),sK6(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f41,plain,
    ! [X0,X5] :
      ( ? [X6] :
          ( in(X6,X0)
          & in(X5,X6) )
     => ( in(sK7(X0,X5),X0)
        & in(X5,sK7(X0,X5)) ) ),
    introduced(choice_axiom,[]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( ( union(X0) = X1
        | ? [X2] :
            ( ( ~ in(X2,X1)
              | ! [X3] :
                  ( ~ in(X3,X0)
                  | ~ in(X2,X3) ) )
            & ( in(X2,X1)
              | ? [X4] :
                  ( in(X4,X0)
                  & in(X2,X4) ) ) ) )
      & ( ! [X5] :
            ( ( ? [X6] :
                  ( in(X6,X0)
                  & in(X5,X6) )
              | ~ in(X5,X1) )
            & ( in(X5,X1)
              | ! [X7] :
                  ( ~ in(X7,X0)
                  | ~ in(X5,X7) ) ) )
        | union(X0) != X1 ) ),
    inference(rectify,[],[f37]) ).

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

fof(f5,axiom,
    ! [X0,X1] :
      ( union(X0) = X1
    <=> ! [X2] :
          ( ? [X3] :
              ( in(X3,X0)
              & in(X2,X3) )
        <=> in(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).

fof(f312,plain,
    ( ~ in(sK6(powerset(sK1),sK1),powerset(sK1))
    | spl9_17 ),
    inference(avatar_component_clause,[],[f310]) ).

fof(f308,plain,
    ( ~ spl9_9
    | ~ spl9_3
    | ~ spl9_4 ),
    inference(avatar_split_clause,[],[f302,f109,f106,f164]) ).

fof(f164,plain,
    ( spl9_9
  <=> in(sK1,powerset(sK1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_9])]) ).

fof(f106,plain,
    ( spl9_3
  <=> ! [X0] :
        ( ~ in(X0,powerset(sK1))
        | ~ in(sK5(powerset(sK1),sK1),X0) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).

fof(f302,plain,
    ( ~ in(sK1,powerset(sK1))
    | ~ spl9_3
    | ~ spl9_4 ),
    inference(resolution,[],[f107,f110]) ).

fof(f110,plain,
    ( in(sK5(powerset(sK1),sK1),sK1)
    | ~ spl9_4 ),
    inference(avatar_component_clause,[],[f109]) ).

fof(f107,plain,
    ( ! [X0] :
        ( ~ in(sK5(powerset(sK1),sK1),X0)
        | ~ in(X0,powerset(sK1)) )
    | ~ spl9_3 ),
    inference(avatar_component_clause,[],[f106]) ).

fof(f194,plain,
    ~ spl9_7,
    inference(avatar_contradiction_clause,[],[f193]) ).

fof(f193,plain,
    ( $false
    | ~ spl9_7 ),
    inference(resolution,[],[f132,f79]) ).

fof(f79,plain,
    ~ sQ8_eqProxy(union(powerset(sK1)),sK1),
    inference(equality_proxy_replacement,[],[f49,f78]) ).

fof(f49,plain,
    union(powerset(sK1)) != sK1,
    inference(cnf_transformation,[],[f25]) ).

fof(f25,plain,
    union(powerset(sK1)) != sK1,
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f18,f24]) ).

fof(f24,plain,
    ( ? [X0] : union(powerset(X0)) != X0
   => union(powerset(sK1)) != sK1 ),
    introduced(choice_axiom,[]) ).

fof(f18,plain,
    ? [X0] : union(powerset(X0)) != X0,
    inference(ennf_transformation,[],[f12]) ).

fof(f12,negated_conjecture,
    ~ ! [X0] : union(powerset(X0)) = X0,
    inference(negated_conjecture,[],[f11]) ).

fof(f11,conjecture,
    ! [X0] : union(powerset(X0)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t99_zfmisc_1) ).

fof(f132,plain,
    ( sQ8_eqProxy(union(powerset(sK1)),sK1)
    | ~ spl9_7 ),
    inference(avatar_component_clause,[],[f130]) ).

fof(f185,plain,
    spl9_9,
    inference(avatar_contradiction_clause,[],[f184]) ).

fof(f184,plain,
    ( $false
    | spl9_9 ),
    inference(resolution,[],[f182,f60]) ).

fof(f60,plain,
    ! [X0] : subset(X0,X0),
    inference(cnf_transformation,[],[f14]) ).

fof(f14,plain,
    ! [X0] : subset(X0,X0),
    inference(rectify,[],[f9]) ).

fof(f9,axiom,
    ! [X0,X1] : subset(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).

fof(f182,plain,
    ( ~ subset(sK1,sK1)
    | spl9_9 ),
    inference(resolution,[],[f166,f70]) ).

fof(f70,plain,
    ! [X3,X1] :
      ( in(X3,powerset(X1))
      | ~ subset(X3,X1) ),
    inference(equality_resolution,[],[f53]) ).

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

fof(f166,plain,
    ( ~ in(sK1,powerset(sK1))
    | spl9_9 ),
    inference(avatar_component_clause,[],[f164]) ).

fof(f154,plain,
    ( spl9_7
    | spl9_4
    | ~ spl9_8
    | spl9_4 ),
    inference(avatar_split_clause,[],[f144,f109,f151,f109,f130]) ).

fof(f144,plain,
    ( ~ subset(sK6(powerset(sK1),sK1),sK1)
    | in(sK5(powerset(sK1),sK1),sK1)
    | sQ8_eqProxy(union(powerset(sK1)),sK1)
    | spl9_4 ),
    inference(resolution,[],[f126,f89]) ).

fof(f89,plain,
    ! [X0,X1] :
      ( in(sK5(X0,X1),sK6(X0,X1))
      | sQ8_eqProxy(union(X0),X1)
      | in(sK5(X0,X1),X1) ),
    inference(equality_proxy_replacement,[],[f64,f78]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( union(X0) = X1
      | in(sK5(X0,X1),X1)
      | in(sK5(X0,X1),sK6(X0,X1)) ),
    inference(cnf_transformation,[],[f42]) ).

fof(f126,plain,
    ( ! [X0] :
        ( ~ in(sK5(powerset(sK1),sK1),X0)
        | ~ subset(X0,sK1) )
    | spl9_4 ),
    inference(resolution,[],[f111,f48]) ).

fof(f48,plain,
    ! [X2,X0,X1] :
      ( in(X2,X1)
      | ~ in(X2,X0)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ~ in(X2,X0)
            | in(X2,X1) )
        | ~ subset(X0,X1) )
      & ( subset(X0,X1)
        | ( in(sK0(X0,X1),X0)
          & ~ in(sK0(X0,X1),X1) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f21,f22]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( in(X3,X0)
          & ~ in(X3,X1) )
     => ( in(sK0(X0,X1),X0)
        & ~ in(sK0(X0,X1),X1) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f4,axiom,
    ! [X0,X1] :
      ( ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) )
    <=> subset(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).

fof(f111,plain,
    ( ~ in(sK5(powerset(sK1),sK1),sK1)
    | spl9_4 ),
    inference(avatar_component_clause,[],[f109]) ).

fof(f112,plain,
    ( spl9_3
    | ~ spl9_4 ),
    inference(avatar_split_clause,[],[f92,f109,f106]) ).

fof(f92,plain,
    ! [X0] :
      ( ~ in(sK5(powerset(sK1),sK1),sK1)
      | ~ in(X0,powerset(sK1))
      | ~ in(sK5(powerset(sK1),sK1),X0) ),
    inference(resolution,[],[f79,f87]) ).

fof(f87,plain,
    ! [X3,X0,X1] :
      ( sQ8_eqProxy(union(X0),X1)
      | ~ in(sK5(X0,X1),X1)
      | ~ in(X3,X0)
      | ~ in(sK5(X0,X1),X3) ),
    inference(equality_proxy_replacement,[],[f66,f78]) ).

fof(f66,plain,
    ! [X3,X0,X1] :
      ( union(X0) = X1
      | ~ in(sK5(X0,X1),X1)
      | ~ in(X3,X0)
      | ~ in(sK5(X0,X1),X3) ),
    inference(cnf_transformation,[],[f42]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SEU164+3 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.06/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34  % Computer : n012.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.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 14:43:35 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.49  % (18628)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.50  % (18622)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50  % (18622)Refutation not found, incomplete strategy% (18622)------------------------------
% 0.20/0.50  % (18622)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (18622)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (18622)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.50  
% 0.20/0.50  % (18622)Memory used [KB]: 5884
% 0.20/0.50  % (18622)Time elapsed: 0.105 s
% 0.20/0.50  % (18622)Instructions burned: 1 (million)
% 0.20/0.50  % (18622)------------------------------
% 0.20/0.50  % (18622)------------------------------
% 0.20/0.50  % (18624)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.50  % (18620)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.50  % (18635)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51  % (18625)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.51  % (18639)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.20/0.51  % (18620)Refutation not found, incomplete strategy% (18620)------------------------------
% 0.20/0.51  % (18620)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (18646)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.20/0.51  % (18620)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (18620)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.51  
% 0.20/0.51  % (18620)Memory used [KB]: 5884
% 0.20/0.51  % (18620)Time elapsed: 0.110 s
% 0.20/0.51  % (18620)Instructions burned: 2 (million)
% 0.20/0.51  % (18620)------------------------------
% 0.20/0.51  % (18620)------------------------------
% 0.20/0.52  % (18621)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52  % (18621)Refutation not found, incomplete strategy% (18621)------------------------------
% 0.20/0.52  % (18621)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (18621)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (18621)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.52  
% 0.20/0.52  % (18621)Memory used [KB]: 5884
% 0.20/0.52  % (18621)Time elapsed: 0.123 s
% 0.20/0.52  % (18621)Instructions burned: 2 (million)
% 0.20/0.52  % (18621)------------------------------
% 0.20/0.52  % (18621)------------------------------
% 0.20/0.52  % (18638)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.52  % (18624)Refutation not found, incomplete strategy% (18624)------------------------------
% 0.20/0.52  % (18624)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (18624)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (18624)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.52  
% 0.20/0.52  % (18624)Memory used [KB]: 1407
% 0.20/0.52  % (18624)Time elapsed: 0.125 s
% 0.20/0.52  % (18624)Instructions burned: 3 (million)
% 0.20/0.52  % (18624)------------------------------
% 0.20/0.52  % (18624)------------------------------
% 0.20/0.52  % (18627)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.52  % (18623)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.53  % (18638)First to succeed.
% 0.20/0.53  % (18651)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.53  % (18619)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.53  % (18638)Refutation found. Thanks to Tanya!
% 0.20/0.53  % SZS status Theorem for theBenchmark
% 0.20/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53  % (18638)------------------------------
% 0.20/0.53  % (18638)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (18638)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (18638)Termination reason: Refutation
% 0.20/0.53  
% 0.20/0.53  % (18638)Memory used [KB]: 6012
% 0.20/0.53  % (18638)Time elapsed: 0.134 s
% 0.20/0.53  % (18638)Instructions burned: 8 (million)
% 0.20/0.53  % (18638)------------------------------
% 0.20/0.53  % (18638)------------------------------
% 0.20/0.53  % (18613)Success in time 0.177 s
%------------------------------------------------------------------------------