TSTP Solution File: SWC082+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC082+1 : TPTP v8.1.0. Released v2.4.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 : 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:41:37 EDT 2022

% Result   : Theorem 0.18s 0.53s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   44 (   5 unt;   0 def)
%            Number of atoms       :  324 (  58 equ)
%            Maximal formula atoms :   36 (   7 avg)
%            Number of connectives :  411 ( 131   ~; 112   |; 148   &)
%                                         (   5 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   6 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   66 (  24   !;  42   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f664,plain,
    $false,
    inference(avatar_sat_refutation,[],[f635,f641,f646,f652,f658,f663]) ).

fof(f663,plain,
    ( ~ spl58_7
    | ~ spl58_8
    | ~ spl58_9
    | ~ spl58_11 ),
    inference(avatar_contradiction_clause,[],[f662]) ).

fof(f662,plain,
    ( $false
    | ~ spl58_7
    | ~ spl58_8
    | ~ spl58_9
    | ~ spl58_11 ),
    inference(subsumption_resolution,[],[f661,f640]) ).

fof(f640,plain,
    ( segmentP(sK13,sK15)
    | ~ spl58_8 ),
    inference(avatar_component_clause,[],[f638]) ).

fof(f638,plain,
    ( spl58_8
  <=> segmentP(sK13,sK15) ),
    introduced(avatar_definition,[new_symbols(naming,[spl58_8])]) ).

fof(f661,plain,
    ( ~ segmentP(sK13,sK15)
    | ~ spl58_7
    | ~ spl58_9
    | ~ spl58_11 ),
    inference(subsumption_resolution,[],[f660,f657]) ).

fof(f657,plain,
    ( ssList(sK15)
    | ~ spl58_11 ),
    inference(avatar_component_clause,[],[f655]) ).

fof(f655,plain,
    ( spl58_11
  <=> ssList(sK15) ),
    introduced(avatar_definition,[new_symbols(naming,[spl58_11])]) ).

fof(f660,plain,
    ( ~ ssList(sK15)
    | ~ segmentP(sK13,sK15)
    | ~ spl58_7
    | ~ spl58_9 ),
    inference(subsumption_resolution,[],[f659,f645]) ).

fof(f645,plain,
    ( neq(sK15,nil)
    | ~ spl58_9 ),
    inference(avatar_component_clause,[],[f643]) ).

fof(f643,plain,
    ( spl58_9
  <=> neq(sK15,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl58_9])]) ).

fof(f659,plain,
    ( ~ neq(sK15,nil)
    | ~ ssList(sK15)
    | ~ segmentP(sK13,sK15)
    | ~ spl58_7 ),
    inference(resolution,[],[f568,f634]) ).

fof(f634,plain,
    ( segmentP(sK12,sK15)
    | ~ spl58_7 ),
    inference(avatar_component_clause,[],[f632]) ).

fof(f632,plain,
    ( spl58_7
  <=> segmentP(sK12,sK15) ),
    introduced(avatar_definition,[new_symbols(naming,[spl58_7])]) ).

fof(f568,plain,
    ! [X5] :
      ( ~ segmentP(sK12,X5)
      | ~ segmentP(sK13,X5)
      | ~ neq(X5,nil)
      | ~ ssList(X5) ),
    inference(definition_unfolding,[],[f389,f388]) ).

fof(f388,plain,
    sK11 = sK13,
    inference(cnf_transformation,[],[f258]) ).

fof(f258,plain,
    ( ssList(sK12)
    & ( nil != sK14
      | nil = sK13 )
    & ssList(sK14)
    & sK14 = sK12
    & ( ~ neq(sK14,nil)
      | ( ssList(sK15)
        & segmentP(sK14,sK15)
        & segmentP(sK13,sK15)
        & neq(sK15,nil) ) )
    & neq(sK12,nil)
    & ! [X5] :
        ( ~ ssList(X5)
        | ~ segmentP(sK12,X5)
        | ~ segmentP(sK11,X5)
        | ~ neq(X5,nil) )
    & sK11 = sK13
    & ssList(sK13)
    & ssList(sK11) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12,sK13,sK14,sK15])],[f252,f257,f256,f255,f254,f253]) ).

fof(f253,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ? [X3] :
                    ( ( nil != X3
                      | nil = X2 )
                    & ssList(X3)
                    & X1 = X3
                    & ( ~ neq(X3,nil)
                      | ? [X4] :
                          ( ssList(X4)
                          & segmentP(X3,X4)
                          & segmentP(X2,X4)
                          & neq(X4,nil) ) )
                    & neq(X1,nil)
                    & ! [X5] :
                        ( ~ ssList(X5)
                        | ~ segmentP(X1,X5)
                        | ~ segmentP(X0,X5)
                        | ~ neq(X5,nil) )
                    & X0 = X2 )
                & ssList(X2) ) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ( nil != X3
                    | nil = X2 )
                  & ssList(X3)
                  & X1 = X3
                  & ( ~ neq(X3,nil)
                    | ? [X4] :
                        ( ssList(X4)
                        & segmentP(X3,X4)
                        & segmentP(X2,X4)
                        & neq(X4,nil) ) )
                  & neq(X1,nil)
                  & ! [X5] :
                      ( ~ ssList(X5)
                      | ~ segmentP(X1,X5)
                      | ~ segmentP(sK11,X5)
                      | ~ neq(X5,nil) )
                  & sK11 = X2 )
              & ssList(X2) ) )
      & ssList(sK11) ) ),
    introduced(choice_axiom,[]) ).

fof(f254,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( ( nil != X3
                  | nil = X2 )
                & ssList(X3)
                & X1 = X3
                & ( ~ neq(X3,nil)
                  | ? [X4] :
                      ( ssList(X4)
                      & segmentP(X3,X4)
                      & segmentP(X2,X4)
                      & neq(X4,nil) ) )
                & neq(X1,nil)
                & ! [X5] :
                    ( ~ ssList(X5)
                    | ~ segmentP(X1,X5)
                    | ~ segmentP(sK11,X5)
                    | ~ neq(X5,nil) )
                & sK11 = X2 )
            & ssList(X2) ) )
   => ( ssList(sK12)
      & ? [X2] :
          ( ? [X3] :
              ( ( nil != X3
                | nil = X2 )
              & ssList(X3)
              & sK12 = X3
              & ( ~ neq(X3,nil)
                | ? [X4] :
                    ( ssList(X4)
                    & segmentP(X3,X4)
                    & segmentP(X2,X4)
                    & neq(X4,nil) ) )
              & neq(sK12,nil)
              & ! [X5] :
                  ( ~ ssList(X5)
                  | ~ segmentP(sK12,X5)
                  | ~ segmentP(sK11,X5)
                  | ~ neq(X5,nil) )
              & sK11 = X2 )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f255,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( nil != X3
              | nil = X2 )
            & ssList(X3)
            & sK12 = X3
            & ( ~ neq(X3,nil)
              | ? [X4] :
                  ( ssList(X4)
                  & segmentP(X3,X4)
                  & segmentP(X2,X4)
                  & neq(X4,nil) ) )
            & neq(sK12,nil)
            & ! [X5] :
                ( ~ ssList(X5)
                | ~ segmentP(sK12,X5)
                | ~ segmentP(sK11,X5)
                | ~ neq(X5,nil) )
            & sK11 = X2 )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( nil != X3
            | nil = sK13 )
          & ssList(X3)
          & sK12 = X3
          & ( ~ neq(X3,nil)
            | ? [X4] :
                ( ssList(X4)
                & segmentP(X3,X4)
                & segmentP(sK13,X4)
                & neq(X4,nil) ) )
          & neq(sK12,nil)
          & ! [X5] :
              ( ~ ssList(X5)
              | ~ segmentP(sK12,X5)
              | ~ segmentP(sK11,X5)
              | ~ neq(X5,nil) )
          & sK11 = sK13 )
      & ssList(sK13) ) ),
    introduced(choice_axiom,[]) ).

fof(f256,plain,
    ( ? [X3] :
        ( ( nil != X3
          | nil = sK13 )
        & ssList(X3)
        & sK12 = X3
        & ( ~ neq(X3,nil)
          | ? [X4] :
              ( ssList(X4)
              & segmentP(X3,X4)
              & segmentP(sK13,X4)
              & neq(X4,nil) ) )
        & neq(sK12,nil)
        & ! [X5] :
            ( ~ ssList(X5)
            | ~ segmentP(sK12,X5)
            | ~ segmentP(sK11,X5)
            | ~ neq(X5,nil) )
        & sK11 = sK13 )
   => ( ( nil != sK14
        | nil = sK13 )
      & ssList(sK14)
      & sK14 = sK12
      & ( ~ neq(sK14,nil)
        | ? [X4] :
            ( ssList(X4)
            & segmentP(sK14,X4)
            & segmentP(sK13,X4)
            & neq(X4,nil) ) )
      & neq(sK12,nil)
      & ! [X5] :
          ( ~ ssList(X5)
          | ~ segmentP(sK12,X5)
          | ~ segmentP(sK11,X5)
          | ~ neq(X5,nil) )
      & sK11 = sK13 ) ),
    introduced(choice_axiom,[]) ).

fof(f257,plain,
    ( ? [X4] :
        ( ssList(X4)
        & segmentP(sK14,X4)
        & segmentP(sK13,X4)
        & neq(X4,nil) )
   => ( ssList(sK15)
      & segmentP(sK14,sK15)
      & segmentP(sK13,sK15)
      & neq(sK15,nil) ) ),
    introduced(choice_axiom,[]) ).

fof(f252,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ( nil != X3
                    | nil = X2 )
                  & ssList(X3)
                  & X1 = X3
                  & ( ~ neq(X3,nil)
                    | ? [X4] :
                        ( ssList(X4)
                        & segmentP(X3,X4)
                        & segmentP(X2,X4)
                        & neq(X4,nil) ) )
                  & neq(X1,nil)
                  & ! [X5] :
                      ( ~ ssList(X5)
                      | ~ segmentP(X1,X5)
                      | ~ segmentP(X0,X5)
                      | ~ neq(X5,nil) )
                  & X0 = X2 )
              & ssList(X2) ) )
      & ssList(X0) ),
    inference(rectify,[],[f124]) ).

fof(f124,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ( nil != X3
                    | nil = X2 )
                  & ssList(X3)
                  & X1 = X3
                  & ( ~ neq(X3,nil)
                    | ? [X5] :
                        ( ssList(X5)
                        & segmentP(X3,X5)
                        & segmentP(X2,X5)
                        & neq(X5,nil) ) )
                  & neq(X1,nil)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ segmentP(X1,X4)
                      | ~ segmentP(X0,X4)
                      | ~ neq(X4,nil) )
                  & X0 = X2 )
              & ssList(X2) ) )
      & ssList(X0) ),
    inference(flattening,[],[f123]) ).

fof(f123,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( neq(X1,nil)
                  & ( nil != X3
                    | nil = X2 )
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ segmentP(X1,X4)
                      | ~ segmentP(X0,X4)
                      | ~ neq(X4,nil) )
                  & ( ~ neq(X3,nil)
                    | ? [X5] :
                        ( segmentP(X3,X5)
                        & neq(X5,nil)
                        & segmentP(X2,X5)
                        & ssList(X5) ) )
                  & X1 = X3
                  & X0 = X2
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ~ neq(X1,nil)
                      | ( nil != X2
                        & nil = X3 )
                      | ? [X4] :
                          ( segmentP(X1,X4)
                          & segmentP(X0,X4)
                          & ssList(X4)
                          & neq(X4,nil) )
                      | ( neq(X3,nil)
                        & ! [X5] :
                            ( ssList(X5)
                           => ( ~ segmentP(X3,X5)
                              | ~ neq(X5,nil)
                              | ~ segmentP(X2,X5) ) ) )
                      | X1 != X3
                      | X0 != X2 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ~ neq(X1,nil)
                    | ( nil != X2
                      & nil = X3 )
                    | ? [X4] :
                        ( segmentP(X1,X4)
                        & segmentP(X0,X4)
                        & ssList(X4)
                        & neq(X4,nil) )
                    | ( neq(X3,nil)
                      & ! [X5] :
                          ( ssList(X5)
                         => ( ~ segmentP(X3,X5)
                            | ~ neq(X5,nil)
                            | ~ segmentP(X2,X5) ) ) )
                    | X1 != X3
                    | X0 != X2 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f389,plain,
    ! [X5] :
      ( ~ ssList(X5)
      | ~ segmentP(sK12,X5)
      | ~ segmentP(sK11,X5)
      | ~ neq(X5,nil) ),
    inference(cnf_transformation,[],[f258]) ).

fof(f658,plain,
    ( ~ spl58_6
    | spl58_11 ),
    inference(avatar_split_clause,[],[f564,f655,f628]) ).

fof(f628,plain,
    ( spl58_6
  <=> neq(sK12,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl58_6])]) ).

fof(f564,plain,
    ( ssList(sK15)
    | ~ neq(sK12,nil) ),
    inference(definition_unfolding,[],[f394,f395]) ).

fof(f395,plain,
    sK14 = sK12,
    inference(cnf_transformation,[],[f258]) ).

fof(f394,plain,
    ( ~ neq(sK14,nil)
    | ssList(sK15) ),
    inference(cnf_transformation,[],[f258]) ).

fof(f652,plain,
    spl58_6,
    inference(avatar_split_clause,[],[f390,f628]) ).

fof(f390,plain,
    neq(sK12,nil),
    inference(cnf_transformation,[],[f258]) ).

fof(f646,plain,
    ( ~ spl58_6
    | spl58_9 ),
    inference(avatar_split_clause,[],[f567,f643,f628]) ).

fof(f567,plain,
    ( neq(sK15,nil)
    | ~ neq(sK12,nil) ),
    inference(definition_unfolding,[],[f391,f395]) ).

fof(f391,plain,
    ( ~ neq(sK14,nil)
    | neq(sK15,nil) ),
    inference(cnf_transformation,[],[f258]) ).

fof(f641,plain,
    ( spl58_8
    | ~ spl58_6 ),
    inference(avatar_split_clause,[],[f566,f628,f638]) ).

fof(f566,plain,
    ( ~ neq(sK12,nil)
    | segmentP(sK13,sK15) ),
    inference(definition_unfolding,[],[f392,f395]) ).

fof(f392,plain,
    ( ~ neq(sK14,nil)
    | segmentP(sK13,sK15) ),
    inference(cnf_transformation,[],[f258]) ).

fof(f635,plain,
    ( ~ spl58_6
    | spl58_7 ),
    inference(avatar_split_clause,[],[f565,f632,f628]) ).

fof(f565,plain,
    ( segmentP(sK12,sK15)
    | ~ neq(sK12,nil) ),
    inference(definition_unfolding,[],[f393,f395,f395]) ).

fof(f393,plain,
    ( ~ neq(sK14,nil)
    | segmentP(sK14,sK15) ),
    inference(cnf_transformation,[],[f258]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC082+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n002.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 18:22:44 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.18/0.49  % (12503)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.49  % (12511)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.18/0.50  % (12500)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.18/0.50  % (12505)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.18/0.50  % (12515)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.18/0.50  % (12509)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.50  % (12512)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.51  % (12508)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.18/0.51  % (12524)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.18/0.51  % (12522)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.18/0.51  % (12503)First to succeed.
% 0.18/0.51  % (12519)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.18/0.51  % (12501)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.18/0.51  % (12516)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.18/0.52  % (12504)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.18/0.52  % (12507)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.18/0.52  % (12507)Instruction limit reached!
% 0.18/0.52  % (12507)------------------------------
% 0.18/0.52  % (12507)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52  % (12507)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52  % (12507)Termination reason: Unknown
% 0.18/0.52  % (12507)Termination phase: Preprocessing 2
% 0.18/0.52  
% 0.18/0.52  % (12507)Memory used [KB]: 1023
% 0.18/0.52  % (12507)Time elapsed: 0.002 s
% 0.18/0.52  % (12507)Instructions burned: 2 (million)
% 0.18/0.52  % (12507)------------------------------
% 0.18/0.52  % (12507)------------------------------
% 0.18/0.52  % (12514)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.18/0.52  % (12523)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.18/0.52  % (12499)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.18/0.52  % (12510)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.18/0.52  % (12526)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.18/0.52  % (12506)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.52  % (12513)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.18/0.53  % (12517)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.53  % (12525)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.18/0.53  % (12503)Refutation found. Thanks to Tanya!
% 0.18/0.53  % SZS status Theorem for theBenchmark
% 0.18/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.53  % (12503)------------------------------
% 0.18/0.53  % (12503)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53  % (12503)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53  % (12503)Termination reason: Refutation
% 0.18/0.53  
% 0.18/0.53  % (12503)Memory used [KB]: 6012
% 0.18/0.53  % (12503)Time elapsed: 0.120 s
% 0.18/0.53  % (12503)Instructions burned: 17 (million)
% 0.18/0.53  % (12503)------------------------------
% 0.18/0.53  % (12503)------------------------------
% 0.18/0.53  % (12496)Success in time 0.189 s
%------------------------------------------------------------------------------