TSTP Solution File: SEU154+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SEU154+1 : TPTP v8.1.0. Released v3.3.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 : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 18:26:56 EDT 2022

% Result   : Theorem 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   66 (  11 unt;   0 def)
%            Number of atoms       :  249 (  57 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  296 ( 113   ~; 106   |;  56   &)
%                                         (  13 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :  125 ( 111   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f348,plain,
    $false,
    inference(avatar_sat_refutation,[],[f181,f309,f347]) ).

fof(f347,plain,
    spl7_2,
    inference(avatar_contradiction_clause,[],[f343]) ).

fof(f343,plain,
    ( $false
    | spl7_2 ),
    inference(resolution,[],[f175,f78]) ).

fof(f78,plain,
    ! [X0] : subset(empty_set,X0),
    inference(cnf_transformation,[],[f19]) ).

fof(f19,axiom,
    ! [X0] : subset(empty_set,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).

fof(f175,plain,
    ( ~ subset(empty_set,set_intersection2(sK5,singleton(sK6)))
    | spl7_2 ),
    inference(avatar_component_clause,[],[f174]) ).

fof(f174,plain,
    ( spl7_2
  <=> subset(empty_set,set_intersection2(sK5,singleton(sK6))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).

fof(f309,plain,
    spl7_1,
    inference(avatar_contradiction_clause,[],[f302]) ).

fof(f302,plain,
    ( $false
    | spl7_1 ),
    inference(unit_resulting_resolution,[],[f80,f256]) ).

fof(f256,plain,
    ( in(sK6,sK5)
    | spl7_1 ),
    inference(backward_demodulation,[],[f185,f243]) ).

fof(f243,plain,
    ( sK4(empty_set,set_intersection2(sK5,singleton(sK6))) = sK6
    | spl7_1 ),
    inference(resolution,[],[f184,f85]) ).

fof(f85,plain,
    ! [X3,X1] :
      ( ~ in(X3,singleton(X1))
      | X1 = X3 ),
    inference(equality_resolution,[],[f61]) ).

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

fof(f38,plain,
    ! [X0,X1] :
      ( ( singleton(X1) = X0
        | ( ( ~ in(sK2(X0,X1),X0)
            | sK2(X0,X1) != X1 )
          & ( in(sK2(X0,X1),X0)
            | sK2(X0,X1) = X1 ) ) )
      & ( ! [X3] :
            ( ( X1 = X3
              | ~ in(X3,X0) )
            & ( in(X3,X0)
              | X1 != X3 ) )
        | singleton(X1) != X0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f36,f37]) ).

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

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

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

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

fof(f184,plain,
    ( in(sK4(empty_set,set_intersection2(sK5,singleton(sK6))),singleton(sK6))
    | spl7_1 ),
    inference(resolution,[],[f183,f89]) ).

fof(f89,plain,
    ! [X3,X0,X1] :
      ( ~ in(X3,set_intersection2(X0,X1))
      | in(X3,X1) ),
    inference(equality_resolution,[],[f69]) ).

fof(f69,plain,
    ! [X2,X3,X0,X1] :
      ( in(X3,X1)
      | ~ in(X3,X2)
      | set_intersection2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f43]) ).

fof(f43,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( ( ( in(X3,X0)
                & in(X3,X1) )
              | ~ in(X3,X2) )
            & ( in(X3,X2)
              | ~ in(X3,X0)
              | ~ in(X3,X1) ) )
        | set_intersection2(X0,X1) != X2 )
      & ( set_intersection2(X0,X1) = X2
        | ( ( ~ in(sK3(X0,X1,X2),X2)
            | ~ in(sK3(X0,X1,X2),X0)
            | ~ in(sK3(X0,X1,X2),X1) )
          & ( in(sK3(X0,X1,X2),X2)
            | ( in(sK3(X0,X1,X2),X0)
              & in(sK3(X0,X1,X2),X1) ) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f41,f42]) ).

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

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

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

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

fof(f22,plain,
    ! [X2,X1,X0] :
      ( ! [X3] :
          ( ( in(X3,X2)
            & in(X3,X1) )
        <=> in(X3,X0) )
    <=> set_intersection2(X2,X1) = X0 ),
    inference(rectify,[],[f6]) ).

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

fof(f183,plain,
    ( in(sK4(empty_set,set_intersection2(sK5,singleton(sK6))),set_intersection2(sK5,singleton(sK6)))
    | spl7_1 ),
    inference(resolution,[],[f172,f74]) ).

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

fof(f50,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( in(X2,X0)
            | ~ in(X2,X1) )
        | ~ subset(X1,X0) )
      & ( subset(X1,X0)
        | ( ~ in(sK4(X0,X1),X0)
          & in(sK4(X0,X1),X1) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f48,f49]) ).

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

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

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

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

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

fof(f172,plain,
    ( ~ subset(set_intersection2(sK5,singleton(sK6)),empty_set)
    | spl7_1 ),
    inference(avatar_component_clause,[],[f171]) ).

fof(f171,plain,
    ( spl7_1
  <=> subset(set_intersection2(sK5,singleton(sK6)),empty_set) ),
    introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).

fof(f185,plain,
    ( in(sK4(empty_set,set_intersection2(sK5,singleton(sK6))),sK5)
    | spl7_1 ),
    inference(resolution,[],[f183,f88]) ).

fof(f88,plain,
    ! [X3,X0,X1] :
      ( ~ in(X3,set_intersection2(X0,X1))
      | in(X3,X0) ),
    inference(equality_resolution,[],[f70]) ).

fof(f70,plain,
    ! [X2,X3,X0,X1] :
      ( in(X3,X0)
      | ~ in(X3,X2)
      | set_intersection2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f43]) ).

fof(f80,plain,
    ~ in(sK6,sK5),
    inference(cnf_transformation,[],[f52]) ).

fof(f52,plain,
    ( ~ in(sK6,sK5)
    & ~ disjoint(singleton(sK6),sK5) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f27,f51]) ).

fof(f51,plain,
    ( ? [X0,X1] :
        ( ~ in(X1,X0)
        & ~ disjoint(singleton(X1),X0) )
   => ( ~ in(sK6,sK5)
      & ~ disjoint(singleton(sK6),sK5) ) ),
    introduced(choice_axiom,[]) ).

fof(f27,plain,
    ? [X0,X1] :
      ( ~ in(X1,X0)
      & ~ disjoint(singleton(X1),X0) ),
    inference(ennf_transformation,[],[f23]) ).

fof(f23,plain,
    ~ ! [X0,X1] :
        ( ~ in(X1,X0)
       => disjoint(singleton(X1),X0) ),
    inference(rectify,[],[f14]) ).

fof(f14,negated_conjecture,
    ~ ! [X1,X0] :
        ( ~ in(X0,X1)
       => disjoint(singleton(X0),X1) ),
    inference(negated_conjecture,[],[f13]) ).

fof(f13,conjecture,
    ! [X1,X0] :
      ( ~ in(X0,X1)
     => disjoint(singleton(X0),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).

fof(f181,plain,
    ( ~ spl7_1
    | ~ spl7_2 ),
    inference(avatar_split_clause,[],[f180,f174,f171]) ).

fof(f180,plain,
    ( ~ subset(empty_set,set_intersection2(sK5,singleton(sK6)))
    | ~ subset(set_intersection2(sK5,singleton(sK6)),empty_set) ),
    inference(forward_demodulation,[],[f179,f73]) ).

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

fof(f46,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).

fof(f179,plain,
    ( ~ subset(empty_set,set_intersection2(singleton(sK6),sK5))
    | ~ subset(set_intersection2(sK5,singleton(sK6)),empty_set) ),
    inference(forward_demodulation,[],[f160,f73]) ).

fof(f160,plain,
    ( ~ subset(set_intersection2(singleton(sK6),sK5),empty_set)
    | ~ subset(empty_set,set_intersection2(singleton(sK6),sK5)) ),
    inference(extensionality_resolution,[],[f83,f95]) ).

fof(f95,plain,
    empty_set != set_intersection2(singleton(sK6),sK5),
    inference(resolution,[],[f71,f79]) ).

fof(f79,plain,
    ~ disjoint(singleton(sK6),sK5),
    inference(cnf_transformation,[],[f52]) ).

fof(f71,plain,
    ! [X0,X1] :
      ( disjoint(X0,X1)
      | set_intersection2(X0,X1) != empty_set ),
    inference(cnf_transformation,[],[f45]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( ( set_intersection2(X0,X1) = empty_set
        | ~ disjoint(X0,X1) )
      & ( disjoint(X0,X1)
        | set_intersection2(X0,X1) != empty_set ) ),
    inference(rectify,[],[f44]) ).

fof(f44,plain,
    ! [X1,X0] :
      ( ( set_intersection2(X1,X0) = empty_set
        | ~ disjoint(X1,X0) )
      & ( disjoint(X1,X0)
        | set_intersection2(X1,X0) != empty_set ) ),
    inference(nnf_transformation,[],[f21]) ).

fof(f21,plain,
    ! [X1,X0] :
      ( set_intersection2(X1,X0) = empty_set
    <=> disjoint(X1,X0) ),
    inference(rectify,[],[f7]) ).

fof(f7,axiom,
    ! [X1,X0] :
      ( set_intersection2(X0,X1) = empty_set
    <=> disjoint(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).

fof(f83,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | X0 = X1
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f54]) ).

fof(f54,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X1,X0)
        | ~ subset(X0,X1) )
      & ( ( subset(X1,X0)
          & subset(X0,X1) )
        | X0 != X1 ) ),
    inference(flattening,[],[f53]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X1,X0)
        | ~ subset(X0,X1) )
      & ( ( subset(X1,X0)
          & subset(X0,X1) )
        | X0 != X1 ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ( subset(X1,X0)
        & subset(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SEU154+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/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.12/0.34  % Computer : n014.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 14:43:03 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.45  % (15820)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.19/0.48  % (15820)Instruction limit reached!
% 0.19/0.48  % (15820)------------------------------
% 0.19/0.48  % (15820)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (15843)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.19/0.49  % (15834)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.49  % (15826)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.49  % (15834)Instruction limit reached!
% 0.19/0.49  % (15834)------------------------------
% 0.19/0.49  % (15834)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (15820)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (15820)Termination reason: Unknown
% 0.19/0.49  % (15820)Termination phase: Saturation
% 0.19/0.49  
% 0.19/0.49  % (15820)Memory used [KB]: 6140
% 0.19/0.49  % (15834)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (15820)Time elapsed: 0.098 s
% 0.19/0.49  % (15820)Instructions burned: 14 (million)
% 0.19/0.49  % (15834)Termination reason: Unknown
% 0.19/0.49  % (15820)------------------------------
% 0.19/0.49  % (15820)------------------------------
% 0.19/0.49  % (15834)Termination phase: Saturation
% 0.19/0.49  
% 0.19/0.49  % (15834)Memory used [KB]: 1407
% 0.19/0.49  % (15834)Time elapsed: 0.004 s
% 0.19/0.49  % (15834)Instructions burned: 2 (million)
% 0.19/0.49  % (15834)------------------------------
% 0.19/0.49  % (15834)------------------------------
% 0.19/0.50  % (15826)Refutation not found, incomplete strategy% (15826)------------------------------
% 0.19/0.50  % (15826)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (15826)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (15826)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.50  
% 0.19/0.50  % (15826)Memory used [KB]: 5884
% 0.19/0.50  % (15826)Time elapsed: 0.112 s
% 0.19/0.50  % (15826)Instructions burned: 3 (million)
% 0.19/0.50  % (15826)------------------------------
% 0.19/0.50  % (15826)------------------------------
% 0.19/0.50  % (15842)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.50  % (15842)Refutation not found, incomplete strategy% (15842)------------------------------
% 0.19/0.50  % (15842)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (15842)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (15842)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.50  
% 0.19/0.50  % (15842)Memory used [KB]: 6012
% 0.19/0.50  % (15842)Time elapsed: 0.115 s
% 0.19/0.50  % (15842)Instructions burned: 2 (million)
% 0.19/0.50  % (15842)------------------------------
% 0.19/0.50  % (15842)------------------------------
% 0.19/0.51  % (15843)First to succeed.
% 0.19/0.51  % (15843)Refutation found. Thanks to Tanya!
% 0.19/0.51  % SZS status Theorem for theBenchmark
% 0.19/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51  % (15843)------------------------------
% 0.19/0.51  % (15843)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (15843)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (15843)Termination reason: Refutation
% 0.19/0.51  
% 0.19/0.51  % (15843)Memory used [KB]: 6140
% 0.19/0.51  % (15843)Time elapsed: 0.128 s
% 0.19/0.51  % (15843)Instructions burned: 15 (million)
% 0.19/0.51  % (15843)------------------------------
% 0.19/0.51  % (15843)------------------------------
% 0.19/0.51  % (15815)Success in time 0.165 s
%------------------------------------------------------------------------------