TSTP Solution File: SET016+4 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET016+4 : 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 : n015.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:23:07 EDT 2022

% Result   : Theorem 0.22s 0.56s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   82 (  10 unt;   0 def)
%            Number of atoms       :  207 (  61 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  206 (  81   ~;  80   |;  26   &)
%                                         (  11 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :  111 (  96   !;  15   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f223,plain,
    $false,
    inference(avatar_sat_refutation,[],[f127,f141,f222]) ).

fof(f222,plain,
    ( ~ spl7_1
    | spl7_2 ),
    inference(avatar_contradiction_clause,[],[f221]) ).

fof(f221,plain,
    ( $false
    | ~ spl7_1
    | spl7_2 ),
    inference(subsumption_resolution,[],[f219,f178]) ).

fof(f178,plain,
    ( sK1 != sK0
    | ~ spl7_1 ),
    inference(backward_demodulation,[],[f155,f177]) ).

fof(f177,plain,
    ( sK2 = sK0
    | ~ spl7_1 ),
    inference(subsumption_resolution,[],[f175,f155]) ).

fof(f175,plain,
    ( sK2 = sK1
    | sK2 = sK0
    | ~ spl7_1 ),
    inference(resolution,[],[f173,f88]) ).

fof(f88,plain,
    ! [X2,X0,X1] :
      ( ~ member(X1,unordered_pair(X2,X0))
      | X1 = X2
      | X0 = X1 ),
    inference(cnf_transformation,[],[f57]) ).

fof(f57,plain,
    ! [X0,X1,X2] :
      ( ( X0 = X1
        | X1 = X2
        | ~ member(X1,unordered_pair(X2,X0)) )
      & ( member(X1,unordered_pair(X2,X0))
        | ( X0 != X1
          & X1 != X2 ) ) ),
    inference(rectify,[],[f56]) ).

fof(f56,plain,
    ! [X1,X0,X2] :
      ( ( X0 = X1
        | X0 = X2
        | ~ member(X0,unordered_pair(X2,X1)) )
      & ( member(X0,unordered_pair(X2,X1))
        | ( X0 != X1
          & X0 != X2 ) ) ),
    inference(flattening,[],[f55]) ).

fof(f55,plain,
    ! [X1,X0,X2] :
      ( ( X0 = X1
        | X0 = X2
        | ~ member(X0,unordered_pair(X2,X1)) )
      & ( member(X0,unordered_pair(X2,X1))
        | ( X0 != X1
          & X0 != X2 ) ) ),
    inference(nnf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X1,X0,X2] :
      ( ( X0 = X1
        | X0 = X2 )
    <=> member(X0,unordered_pair(X2,X1)) ),
    inference(rectify,[],[f9]) ).

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

fof(f173,plain,
    ( member(sK2,unordered_pair(sK1,sK0))
    | ~ spl7_1 ),
    inference(superposition,[],[f94,f156]) ).

fof(f156,plain,
    ( unordered_pair(sK1,sK0) = unordered_pair(sK2,sK1)
    | ~ spl7_1 ),
    inference(backward_demodulation,[],[f122,f154]) ).

fof(f154,plain,
    ( sK3 = sK1
    | ~ spl7_1 ),
    inference(subsumption_resolution,[],[f152,f63]) ).

fof(f63,plain,
    sK3 != sK2,
    inference(cnf_transformation,[],[f33]) ).

fof(f33,plain,
    ( sK3 != sK2
    & equal_set(unordered_pair(singleton(sK2),unordered_pair(sK2,sK1)),unordered_pair(singleton(sK3),unordered_pair(sK3,sK0))) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f31,f32]) ).

fof(f32,plain,
    ( ? [X0,X1,X2,X3] :
        ( X2 != X3
        & equal_set(unordered_pair(singleton(X2),unordered_pair(X2,X1)),unordered_pair(singleton(X3),unordered_pair(X3,X0))) )
   => ( sK3 != sK2
      & equal_set(unordered_pair(singleton(sK2),unordered_pair(sK2,sK1)),unordered_pair(singleton(sK3),unordered_pair(sK3,sK0))) ) ),
    introduced(choice_axiom,[]) ).

fof(f31,plain,
    ? [X0,X1,X2,X3] :
      ( X2 != X3
      & equal_set(unordered_pair(singleton(X2),unordered_pair(X2,X1)),unordered_pair(singleton(X3),unordered_pair(X3,X0))) ),
    inference(rectify,[],[f27]) ).

fof(f27,plain,
    ? [X2,X0,X1,X3] :
      ( X1 != X3
      & equal_set(unordered_pair(singleton(X1),unordered_pair(X1,X0)),unordered_pair(singleton(X3),unordered_pair(X3,X2))) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f22,plain,
    ~ ! [X3,X0,X2,X1] :
        ( equal_set(unordered_pair(singleton(X1),unordered_pair(X1,X0)),unordered_pair(singleton(X3),unordered_pair(X3,X2)))
       => X1 = X3 ),
    inference(rectify,[],[f13]) ).

fof(f13,negated_conjecture,
    ~ ! [X1,X0,X6,X5] :
        ( equal_set(unordered_pair(singleton(X0),unordered_pair(X0,X1)),unordered_pair(singleton(X5),unordered_pair(X5,X6)))
       => X0 = X5 ),
    inference(negated_conjecture,[],[f12]) ).

fof(f12,conjecture,
    ! [X1,X0,X6,X5] :
      ( equal_set(unordered_pair(singleton(X0),unordered_pair(X0,X1)),unordered_pair(singleton(X5),unordered_pair(X5,X6)))
     => X0 = X5 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI50a) ).

fof(f152,plain,
    ( sK3 = sK2
    | sK3 = sK1
    | ~ spl7_1 ),
    inference(resolution,[],[f150,f88]) ).

fof(f150,plain,
    ( member(sK3,unordered_pair(sK2,sK1))
    | ~ spl7_1 ),
    inference(superposition,[],[f94,f122]) ).

fof(f122,plain,
    ( unordered_pair(sK2,sK1) = unordered_pair(sK3,sK0)
    | ~ spl7_1 ),
    inference(avatar_component_clause,[],[f120]) ).

fof(f120,plain,
    ( spl7_1
  <=> unordered_pair(sK2,sK1) = unordered_pair(sK3,sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).

fof(f94,plain,
    ! [X2,X0] : member(X2,unordered_pair(X2,X0)),
    inference(equality_resolution,[],[f86]) ).

fof(f86,plain,
    ! [X2,X0,X1] :
      ( member(X1,unordered_pair(X2,X0))
      | X1 != X2 ),
    inference(cnf_transformation,[],[f57]) ).

fof(f155,plain,
    ( sK2 != sK1
    | ~ spl7_1 ),
    inference(backward_demodulation,[],[f63,f154]) ).

fof(f219,plain,
    ( sK1 = sK0
    | ~ spl7_1
    | spl7_2 ),
    inference(resolution,[],[f216,f79]) ).

fof(f79,plain,
    ! [X0,X1] :
      ( ~ member(X1,singleton(X0))
      | X0 = X1 ),
    inference(cnf_transformation,[],[f50]) ).

fof(f50,plain,
    ! [X0,X1] :
      ( ( member(X1,singleton(X0))
        | X0 != X1 )
      & ( X0 = X1
        | ~ member(X1,singleton(X0)) ) ),
    inference(rectify,[],[f49]) ).

fof(f49,plain,
    ! [X1,X0] :
      ( ( member(X0,singleton(X1))
        | X0 != X1 )
      & ( X0 = X1
        | ~ member(X0,singleton(X1)) ) ),
    inference(nnf_transformation,[],[f21]) ).

fof(f21,plain,
    ! [X1,X0] :
      ( member(X0,singleton(X1))
    <=> X0 = X1 ),
    inference(rectify,[],[f8]) ).

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

fof(f216,plain,
    ( member(sK1,singleton(sK0))
    | ~ spl7_1
    | spl7_2 ),
    inference(superposition,[],[f92,f205]) ).

fof(f205,plain,
    ( singleton(sK1) = singleton(sK0)
    | ~ spl7_1
    | spl7_2 ),
    inference(subsumption_resolution,[],[f203,f180]) ).

fof(f180,plain,
    ( singleton(sK1) != unordered_pair(sK0,sK1)
    | ~ spl7_1
    | spl7_2 ),
    inference(backward_demodulation,[],[f157,f177]) ).

fof(f157,plain,
    ( singleton(sK1) != unordered_pair(sK2,sK1)
    | ~ spl7_1
    | spl7_2 ),
    inference(backward_demodulation,[],[f125,f154]) ).

fof(f125,plain,
    ( singleton(sK3) != unordered_pair(sK2,sK1)
    | spl7_2 ),
    inference(avatar_component_clause,[],[f124]) ).

fof(f124,plain,
    ( spl7_2
  <=> singleton(sK3) = unordered_pair(sK2,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).

fof(f203,plain,
    ( singleton(sK1) = unordered_pair(sK0,sK1)
    | singleton(sK1) = singleton(sK0)
    | ~ spl7_1 ),
    inference(resolution,[],[f199,f88]) ).

fof(f199,plain,
    ( member(singleton(sK1),unordered_pair(singleton(sK0),unordered_pair(sK0,sK1)))
    | ~ spl7_1 ),
    inference(resolution,[],[f110,f186]) ).

fof(f186,plain,
    ( subset(unordered_pair(singleton(sK1),unordered_pair(sK0,sK1)),unordered_pair(singleton(sK0),unordered_pair(sK0,sK1)))
    | ~ spl7_1 ),
    inference(forward_demodulation,[],[f181,f179]) ).

fof(f179,plain,
    ( unordered_pair(sK1,sK0) = unordered_pair(sK0,sK1)
    | ~ spl7_1 ),
    inference(backward_demodulation,[],[f156,f177]) ).

fof(f181,plain,
    ( subset(unordered_pair(singleton(sK1),unordered_pair(sK1,sK0)),unordered_pair(singleton(sK0),unordered_pair(sK1,sK0)))
    | ~ spl7_1 ),
    inference(backward_demodulation,[],[f165,f177]) ).

fof(f165,plain,
    ( subset(unordered_pair(singleton(sK1),unordered_pair(sK1,sK0)),unordered_pair(singleton(sK2),unordered_pair(sK1,sK0)))
    | ~ spl7_1 ),
    inference(backward_demodulation,[],[f158,f156]) ).

fof(f158,plain,
    ( subset(unordered_pair(singleton(sK1),unordered_pair(sK2,sK1)),unordered_pair(singleton(sK2),unordered_pair(sK2,sK1)))
    | ~ spl7_1 ),
    inference(backward_demodulation,[],[f142,f154]) ).

fof(f142,plain,
    ( subset(unordered_pair(singleton(sK3),unordered_pair(sK2,sK1)),unordered_pair(singleton(sK2),unordered_pair(sK2,sK1)))
    | ~ spl7_1 ),
    inference(backward_demodulation,[],[f96,f122]) ).

fof(f96,plain,
    subset(unordered_pair(singleton(sK3),unordered_pair(sK3,sK0)),unordered_pair(singleton(sK2),unordered_pair(sK2,sK1))),
    inference(resolution,[],[f75,f62]) ).

fof(f62,plain,
    equal_set(unordered_pair(singleton(sK2),unordered_pair(sK2,sK1)),unordered_pair(singleton(sK3),unordered_pair(sK3,sK0))),
    inference(cnf_transformation,[],[f33]) ).

fof(f75,plain,
    ! [X0,X1] :
      ( ~ equal_set(X0,X1)
      | subset(X1,X0) ),
    inference(cnf_transformation,[],[f45]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( ~ equal_set(X0,X1)
      | ( subset(X1,X0)
        & subset(X0,X1) ) ),
    inference(rectify,[],[f29]) ).

fof(f29,plain,
    ! [X1,X0] :
      ( ~ equal_set(X1,X0)
      | ( subset(X0,X1)
        & subset(X1,X0) ) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f26,plain,
    ! [X1,X0] :
      ( equal_set(X1,X0)
     => ( subset(X0,X1)
        & subset(X1,X0) ) ),
    inference(unused_predicate_definition_removal,[],[f16]) ).

fof(f16,plain,
    ! [X1,X0] :
      ( equal_set(X1,X0)
    <=> ( subset(X0,X1)
        & subset(X1,X0) ) ),
    inference(rectify,[],[f2]) ).

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

fof(f110,plain,
    ! [X6,X7,X5] :
      ( ~ subset(unordered_pair(X5,X7),X6)
      | member(X5,X6) ),
    inference(resolution,[],[f89,f94]) ).

fof(f89,plain,
    ! [X3,X0,X1] :
      ( ~ member(X3,X0)
      | member(X3,X1)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f61]) ).

fof(f61,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( member(sK6(X0,X1),X0)
          & ~ member(sK6(X0,X1),X1) ) )
      & ( ! [X3] :
            ( ~ member(X3,X0)
            | member(X3,X1) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f59,f60]) ).

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

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

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

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

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

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

fof(f92,plain,
    ! [X1] : member(X1,singleton(X1)),
    inference(equality_resolution,[],[f80]) ).

fof(f80,plain,
    ! [X0,X1] :
      ( member(X1,singleton(X0))
      | X0 != X1 ),
    inference(cnf_transformation,[],[f50]) ).

fof(f141,plain,
    ~ spl7_2,
    inference(avatar_contradiction_clause,[],[f140]) ).

fof(f140,plain,
    ( $false
    | ~ spl7_2 ),
    inference(subsumption_resolution,[],[f138,f63]) ).

fof(f138,plain,
    ( sK3 = sK2
    | ~ spl7_2 ),
    inference(resolution,[],[f136,f79]) ).

fof(f136,plain,
    ( member(sK2,singleton(sK3))
    | ~ spl7_2 ),
    inference(superposition,[],[f94,f126]) ).

fof(f126,plain,
    ( singleton(sK3) = unordered_pair(sK2,sK1)
    | ~ spl7_2 ),
    inference(avatar_component_clause,[],[f124]) ).

fof(f127,plain,
    ( spl7_1
    | spl7_2 ),
    inference(avatar_split_clause,[],[f117,f124,f120]) ).

fof(f117,plain,
    ( singleton(sK3) = unordered_pair(sK2,sK1)
    | unordered_pair(sK2,sK1) = unordered_pair(sK3,sK0) ),
    inference(resolution,[],[f114,f88]) ).

fof(f114,plain,
    member(unordered_pair(sK2,sK1),unordered_pair(singleton(sK3),unordered_pair(sK3,sK0))),
    inference(resolution,[],[f109,f95]) ).

fof(f95,plain,
    subset(unordered_pair(singleton(sK2),unordered_pair(sK2,sK1)),unordered_pair(singleton(sK3),unordered_pair(sK3,sK0))),
    inference(resolution,[],[f74,f62]) ).

fof(f74,plain,
    ! [X0,X1] :
      ( ~ equal_set(X0,X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f45]) ).

fof(f109,plain,
    ! [X2,X3,X4] :
      ( ~ subset(unordered_pair(X4,X2),X3)
      | member(X2,X3) ),
    inference(resolution,[],[f89,f93]) ).

fof(f93,plain,
    ! [X2,X1] : member(X1,unordered_pair(X2,X1)),
    inference(equality_resolution,[],[f87]) ).

fof(f87,plain,
    ! [X2,X0,X1] :
      ( member(X1,unordered_pair(X2,X0))
      | X0 != X1 ),
    inference(cnf_transformation,[],[f57]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SET016+4 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.15/0.35  % Computer : n015.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Tue Aug 30 13:05:21 EDT 2022
% 0.15/0.35  % CPUTime    : 
% 0.22/0.50  % (3360)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)
% 0.22/0.50  % (3365)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.22/0.50  % (3365)Instruction limit reached!
% 0.22/0.50  % (3365)------------------------------
% 0.22/0.50  % (3365)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.50  % (3365)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.50  % (3365)Termination reason: Unknown
% 0.22/0.50  % (3365)Termination phase: Blocked clause elimination
% 0.22/0.50  
% 0.22/0.50  % (3365)Memory used [KB]: 895
% 0.22/0.50  % (3365)Time elapsed: 0.002 s
% 0.22/0.50  % (3365)Instructions burned: 2 (million)
% 0.22/0.50  % (3365)------------------------------
% 0.22/0.50  % (3365)------------------------------
% 0.22/0.51  % (3363)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)
% 0.22/0.51  % (3357)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)
% 0.22/0.51  TRYING [1]
% 0.22/0.51  TRYING [2]
% 0.22/0.51  TRYING [3]
% 0.22/0.51  % (3371)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)
% 0.22/0.51  % (3366)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)
% 0.22/0.51  TRYING [1]
% 0.22/0.52  TRYING [2]
% 0.22/0.52  TRYING [4]
% 0.22/0.52  % (3370)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.22/0.52  TRYING [3]
% 0.22/0.52  % (3379)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.22/0.52  % (3368)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)
% 0.22/0.52  % (3362)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)
% 0.22/0.52  % (3377)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)
% 0.22/0.52  % (3382)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.22/0.52  % (3380)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)
% 0.22/0.53  % (3384)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)
% 0.22/0.53  TRYING [4]
% 0.22/0.53  % (3367)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.22/0.53  % (3358)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)
% 0.22/0.53  % (3375)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.22/0.53  % (3381)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)
% 0.22/0.53  % (3361)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.53  % (3372)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)
% 0.22/0.53  % (3359)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)
% 0.22/0.54  % (3369)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.22/0.54  % (3385)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)
% 0.22/0.54  % (3377)First to succeed.
% 0.22/0.54  % (3386)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.22/0.54  % (3358)Refutation not found, incomplete strategy% (3358)------------------------------
% 0.22/0.54  % (3358)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.54  % (3358)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.54  % (3358)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.54  
% 0.22/0.54  % (3358)Memory used [KB]: 5500
% 0.22/0.54  % (3358)Time elapsed: 0.128 s
% 0.22/0.54  % (3358)Instructions burned: 3 (million)
% 0.22/0.54  % (3358)------------------------------
% 0.22/0.54  % (3358)------------------------------
% 0.22/0.54  % (3387)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)
% 0.22/0.55  % (3373)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)
% 0.22/0.55  % (3364)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.22/0.55  TRYING [5]
% 0.22/0.55  % (3383)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.22/0.55  % (3376)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)
% 0.22/0.55  TRYING [5]
% 0.22/0.55  % (3374)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.22/0.55  TRYING [1]
% 0.22/0.55  TRYING [2]
% 0.22/0.55  TRYING [3]
% 0.22/0.56  % (3377)Refutation found. Thanks to Tanya!
% 0.22/0.56  % SZS status Theorem for theBenchmark
% 0.22/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.56  % (3377)------------------------------
% 0.22/0.56  % (3377)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.56  % (3377)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.56  % (3377)Termination reason: Refutation
% 0.22/0.56  
% 0.22/0.56  % (3377)Memory used [KB]: 5628
% 0.22/0.56  % (3377)Time elapsed: 0.129 s
% 0.22/0.56  % (3377)Instructions burned: 8 (million)
% 0.22/0.56  % (3377)------------------------------
% 0.22/0.56  % (3377)------------------------------
% 0.22/0.56  % (3355)Success in time 0.191 s
%------------------------------------------------------------------------------