TSTP Solution File: SET807+4 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET807+4 : 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 : n002.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:19 EDT 2022

% Result   : Theorem 0.20s 0.54s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   60 (  11 unt;   0 def)
%            Number of atoms       :  207 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  217 (  70   ~;  55   |;  69   &)
%                                         (   7 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-2 aty)
%            Number of variables   :  130 ( 102   !;  28   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f130,plain,
    $false,
    inference(subsumption_resolution,[],[f127,f112]) ).

fof(f112,plain,
    ~ member(sK6(sK3(subset_predicate,power_set(sK1)),sK2(subset_predicate,power_set(sK1))),sK2(subset_predicate,power_set(sK1))),
    inference(resolution,[],[f111,f70]) ).

fof(f70,plain,
    ! [X0] :
      ( ~ sP0(subset_predicate,X0)
      | ~ member(sK6(sK3(subset_predicate,X0),sK2(subset_predicate,X0)),sK2(subset_predicate,X0)) ),
    inference(resolution,[],[f66,f62]) ).

fof(f62,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ member(sK6(X0,X1),X1) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( member(X2,X1)
            | ~ member(X2,X0) )
        | ~ subset(X0,X1) )
      & ( subset(X0,X1)
        | ( ~ member(sK6(X0,X1),X1)
          & member(sK6(X0,X1),X0) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f45,f46]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( ~ member(X3,X1)
          & member(X3,X0) )
     => ( ~ member(sK6(X0,X1),X1)
        & member(sK6(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( member(X2,X1)
            | ~ member(X2,X0) )
        | ~ subset(X0,X1) )
      & ( subset(X0,X1)
        | ? [X3] :
            ( ~ member(X3,X1)
            & member(X3,X0) ) ) ),
    inference(rectify,[],[f44]) ).

fof(f44,plain,
    ! [X1,X0] :
      ( ( ! [X2] :
            ( member(X2,X0)
            | ~ member(X2,X1) )
        | ~ subset(X1,X0) )
      & ( subset(X1,X0)
        | ? [X2] :
            ( ~ member(X2,X0)
            & member(X2,X1) ) ) ),
    inference(nnf_transformation,[],[f29]) ).

fof(f29,plain,
    ! [X1,X0] :
      ( ! [X2] :
          ( member(X2,X0)
          | ~ member(X2,X1) )
    <=> subset(X1,X0) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( subset(X1,X0)
    <=> ! [X2] :
          ( member(X2,X1)
         => member(X2,X0) ) ),
    inference(rectify,[],[f1]) ).

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

fof(f66,plain,
    ! [X0] :
      ( ~ subset(sK3(subset_predicate,X0),sK2(subset_predicate,X0))
      | ~ sP0(subset_predicate,X0) ),
    inference(resolution,[],[f59,f51]) ).

fof(f51,plain,
    ! [X0,X1] :
      ( ~ apply(X0,sK3(X0,X1),sK2(X0,X1))
      | ~ sP0(X0,X1) ),
    inference(cnf_transformation,[],[f38]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( ( apply(X0,sK4(X0,X1),sK2(X0,X1))
        & member(sK3(X0,X1),X1)
        & member(sK2(X0,X1),X1)
        & apply(X0,sK3(X0,X1),sK4(X0,X1))
        & member(sK4(X0,X1),X1)
        & ~ apply(X0,sK3(X0,X1),sK2(X0,X1)) )
      | ~ sP0(X0,X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f36,f37]) ).

fof(f37,plain,
    ! [X0,X1] :
      ( ? [X2,X3,X4] :
          ( apply(X0,X4,X2)
          & member(X3,X1)
          & member(X2,X1)
          & apply(X0,X3,X4)
          & member(X4,X1)
          & ~ apply(X0,X3,X2) )
     => ( apply(X0,sK4(X0,X1),sK2(X0,X1))
        & member(sK3(X0,X1),X1)
        & member(sK2(X0,X1),X1)
        & apply(X0,sK3(X0,X1),sK4(X0,X1))
        & member(sK4(X0,X1),X1)
        & ~ apply(X0,sK3(X0,X1),sK2(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( ? [X2,X3,X4] :
          ( apply(X0,X4,X2)
          & member(X3,X1)
          & member(X2,X1)
          & apply(X0,X3,X4)
          & member(X4,X1)
          & ~ apply(X0,X3,X2) )
      | ~ sP0(X0,X1) ),
    inference(rectify,[],[f35]) ).

fof(f35,plain,
    ! [X1,X0] :
      ( ? [X2,X4,X3] :
          ( apply(X1,X3,X2)
          & member(X4,X0)
          & member(X2,X0)
          & apply(X1,X4,X3)
          & member(X3,X0)
          & ~ apply(X1,X4,X2) )
      | ~ sP0(X1,X0) ),
    inference(nnf_transformation,[],[f30]) ).

fof(f30,plain,
    ! [X1,X0] :
      ( ? [X2,X4,X3] :
          ( apply(X1,X3,X2)
          & member(X4,X0)
          & member(X2,X0)
          & apply(X1,X4,X3)
          & member(X3,X0)
          & ~ apply(X1,X4,X2) )
      | ~ sP0(X1,X0) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f59,plain,
    ! [X0,X1] :
      ( apply(subset_predicate,X0,X1)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f43]) ).

fof(f43,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ~ apply(subset_predicate,X0,X1) )
      & ( apply(subset_predicate,X0,X1)
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f42]) ).

fof(f42,plain,
    ! [X1,X0] :
      ( ( subset(X1,X0)
        | ~ apply(subset_predicate,X1,X0) )
      & ( apply(subset_predicate,X1,X0)
        | ~ subset(X1,X0) ) ),
    inference(nnf_transformation,[],[f20]) ).

fof(f20,plain,
    ! [X1,X0] :
      ( subset(X1,X0)
    <=> apply(subset_predicate,X1,X0) ),
    inference(rectify,[],[f17]) ).

fof(f17,axiom,
    ! [X4,X2] :
      ( apply(subset_predicate,X2,X4)
    <=> subset(X2,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rel_subset) ).

fof(f111,plain,
    sP0(subset_predicate,power_set(sK1)),
    inference(subsumption_resolution,[],[f85,f84]) ).

fof(f84,plain,
    ( sP0(subset_predicate,power_set(sK1))
    | ~ member(sK6(sK5(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),sK5(subset_predicate,power_set(sK1))) ),
    inference(resolution,[],[f82,f62]) ).

fof(f82,plain,
    ( ~ subset(sK5(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1)))
    | sP0(subset_predicate,power_set(sK1)) ),
    inference(resolution,[],[f64,f59]) ).

fof(f64,plain,
    ( ~ apply(subset_predicate,sK5(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1)))
    | sP0(subset_predicate,power_set(sK1)) ),
    inference(resolution,[],[f48,f58]) ).

fof(f58,plain,
    ! [X0,X1] :
      ( pre_order(X0,X1)
      | sP0(X0,X1)
      | ~ apply(X0,sK5(X0,X1),sK5(X0,X1)) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( ( ~ apply(X0,sK5(X0,X1),sK5(X0,X1))
        & member(sK5(X0,X1),X1) )
      | pre_order(X0,X1)
      | sP0(X0,X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f39,f40]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ~ apply(X0,X2,X2)
          & member(X2,X1) )
     => ( ~ apply(X0,sK5(X0,X1),sK5(X0,X1))
        & member(sK5(X0,X1),X1) ) ),
    introduced(choice_axiom,[]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ~ apply(X0,X2,X2)
          & member(X2,X1) )
      | pre_order(X0,X1)
      | sP0(X0,X1) ),
    inference(rectify,[],[f31]) ).

fof(f31,plain,
    ! [X1,X0] :
      ( ? [X5] :
          ( ~ apply(X1,X5,X5)
          & member(X5,X0) )
      | pre_order(X1,X0)
      | sP0(X1,X0) ),
    inference(definition_folding,[],[f27,f30]) ).

fof(f27,plain,
    ! [X1,X0] :
      ( ? [X5] :
          ( ~ apply(X1,X5,X5)
          & member(X5,X0) )
      | pre_order(X1,X0)
      | ? [X2,X4,X3] :
          ( apply(X1,X3,X2)
          & member(X4,X0)
          & member(X2,X0)
          & apply(X1,X4,X3)
          & member(X3,X0)
          & ~ apply(X1,X4,X2) ) ),
    inference(flattening,[],[f26]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( pre_order(X1,X0)
      | ? [X2,X3,X4] :
          ( ~ apply(X1,X4,X2)
          & apply(X1,X3,X2)
          & apply(X1,X4,X3)
          & member(X3,X0)
          & member(X4,X0)
          & member(X2,X0) )
      | ? [X5] :
          ( ~ apply(X1,X5,X5)
          & member(X5,X0) ) ),
    inference(ennf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ( ! [X2,X3,X4] :
            ( ( member(X3,X0)
              & member(X4,X0)
              & member(X2,X0) )
           => ( ( apply(X1,X3,X2)
                & apply(X1,X4,X3) )
             => apply(X1,X4,X2) ) )
        & ! [X5] :
            ( member(X5,X0)
           => apply(X1,X5,X5) ) )
     => pre_order(X1,X0) ),
    inference(unused_predicate_definition_removal,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ( ! [X2,X3,X4] :
            ( ( member(X3,X0)
              & member(X4,X0)
              & member(X2,X0) )
           => ( ( apply(X1,X3,X2)
                & apply(X1,X4,X3) )
             => apply(X1,X4,X2) ) )
        & ! [X5] :
            ( member(X5,X0)
           => apply(X1,X5,X5) ) )
    <=> pre_order(X1,X0) ),
    inference(rectify,[],[f16]) ).

fof(f16,axiom,
    ! [X3,X6] :
      ( pre_order(X6,X3)
    <=> ( ! [X5,X4,X2] :
            ( ( member(X4,X3)
              & member(X5,X3)
              & member(X2,X3) )
           => ( ( apply(X6,X4,X5)
                & apply(X6,X2,X4) )
             => apply(X6,X2,X5) ) )
        & ! [X2] :
            ( member(X2,X3)
           => apply(X6,X2,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pre_order) ).

fof(f48,plain,
    ~ pre_order(subset_predicate,power_set(sK1)),
    inference(cnf_transformation,[],[f33]) ).

fof(f33,plain,
    ~ pre_order(subset_predicate,power_set(sK1)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f28,f32]) ).

fof(f32,plain,
    ( ? [X0] : ~ pre_order(subset_predicate,power_set(X0))
   => ~ pre_order(subset_predicate,power_set(sK1)) ),
    introduced(choice_axiom,[]) ).

fof(f28,plain,
    ? [X0] : ~ pre_order(subset_predicate,power_set(X0)),
    inference(ennf_transformation,[],[f21]) ).

fof(f21,plain,
    ~ ! [X0] : pre_order(subset_predicate,power_set(X0)),
    inference(rectify,[],[f19]) ).

fof(f19,negated_conjecture,
    ~ ! [X3] : pre_order(subset_predicate,power_set(X3)),
    inference(negated_conjecture,[],[f18]) ).

fof(f18,conjecture,
    ! [X3] : pre_order(subset_predicate,power_set(X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV18a) ).

fof(f85,plain,
    ( sP0(subset_predicate,power_set(sK1))
    | member(sK6(sK5(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),sK5(subset_predicate,power_set(sK1))) ),
    inference(resolution,[],[f82,f61]) ).

fof(f61,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | member(sK6(X0,X1),X0) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f127,plain,
    member(sK6(sK3(subset_predicate,power_set(sK1)),sK2(subset_predicate,power_set(sK1))),sK2(subset_predicate,power_set(sK1))),
    inference(resolution,[],[f125,f113]) ).

fof(f113,plain,
    member(sK6(sK3(subset_predicate,power_set(sK1)),sK2(subset_predicate,power_set(sK1))),sK3(subset_predicate,power_set(sK1))),
    inference(resolution,[],[f111,f71]) ).

fof(f71,plain,
    ! [X1] :
      ( ~ sP0(subset_predicate,X1)
      | member(sK6(sK3(subset_predicate,X1),sK2(subset_predicate,X1)),sK3(subset_predicate,X1)) ),
    inference(resolution,[],[f66,f61]) ).

fof(f125,plain,
    ! [X0] :
      ( ~ member(X0,sK3(subset_predicate,power_set(sK1)))
      | member(X0,sK2(subset_predicate,power_set(sK1))) ),
    inference(resolution,[],[f117,f115]) ).

fof(f115,plain,
    ! [X0] :
      ( member(X0,sK4(subset_predicate,power_set(sK1)))
      | ~ member(X0,sK3(subset_predicate,power_set(sK1))) ),
    inference(resolution,[],[f111,f73]) ).

fof(f73,plain,
    ! [X0,X1] :
      ( ~ sP0(subset_predicate,X0)
      | ~ member(X1,sK3(subset_predicate,X0))
      | member(X1,sK4(subset_predicate,X0)) ),
    inference(resolution,[],[f68,f63]) ).

fof(f63,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X0,X1)
      | member(X2,X1)
      | ~ member(X2,X0) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f68,plain,
    ! [X2] :
      ( subset(sK3(subset_predicate,X2),sK4(subset_predicate,X2))
      | ~ sP0(subset_predicate,X2) ),
    inference(resolution,[],[f60,f53]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( apply(X0,sK3(X0,X1),sK4(X0,X1))
      | ~ sP0(X0,X1) ),
    inference(cnf_transformation,[],[f38]) ).

fof(f60,plain,
    ! [X0,X1] :
      ( ~ apply(subset_predicate,X0,X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f43]) ).

fof(f117,plain,
    ! [X1] :
      ( ~ member(X1,sK4(subset_predicate,power_set(sK1)))
      | member(X1,sK2(subset_predicate,power_set(sK1))) ),
    inference(resolution,[],[f111,f75]) ).

fof(f75,plain,
    ! [X0,X1] :
      ( ~ sP0(subset_predicate,X0)
      | ~ member(X1,sK4(subset_predicate,X0))
      | member(X1,sK2(subset_predicate,X0)) ),
    inference(resolution,[],[f69,f63]) ).

fof(f69,plain,
    ! [X3] :
      ( subset(sK4(subset_predicate,X3),sK2(subset_predicate,X3))
      | ~ sP0(subset_predicate,X3) ),
    inference(resolution,[],[f60,f56]) ).

fof(f56,plain,
    ! [X0,X1] :
      ( apply(X0,sK4(X0,X1),sK2(X0,X1))
      | ~ sP0(X0,X1) ),
    inference(cnf_transformation,[],[f38]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET807+4 : TPTP v8.1.0. Released v3.2.0.
% 0.13/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 : n002.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:33:44 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.49  % (16929)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.51  % (16921)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.52  % (16946)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.20/0.52  % (16925)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.52  % (16944)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.20/0.52  % (16938)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.53  % (16926)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.53  % (16950)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.20/0.53  % (16927)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.53  % (16924)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.53  % (16930)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.53  % (16924)Refutation not found, incomplete strategy% (16924)------------------------------
% 0.20/0.53  % (16924)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (16924)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (16924)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.53  
% 0.20/0.53  % (16924)Memory used [KB]: 6012
% 0.20/0.53  % (16924)Time elapsed: 0.122 s
% 0.20/0.53  % (16924)Instructions burned: 1 (million)
% 0.20/0.53  % (16924)------------------------------
% 0.20/0.53  % (16924)------------------------------
% 0.20/0.53  % (16930)Refutation not found, incomplete strategy% (16930)------------------------------
% 0.20/0.53  % (16930)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (16925)Instruction limit reached!
% 0.20/0.53  % (16925)------------------------------
% 0.20/0.53  % (16925)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (16930)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (16925)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (16930)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.53  
% 0.20/0.53  % (16925)Termination reason: Unknown
% 0.20/0.53  % (16925)Termination phase: Saturation
% 0.20/0.53  
% 0.20/0.53  % (16930)Memory used [KB]: 5884
% 0.20/0.53  % (16930)Time elapsed: 0.121 s
% 0.20/0.53  % (16925)Memory used [KB]: 6140
% 0.20/0.53  % (16930)Instructions burned: 2 (million)
% 0.20/0.53  % (16925)Time elapsed: 0.122 s
% 0.20/0.53  % (16930)------------------------------
% 0.20/0.53  % (16930)------------------------------
% 0.20/0.53  % (16925)Instructions burned: 13 (million)
% 0.20/0.53  % (16925)------------------------------
% 0.20/0.53  % (16925)------------------------------
% 0.20/0.53  % (16934)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53  % (16950)Refutation not found, incomplete strategy% (16950)------------------------------
% 0.20/0.53  % (16950)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (16940)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.20/0.53  % (16923)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.53  % (16934)Refutation not found, incomplete strategy% (16934)------------------------------
% 0.20/0.53  % (16934)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (16942)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.53  % (16951)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.54  % (16941)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.54  % (16940)Instruction limit reached!
% 0.20/0.54  % (16940)------------------------------
% 0.20/0.54  % (16940)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (16940)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (16940)Termination reason: Unknown
% 0.20/0.54  % (16940)Termination phase: Saturation
% 0.20/0.54  
% 0.20/0.54  % (16940)Memory used [KB]: 1407
% 0.20/0.54  % (16940)Time elapsed: 0.003 s
% 0.20/0.54  % (16940)Instructions burned: 2 (million)
% 0.20/0.54  % (16940)------------------------------
% 0.20/0.54  % (16940)------------------------------
% 0.20/0.54  % (16933)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.20/0.54  % (16931)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.20/0.54  % (16926)First to succeed.
% 0.20/0.54  % (16945)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.20/0.54  % (16949)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.20/0.54  % (16926)Refutation found. Thanks to Tanya!
% 0.20/0.54  % SZS status Theorem for theBenchmark
% 0.20/0.54  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.54  % (16926)------------------------------
% 0.20/0.54  % (16926)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (16926)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (16926)Termination reason: Refutation
% 0.20/0.54  
% 0.20/0.54  % (16926)Memory used [KB]: 1535
% 0.20/0.54  % (16926)Time elapsed: 0.136 s
% 0.20/0.54  % (16926)Instructions burned: 4 (million)
% 0.20/0.54  % (16926)------------------------------
% 0.20/0.54  % (16926)------------------------------
% 0.20/0.54  % (16917)Success in time 0.187 s
%------------------------------------------------------------------------------