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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC009+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 : n021.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:10 EDT 2022

% Result   : Theorem 0.20s 0.57s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   37 (  18 unt;   0 def)
%            Number of atoms       :  352 ( 144 equ)
%            Maximal formula atoms :   46 (   9 avg)
%            Number of connectives :  507 ( 192   ~; 162   |; 137   &)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   8 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :  154 ( 105   !;  49   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f643,plain,
    $false,
    inference(subsumption_resolution,[],[f642,f487]) ).

fof(f487,plain,
    ssList(sK45),
    inference(cnf_transformation,[],[f318]) ).

fof(f318,plain,
    ( ssList(sK41)
    & ssList(sK42)
    & ( nil = sK44
      | nil != sK43 )
    & ! [X4] :
        ( ! [X5] :
            ( ! [X6] :
                ( app(X4,X6) != sK41
                | app(app(X4,X5),X6) != sK42
                | ~ ssList(X6) )
            | ~ ssList(X5) )
        | ~ ssList(X4) )
    & ! [X8] :
        ( ~ ssItem(X8)
        | ! [X9] :
            ( ~ ssList(X9)
            | app(cons(X8,nil),X9) != sK45
            | ! [X10] :
                ( ~ ssItem(X10)
                | ! [X11] :
                    ( ~ ssList(X11)
                    | app(X11,cons(X10,nil)) != sK43
                    | ~ lt(X10,X8) ) ) ) )
    & sK44 = app(sK43,sK45)
    & ssList(sK45)
    & strictorderedP(sK43)
    & ssList(sK44)
    & sK44 = sK42
    & sK43 = sK41
    & ssList(sK43) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK41,sK42,sK43,sK44,sK45])],[f195,f317,f316,f315,f314,f313]) ).

fof(f313,plain,
    ( ? [X0] :
        ( ssList(X0)
        & ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ? [X3] :
                    ( ( nil = X3
                      | nil != X2 )
                    & ! [X4] :
                        ( ! [X5] :
                            ( ! [X6] :
                                ( app(X4,X6) != X0
                                | app(app(X4,X5),X6) != X1
                                | ~ ssList(X6) )
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    & ? [X7] :
                        ( ! [X8] :
                            ( ~ ssItem(X8)
                            | ! [X9] :
                                ( ~ ssList(X9)
                                | app(cons(X8,nil),X9) != X7
                                | ! [X10] :
                                    ( ~ ssItem(X10)
                                    | ! [X11] :
                                        ( ~ ssList(X11)
                                        | app(X11,cons(X10,nil)) != X2
                                        | ~ lt(X10,X8) ) ) ) )
                        & app(X2,X7) = X3
                        & ssList(X7)
                        & strictorderedP(X2) )
                    & ssList(X3)
                    & X1 = X3
                    & X0 = X2 )
                & ssList(X2) ) ) )
   => ( ssList(sK41)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ( nil = X3
                    | nil != X2 )
                  & ! [X4] :
                      ( ! [X5] :
                          ( ! [X6] :
                              ( app(X4,X6) != sK41
                              | app(app(X4,X5),X6) != X1
                              | ~ ssList(X6) )
                          | ~ ssList(X5) )
                      | ~ ssList(X4) )
                  & ? [X7] :
                      ( ! [X8] :
                          ( ~ ssItem(X8)
                          | ! [X9] :
                              ( ~ ssList(X9)
                              | app(cons(X8,nil),X9) != X7
                              | ! [X10] :
                                  ( ~ ssItem(X10)
                                  | ! [X11] :
                                      ( ~ ssList(X11)
                                      | app(X11,cons(X10,nil)) != X2
                                      | ~ lt(X10,X8) ) ) ) )
                      & app(X2,X7) = X3
                      & ssList(X7)
                      & strictorderedP(X2) )
                  & ssList(X3)
                  & X1 = X3
                  & sK41 = X2 )
              & ssList(X2) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f314,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( ( nil = X3
                  | nil != X2 )
                & ! [X4] :
                    ( ! [X5] :
                        ( ! [X6] :
                            ( app(X4,X6) != sK41
                            | app(app(X4,X5),X6) != X1
                            | ~ ssList(X6) )
                        | ~ ssList(X5) )
                    | ~ ssList(X4) )
                & ? [X7] :
                    ( ! [X8] :
                        ( ~ ssItem(X8)
                        | ! [X9] :
                            ( ~ ssList(X9)
                            | app(cons(X8,nil),X9) != X7
                            | ! [X10] :
                                ( ~ ssItem(X10)
                                | ! [X11] :
                                    ( ~ ssList(X11)
                                    | app(X11,cons(X10,nil)) != X2
                                    | ~ lt(X10,X8) ) ) ) )
                    & app(X2,X7) = X3
                    & ssList(X7)
                    & strictorderedP(X2) )
                & ssList(X3)
                & X1 = X3
                & sK41 = X2 )
            & ssList(X2) ) )
   => ( ssList(sK42)
      & ? [X2] :
          ( ? [X3] :
              ( ( nil = X3
                | nil != X2 )
              & ! [X4] :
                  ( ! [X5] :
                      ( ! [X6] :
                          ( app(X4,X6) != sK41
                          | app(app(X4,X5),X6) != sK42
                          | ~ ssList(X6) )
                      | ~ ssList(X5) )
                  | ~ ssList(X4) )
              & ? [X7] :
                  ( ! [X8] :
                      ( ~ ssItem(X8)
                      | ! [X9] :
                          ( ~ ssList(X9)
                          | app(cons(X8,nil),X9) != X7
                          | ! [X10] :
                              ( ~ ssItem(X10)
                              | ! [X11] :
                                  ( ~ ssList(X11)
                                  | app(X11,cons(X10,nil)) != X2
                                  | ~ lt(X10,X8) ) ) ) )
                  & app(X2,X7) = X3
                  & ssList(X7)
                  & strictorderedP(X2) )
              & ssList(X3)
              & sK42 = X3
              & sK41 = X2 )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f315,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( nil = X3
              | nil != X2 )
            & ! [X4] :
                ( ! [X5] :
                    ( ! [X6] :
                        ( app(X4,X6) != sK41
                        | app(app(X4,X5),X6) != sK42
                        | ~ ssList(X6) )
                    | ~ ssList(X5) )
                | ~ ssList(X4) )
            & ? [X7] :
                ( ! [X8] :
                    ( ~ ssItem(X8)
                    | ! [X9] :
                        ( ~ ssList(X9)
                        | app(cons(X8,nil),X9) != X7
                        | ! [X10] :
                            ( ~ ssItem(X10)
                            | ! [X11] :
                                ( ~ ssList(X11)
                                | app(X11,cons(X10,nil)) != X2
                                | ~ lt(X10,X8) ) ) ) )
                & app(X2,X7) = X3
                & ssList(X7)
                & strictorderedP(X2) )
            & ssList(X3)
            & sK42 = X3
            & sK41 = X2 )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( nil = X3
            | nil != sK43 )
          & ! [X4] :
              ( ! [X5] :
                  ( ! [X6] :
                      ( app(X4,X6) != sK41
                      | app(app(X4,X5),X6) != sK42
                      | ~ ssList(X6) )
                  | ~ ssList(X5) )
              | ~ ssList(X4) )
          & ? [X7] :
              ( ! [X8] :
                  ( ~ ssItem(X8)
                  | ! [X9] :
                      ( ~ ssList(X9)
                      | app(cons(X8,nil),X9) != X7
                      | ! [X10] :
                          ( ~ ssItem(X10)
                          | ! [X11] :
                              ( ~ ssList(X11)
                              | app(X11,cons(X10,nil)) != sK43
                              | ~ lt(X10,X8) ) ) ) )
              & app(sK43,X7) = X3
              & ssList(X7)
              & strictorderedP(sK43) )
          & ssList(X3)
          & sK42 = X3
          & sK43 = sK41 )
      & ssList(sK43) ) ),
    introduced(choice_axiom,[]) ).

fof(f316,plain,
    ( ? [X3] :
        ( ( nil = X3
          | nil != sK43 )
        & ! [X4] :
            ( ! [X5] :
                ( ! [X6] :
                    ( app(X4,X6) != sK41
                    | app(app(X4,X5),X6) != sK42
                    | ~ ssList(X6) )
                | ~ ssList(X5) )
            | ~ ssList(X4) )
        & ? [X7] :
            ( ! [X8] :
                ( ~ ssItem(X8)
                | ! [X9] :
                    ( ~ ssList(X9)
                    | app(cons(X8,nil),X9) != X7
                    | ! [X10] :
                        ( ~ ssItem(X10)
                        | ! [X11] :
                            ( ~ ssList(X11)
                            | app(X11,cons(X10,nil)) != sK43
                            | ~ lt(X10,X8) ) ) ) )
            & app(sK43,X7) = X3
            & ssList(X7)
            & strictorderedP(sK43) )
        & ssList(X3)
        & sK42 = X3
        & sK43 = sK41 )
   => ( ( nil = sK44
        | nil != sK43 )
      & ! [X4] :
          ( ! [X5] :
              ( ! [X6] :
                  ( app(X4,X6) != sK41
                  | app(app(X4,X5),X6) != sK42
                  | ~ ssList(X6) )
              | ~ ssList(X5) )
          | ~ ssList(X4) )
      & ? [X7] :
          ( ! [X8] :
              ( ~ ssItem(X8)
              | ! [X9] :
                  ( ~ ssList(X9)
                  | app(cons(X8,nil),X9) != X7
                  | ! [X10] :
                      ( ~ ssItem(X10)
                      | ! [X11] :
                          ( ~ ssList(X11)
                          | app(X11,cons(X10,nil)) != sK43
                          | ~ lt(X10,X8) ) ) ) )
          & sK44 = app(sK43,X7)
          & ssList(X7)
          & strictorderedP(sK43) )
      & ssList(sK44)
      & sK44 = sK42
      & sK43 = sK41 ) ),
    introduced(choice_axiom,[]) ).

fof(f317,plain,
    ( ? [X7] :
        ( ! [X8] :
            ( ~ ssItem(X8)
            | ! [X9] :
                ( ~ ssList(X9)
                | app(cons(X8,nil),X9) != X7
                | ! [X10] :
                    ( ~ ssItem(X10)
                    | ! [X11] :
                        ( ~ ssList(X11)
                        | app(X11,cons(X10,nil)) != sK43
                        | ~ lt(X10,X8) ) ) ) )
        & sK44 = app(sK43,X7)
        & ssList(X7)
        & strictorderedP(sK43) )
   => ( ! [X8] :
          ( ~ ssItem(X8)
          | ! [X9] :
              ( ~ ssList(X9)
              | app(cons(X8,nil),X9) != sK45
              | ! [X10] :
                  ( ~ ssItem(X10)
                  | ! [X11] :
                      ( ~ ssList(X11)
                      | app(X11,cons(X10,nil)) != sK43
                      | ~ lt(X10,X8) ) ) ) )
      & sK44 = app(sK43,sK45)
      & ssList(sK45)
      & strictorderedP(sK43) ) ),
    introduced(choice_axiom,[]) ).

fof(f195,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ( nil = X3
                    | nil != X2 )
                  & ! [X4] :
                      ( ! [X5] :
                          ( ! [X6] :
                              ( app(X4,X6) != X0
                              | app(app(X4,X5),X6) != X1
                              | ~ ssList(X6) )
                          | ~ ssList(X5) )
                      | ~ ssList(X4) )
                  & ? [X7] :
                      ( ! [X8] :
                          ( ~ ssItem(X8)
                          | ! [X9] :
                              ( ~ ssList(X9)
                              | app(cons(X8,nil),X9) != X7
                              | ! [X10] :
                                  ( ~ ssItem(X10)
                                  | ! [X11] :
                                      ( ~ ssList(X11)
                                      | app(X11,cons(X10,nil)) != X2
                                      | ~ lt(X10,X8) ) ) ) )
                      & app(X2,X7) = X3
                      & ssList(X7)
                      & strictorderedP(X2) )
                  & ssList(X3)
                  & X1 = X3
                  & X0 = X2 )
              & ssList(X2) ) ) ),
    inference(flattening,[],[f194]) ).

fof(f194,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X0 = X2
                  & ! [X4] :
                      ( ! [X5] :
                          ( ! [X6] :
                              ( app(X4,X6) != X0
                              | app(app(X4,X5),X6) != X1
                              | ~ ssList(X6) )
                          | ~ ssList(X5) )
                      | ~ ssList(X4) )
                  & ? [X7] :
                      ( app(X2,X7) = X3
                      & ! [X8] :
                          ( ~ ssItem(X8)
                          | ! [X9] :
                              ( ~ ssList(X9)
                              | app(cons(X8,nil),X9) != X7
                              | ! [X10] :
                                  ( ~ ssItem(X10)
                                  | ! [X11] :
                                      ( ~ ssList(X11)
                                      | app(X11,cons(X10,nil)) != X2
                                      | ~ lt(X10,X8) ) ) ) )
                      & strictorderedP(X2)
                      & ssList(X7) )
                  & X1 = X3
                  & ( nil = X3
                    | nil != 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)
                   => ( X0 != X2
                      | ? [X4] :
                          ( ssList(X4)
                          & ? [X5] :
                              ( ? [X6] :
                                  ( ssList(X6)
                                  & app(X4,X6) = X0
                                  & app(app(X4,X5),X6) = X1 )
                              & ssList(X5) ) )
                      | ! [X7] :
                          ( ssList(X7)
                         => ( app(X2,X7) != X3
                            | ? [X8] :
                                ( ssItem(X8)
                                & ? [X9] :
                                    ( ? [X10] :
                                        ( ? [X11] :
                                            ( ssList(X11)
                                            & lt(X10,X8)
                                            & app(X11,cons(X10,nil)) = X2 )
                                        & ssItem(X10) )
                                    & ssList(X9)
                                    & app(cons(X8,nil),X9) = X7 ) )
                            | ~ strictorderedP(X2) ) )
                      | X1 != X3
                      | ( nil = X2
                        & nil != X3 ) ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X0 != X2
                    | ? [X4] :
                        ( ssList(X4)
                        & ? [X5] :
                            ( ? [X6] :
                                ( ssList(X6)
                                & app(X4,X6) = X0
                                & app(app(X4,X5),X6) = X1 )
                            & ssList(X5) ) )
                    | ! [X7] :
                        ( ssList(X7)
                       => ( app(X2,X7) != X3
                          | ? [X8] :
                              ( ssItem(X8)
                              & ? [X9] :
                                  ( ? [X10] :
                                      ( ? [X11] :
                                          ( ssList(X11)
                                          & lt(X10,X8)
                                          & app(X11,cons(X10,nil)) = X2 )
                                      & ssItem(X10) )
                                  & ssList(X9)
                                  & app(cons(X8,nil),X9) = X7 ) )
                          | ~ strictorderedP(X2) ) )
                    | X1 != X3
                    | ( nil = X2
                      & nil != X3 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f642,plain,
    ~ ssList(sK45),
    inference(subsumption_resolution,[],[f640,f625]) ).

fof(f625,plain,
    app(sK42,nil) = sK42,
    inference(resolution,[],[f372,f596]) ).

fof(f596,plain,
    ssList(sK42),
    inference(forward_demodulation,[],[f485,f484]) ).

fof(f484,plain,
    sK44 = sK42,
    inference(cnf_transformation,[],[f318]) ).

fof(f485,plain,
    ssList(sK44),
    inference(cnf_transformation,[],[f318]) ).

fof(f372,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(X0,nil) = X0 ),
    inference(cnf_transformation,[],[f127]) ).

fof(f127,plain,
    ! [X0] :
      ( app(X0,nil) = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f84]) ).

fof(f84,axiom,
    ! [X0] :
      ( ssList(X0)
     => app(X0,nil) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).

fof(f640,plain,
    ( app(sK42,nil) != sK42
    | ~ ssList(sK45) ),
    inference(superposition,[],[f633,f604]) ).

fof(f604,plain,
    app(sK41,sK45) = sK42,
    inference(backward_demodulation,[],[f597,f603]) ).

fof(f603,plain,
    sF58 = sK42,
    inference(forward_demodulation,[],[f588,f484]) ).

fof(f588,plain,
    sK44 = sF58,
    inference(definition_folding,[],[f488,f587]) ).

fof(f587,plain,
    app(sK43,sK45) = sF58,
    introduced(function_definition,[]) ).

fof(f488,plain,
    sK44 = app(sK43,sK45),
    inference(cnf_transformation,[],[f318]) ).

fof(f597,plain,
    app(sK41,sK45) = sF58,
    inference(backward_demodulation,[],[f587,f483]) ).

fof(f483,plain,
    sK43 = sK41,
    inference(cnf_transformation,[],[f318]) ).

fof(f633,plain,
    ! [X0] :
      ( app(app(sK41,X0),nil) != sK42
      | ~ ssList(X0) ),
    inference(subsumption_resolution,[],[f632,f493]) ).

fof(f493,plain,
    ssList(sK41),
    inference(cnf_transformation,[],[f318]) ).

fof(f632,plain,
    ! [X0] :
      ( ~ ssList(sK41)
      | app(app(sK41,X0),nil) != sK42
      | ~ ssList(X0) ),
    inference(subsumption_resolution,[],[f631,f389]) ).

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

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

fof(f631,plain,
    ! [X0] :
      ( ~ ssList(nil)
      | app(app(sK41,X0),nil) != sK42
      | ~ ssList(sK41)
      | ~ ssList(X0) ),
    inference(trivial_inequality_removal,[],[f630]) ).

fof(f630,plain,
    ! [X0] :
      ( ~ ssList(nil)
      | ~ ssList(X0)
      | sK41 != sK41
      | ~ ssList(sK41)
      | app(app(sK41,X0),nil) != sK42 ),
    inference(superposition,[],[f490,f624]) ).

fof(f624,plain,
    app(sK41,nil) = sK41,
    inference(resolution,[],[f372,f493]) ).

fof(f490,plain,
    ! [X6,X4,X5] :
      ( app(X4,X6) != sK41
      | ~ ssList(X6)
      | app(app(X4,X5),X6) != sK42
      | ~ ssList(X4)
      | ~ ssList(X5) ),
    inference(cnf_transformation,[],[f318]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SWC009+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/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 : n021.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 17:50:26 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.51  % (22219)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.20/0.51  % (22227)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.20/0.52  % (22221)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.20/0.52  % (22226)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.53  % (22231)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.20/0.53  % (22220)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.20/0.53  % (22234)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.20/0.53  % (22223)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53  % (22224)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.20/0.53  % (22222)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.20/0.53  % (22241)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.20/0.53  % (22227)Instruction limit reached!
% 0.20/0.53  % (22227)------------------------------
% 0.20/0.53  % (22227)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (22227)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (22227)Termination reason: Unknown
% 0.20/0.53  % (22227)Termination phase: Preprocessing 2
% 0.20/0.53  
% 0.20/0.53  % (22227)Memory used [KB]: 1023
% 0.20/0.53  % (22227)Time elapsed: 0.003 s
% 0.20/0.53  % (22227)Instructions burned: 2 (million)
% 0.20/0.53  % (22227)------------------------------
% 0.20/0.53  % (22227)------------------------------
% 0.20/0.53  % (22229)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.53  % (22232)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.53  % (22233)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.20/0.54  % (22246)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.20/0.54  % (22238)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.20/0.54  % (22242)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.20/0.54  % (22243)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.54  % (22247)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.54  % (22226)Instruction limit reached!
% 0.20/0.54  % (22226)------------------------------
% 0.20/0.54  % (22226)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (22226)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (22226)Termination reason: Unknown
% 0.20/0.54  % (22226)Termination phase: Function definition elimination
% 0.20/0.54  
% 0.20/0.54  % (22226)Memory used [KB]: 1279
% 0.20/0.54  % (22226)Time elapsed: 0.009 s
% 0.20/0.54  % (22226)Instructions burned: 8 (million)
% 0.20/0.54  % (22226)------------------------------
% 0.20/0.54  % (22226)------------------------------
% 0.20/0.54  % (22228)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.20/0.54  % (22245)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.20/0.54  % (22235)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.20/0.54  % (22248)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.20/0.55  % (22239)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.20/0.55  % (22225)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.20/0.55  TRYING [1]
% 0.20/0.55  % (22237)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.55  % (22240)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.55  % (22244)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.55  % (22236)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.55  % (22230)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.20/0.56  TRYING [2]
% 0.20/0.57  % (22234)First to succeed.
% 0.20/0.57  % (22234)Refutation found. Thanks to Tanya!
% 0.20/0.57  % SZS status Theorem for theBenchmark
% 0.20/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.57  % (22234)------------------------------
% 0.20/0.57  % (22234)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57  % (22234)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57  % (22234)Termination reason: Refutation
% 0.20/0.57  
% 0.20/0.57  % (22234)Memory used [KB]: 1535
% 0.20/0.57  % (22234)Time elapsed: 0.136 s
% 0.20/0.57  % (22234)Instructions burned: 19 (million)
% 0.20/0.57  % (22234)------------------------------
% 0.20/0.57  % (22234)------------------------------
% 0.20/0.57  % (22218)Success in time 0.219 s
%------------------------------------------------------------------------------