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

View Problem - Process Solution

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

% Result   : Theorem 2.21s 0.64s
% Output   : Refutation 2.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   68 (   9 unt;   0 def)
%            Number of atoms       :  371 ( 135 equ)
%            Maximal formula atoms :   32 (   5 avg)
%            Number of connectives :  463 ( 160   ~; 158   |; 121   &)
%                                         (   2 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   86 (  60   !;  26   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1296,plain,
    $false,
    inference(subsumption_resolution,[],[f1295,f1249]) ).

fof(f1249,plain,
    nil != sK38,
    inference(trivial_inequality_removal,[],[f1196]) ).

fof(f1196,plain,
    ( nil != sK38
    | nil != nil ),
    inference(backward_demodulation,[],[f500,f1185]) ).

fof(f1185,plain,
    nil = sK37,
    inference(subsumption_resolution,[],[f1184,f493]) ).

fof(f493,plain,
    ssList(sK37),
    inference(cnf_transformation,[],[f312]) ).

fof(f312,plain,
    ( ssList(sK38)
    & ! [X4] :
        ( ( ( ~ memberP(sK39,X4)
            | memberP(sK40,X4) )
          & ( ~ memberP(sK40,X4)
            | memberP(sK39,X4) ) )
        | ~ ssItem(X4) )
    & ssList(sK40)
    & ( ( nil != sK38
        & nil = sK37 )
      | ( nil = sK38
        & nil != sK37 ) )
    & duplicatefreeP(sK39)
    & sK39 = sK37
    & sK40 = sK38
    & ssList(sK39)
    & ssList(sK37) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK37,sK38,sK39,sK40])],[f186,f311,f310,f309,f308]) ).

fof(f308,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ? [X3] :
                    ( ! [X4] :
                        ( ( ( ~ memberP(X2,X4)
                            | memberP(X3,X4) )
                          & ( ~ memberP(X3,X4)
                            | memberP(X2,X4) ) )
                        | ~ ssItem(X4) )
                    & ssList(X3)
                    & ( ( nil != X1
                        & nil = X0 )
                      | ( nil = X1
                        & nil != X0 ) )
                    & duplicatefreeP(X2)
                    & X0 = X2
                    & X1 = X3 )
                & ssList(X2) ) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ! [X4] :
                      ( ( ( ~ memberP(X2,X4)
                          | memberP(X3,X4) )
                        & ( ~ memberP(X3,X4)
                          | memberP(X2,X4) ) )
                      | ~ ssItem(X4) )
                  & ssList(X3)
                  & ( ( nil != X1
                      & nil = sK37 )
                    | ( nil = X1
                      & nil != sK37 ) )
                  & duplicatefreeP(X2)
                  & sK37 = X2
                  & X1 = X3 )
              & ssList(X2) ) )
      & ssList(sK37) ) ),
    introduced(choice_axiom,[]) ).

fof(f309,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( ! [X4] :
                    ( ( ( ~ memberP(X2,X4)
                        | memberP(X3,X4) )
                      & ( ~ memberP(X3,X4)
                        | memberP(X2,X4) ) )
                    | ~ ssItem(X4) )
                & ssList(X3)
                & ( ( nil != X1
                    & nil = sK37 )
                  | ( nil = X1
                    & nil != sK37 ) )
                & duplicatefreeP(X2)
                & sK37 = X2
                & X1 = X3 )
            & ssList(X2) ) )
   => ( ssList(sK38)
      & ? [X2] :
          ( ? [X3] :
              ( ! [X4] :
                  ( ( ( ~ memberP(X2,X4)
                      | memberP(X3,X4) )
                    & ( ~ memberP(X3,X4)
                      | memberP(X2,X4) ) )
                  | ~ ssItem(X4) )
              & ssList(X3)
              & ( ( nil != sK38
                  & nil = sK37 )
                | ( nil = sK38
                  & nil != sK37 ) )
              & duplicatefreeP(X2)
              & sK37 = X2
              & sK38 = X3 )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f310,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ! [X4] :
                ( ( ( ~ memberP(X2,X4)
                    | memberP(X3,X4) )
                  & ( ~ memberP(X3,X4)
                    | memberP(X2,X4) ) )
                | ~ ssItem(X4) )
            & ssList(X3)
            & ( ( nil != sK38
                & nil = sK37 )
              | ( nil = sK38
                & nil != sK37 ) )
            & duplicatefreeP(X2)
            & sK37 = X2
            & sK38 = X3 )
        & ssList(X2) )
   => ( ? [X3] :
          ( ! [X4] :
              ( ( ( ~ memberP(sK39,X4)
                  | memberP(X3,X4) )
                & ( ~ memberP(X3,X4)
                  | memberP(sK39,X4) ) )
              | ~ ssItem(X4) )
          & ssList(X3)
          & ( ( nil != sK38
              & nil = sK37 )
            | ( nil = sK38
              & nil != sK37 ) )
          & duplicatefreeP(sK39)
          & sK39 = sK37
          & sK38 = X3 )
      & ssList(sK39) ) ),
    introduced(choice_axiom,[]) ).

fof(f311,plain,
    ( ? [X3] :
        ( ! [X4] :
            ( ( ( ~ memberP(sK39,X4)
                | memberP(X3,X4) )
              & ( ~ memberP(X3,X4)
                | memberP(sK39,X4) ) )
            | ~ ssItem(X4) )
        & ssList(X3)
        & ( ( nil != sK38
            & nil = sK37 )
          | ( nil = sK38
            & nil != sK37 ) )
        & duplicatefreeP(sK39)
        & sK39 = sK37
        & sK38 = X3 )
   => ( ! [X4] :
          ( ( ( ~ memberP(sK39,X4)
              | memberP(sK40,X4) )
            & ( ~ memberP(sK40,X4)
              | memberP(sK39,X4) ) )
          | ~ ssItem(X4) )
      & ssList(sK40)
      & ( ( nil != sK38
          & nil = sK37 )
        | ( nil = sK38
          & nil != sK37 ) )
      & duplicatefreeP(sK39)
      & sK39 = sK37
      & sK40 = sK38 ) ),
    introduced(choice_axiom,[]) ).

fof(f186,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ! [X4] :
                      ( ( ( ~ memberP(X2,X4)
                          | memberP(X3,X4) )
                        & ( ~ memberP(X3,X4)
                          | memberP(X2,X4) ) )
                      | ~ ssItem(X4) )
                  & ssList(X3)
                  & ( ( nil != X1
                      & nil = X0 )
                    | ( nil = X1
                      & nil != X0 ) )
                  & duplicatefreeP(X2)
                  & X0 = X2
                  & X1 = X3 )
              & ssList(X2) ) )
      & ssList(X0) ),
    inference(flattening,[],[f185]) ).

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

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

fof(f1184,plain,
    ( ~ ssList(sK37)
    | nil = sK37 ),
    inference(duplicate_literal_removal,[],[f1183]) ).

fof(f1183,plain,
    ( ~ ssList(sK37)
    | nil = sK37
    | nil = sK37 ),
    inference(resolution,[],[f1182,f445]) ).

fof(f445,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    inference(cnf_transformation,[],[f121]) ).

fof(f121,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ssList(tl(X0))
      | nil = X0 ),
    inference(flattening,[],[f120]) ).

fof(f120,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f24]) ).

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

fof(f1182,plain,
    ( ~ ssList(tl(sK37))
    | nil = sK37 ),
    inference(subsumption_resolution,[],[f1181,f493]) ).

fof(f1181,plain,
    ( nil = sK37
    | ~ ssList(sK37)
    | ~ ssList(tl(sK37)) ),
    inference(duplicate_literal_removal,[],[f1180]) ).

fof(f1180,plain,
    ( ~ ssList(sK37)
    | nil = sK37
    | ~ ssList(tl(sK37))
    | nil = sK37 ),
    inference(resolution,[],[f1178,f418]) ).

fof(f418,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    inference(cnf_transformation,[],[f100]) ).

fof(f100,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    inference(flattening,[],[f99]) ).

fof(f99,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f22,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => ssItem(hd(X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax22) ).

fof(f1178,plain,
    ( ~ ssItem(hd(sK37))
    | ~ ssList(tl(sK37))
    | nil = sK37 ),
    inference(subsumption_resolution,[],[f1175,f419]) ).

fof(f419,plain,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f106]) ).

fof(f106,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | ~ memberP(nil,X0) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f38,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ~ memberP(nil,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).

fof(f1175,plain,
    ( ~ ssItem(hd(sK37))
    | nil = sK37
    | memberP(nil,hd(sK37))
    | ~ ssList(tl(sK37)) ),
    inference(duplicate_literal_removal,[],[f1169]) ).

fof(f1169,plain,
    ( ~ ssItem(hd(sK37))
    | nil = sK37
    | memberP(nil,hd(sK37))
    | ~ ssItem(hd(sK37))
    | nil = sK37
    | ~ ssList(tl(sK37)) ),
    inference(resolution,[],[f1164,f601]) ).

fof(f601,plain,
    ! [X0] :
      ( ~ memberP(sK37,X0)
      | memberP(nil,X0)
      | ~ ssItem(X0)
      | nil = sK37 ),
    inference(superposition,[],[f560,f499]) ).

fof(f499,plain,
    ( nil = sK38
    | nil = sK37 ),
    inference(cnf_transformation,[],[f312]) ).

fof(f560,plain,
    ! [X4] :
      ( memberP(sK38,X4)
      | ~ ssItem(X4)
      | ~ memberP(sK37,X4) ),
    inference(definition_unfolding,[],[f504,f496,f495]) ).

fof(f495,plain,
    sK40 = sK38,
    inference(cnf_transformation,[],[f312]) ).

fof(f496,plain,
    sK39 = sK37,
    inference(cnf_transformation,[],[f312]) ).

fof(f504,plain,
    ! [X4] :
      ( ~ memberP(sK39,X4)
      | memberP(sK40,X4)
      | ~ ssItem(X4) ),
    inference(cnf_transformation,[],[f312]) ).

fof(f1164,plain,
    ( memberP(sK37,hd(sK37))
    | ~ ssItem(hd(sK37))
    | ~ ssList(tl(sK37))
    | nil = sK37 ),
    inference(superposition,[],[f594,f1160]) ).

fof(f1160,plain,
    ( cons(hd(sK37),tl(sK37)) = sK37
    | nil = sK37 ),
    inference(resolution,[],[f414,f493]) ).

fof(f414,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | nil = X0
      | cons(hd(X0),tl(X0)) = X0 ),
    inference(cnf_transformation,[],[f210]) ).

fof(f210,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | cons(hd(X0),tl(X0)) = X0
      | nil = X0 ),
    inference(flattening,[],[f209]) ).

fof(f209,plain,
    ! [X0] :
      ( cons(hd(X0),tl(X0)) = X0
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f78]) ).

fof(f78,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => cons(hd(X0),tl(X0)) = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).

fof(f594,plain,
    ! [X2,X1] :
      ( memberP(cons(X1,X2),X1)
      | ~ ssList(X2)
      | ~ ssItem(X1) ),
    inference(duplicate_literal_removal,[],[f565]) ).

fof(f565,plain,
    ! [X2,X1] :
      ( ~ ssItem(X1)
      | ~ ssList(X2)
      | memberP(cons(X1,X2),X1)
      | ~ ssItem(X1) ),
    inference(equality_resolution,[],[f352]) ).

fof(f352,plain,
    ! [X2,X0,X1] :
      ( ~ ssItem(X1)
      | memberP(cons(X1,X2),X0)
      | X0 != X1
      | ~ ssList(X2)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f233]) ).

fof(f233,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssItem(X1)
          | ! [X2] :
              ( ( ( memberP(cons(X1,X2),X0)
                  | ( X0 != X1
                    & ~ memberP(X2,X0) ) )
                & ( X0 = X1
                  | memberP(X2,X0)
                  | ~ memberP(cons(X1,X2),X0) ) )
              | ~ ssList(X2) ) )
      | ~ ssItem(X0) ),
    inference(flattening,[],[f232]) ).

fof(f232,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssItem(X1)
          | ! [X2] :
              ( ( ( memberP(cons(X1,X2),X0)
                  | ( X0 != X1
                    & ~ memberP(X2,X0) ) )
                & ( X0 = X1
                  | memberP(X2,X0)
                  | ~ memberP(cons(X1,X2),X0) ) )
              | ~ ssList(X2) ) )
      | ~ ssItem(X0) ),
    inference(nnf_transformation,[],[f148]) ).

fof(f148,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssItem(X1)
          | ! [X2] :
              ( ( memberP(cons(X1,X2),X0)
              <=> ( X0 = X1
                  | memberP(X2,X0) ) )
              | ~ ssList(X2) ) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f37,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ! [X2] :
              ( ssList(X2)
             => ( memberP(cons(X1,X2),X0)
              <=> ( X0 = X1
                  | memberP(X2,X0) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax37) ).

fof(f500,plain,
    ( nil != sK38
    | nil != sK37 ),
    inference(cnf_transformation,[],[f312]) ).

fof(f1295,plain,
    nil = sK38,
    inference(subsumption_resolution,[],[f1294,f505]) ).

fof(f505,plain,
    ssList(sK38),
    inference(cnf_transformation,[],[f312]) ).

fof(f1294,plain,
    ( ~ ssList(sK38)
    | nil = sK38 ),
    inference(resolution,[],[f1293,f445]) ).

fof(f1293,plain,
    ~ ssList(tl(sK38)),
    inference(subsumption_resolution,[],[f1292,f1249]) ).

fof(f1292,plain,
    ( ~ ssList(tl(sK38))
    | nil = sK38 ),
    inference(subsumption_resolution,[],[f1291,f505]) ).

fof(f1291,plain,
    ( ~ ssList(tl(sK38))
    | ~ ssList(sK38)
    | nil = sK38 ),
    inference(resolution,[],[f1290,f418]) ).

fof(f1290,plain,
    ( ~ ssItem(hd(sK38))
    | ~ ssList(tl(sK38)) ),
    inference(subsumption_resolution,[],[f1289,f1249]) ).

fof(f1289,plain,
    ( nil = sK38
    | ~ ssItem(hd(sK38))
    | ~ ssList(tl(sK38)) ),
    inference(duplicate_literal_removal,[],[f1288]) ).

fof(f1288,plain,
    ( nil = sK38
    | ~ ssItem(hd(sK38))
    | ~ ssItem(hd(sK38))
    | ~ ssList(tl(sK38)) ),
    inference(resolution,[],[f1251,f1166]) ).

fof(f1166,plain,
    ( memberP(sK38,hd(sK38))
    | ~ ssItem(hd(sK38))
    | ~ ssList(tl(sK38))
    | nil = sK38 ),
    inference(superposition,[],[f594,f1161]) ).

fof(f1161,plain,
    ( cons(hd(sK38),tl(sK38)) = sK38
    | nil = sK38 ),
    inference(resolution,[],[f414,f505]) ).

fof(f1251,plain,
    ! [X4] :
      ( ~ memberP(sK38,X4)
      | ~ ssItem(X4) ),
    inference(subsumption_resolution,[],[f1198,f419]) ).

fof(f1198,plain,
    ! [X4] :
      ( ~ memberP(sK38,X4)
      | ~ ssItem(X4)
      | memberP(nil,X4) ),
    inference(backward_demodulation,[],[f561,f1185]) ).

fof(f561,plain,
    ! [X4] :
      ( ~ memberP(sK38,X4)
      | ~ ssItem(X4)
      | memberP(sK37,X4) ),
    inference(definition_unfolding,[],[f503,f495,f496]) ).

fof(f503,plain,
    ! [X4] :
      ( ~ memberP(sK40,X4)
      | memberP(sK39,X4)
      | ~ ssItem(X4) ),
    inference(cnf_transformation,[],[f312]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWC025+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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 : n014.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:59:03 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.47  % (25456)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.48  % (25456)Instruction limit reached!
% 0.19/0.48  % (25456)------------------------------
% 0.19/0.48  % (25456)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48  % (25456)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48  % (25456)Termination reason: Unknown
% 0.19/0.48  % (25456)Termination phase: Property scanning
% 0.19/0.48  
% 0.19/0.48  % (25456)Memory used [KB]: 1279
% 0.19/0.48  % (25456)Time elapsed: 0.007 s
% 0.19/0.48  % (25456)Instructions burned: 9 (million)
% 0.19/0.48  % (25456)------------------------------
% 0.19/0.48  % (25456)------------------------------
% 0.19/0.48  % (25477)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.51  % (25462)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.52  % (25463)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.19/0.52  % (25468)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.19/0.52  % (25471)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.19/0.52  % (25475)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.19/0.52  % (25451)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.19/0.53  % (25454)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.19/0.53  % (25452)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.19/0.53  % (25476)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.19/0.53  % (25474)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.53  % (25455)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.19/0.53  % (25473)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.53  % (25453)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.54  % (25470)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.54  % (25449)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.19/0.54  % (25465)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.19/0.54  % (25461)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.19/0.54  % (25467)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.54  % (25466)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.54  % (25478)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.19/0.54  % (25458)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.19/0.54  % (25457)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.19/0.55  % (25460)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.19/0.55  % (25459)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.56  % (25479)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=388:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/388Mi)
% 0.19/0.56  % (25450)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.19/0.57  % (25457)Instruction limit reached!
% 0.19/0.57  % (25457)------------------------------
% 0.19/0.57  % (25457)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57  % (25457)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57  % (25457)Termination reason: Unknown
% 0.19/0.57  % (25457)Termination phase: Preprocessing 2
% 0.19/0.57  
% 0.19/0.57  % (25457)Memory used [KB]: 1023
% 0.19/0.57  % (25457)Time elapsed: 0.002 s
% 0.19/0.57  % (25457)Instructions burned: 2 (million)
% 0.19/0.57  % (25457)------------------------------
% 0.19/0.57  % (25457)------------------------------
% 0.19/0.57  % (25472)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.19/0.57  % (25469)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.19/0.58  % (25464)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)
% 1.77/0.58  TRYING [1]
% 1.77/0.58  TRYING [2]
% 1.77/0.59  TRYING [1]
% 1.77/0.59  TRYING [2]
% 1.77/0.60  TRYING [1]
% 1.77/0.60  TRYING [2]
% 1.90/0.60  % (25451)Instruction limit reached!
% 1.90/0.60  % (25451)------------------------------
% 1.90/0.60  % (25451)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.90/0.60  % (25451)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.90/0.60  % (25451)Termination reason: Unknown
% 1.90/0.60  % (25451)Termination phase: Saturation
% 1.90/0.60  
% 1.90/0.60  % (25451)Memory used [KB]: 1663
% 1.90/0.60  % (25451)Time elapsed: 0.191 s
% 1.90/0.60  % (25451)Instructions burned: 37 (million)
% 1.90/0.60  % (25451)------------------------------
% 1.90/0.60  % (25451)------------------------------
% 1.90/0.61  % (25450)Refutation not found, incomplete strategy% (25450)------------------------------
% 1.90/0.61  % (25450)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.90/0.61  % (25450)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.90/0.61  % (25450)Termination reason: Refutation not found, incomplete strategy
% 1.90/0.61  
% 1.90/0.61  % (25450)Memory used [KB]: 6012
% 1.90/0.61  % (25450)Time elapsed: 0.214 s
% 1.90/0.61  % (25450)Instructions burned: 19 (million)
% 1.90/0.61  % (25450)------------------------------
% 1.90/0.61  % (25450)------------------------------
% 1.90/0.61  TRYING [3]
% 1.90/0.61  % (25455)Instruction limit reached!
% 1.90/0.61  % (25455)------------------------------
% 1.90/0.61  % (25455)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.90/0.61  % (25455)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.90/0.61  % (25455)Termination reason: Unknown
% 1.90/0.61  % (25455)Termination phase: Finite model building constraint generation
% 1.90/0.61  
% 1.90/0.61  % (25454)Instruction limit reached!
% 1.90/0.61  % (25454)------------------------------
% 1.90/0.61  % (25454)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.90/0.61  % (25455)Memory used [KB]: 7547
% 1.90/0.61  % (25455)Time elapsed: 0.191 s
% 1.90/0.61  % (25454)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.90/0.61  % (25455)Instructions burned: 52 (million)
% 1.90/0.61  % (25454)Termination reason: Unknown
% 1.90/0.61  % (25455)------------------------------
% 1.90/0.61  % (25455)------------------------------
% 1.90/0.61  % (25454)Termination phase: Saturation
% 1.90/0.61  
% 1.90/0.61  % (25454)Memory used [KB]: 6396
% 1.90/0.61  % (25454)Time elapsed: 0.218 s
% 1.90/0.61  % (25454)Instructions burned: 49 (million)
% 1.90/0.61  % (25454)------------------------------
% 1.90/0.61  % (25454)------------------------------
% 1.90/0.61  % (25452)Instruction limit reached!
% 1.90/0.61  % (25452)------------------------------
% 1.90/0.61  % (25452)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.90/0.61  % (25452)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.90/0.61  % (25452)Termination reason: Unknown
% 1.90/0.61  % (25452)Termination phase: Saturation
% 1.90/0.61  
% 1.90/0.61  % (25452)Memory used [KB]: 6524
% 1.90/0.61  % (25452)Time elapsed: 0.216 s
% 1.90/0.61  % (25452)Instructions burned: 52 (million)
% 1.90/0.61  % (25452)------------------------------
% 1.90/0.61  % (25452)------------------------------
% 1.90/0.62  TRYING [3]
% 1.90/0.62  % (25453)Instruction limit reached!
% 1.90/0.62  % (25453)------------------------------
% 1.90/0.62  % (25453)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.90/0.62  % (25453)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.90/0.62  % (25453)Termination reason: Unknown
% 1.90/0.62  % (25453)Termination phase: Saturation
% 1.90/0.62  
% 1.90/0.62  % (25453)Memory used [KB]: 6780
% 1.90/0.62  % (25453)Time elapsed: 0.205 s
% 1.90/0.62  % (25453)Instructions burned: 51 (million)
% 1.90/0.62  % (25453)------------------------------
% 1.90/0.62  % (25453)------------------------------
% 1.90/0.62  TRYING [3]
% 1.90/0.62  % (25466)Instruction limit reached!
% 1.90/0.62  % (25466)------------------------------
% 1.90/0.62  % (25466)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.90/0.62  % (25466)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.90/0.62  % (25466)Termination reason: Unknown
% 1.90/0.62  % (25466)Termination phase: Finite model building constraint generation
% 1.90/0.62  
% 1.90/0.62  % (25466)Memory used [KB]: 7675
% 1.90/0.62  % (25466)Time elapsed: 0.228 s
% 1.90/0.62  % (25466)Instructions burned: 61 (million)
% 1.90/0.62  % (25466)------------------------------
% 1.90/0.62  % (25466)------------------------------
% 1.90/0.62  % (25458)Instruction limit reached!
% 1.90/0.62  % (25458)------------------------------
% 1.90/0.62  % (25458)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.90/0.62  % (25458)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.90/0.62  % (25458)Termination reason: Unknown
% 1.90/0.62  % (25458)Termination phase: Saturation
% 1.90/0.62  
% 1.90/0.62  % (25458)Memory used [KB]: 2302
% 1.90/0.62  % (25458)Time elapsed: 0.219 s
% 1.90/0.62  % (25458)Instructions burned: 53 (million)
% 1.90/0.62  % (25458)------------------------------
% 1.90/0.62  % (25458)------------------------------
% 1.90/0.63  % (25459)Instruction limit reached!
% 1.90/0.63  % (25459)------------------------------
% 1.90/0.63  % (25459)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.21/0.63  % (25471)First to succeed.
% 2.21/0.64  % (25459)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.21/0.64  % (25459)Termination reason: Unknown
% 2.21/0.64  % (25459)Termination phase: Saturation
% 2.21/0.64  
% 2.21/0.64  % (25459)Memory used [KB]: 6652
% 2.21/0.64  % (25459)Time elapsed: 0.221 s
% 2.21/0.64  % (25459)Instructions burned: 51 (million)
% 2.21/0.64  % (25459)------------------------------
% 2.21/0.64  % (25459)------------------------------
% 2.21/0.64  % (25471)Refutation found. Thanks to Tanya!
% 2.21/0.64  % SZS status Theorem for theBenchmark
% 2.21/0.64  % SZS output start Proof for theBenchmark
% See solution above
% 2.21/0.64  % (25471)------------------------------
% 2.21/0.64  % (25471)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.21/0.64  % (25471)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.21/0.64  % (25471)Termination reason: Refutation
% 2.21/0.64  
% 2.21/0.64  % (25471)Memory used [KB]: 1791
% 2.21/0.64  % (25471)Time elapsed: 0.207 s
% 2.21/0.64  % (25471)Instructions burned: 51 (million)
% 2.21/0.64  % (25471)------------------------------
% 2.21/0.64  % (25471)------------------------------
% 2.21/0.64  % (25448)Success in time 0.283 s
%------------------------------------------------------------------------------