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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET944+1 : TPTP v8.1.0. Released v3.2.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 : n024.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:22:49 EDT 2022

% Result   : Theorem 0.21s 0.56s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   53 (  17 unt;   0 def)
%            Number of atoms       :  231 (  24 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  284 ( 106   ~; 102   |;  59   &)
%                                         (  10 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-3 aty)
%            Number of variables   :  147 ( 121   !;  26   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f193,plain,
    $false,
    inference(subsumption_resolution,[],[f187,f140]) ).

fof(f140,plain,
    in(sK6(set_intersection2(union(sK1),union(sK2)),union(set_intersection2(sK1,sK2))),union(sK1)),
    inference(unit_resulting_resolution,[],[f67,f78,f61]) ).

fof(f61,plain,
    ! [X2,X3,X1] :
      ( ~ in(X3,X1)
      | in(X2,union(X1))
      | ~ in(X2,X3) ),
    inference(equality_resolution,[],[f53]) ).

fof(f53,plain,
    ! [X2,X3,X0,X1] :
      ( in(X2,X0)
      | ~ in(X2,X3)
      | ~ in(X3,X1)
      | union(X1) != X0 ),
    inference(cnf_transformation,[],[f33]) ).

fof(f33,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ( in(X2,X0)
              | ! [X3] :
                  ( ~ in(X2,X3)
                  | ~ in(X3,X1) ) )
            & ( ( in(X2,sK3(X1,X2))
                & in(sK3(X1,X2),X1) )
              | ~ in(X2,X0) ) )
        | union(X1) != X0 )
      & ( union(X1) = X0
        | ( ( ! [X6] :
                ( ~ in(sK4(X0,X1),X6)
                | ~ in(X6,X1) )
            | ~ in(sK4(X0,X1),X0) )
          & ( ( in(sK4(X0,X1),sK5(X0,X1))
              & in(sK5(X0,X1),X1) )
            | in(sK4(X0,X1),X0) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f29,f32,f31,f30]) ).

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

fof(f31,plain,
    ! [X0,X1] :
      ( ? [X5] :
          ( ( ! [X6] :
                ( ~ in(X5,X6)
                | ~ in(X6,X1) )
            | ~ in(X5,X0) )
          & ( ? [X7] :
                ( in(X5,X7)
                & in(X7,X1) )
            | in(X5,X0) ) )
     => ( ( ! [X6] :
              ( ~ in(sK4(X0,X1),X6)
              | ~ in(X6,X1) )
          | ~ in(sK4(X0,X1),X0) )
        & ( ? [X7] :
              ( in(sK4(X0,X1),X7)
              & in(X7,X1) )
          | in(sK4(X0,X1),X0) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( ? [X7] :
          ( in(sK4(X0,X1),X7)
          & in(X7,X1) )
     => ( in(sK4(X0,X1),sK5(X0,X1))
        & in(sK5(X0,X1),X1) ) ),
    introduced(choice_axiom,[]) ).

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

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

fof(f14,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( in(X2,X0)
        <=> ? [X3] :
              ( in(X2,X3)
              & in(X3,X1) ) )
    <=> union(X1) = X0 ),
    inference(rectify,[],[f5]) ).

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

fof(f78,plain,
    in(sK3(set_intersection2(sK1,sK2),sK6(set_intersection2(union(sK1),union(sK2)),union(set_intersection2(sK1,sK2)))),sK1),
    inference(unit_resulting_resolution,[],[f66,f59]) ).

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

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

fof(f23,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(X1,X0) != X2 )
      & ( set_intersection2(X1,X0) = X2
        | ( ( ~ in(sK0(X0,X1,X2),X2)
            | ~ in(sK0(X0,X1,X2),X0)
            | ~ in(sK0(X0,X1,X2),X1) )
          & ( in(sK0(X0,X1,X2),X2)
            | ( in(sK0(X0,X1,X2),X0)
              & in(sK0(X0,X1,X2),X1) ) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f21,f22]) ).

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

fof(f21,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(X1,X0) != X2 )
      & ( set_intersection2(X1,X0) = X2
        | ? [X4] :
            ( ( ~ in(X4,X2)
              | ~ in(X4,X0)
              | ~ in(X4,X1) )
            & ( in(X4,X2)
              | ( in(X4,X0)
                & in(X4,X1) ) ) ) ) ),
    inference(rectify,[],[f20]) ).

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

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

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

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

fof(f66,plain,
    in(sK3(set_intersection2(sK1,sK2),sK6(set_intersection2(union(sK1),union(sK2)),union(set_intersection2(sK1,sK2)))),set_intersection2(sK1,sK2)),
    inference(unit_resulting_resolution,[],[f64,f63]) ).

fof(f63,plain,
    ! [X2,X1] :
      ( in(sK3(X1,X2),X1)
      | ~ in(X2,union(X1)) ),
    inference(equality_resolution,[],[f51]) ).

fof(f51,plain,
    ! [X2,X0,X1] :
      ( in(sK3(X1,X2),X1)
      | ~ in(X2,X0)
      | union(X1) != X0 ),
    inference(cnf_transformation,[],[f33]) ).

fof(f64,plain,
    in(sK6(set_intersection2(union(sK1),union(sK2)),union(set_intersection2(sK1,sK2))),union(set_intersection2(sK1,sK2))),
    inference(unit_resulting_resolution,[],[f46,f56]) ).

fof(f56,plain,
    ! [X0,X1] :
      ( in(sK6(X0,X1),X1)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f37]) ).

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

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

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

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

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

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

fof(f46,plain,
    ~ subset(union(set_intersection2(sK1,sK2)),set_intersection2(union(sK1),union(sK2))),
    inference(cnf_transformation,[],[f26]) ).

fof(f26,plain,
    ~ subset(union(set_intersection2(sK1,sK2)),set_intersection2(union(sK1),union(sK2))),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f24,f25]) ).

fof(f25,plain,
    ( ? [X0,X1] : ~ subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1)))
   => ~ subset(union(set_intersection2(sK1,sK2)),set_intersection2(union(sK1),union(sK2))) ),
    introduced(choice_axiom,[]) ).

fof(f24,plain,
    ? [X0,X1] : ~ subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
    inference(rectify,[],[f17]) ).

fof(f17,plain,
    ? [X1,X0] : ~ subset(union(set_intersection2(X1,X0)),set_intersection2(union(X1),union(X0))),
    inference(ennf_transformation,[],[f12]) ).

fof(f12,plain,
    ~ ! [X0,X1] : subset(union(set_intersection2(X1,X0)),set_intersection2(union(X1),union(X0))),
    inference(rectify,[],[f11]) ).

fof(f11,negated_conjecture,
    ~ ! [X1,X0] : subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
    inference(negated_conjecture,[],[f10]) ).

fof(f10,conjecture,
    ! [X1,X0] : subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t97_zfmisc_1) ).

fof(f67,plain,
    in(sK6(set_intersection2(union(sK1),union(sK2)),union(set_intersection2(sK1,sK2))),sK3(set_intersection2(sK1,sK2),sK6(set_intersection2(union(sK1),union(sK2)),union(set_intersection2(sK1,sK2))))),
    inference(unit_resulting_resolution,[],[f64,f62]) ).

fof(f62,plain,
    ! [X2,X1] :
      ( in(X2,sK3(X1,X2))
      | ~ in(X2,union(X1)) ),
    inference(equality_resolution,[],[f52]) ).

fof(f52,plain,
    ! [X2,X0,X1] :
      ( in(X2,sK3(X1,X2))
      | ~ in(X2,X0)
      | union(X1) != X0 ),
    inference(cnf_transformation,[],[f33]) ).

fof(f187,plain,
    ~ in(sK6(set_intersection2(union(sK1),union(sK2)),union(set_intersection2(sK1,sK2))),union(sK1)),
    inference(unit_resulting_resolution,[],[f65,f129,f60]) ).

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

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

fof(f129,plain,
    in(sK6(set_intersection2(union(sK1),union(sK2)),union(set_intersection2(sK1,sK2))),union(sK2)),
    inference(unit_resulting_resolution,[],[f67,f77,f61]) ).

fof(f77,plain,
    in(sK3(set_intersection2(sK1,sK2),sK6(set_intersection2(union(sK1),union(sK2)),union(set_intersection2(sK1,sK2)))),sK2),
    inference(unit_resulting_resolution,[],[f66,f58]) ).

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

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

fof(f65,plain,
    ~ in(sK6(set_intersection2(union(sK1),union(sK2)),union(set_intersection2(sK1,sK2))),set_intersection2(union(sK1),union(sK2))),
    inference(unit_resulting_resolution,[],[f46,f55]) ).

fof(f55,plain,
    ! [X0,X1] :
      ( ~ in(sK6(X0,X1),X0)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f37]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SET944+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/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.35  % Computer : n024.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 14:34:04 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.21/0.50  % (2306)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.51  % (2310)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.21/0.51  % (2298)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.21/0.51  % (2318)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.21/0.51  % (2302)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.21/0.51  % (2300)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.21/0.51  % (2314)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.21/0.51  % (2302)Instruction limit reached!
% 0.21/0.51  % (2302)------------------------------
% 0.21/0.51  % (2302)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (2310)Instruction limit reached!
% 0.21/0.51  % (2310)------------------------------
% 0.21/0.51  % (2310)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52  % (2306)Instruction limit reached!
% 0.21/0.52  % (2306)------------------------------
% 0.21/0.52  % (2306)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52  % (2292)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.21/0.52  % (2308)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.21/0.52  % (2293)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.21/0.52  % (2293)Refutation not found, incomplete strategy% (2293)------------------------------
% 0.21/0.52  % (2293)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52  % (2293)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52  % (2293)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.52  
% 0.21/0.52  % (2293)Memory used [KB]: 5884
% 0.21/0.52  % (2293)Time elapsed: 0.116 s
% 0.21/0.52  % (2293)Instructions burned: 2 (million)
% 0.21/0.52  % (2293)------------------------------
% 0.21/0.52  % (2293)------------------------------
% 0.21/0.52  % (2310)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52  % (2306)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52  % (2310)Termination reason: Unknown
% 0.21/0.52  % (2306)Termination reason: Unknown
% 0.21/0.52  % (2310)Termination phase: Saturation
% 0.21/0.52  % (2306)Termination phase: Saturation
% 0.21/0.52  
% 0.21/0.52  
% 0.21/0.52  % (2310)Memory used [KB]: 5884
% 0.21/0.52  % (2306)Memory used [KB]: 5884
% 0.21/0.52  % (2310)Time elapsed: 0.003 s
% 0.21/0.52  % (2310)Instructions burned: 3 (million)
% 0.21/0.52  % (2306)Time elapsed: 0.114 s
% 0.21/0.52  % (2310)------------------------------
% 0.21/0.52  % (2310)------------------------------
% 0.21/0.52  % (2306)Instructions burned: 3 (million)
% 0.21/0.52  % (2306)------------------------------
% 0.21/0.52  % (2306)------------------------------
% 0.21/0.53  % (2294)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.21/0.53  % (2294)Refutation not found, incomplete strategy% (2294)------------------------------
% 0.21/0.53  % (2294)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53  % (2294)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53  % (2294)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.53  
% 0.21/0.53  % (2294)Memory used [KB]: 5884
% 0.21/0.53  % (2294)Time elapsed: 0.108 s
% 0.21/0.53  % (2294)Instructions burned: 2 (million)
% 0.21/0.53  % (2294)------------------------------
% 0.21/0.53  % (2294)------------------------------
% 0.21/0.53  % (2309)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.53  % (2302)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53  % (2302)Termination reason: Unknown
% 0.21/0.53  % (2302)Termination phase: Saturation
% 0.21/0.53  
% 0.21/0.53  % (2302)Memory used [KB]: 6012
% 0.21/0.53  % (2302)Time elapsed: 0.116 s
% 0.21/0.53  % (2302)Instructions burned: 13 (million)
% 0.21/0.53  % (2302)------------------------------
% 0.21/0.53  % (2302)------------------------------
% 0.21/0.53  % (2309)Instruction limit reached!
% 0.21/0.53  % (2309)------------------------------
% 0.21/0.53  % (2309)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53  % (2309)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53  % (2309)Termination reason: Unknown
% 0.21/0.53  % (2309)Termination phase: Finite model building preprocessing
% 0.21/0.53  
% 0.21/0.53  % (2309)Memory used [KB]: 1407
% 0.21/0.53  % (2309)Time elapsed: 0.002 s
% 0.21/0.53  % (2309)Instructions burned: 3 (million)
% 0.21/0.53  % (2309)------------------------------
% 0.21/0.53  % (2309)------------------------------
% 0.21/0.53  % (2312)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.21/0.53  % (2301)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.21/0.54  % (2316)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.54  % (2320)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.21/0.54  % (2315)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.54  % (2320)Refutation not found, incomplete strategy% (2320)------------------------------
% 0.21/0.54  % (2320)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54  % (2320)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54  % (2320)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.54  
% 0.21/0.54  % (2320)Memory used [KB]: 5884
% 0.21/0.54  % (2320)Time elapsed: 0.131 s
% 0.21/0.54  % (2320)Instructions burned: 2 (million)
% 0.21/0.54  % (2320)------------------------------
% 0.21/0.54  % (2320)------------------------------
% 0.21/0.54  % (2296)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.21/0.54  % (2317)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.21/0.54  % (2304)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.54  % (2311)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.21/0.54  % (2295)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.21/0.55  % (2297)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.21/0.55  % (2295)First to succeed.
% 0.21/0.55  % (2307)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.55  % (2299)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.55  % (2307)Instruction limit reached!
% 0.21/0.55  % (2307)------------------------------
% 0.21/0.55  % (2307)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56  % (2303)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.56  % (2296)Instruction limit reached!
% 0.21/0.56  % (2296)------------------------------
% 0.21/0.56  % (2296)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56  % (2319)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.21/0.56  % (2311)Refutation not found, incomplete strategy% (2311)------------------------------
% 0.21/0.56  % (2311)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56  % (2311)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56  % (2311)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.56  
% 0.21/0.56  % (2311)Memory used [KB]: 5884
% 0.21/0.56  % (2311)Time elapsed: 0.147 s
% 0.21/0.56  % (2311)Instructions burned: 1 (million)
% 0.21/0.56  % (2311)------------------------------
% 0.21/0.56  % (2311)------------------------------
% 0.21/0.56  % (2298)Instruction limit reached!
% 0.21/0.56  % (2298)------------------------------
% 0.21/0.56  % (2298)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56  % (2295)Refutation found. Thanks to Tanya!
% 0.21/0.56  % SZS status Theorem for theBenchmark
% 0.21/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.56  % (2295)------------------------------
% 0.21/0.56  % (2295)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56  % (2295)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56  % (2295)Termination reason: Refutation
% 0.21/0.56  
% 0.21/0.56  % (2295)Memory used [KB]: 6012
% 0.21/0.56  % (2295)Time elapsed: 0.154 s
% 0.21/0.56  % (2295)Instructions burned: 7 (million)
% 0.21/0.56  % (2295)------------------------------
% 0.21/0.56  % (2295)------------------------------
% 0.21/0.56  % (2291)Success in time 0.198 s
%------------------------------------------------------------------------------