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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC256+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 : n027.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:42:44 EDT 2022

% Result   : Theorem 1.70s 0.59s
% Output   : Refutation 1.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   62 (  13 unt;   0 def)
%            Number of atoms       :  293 (  95 equ)
%            Maximal formula atoms :   26 (   4 avg)
%            Number of connectives :  312 (  81   ~;  76   |; 126   &)
%                                         (  10 <=>;  19  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   7 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   72 (  32   !;  40   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1028,plain,
    $false,
    inference(avatar_sat_refutation,[],[f616,f621,f649,f811,f1017,f1019,f1022]) ).

fof(f1022,plain,
    ~ spl58_23,
    inference(avatar_contradiction_clause,[],[f1020]) ).

fof(f1020,plain,
    ( $false
    | ~ spl58_23 ),
    inference(resolution,[],[f1016,f562]) ).

fof(f562,plain,
    ~ singletonP(sK40),
    inference(definition_unfolding,[],[f498,f499]) ).

fof(f499,plain,
    sK38 = sK40,
    inference(cnf_transformation,[],[f313]) ).

fof(f313,plain,
    ( ssList(sK40)
    & sK38 = sK40
    & ~ singletonP(sK38)
    & sK41 = sK39
    & ( ( memberP(sK41,sK42)
        & ssItem(sK42)
        & cons(sK42,nil) = sK40 )
      | ( nil = sK41
        & nil = sK40 ) )
    & ssList(sK41)
    & neq(sK39,nil)
    & ssList(sK39)
    & ssList(sK38) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK38,sK39,sK40,sK41,sK42])],[f174,f312,f311,f310,f309,f308]) ).

fof(f308,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( X0 = X2
                    & ~ singletonP(X0)
                    & X1 = X3
                    & ( ? [X4] :
                          ( memberP(X3,X4)
                          & ssItem(X4)
                          & cons(X4,nil) = X2 )
                      | ( nil = X3
                        & nil = X2 ) )
                    & ssList(X3)
                    & neq(X1,nil) ) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( sK38 = X2
                  & ~ singletonP(sK38)
                  & X1 = X3
                  & ( ? [X4] :
                        ( memberP(X3,X4)
                        & ssItem(X4)
                        & cons(X4,nil) = X2 )
                    | ( nil = X3
                      & nil = X2 ) )
                  & ssList(X3)
                  & neq(X1,nil) ) )
          & ssList(X1) )
      & ssList(sK38) ) ),
    introduced(choice_axiom,[]) ).

fof(f309,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( sK38 = X2
                & ~ singletonP(sK38)
                & X1 = X3
                & ( ? [X4] :
                      ( memberP(X3,X4)
                      & ssItem(X4)
                      & cons(X4,nil) = X2 )
                  | ( nil = X3
                    & nil = X2 ) )
                & ssList(X3)
                & neq(X1,nil) ) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( sK38 = X2
              & ~ singletonP(sK38)
              & sK39 = X3
              & ( ? [X4] :
                    ( memberP(X3,X4)
                    & ssItem(X4)
                    & cons(X4,nil) = X2 )
                | ( nil = X3
                  & nil = X2 ) )
              & ssList(X3)
              & neq(sK39,nil) ) )
      & ssList(sK39) ) ),
    introduced(choice_axiom,[]) ).

fof(f310,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( sK38 = X2
            & ~ singletonP(sK38)
            & sK39 = X3
            & ( ? [X4] :
                  ( memberP(X3,X4)
                  & ssItem(X4)
                  & cons(X4,nil) = X2 )
              | ( nil = X3
                & nil = X2 ) )
            & ssList(X3)
            & neq(sK39,nil) ) )
   => ( ssList(sK40)
      & ? [X3] :
          ( sK38 = sK40
          & ~ singletonP(sK38)
          & sK39 = X3
          & ( ? [X4] :
                ( memberP(X3,X4)
                & ssItem(X4)
                & cons(X4,nil) = sK40 )
            | ( nil = X3
              & nil = sK40 ) )
          & ssList(X3)
          & neq(sK39,nil) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f311,plain,
    ( ? [X3] :
        ( sK38 = sK40
        & ~ singletonP(sK38)
        & sK39 = X3
        & ( ? [X4] :
              ( memberP(X3,X4)
              & ssItem(X4)
              & cons(X4,nil) = sK40 )
          | ( nil = X3
            & nil = sK40 ) )
        & ssList(X3)
        & neq(sK39,nil) )
   => ( sK38 = sK40
      & ~ singletonP(sK38)
      & sK41 = sK39
      & ( ? [X4] :
            ( memberP(sK41,X4)
            & ssItem(X4)
            & cons(X4,nil) = sK40 )
        | ( nil = sK41
          & nil = sK40 ) )
      & ssList(sK41)
      & neq(sK39,nil) ) ),
    introduced(choice_axiom,[]) ).

fof(f312,plain,
    ( ? [X4] :
        ( memberP(sK41,X4)
        & ssItem(X4)
        & cons(X4,nil) = sK40 )
   => ( memberP(sK41,sK42)
      & ssItem(sK42)
      & cons(sK42,nil) = sK40 ) ),
    introduced(choice_axiom,[]) ).

fof(f174,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( X0 = X2
                  & ~ singletonP(X0)
                  & X1 = X3
                  & ( ? [X4] :
                        ( memberP(X3,X4)
                        & ssItem(X4)
                        & cons(X4,nil) = X2 )
                    | ( nil = X3
                      & nil = X2 ) )
                  & ssList(X3)
                  & neq(X1,nil) ) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f173]) ).

fof(f173,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X0 = X2
                  & neq(X1,nil)
                  & X1 = X3
                  & ( ? [X4] :
                        ( memberP(X3,X4)
                        & cons(X4,nil) = X2
                        & ssItem(X4) )
                    | ( nil = X3
                      & nil = X2 ) )
                  & ~ singletonP(X0)
                  & 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)
                   => ( X0 != X2
                      | ~ neq(X1,nil)
                      | X1 != X3
                      | ( ! [X4] :
                            ( ssItem(X4)
                           => ( ~ memberP(X3,X4)
                              | cons(X4,nil) != X2 ) )
                        & ( nil != X3
                          | nil != X2 ) )
                      | singletonP(X0) ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

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

fof(f498,plain,
    ~ singletonP(sK38),
    inference(cnf_transformation,[],[f313]) ).

fof(f1016,plain,
    ( singletonP(sK40)
    | ~ spl58_23 ),
    inference(avatar_component_clause,[],[f1014]) ).

fof(f1014,plain,
    ( spl58_23
  <=> singletonP(sK40) ),
    introduced(avatar_definition,[new_symbols(naming,[spl58_23])]) ).

fof(f1019,plain,
    spl58_22,
    inference(avatar_contradiction_clause,[],[f1018]) ).

fof(f1018,plain,
    ( $false
    | spl58_22 ),
    inference(resolution,[],[f1012,f568]) ).

fof(f568,plain,
    ssList(sK40),
    inference(definition_unfolding,[],[f487,f499]) ).

fof(f487,plain,
    ssList(sK38),
    inference(cnf_transformation,[],[f313]) ).

fof(f1012,plain,
    ( ~ ssList(sK40)
    | spl58_22 ),
    inference(avatar_component_clause,[],[f1010]) ).

fof(f1010,plain,
    ( spl58_22
  <=> ssList(sK40) ),
    introduced(avatar_definition,[new_symbols(naming,[spl58_22])]) ).

fof(f1017,plain,
    ( ~ spl58_22
    | spl58_23
    | ~ spl58_2
    | ~ spl58_4 ),
    inference(avatar_split_clause,[],[f1007,f618,f608,f1014,f1010]) ).

fof(f608,plain,
    ( spl58_2
  <=> ssItem(sK42) ),
    introduced(avatar_definition,[new_symbols(naming,[spl58_2])]) ).

fof(f618,plain,
    ( spl58_4
  <=> cons(sK42,nil) = sK40 ),
    introduced(avatar_definition,[new_symbols(naming,[spl58_4])]) ).

fof(f1007,plain,
    ( ~ ssItem(sK42)
    | singletonP(sK40)
    | ~ ssList(sK40)
    | ~ spl58_4 ),
    inference(superposition,[],[f591,f620]) ).

fof(f620,plain,
    ( cons(sK42,nil) = sK40
    | ~ spl58_4 ),
    inference(avatar_component_clause,[],[f618]) ).

fof(f591,plain,
    ! [X2] :
      ( singletonP(cons(X2,nil))
      | ~ ssList(cons(X2,nil))
      | ~ ssItem(X2) ),
    inference(equality_resolution,[],[f517]) ).

fof(f517,plain,
    ! [X2,X0] :
      ( ~ ssList(X0)
      | singletonP(X0)
      | ~ ssItem(X2)
      | cons(X2,nil) != X0 ),
    inference(cnf_transformation,[],[f320]) ).

fof(f320,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( ( ( ssItem(sK43(X0))
            & cons(sK43(X0),nil) = X0 )
          | ~ singletonP(X0) )
        & ( singletonP(X0)
          | ! [X2] :
              ( ~ ssItem(X2)
              | cons(X2,nil) != X0 ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK43])],[f318,f319]) ).

fof(f319,plain,
    ! [X0] :
      ( ? [X1] :
          ( ssItem(X1)
          & cons(X1,nil) = X0 )
     => ( ssItem(sK43(X0))
        & cons(sK43(X0),nil) = X0 ) ),
    introduced(choice_axiom,[]) ).

fof(f318,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( ( ? [X1] :
              ( ssItem(X1)
              & cons(X1,nil) = X0 )
          | ~ singletonP(X0) )
        & ( singletonP(X0)
          | ! [X2] :
              ( ~ ssItem(X2)
              | cons(X2,nil) != X0 ) ) ) ),
    inference(rectify,[],[f317]) ).

fof(f317,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( ( ? [X1] :
              ( ssItem(X1)
              & cons(X1,nil) = X0 )
          | ~ singletonP(X0) )
        & ( singletonP(X0)
          | ! [X1] :
              ( ~ ssItem(X1)
              | cons(X1,nil) != X0 ) ) ) ),
    inference(nnf_transformation,[],[f118]) ).

fof(f118,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( ? [X1] :
            ( ssItem(X1)
            & cons(X1,nil) = X0 )
      <=> singletonP(X0) ) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( ? [X1] :
            ( ssItem(X1)
            & cons(X1,nil) = X0 )
      <=> singletonP(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).

fof(f811,plain,
    ( ~ spl58_6
    | ~ spl58_3 ),
    inference(avatar_split_clause,[],[f809,f613,f627]) ).

fof(f627,plain,
    ( spl58_6
  <=> ssList(nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl58_6])]) ).

fof(f613,plain,
    ( spl58_3
  <=> nil = sK39 ),
    introduced(avatar_definition,[new_symbols(naming,[spl58_3])]) ).

fof(f809,plain,
    ( ~ ssList(nil)
    | ~ spl58_3 ),
    inference(resolution,[],[f794,f601]) ).

fof(f601,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f582]) ).

fof(f582,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1)
      | ~ ssList(X1) ),
    inference(equality_resolution,[],[f454]) ).

fof(f454,plain,
    ! [X0,X1] :
      ( ~ ssList(X1)
      | X0 != X1
      | ~ neq(X0,X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f288]) ).

fof(f288,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssList(X1)
          | ( ( neq(X0,X1)
              | X0 = X1 )
            & ( X0 != X1
              | ~ neq(X0,X1) ) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f144]) ).

fof(f144,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssList(X1)
          | ( neq(X0,X1)
          <=> X0 != X1 ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).

fof(f794,plain,
    ( neq(nil,nil)
    | ~ spl58_3 ),
    inference(backward_demodulation,[],[f489,f615]) ).

fof(f615,plain,
    ( nil = sK39
    | ~ spl58_3 ),
    inference(avatar_component_clause,[],[f613]) ).

fof(f489,plain,
    neq(sK39,nil),
    inference(cnf_transformation,[],[f313]) ).

fof(f649,plain,
    spl58_6,
    inference(avatar_contradiction_clause,[],[f648]) ).

fof(f648,plain,
    ( $false
    | spl58_6 ),
    inference(resolution,[],[f629,f514]) ).

fof(f514,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).

fof(f629,plain,
    ( ~ ssList(nil)
    | spl58_6 ),
    inference(avatar_component_clause,[],[f627]) ).

fof(f621,plain,
    ( spl58_4
    | spl58_3 ),
    inference(avatar_split_clause,[],[f566,f613,f618]) ).

fof(f566,plain,
    ( nil = sK39
    | cons(sK42,nil) = sK40 ),
    inference(definition_unfolding,[],[f492,f497]) ).

fof(f497,plain,
    sK41 = sK39,
    inference(cnf_transformation,[],[f313]) ).

fof(f492,plain,
    ( cons(sK42,nil) = sK40
    | nil = sK41 ),
    inference(cnf_transformation,[],[f313]) ).

fof(f616,plain,
    ( spl58_3
    | spl58_2 ),
    inference(avatar_split_clause,[],[f565,f608,f613]) ).

fof(f565,plain,
    ( ssItem(sK42)
    | nil = sK39 ),
    inference(definition_unfolding,[],[f494,f497]) ).

fof(f494,plain,
    ( ssItem(sK42)
    | nil = sK41 ),
    inference(cnf_transformation,[],[f313]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SWC256+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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.13/0.35  % Computer : n027.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 18:54:31 EDT 2022
% 0.13/0.36  % CPUTime    : 
% 0.21/0.53  % (7585)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.21/0.53  % (7577)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.21/0.53  % (7573)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.55  % (7571)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.21/0.55  % (7566)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.21/0.55  % (7571)Instruction limit reached!
% 0.21/0.55  % (7571)------------------------------
% 0.21/0.55  % (7571)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55  % (7571)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55  % (7571)Termination reason: Unknown
% 0.21/0.55  % (7571)Termination phase: Preprocessing 3
% 0.21/0.55  
% 0.21/0.55  % (7571)Memory used [KB]: 1151
% 0.21/0.55  % (7571)Time elapsed: 0.003 s
% 0.21/0.55  % (7571)Instructions burned: 3 (million)
% 0.21/0.55  % (7571)------------------------------
% 0.21/0.55  % (7571)------------------------------
% 0.21/0.55  % (7572)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.21/0.55  % (7582)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.21/0.55  % (7570)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.55  % (7570)Instruction limit reached!
% 0.21/0.55  % (7570)------------------------------
% 0.21/0.55  % (7570)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55  % (7570)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55  % (7570)Termination reason: Unknown
% 0.21/0.55  % (7570)Termination phase: Property scanning
% 0.21/0.55  
% 0.21/0.55  % (7570)Memory used [KB]: 1279
% 0.21/0.55  % (7570)Time elapsed: 0.004 s
% 0.21/0.55  % (7570)Instructions burned: 7 (million)
% 0.21/0.55  % (7570)------------------------------
% 0.21/0.55  % (7570)------------------------------
% 0.21/0.55  % (7567)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.55  % (7587)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.21/0.56  % (7588)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.21/0.56  % (7578)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.21/0.56  % (7574)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.21/0.56  % (7563)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.21/0.56  % (7583)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.21/0.57  % (7564)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.57/0.57  % (7581)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.57/0.57  % (7568)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.57/0.57  % (7589)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.57/0.57  % (7565)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.57/0.57  % (7575)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.57/0.57  % (7586)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.57/0.57  % (7584)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.57/0.57  % (7569)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.57/0.58  % (7591)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.57/0.58  % (7590)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.57/0.58  % (7573)First to succeed.
% 1.57/0.58  % (7579)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.70/0.59  % (7580)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.70/0.59  % (7573)Refutation found. Thanks to Tanya!
% 1.70/0.59  % SZS status Theorem for theBenchmark
% 1.70/0.59  % SZS output start Proof for theBenchmark
% See solution above
% 1.70/0.59  % (7573)------------------------------
% 1.70/0.59  % (7573)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.70/0.59  % (7573)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.70/0.59  % (7573)Termination reason: Refutation
% 1.70/0.59  
% 1.70/0.59  % (7573)Memory used [KB]: 6268
% 1.70/0.59  % (7573)Time elapsed: 0.110 s
% 1.70/0.59  % (7573)Instructions burned: 32 (million)
% 1.70/0.59  % (7573)------------------------------
% 1.70/0.59  % (7573)------------------------------
% 1.70/0.59  % (7562)Success in time 0.224 s
%------------------------------------------------------------------------------