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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC185+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 : n013.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:16 EDT 2022

% Result   : Theorem 0.20s 0.56s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   40 (  10 unt;   0 def)
%            Number of atoms       :  332 (  69 equ)
%            Maximal formula atoms :   36 (   8 avg)
%            Number of connectives :  420 ( 128   ~; 109   |; 160   &)
%                                         (   2 <=>;  21  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   8 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :  132 (  56   !;  76   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f711,plain,
    $false,
    inference(avatar_sat_refutation,[],[f617,f701,f710]) ).

fof(f710,plain,
    ~ spl60_3,
    inference(avatar_contradiction_clause,[],[f709]) ).

fof(f709,plain,
    ( $false
    | ~ spl60_3 ),
    inference(subsumption_resolution,[],[f708,f371]) ).

fof(f371,plain,
    ssList(sK17),
    inference(cnf_transformation,[],[f250]) ).

fof(f250,plain,
    ( ssList(sK12)
    & ssList(sK13)
    & sK12 = sK14
    & sK11 = sK13
    & ssList(sK14)
    & ssList(sK17)
    & ( memberP(sK17,sK15)
      | memberP(sK16,sK15) )
    & sK11 = app(app(sK16,cons(sK15,nil)),sK17)
    & ssList(sK16)
    & ssItem(sK15)
    & ! [X7] :
        ( ! [X8] :
            ( ~ ssList(X8)
            | ! [X9] :
                ( app(app(X8,cons(X7,nil)),X9) != sK13
                | ( ~ memberP(X9,X7)
                  & ~ memberP(X8,X7) )
                | ~ ssList(X9) ) )
        | ~ ssItem(X7) )
    & ssList(sK11) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12,sK13,sK14,sK15,sK16,sK17])],[f242,f249,f248,f247,f246,f245,f244,f243]) ).

fof(f243,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( X1 = X3
                    & X0 = X2
                    & ssList(X3)
                    & ? [X4] :
                        ( ? [X5] :
                            ( ? [X6] :
                                ( ssList(X6)
                                & ( memberP(X6,X4)
                                  | memberP(X5,X4) )
                                & app(app(X5,cons(X4,nil)),X6) = X0 )
                            & ssList(X5) )
                        & ssItem(X4) )
                    & ! [X7] :
                        ( ! [X8] :
                            ( ~ ssList(X8)
                            | ! [X9] :
                                ( app(app(X8,cons(X7,nil)),X9) != X2
                                | ( ~ memberP(X9,X7)
                                  & ~ memberP(X8,X7) )
                                | ~ ssList(X9) ) )
                        | ~ ssItem(X7) ) ) ) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( X1 = X3
                  & sK11 = X2
                  & ssList(X3)
                  & ? [X4] :
                      ( ? [X5] :
                          ( ? [X6] :
                              ( ssList(X6)
                              & ( memberP(X6,X4)
                                | memberP(X5,X4) )
                              & app(app(X5,cons(X4,nil)),X6) = sK11 )
                          & ssList(X5) )
                      & ssItem(X4) )
                  & ! [X7] :
                      ( ! [X8] :
                          ( ~ ssList(X8)
                          | ! [X9] :
                              ( app(app(X8,cons(X7,nil)),X9) != X2
                              | ( ~ memberP(X9,X7)
                                & ~ memberP(X8,X7) )
                              | ~ ssList(X9) ) )
                      | ~ ssItem(X7) ) ) ) )
      & ssList(sK11) ) ),
    introduced(choice_axiom,[]) ).

fof(f244,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( X1 = X3
                & sK11 = X2
                & ssList(X3)
                & ? [X4] :
                    ( ? [X5] :
                        ( ? [X6] :
                            ( ssList(X6)
                            & ( memberP(X6,X4)
                              | memberP(X5,X4) )
                            & app(app(X5,cons(X4,nil)),X6) = sK11 )
                        & ssList(X5) )
                    & ssItem(X4) )
                & ! [X7] :
                    ( ! [X8] :
                        ( ~ ssList(X8)
                        | ! [X9] :
                            ( app(app(X8,cons(X7,nil)),X9) != X2
                            | ( ~ memberP(X9,X7)
                              & ~ memberP(X8,X7) )
                            | ~ ssList(X9) ) )
                    | ~ ssItem(X7) ) ) ) )
   => ( ssList(sK12)
      & ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( sK12 = X3
              & sK11 = X2
              & ssList(X3)
              & ? [X4] :
                  ( ? [X5] :
                      ( ? [X6] :
                          ( ssList(X6)
                          & ( memberP(X6,X4)
                            | memberP(X5,X4) )
                          & app(app(X5,cons(X4,nil)),X6) = sK11 )
                      & ssList(X5) )
                  & ssItem(X4) )
              & ! [X7] :
                  ( ! [X8] :
                      ( ~ ssList(X8)
                      | ! [X9] :
                          ( app(app(X8,cons(X7,nil)),X9) != X2
                          | ( ~ memberP(X9,X7)
                            & ~ memberP(X8,X7) )
                          | ~ ssList(X9) ) )
                  | ~ ssItem(X7) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f245,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( sK12 = X3
            & sK11 = X2
            & ssList(X3)
            & ? [X4] :
                ( ? [X5] :
                    ( ? [X6] :
                        ( ssList(X6)
                        & ( memberP(X6,X4)
                          | memberP(X5,X4) )
                        & app(app(X5,cons(X4,nil)),X6) = sK11 )
                    & ssList(X5) )
                & ssItem(X4) )
            & ! [X7] :
                ( ! [X8] :
                    ( ~ ssList(X8)
                    | ! [X9] :
                        ( app(app(X8,cons(X7,nil)),X9) != X2
                        | ( ~ memberP(X9,X7)
                          & ~ memberP(X8,X7) )
                        | ~ ssList(X9) ) )
                | ~ ssItem(X7) ) ) )
   => ( ssList(sK13)
      & ? [X3] :
          ( sK12 = X3
          & sK11 = sK13
          & ssList(X3)
          & ? [X4] :
              ( ? [X5] :
                  ( ? [X6] :
                      ( ssList(X6)
                      & ( memberP(X6,X4)
                        | memberP(X5,X4) )
                      & app(app(X5,cons(X4,nil)),X6) = sK11 )
                  & ssList(X5) )
              & ssItem(X4) )
          & ! [X7] :
              ( ! [X8] :
                  ( ~ ssList(X8)
                  | ! [X9] :
                      ( app(app(X8,cons(X7,nil)),X9) != sK13
                      | ( ~ memberP(X9,X7)
                        & ~ memberP(X8,X7) )
                      | ~ ssList(X9) ) )
              | ~ ssItem(X7) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f246,plain,
    ( ? [X3] :
        ( sK12 = X3
        & sK11 = sK13
        & ssList(X3)
        & ? [X4] :
            ( ? [X5] :
                ( ? [X6] :
                    ( ssList(X6)
                    & ( memberP(X6,X4)
                      | memberP(X5,X4) )
                    & app(app(X5,cons(X4,nil)),X6) = sK11 )
                & ssList(X5) )
            & ssItem(X4) )
        & ! [X7] :
            ( ! [X8] :
                ( ~ ssList(X8)
                | ! [X9] :
                    ( app(app(X8,cons(X7,nil)),X9) != sK13
                    | ( ~ memberP(X9,X7)
                      & ~ memberP(X8,X7) )
                    | ~ ssList(X9) ) )
            | ~ ssItem(X7) ) )
   => ( sK12 = sK14
      & sK11 = sK13
      & ssList(sK14)
      & ? [X4] :
          ( ? [X5] :
              ( ? [X6] :
                  ( ssList(X6)
                  & ( memberP(X6,X4)
                    | memberP(X5,X4) )
                  & app(app(X5,cons(X4,nil)),X6) = sK11 )
              & ssList(X5) )
          & ssItem(X4) )
      & ! [X7] :
          ( ! [X8] :
              ( ~ ssList(X8)
              | ! [X9] :
                  ( app(app(X8,cons(X7,nil)),X9) != sK13
                  | ( ~ memberP(X9,X7)
                    & ~ memberP(X8,X7) )
                  | ~ ssList(X9) ) )
          | ~ ssItem(X7) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f247,plain,
    ( ? [X4] :
        ( ? [X5] :
            ( ? [X6] :
                ( ssList(X6)
                & ( memberP(X6,X4)
                  | memberP(X5,X4) )
                & app(app(X5,cons(X4,nil)),X6) = sK11 )
            & ssList(X5) )
        & ssItem(X4) )
   => ( ? [X5] :
          ( ? [X6] :
              ( ssList(X6)
              & ( memberP(X6,sK15)
                | memberP(X5,sK15) )
              & sK11 = app(app(X5,cons(sK15,nil)),X6) )
          & ssList(X5) )
      & ssItem(sK15) ) ),
    introduced(choice_axiom,[]) ).

fof(f248,plain,
    ( ? [X5] :
        ( ? [X6] :
            ( ssList(X6)
            & ( memberP(X6,sK15)
              | memberP(X5,sK15) )
            & sK11 = app(app(X5,cons(sK15,nil)),X6) )
        & ssList(X5) )
   => ( ? [X6] :
          ( ssList(X6)
          & ( memberP(X6,sK15)
            | memberP(sK16,sK15) )
          & sK11 = app(app(sK16,cons(sK15,nil)),X6) )
      & ssList(sK16) ) ),
    introduced(choice_axiom,[]) ).

fof(f249,plain,
    ( ? [X6] :
        ( ssList(X6)
        & ( memberP(X6,sK15)
          | memberP(sK16,sK15) )
        & sK11 = app(app(sK16,cons(sK15,nil)),X6) )
   => ( ssList(sK17)
      & ( memberP(sK17,sK15)
        | memberP(sK16,sK15) )
      & sK11 = app(app(sK16,cons(sK15,nil)),sK17) ) ),
    introduced(choice_axiom,[]) ).

fof(f242,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ssList(X3)
                  & ? [X4] :
                      ( ? [X5] :
                          ( ? [X6] :
                              ( ssList(X6)
                              & ( memberP(X6,X4)
                                | memberP(X5,X4) )
                              & app(app(X5,cons(X4,nil)),X6) = X0 )
                          & ssList(X5) )
                      & ssItem(X4) )
                  & ! [X7] :
                      ( ! [X8] :
                          ( ~ ssList(X8)
                          | ! [X9] :
                              ( app(app(X8,cons(X7,nil)),X9) != X2
                              | ( ~ memberP(X9,X7)
                                & ~ memberP(X8,X7) )
                              | ~ ssList(X9) ) )
                      | ~ ssItem(X7) ) ) ) )
      & ssList(X0) ),
    inference(rectify,[],[f191]) ).

fof(f191,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ssList(X3)
                  & ? [X7] :
                      ( ? [X8] :
                          ( ? [X9] :
                              ( ssList(X9)
                              & ( memberP(X9,X7)
                                | memberP(X8,X7) )
                              & app(app(X8,cons(X7,nil)),X9) = X0 )
                          & ssList(X8) )
                      & ssItem(X7) )
                  & ! [X4] :
                      ( ! [X5] :
                          ( ~ ssList(X5)
                          | ! [X6] :
                              ( app(app(X5,cons(X4,nil)),X6) != X2
                              | ( ~ memberP(X6,X4)
                                & ~ memberP(X5,X4) )
                              | ~ ssList(X6) ) )
                      | ~ ssItem(X4) ) ) ) )
      & ssList(X0) ),
    inference(flattening,[],[f190]) ).

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

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

fof(f708,plain,
    ( ~ ssList(sK17)
    | ~ spl60_3 ),
    inference(subsumption_resolution,[],[f707,f612]) ).

fof(f612,plain,
    ( memberP(sK17,sK15)
    | ~ spl60_3 ),
    inference(avatar_component_clause,[],[f610]) ).

fof(f610,plain,
    ( spl60_3
  <=> memberP(sK17,sK15) ),
    introduced(avatar_definition,[new_symbols(naming,[spl60_3])]) ).

fof(f707,plain,
    ( ~ memberP(sK17,sK15)
    | ~ ssList(sK17) ),
    inference(subsumption_resolution,[],[f706,f368]) ).

fof(f368,plain,
    ssList(sK16),
    inference(cnf_transformation,[],[f250]) ).

fof(f706,plain,
    ( ~ ssList(sK16)
    | ~ memberP(sK17,sK15)
    | ~ ssList(sK17) ),
    inference(subsumption_resolution,[],[f705,f367]) ).

fof(f367,plain,
    ssItem(sK15),
    inference(cnf_transformation,[],[f250]) ).

fof(f705,plain,
    ( ~ ssItem(sK15)
    | ~ ssList(sK16)
    | ~ memberP(sK17,sK15)
    | ~ ssList(sK17) ),
    inference(trivial_inequality_removal,[],[f703]) ).

fof(f703,plain,
    ( ~ memberP(sK17,sK15)
    | ~ ssList(sK16)
    | sK13 != sK13
    | ~ ssList(sK17)
    | ~ ssItem(sK15) ),
    inference(superposition,[],[f366,f565]) ).

fof(f565,plain,
    sK13 = app(app(sK16,cons(sK15,nil)),sK17),
    inference(definition_unfolding,[],[f369,f373]) ).

fof(f373,plain,
    sK11 = sK13,
    inference(cnf_transformation,[],[f250]) ).

fof(f369,plain,
    sK11 = app(app(sK16,cons(sK15,nil)),sK17),
    inference(cnf_transformation,[],[f250]) ).

fof(f366,plain,
    ! [X8,X9,X7] :
      ( app(app(X8,cons(X7,nil)),X9) != sK13
      | ~ ssItem(X7)
      | ~ ssList(X8)
      | ~ ssList(X9)
      | ~ memberP(X9,X7) ),
    inference(cnf_transformation,[],[f250]) ).

fof(f701,plain,
    ~ spl60_4,
    inference(avatar_split_clause,[],[f700,f614]) ).

fof(f614,plain,
    ( spl60_4
  <=> memberP(sK16,sK15) ),
    introduced(avatar_definition,[new_symbols(naming,[spl60_4])]) ).

fof(f700,plain,
    ~ memberP(sK16,sK15),
    inference(subsumption_resolution,[],[f699,f371]) ).

fof(f699,plain,
    ( ~ memberP(sK16,sK15)
    | ~ ssList(sK17) ),
    inference(subsumption_resolution,[],[f694,f368]) ).

fof(f694,plain,
    ( ~ ssList(sK16)
    | ~ ssList(sK17)
    | ~ memberP(sK16,sK15) ),
    inference(subsumption_resolution,[],[f692,f367]) ).

fof(f692,plain,
    ( ~ ssItem(sK15)
    | ~ ssList(sK16)
    | ~ ssList(sK17)
    | ~ memberP(sK16,sK15) ),
    inference(trivial_inequality_removal,[],[f691]) ).

fof(f691,plain,
    ( ~ memberP(sK16,sK15)
    | sK13 != sK13
    | ~ ssList(sK16)
    | ~ ssList(sK17)
    | ~ ssItem(sK15) ),
    inference(superposition,[],[f365,f565]) ).

fof(f365,plain,
    ! [X8,X9,X7] :
      ( app(app(X8,cons(X7,nil)),X9) != sK13
      | ~ ssList(X8)
      | ~ memberP(X8,X7)
      | ~ ssList(X9)
      | ~ ssItem(X7) ),
    inference(cnf_transformation,[],[f250]) ).

fof(f617,plain,
    ( spl60_3
    | spl60_4 ),
    inference(avatar_split_clause,[],[f370,f614,f610]) ).

fof(f370,plain,
    ( memberP(sK16,sK15)
    | memberP(sK17,sK15) ),
    inference(cnf_transformation,[],[f250]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SWC185+1 : TPTP v8.1.0. Released v2.4.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.13/0.36  % Computer : n013.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit   : 300
% 0.13/0.36  % WCLimit    : 300
% 0.13/0.36  % DateTime   : Tue Aug 30 18:28:32 EDT 2022
% 0.13/0.36  % CPUTime    : 
% 0.20/0.48  % (3835)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.49  % (3855)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.49  % (3843)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.49  % (3834)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.50  % (3847)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51  % (3832)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.51  % (3830)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.51  % (3852)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.51  % (3844)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.51  % (3831)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  % (3829)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.52  % (3837)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  % (3837)Instruction limit reached!
% 0.20/0.52  % (3837)------------------------------
% 0.20/0.52  % (3837)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (3837)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (3837)Termination reason: Unknown
% 0.20/0.52  % (3837)Termination phase: Naming
% 0.20/0.52  
% 0.20/0.52  % (3837)Memory used [KB]: 1023
% 0.20/0.52  % (3837)Time elapsed: 0.004 s
% 0.20/0.52  % (3837)Instructions burned: 3 (million)
% 0.20/0.52  % (3837)------------------------------
% 0.20/0.52  % (3837)------------------------------
% 0.20/0.52  % (3839)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.52  TRYING [1]
% 0.20/0.52  % (3846)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.53  % (3833)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  % (3850)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.53  % (3830)First to succeed.
% 0.20/0.53  % (3855)Also succeeded, but the first one will report.
% 0.20/0.53  TRYING [2]
% 0.20/0.54  % (3858)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.54  % (3853)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  % (3842)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.54  % (3856)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  % (3836)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.54  % (3854)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.54  % (3835)Instruction limit reached!
% 0.20/0.54  % (3835)------------------------------
% 0.20/0.54  % (3835)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (3845)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  % (3836)Instruction limit reached!
% 0.20/0.54  % (3836)------------------------------
% 0.20/0.54  % (3836)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (3836)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (3836)Termination reason: Unknown
% 0.20/0.54  % (3836)Termination phase: Function definition elimination
% 0.20/0.54  
% 0.20/0.54  % (3836)Memory used [KB]: 1279
% 0.20/0.54  % (3836)Time elapsed: 0.005 s
% 0.20/0.54  % (3836)Instructions burned: 8 (million)
% 0.20/0.54  % (3836)------------------------------
% 0.20/0.54  % (3836)------------------------------
% 0.20/0.55  % (3848)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.55  % (3835)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (3835)Termination reason: Unknown
% 0.20/0.55  % (3835)Termination phase: Finite model building SAT solving
% 0.20/0.55  
% 0.20/0.55  % (3835)Memory used [KB]: 7164
% 0.20/0.55  % (3835)Time elapsed: 0.132 s
% 0.20/0.55  % (3835)Instructions burned: 51 (million)
% 0.20/0.55  % (3835)------------------------------
% 0.20/0.55  % (3835)------------------------------
% 0.20/0.55  % (3840)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  % (3830)Refutation found. Thanks to Tanya!
% 0.20/0.56  % SZS status Theorem for theBenchmark
% 0.20/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56  % (3830)------------------------------
% 0.20/0.56  % (3830)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (3830)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (3830)Termination reason: Refutation
% 0.20/0.56  
% 0.20/0.56  % (3830)Memory used [KB]: 6140
% 0.20/0.56  % (3830)Time elapsed: 0.116 s
% 0.20/0.56  % (3830)Instructions burned: 22 (million)
% 0.20/0.56  % (3830)------------------------------
% 0.20/0.56  % (3830)------------------------------
% 0.20/0.56  % (3828)Success in time 0.189 s
%------------------------------------------------------------------------------