TSTP Solution File: SET636+3 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET636+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n005.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:25:11 EDT 2022

% Result   : Theorem 1.47s 0.59s
% Output   : Refutation 1.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   75 (   5 unt;   0 def)
%            Number of atoms       :  232 (  39 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  257 ( 100   ~; 108   |;  33   &)
%                                         (  12 <=>;   3  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :  120 ( 106   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f270,plain,
    $false,
    inference(avatar_sat_refutation,[],[f80,f82,f118,f269]) ).

fof(f269,plain,
    ( ~ spl5_1
    | spl5_2 ),
    inference(avatar_contradiction_clause,[],[f268]) ).

fof(f268,plain,
    ( $false
    | ~ spl5_1
    | spl5_2 ),
    inference(subsumption_resolution,[],[f251,f78]) ).

fof(f78,plain,
    ( empty_set != intersection(sK3,sK4)
    | spl5_2 ),
    inference(avatar_component_clause,[],[f77]) ).

fof(f77,plain,
    ( spl5_2
  <=> empty_set = intersection(sK3,sK4) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).

fof(f251,plain,
    ( empty_set = intersection(sK3,sK4)
    | ~ spl5_1 ),
    inference(superposition,[],[f249,f53]) ).

fof(f53,plain,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,axiom,
    ! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).

fof(f249,plain,
    ( empty_set = intersection(sK4,sK3)
    | ~ spl5_1 ),
    inference(resolution,[],[f232,f119]) ).

fof(f119,plain,
    ( ~ intersect(sK4,sK3)
    | ~ spl5_1 ),
    inference(resolution,[],[f75,f66]) ).

fof(f66,plain,
    ! [X0,X1] :
      ( ~ disjoint(X1,X0)
      | ~ intersect(X1,X0) ),
    inference(cnf_transformation,[],[f42]) ).

fof(f42,plain,
    ! [X0,X1] :
      ( ( ~ intersect(X1,X0)
        | ~ disjoint(X1,X0) )
      & ( disjoint(X1,X0)
        | intersect(X1,X0) ) ),
    inference(rectify,[],[f41]) ).

fof(f41,plain,
    ! [X1,X0] :
      ( ( ~ intersect(X0,X1)
        | ~ disjoint(X0,X1) )
      & ( disjoint(X0,X1)
        | intersect(X0,X1) ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X1,X0] :
      ( ~ intersect(X0,X1)
    <=> disjoint(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).

fof(f75,plain,
    ( disjoint(sK4,sK3)
    | ~ spl5_1 ),
    inference(avatar_component_clause,[],[f73]) ).

fof(f73,plain,
    ( spl5_1
  <=> disjoint(sK4,sK3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).

fof(f232,plain,
    ! [X0,X1] :
      ( intersect(X0,X1)
      | intersection(X0,X1) = empty_set ),
    inference(resolution,[],[f221,f223]) ).

fof(f223,plain,
    ! [X3,X4,X5] :
      ( ~ intersect(intersection(X4,X3),X5)
      | intersect(X5,X3) ),
    inference(superposition,[],[f198,f53]) ).

fof(f198,plain,
    ! [X2,X0,X1] :
      ( ~ intersect(intersection(X0,X1),X2)
      | intersect(X2,X0) ),
    inference(duplicate_literal_removal,[],[f189]) ).

fof(f189,plain,
    ! [X2,X0,X1] :
      ( intersect(X2,X0)
      | ~ intersect(intersection(X0,X1),X2)
      | ~ intersect(intersection(X0,X1),X2) ),
    inference(resolution,[],[f94,f102]) ).

fof(f102,plain,
    ! [X3,X4,X5] :
      ( ~ member(sK0(X3,X5),X4)
      | ~ intersect(X5,X3)
      | intersect(X3,X4) ),
    inference(resolution,[],[f48,f47]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( member(sK0(X0,X1),X0)
      | ~ intersect(X1,X0) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ( intersect(X1,X0)
        | ! [X2] :
            ( ~ member(X2,X0)
            | ~ member(X2,X1) ) )
      & ( ( member(sK0(X0,X1),X0)
          & member(sK0(X0,X1),X1) )
        | ~ intersect(X1,X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f25,f26]) ).

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

fof(f25,plain,
    ! [X0,X1] :
      ( ( intersect(X1,X0)
        | ! [X2] :
            ( ~ member(X2,X0)
            | ~ member(X2,X1) ) )
      & ( ? [X3] :
            ( member(X3,X0)
            & member(X3,X1) )
        | ~ intersect(X1,X0) ) ),
    inference(rectify,[],[f24]) ).

fof(f24,plain,
    ! [X0,X1] :
      ( ( intersect(X1,X0)
        | ! [X2] :
            ( ~ member(X2,X0)
            | ~ member(X2,X1) ) )
      & ( ? [X2] :
            ( member(X2,X0)
            & member(X2,X1) )
        | ~ intersect(X1,X0) ) ),
    inference(nnf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( intersect(X1,X0)
    <=> ? [X2] :
          ( member(X2,X0)
          & member(X2,X1) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ! [X1,X0] :
      ( intersect(X0,X1)
    <=> ? [X2] :
          ( member(X2,X1)
          & member(X2,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).

fof(f48,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,X1)
      | intersect(X1,X0)
      | ~ member(X2,X0) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f94,plain,
    ! [X2,X3,X1] :
      ( member(sK0(X3,intersection(X1,X2)),X1)
      | ~ intersect(intersection(X1,X2),X3) ),
    inference(resolution,[],[f46,f55]) ).

fof(f55,plain,
    ! [X2,X0,X1] :
      ( ~ member(X0,intersection(X1,X2))
      | member(X0,X1) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f33,plain,
    ! [X0,X1,X2] :
      ( ( member(X0,intersection(X1,X2))
        | ~ member(X0,X1)
        | ~ member(X0,X2) )
      & ( ( member(X0,X1)
          & member(X0,X2) )
        | ~ member(X0,intersection(X1,X2)) ) ),
    inference(flattening,[],[f32]) ).

fof(f32,plain,
    ! [X0,X1,X2] :
      ( ( member(X0,intersection(X1,X2))
        | ~ member(X0,X1)
        | ~ member(X0,X2) )
      & ( ( member(X0,X1)
          & member(X0,X2) )
        | ~ member(X0,intersection(X1,X2)) ) ),
    inference(nnf_transformation,[],[f16]) ).

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

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

fof(f46,plain,
    ! [X0,X1] :
      ( member(sK0(X0,X1),X1)
      | ~ intersect(X1,X0) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f221,plain,
    ! [X0,X1] :
      ( intersect(intersection(X0,X1),X0)
      | intersection(X0,X1) = empty_set ),
    inference(resolution,[],[f198,f174]) ).

fof(f174,plain,
    ! [X2] :
      ( intersect(X2,X2)
      | empty_set = X2 ),
    inference(subsumption_resolution,[],[f171,f57]) ).

fof(f57,plain,
    ! [X0] : ~ member(X0,empty_set),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0] : ~ member(X0,empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).

fof(f171,plain,
    ! [X2] :
      ( empty_set = X2
      | intersect(X2,X2)
      | member(sK1(X2,empty_set),empty_set) ),
    inference(duplicate_literal_removal,[],[f167]) ).

fof(f167,plain,
    ! [X2] :
      ( member(sK1(X2,empty_set),empty_set)
      | empty_set = X2
      | empty_set = X2
      | intersect(X2,X2) ),
    inference(resolution,[],[f142,f51]) ).

fof(f51,plain,
    ! [X0,X1] :
      ( member(sK1(X0,X1),X1)
      | member(sK1(X0,X1),X0)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f31]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ( ( ~ member(sK1(X0,X1),X1)
            | ~ member(sK1(X0,X1),X0) )
          & ( member(sK1(X0,X1),X1)
            | member(sK1(X0,X1),X0) ) ) )
      & ( ! [X3] :
            ( ( member(X3,X0)
              | ~ member(X3,X1) )
            & ( member(X3,X1)
              | ~ member(X3,X0) ) )
        | X0 != X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f29,f30]) ).

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

fof(f29,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ? [X2] :
            ( ( ~ member(X2,X1)
              | ~ member(X2,X0) )
            & ( member(X2,X1)
              | member(X2,X0) ) ) )
      & ( ! [X3] :
            ( ( member(X3,X0)
              | ~ member(X3,X1) )
            & ( member(X3,X1)
              | ~ member(X3,X0) ) )
        | X0 != X1 ) ),
    inference(rectify,[],[f28]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ? [X2] :
            ( ( ~ member(X2,X1)
              | ~ member(X2,X0) )
            & ( member(X2,X1)
              | member(X2,X0) ) ) )
      & ( ! [X2] :
            ( ( member(X2,X0)
              | ~ member(X2,X1) )
            & ( member(X2,X1)
              | ~ member(X2,X0) ) )
        | X0 != X1 ) ),
    inference(nnf_transformation,[],[f11]) ).

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

fof(f142,plain,
    ! [X0,X1] :
      ( ~ member(sK1(X0,empty_set),X1)
      | empty_set = X0
      | intersect(X0,X1) ),
    inference(resolution,[],[f130,f48]) ).

fof(f130,plain,
    ! [X9] :
      ( member(sK1(X9,empty_set),X9)
      | empty_set = X9 ),
    inference(resolution,[],[f51,f57]) ).

fof(f118,plain,
    ( spl5_1
    | ~ spl5_2 ),
    inference(avatar_contradiction_clause,[],[f117]) ).

fof(f117,plain,
    ( $false
    | spl5_1
    | ~ spl5_2 ),
    inference(subsumption_resolution,[],[f116,f83]) ).

fof(f83,plain,
    ( intersect(sK4,sK3)
    | spl5_1 ),
    inference(resolution,[],[f65,f74]) ).

fof(f74,plain,
    ( ~ disjoint(sK4,sK3)
    | spl5_1 ),
    inference(avatar_component_clause,[],[f73]) ).

fof(f65,plain,
    ! [X0,X1] :
      ( disjoint(X1,X0)
      | intersect(X1,X0) ),
    inference(cnf_transformation,[],[f42]) ).

fof(f116,plain,
    ( ~ intersect(sK4,sK3)
    | ~ spl5_2 ),
    inference(duplicate_literal_removal,[],[f115]) ).

fof(f115,plain,
    ( ~ intersect(sK4,sK3)
    | ~ intersect(sK4,sK3)
    | ~ spl5_2 ),
    inference(resolution,[],[f113,f47]) ).

fof(f113,plain,
    ( ! [X0] :
        ( ~ member(sK0(X0,sK4),sK3)
        | ~ intersect(sK4,X0) )
    | ~ spl5_2 ),
    inference(resolution,[],[f112,f46]) ).

fof(f112,plain,
    ( ! [X0] :
        ( ~ member(X0,sK4)
        | ~ member(X0,sK3) )
    | ~ spl5_2 ),
    inference(subsumption_resolution,[],[f109,f57]) ).

fof(f109,plain,
    ( ! [X0] :
        ( ~ member(X0,sK3)
        | member(X0,empty_set)
        | ~ member(X0,sK4) )
    | ~ spl5_2 ),
    inference(superposition,[],[f56,f79]) ).

fof(f79,plain,
    ( empty_set = intersection(sK3,sK4)
    | ~ spl5_2 ),
    inference(avatar_component_clause,[],[f77]) ).

fof(f56,plain,
    ! [X2,X0,X1] :
      ( member(X0,intersection(X1,X2))
      | ~ member(X0,X1)
      | ~ member(X0,X2) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f82,plain,
    ( ~ spl5_1
    | ~ spl5_2 ),
    inference(avatar_split_clause,[],[f81,f77,f73]) ).

fof(f81,plain,
    ( empty_set != intersection(sK3,sK4)
    | ~ disjoint(sK4,sK3) ),
    inference(forward_demodulation,[],[f63,f53]) ).

fof(f63,plain,
    ( ~ disjoint(sK4,sK3)
    | empty_set != intersection(sK4,sK3) ),
    inference(cnf_transformation,[],[f40]) ).

fof(f40,plain,
    ( ( empty_set != intersection(sK4,sK3)
      | ~ disjoint(sK4,sK3) )
    & ( empty_set = intersection(sK4,sK3)
      | disjoint(sK4,sK3) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f38,f39]) ).

fof(f39,plain,
    ( ? [X0,X1] :
        ( ( empty_set != intersection(X1,X0)
          | ~ disjoint(X1,X0) )
        & ( empty_set = intersection(X1,X0)
          | disjoint(X1,X0) ) )
   => ( ( empty_set != intersection(sK4,sK3)
        | ~ disjoint(sK4,sK3) )
      & ( empty_set = intersection(sK4,sK3)
        | disjoint(sK4,sK3) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f38,plain,
    ? [X0,X1] :
      ( ( empty_set != intersection(X1,X0)
        | ~ disjoint(X1,X0) )
      & ( empty_set = intersection(X1,X0)
        | disjoint(X1,X0) ) ),
    inference(nnf_transformation,[],[f20]) ).

fof(f20,plain,
    ? [X0,X1] :
      ( disjoint(X1,X0)
    <~> empty_set = intersection(X1,X0) ),
    inference(ennf_transformation,[],[f17]) ).

fof(f17,plain,
    ~ ! [X1,X0] :
        ( disjoint(X1,X0)
      <=> empty_set = intersection(X1,X0) ),
    inference(rectify,[],[f13]) ).

fof(f13,negated_conjecture,
    ~ ! [X1,X0] :
        ( disjoint(X0,X1)
      <=> intersection(X0,X1) = empty_set ),
    inference(negated_conjecture,[],[f12]) ).

fof(f12,conjecture,
    ! [X1,X0] :
      ( disjoint(X0,X1)
    <=> intersection(X0,X1) = empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th118) ).

fof(f80,plain,
    ( spl5_1
    | spl5_2 ),
    inference(avatar_split_clause,[],[f71,f77,f73]) ).

fof(f71,plain,
    ( empty_set = intersection(sK3,sK4)
    | disjoint(sK4,sK3) ),
    inference(forward_demodulation,[],[f62,f53]) ).

fof(f62,plain,
    ( disjoint(sK4,sK3)
    | empty_set = intersection(sK4,sK3) ),
    inference(cnf_transformation,[],[f40]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET636+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n005.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:08:48 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.51  % (23130)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.52  % (23128)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.29/0.52  % (23146)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.29/0.52  % (23130)Instruction limit reached!
% 1.29/0.52  % (23130)------------------------------
% 1.29/0.52  % (23130)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.29/0.52  % (23137)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 1.29/0.53  % (23129)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.29/0.53  % (23136)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.29/0.53  % (23138)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.29/0.53  % (23130)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.29/0.53  % (23130)Termination reason: Unknown
% 1.29/0.53  % (23130)Termination phase: Saturation
% 1.29/0.53  
% 1.29/0.53  % (23130)Memory used [KB]: 5373
% 1.29/0.53  % (23130)Time elapsed: 0.004 s
% 1.29/0.53  % (23130)Instructions burned: 2 (million)
% 1.29/0.53  % (23130)------------------------------
% 1.29/0.53  % (23130)------------------------------
% 1.29/0.54  % (23144)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 1.29/0.54  % (23129)Instruction limit reached!
% 1.29/0.54  % (23129)------------------------------
% 1.29/0.54  % (23129)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.29/0.54  % (23129)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.29/0.54  % (23129)Termination reason: Unknown
% 1.29/0.54  % (23129)Termination phase: Saturation
% 1.29/0.54  
% 1.29/0.54  % (23129)Memory used [KB]: 5500
% 1.29/0.54  % (23129)Time elapsed: 0.118 s
% 1.29/0.54  % (23129)Instructions burned: 7 (million)
% 1.29/0.54  % (23129)------------------------------
% 1.29/0.54  % (23129)------------------------------
% 1.47/0.54  % (23145)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 1.47/0.54  TRYING [1]
% 1.47/0.54  TRYING [2]
% 1.47/0.54  TRYING [3]
% 1.47/0.54  TRYING [4]
% 1.47/0.55  % (23127)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.47/0.55  % (23132)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.47/0.55  % (23126)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.47/0.55  % (23143)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.47/0.55  % (23124)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.47/0.55  % (23133)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.47/0.55  TRYING [5]
% 1.47/0.55  % (23139)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.47/0.56  % (23134)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.47/0.56  % (23131)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.47/0.56  % (23125)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.47/0.56  % (23147)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.47/0.56  TRYING [1]
% 1.47/0.56  % (23123)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.47/0.56  TRYING [2]
% 1.47/0.56  TRYING [3]
% 1.47/0.56  % (23149)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.47/0.56  % (23142)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.47/0.56  % (23151)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.47/0.56  % (23150)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.47/0.56  % (23140)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.47/0.56  % (23123)Refutation not found, incomplete strategy% (23123)------------------------------
% 1.47/0.56  % (23123)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.47/0.56  % (23148)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.47/0.56  % (23123)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.47/0.56  % (23123)Termination reason: Refutation not found, incomplete strategy
% 1.47/0.56  
% 1.47/0.56  % (23123)Memory used [KB]: 5373
% 1.47/0.56  % (23123)Time elapsed: 0.115 s
% 1.47/0.56  % (23123)Instructions burned: 3 (million)
% 1.47/0.56  % (23123)------------------------------
% 1.47/0.56  % (23123)------------------------------
% 1.47/0.57  TRYING [4]
% 1.47/0.57  % (23142)First to succeed.
% 1.47/0.57  % (23122)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.47/0.57  % (23135)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.47/0.57  TRYING [1]
% 1.47/0.57  TRYING [2]
% 1.47/0.57  % (23141)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.47/0.57  TRYING [3]
% 1.47/0.57  TRYING [4]
% 1.47/0.57  TRYING [5]
% 1.47/0.58  TRYING [6]
% 1.47/0.58  % (23128)Instruction limit reached!
% 1.47/0.58  % (23128)------------------------------
% 1.47/0.58  % (23128)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.47/0.58  % (23128)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.47/0.58  % (23128)Termination reason: Unknown
% 1.47/0.58  % (23128)Termination phase: Finite model building constraint generation
% 1.47/0.58  
% 1.47/0.58  % (23128)Memory used [KB]: 6780
% 1.47/0.58  % (23128)Time elapsed: 0.167 s
% 1.47/0.58  % (23128)Instructions burned: 51 (million)
% 1.47/0.58  % (23128)------------------------------
% 1.47/0.58  % (23128)------------------------------
% 1.47/0.59  % (23142)Refutation found. Thanks to Tanya!
% 1.47/0.59  % SZS status Theorem for theBenchmark
% 1.47/0.59  % SZS output start Proof for theBenchmark
% See solution above
% 1.47/0.59  % (23142)------------------------------
% 1.47/0.59  % (23142)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.47/0.59  % (23142)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.47/0.59  % (23142)Termination reason: Refutation
% 1.47/0.59  
% 1.47/0.59  % (23142)Memory used [KB]: 5628
% 1.47/0.59  % (23142)Time elapsed: 0.161 s
% 1.47/0.59  % (23142)Instructions burned: 9 (million)
% 1.47/0.59  % (23142)------------------------------
% 1.47/0.59  % (23142)------------------------------
% 1.47/0.59  % (23121)Success in time 0.23 s
%------------------------------------------------------------------------------