TSTP Solution File: SWC264+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC264+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n015.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 : Tue May 21 04:37:34 EDT 2024

% Result   : Theorem 1.08s 0.86s
% Output   : Refutation 1.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   80 (  10 unt;   0 def)
%            Number of atoms       :  528 (  71 equ)
%            Maximal formula atoms :   17 (   6 avg)
%            Number of connectives :  671 ( 223   ~; 215   |; 186   &)
%                                         (  11 <=>;  36  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   8 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   4 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   4 con; 0-2 aty)
%            Number of variables   :  229 ( 139   !;  90   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1208,plain,
    $false,
    inference(avatar_sat_refutation,[],[f798,f803,f815,f1206]) ).

fof(f1206,plain,
    ( spl51_19
    | ~ spl51_20
    | ~ spl51_22 ),
    inference(avatar_contradiction_clause,[],[f1205]) ).

fof(f1205,plain,
    ( $false
    | spl51_19
    | ~ spl51_20
    | ~ spl51_22 ),
    inference(subsumption_resolution,[],[f1204,f797]) ).

fof(f797,plain,
    ( ~ totalorderedP(sK49)
    | spl51_19 ),
    inference(avatar_component_clause,[],[f795]) ).

fof(f795,plain,
    ( spl51_19
  <=> totalorderedP(sK49) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_19])]) ).

fof(f1204,plain,
    ( totalorderedP(sK49)
    | ~ spl51_20
    | ~ spl51_22 ),
    inference(subsumption_resolution,[],[f1200,f812]) ).

fof(f812,plain,
    ( ssList(sK49)
    | ~ spl51_22 ),
    inference(avatar_component_clause,[],[f810]) ).

fof(f810,plain,
    ( spl51_22
  <=> ssList(sK49) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_22])]) ).

fof(f1200,plain,
    ( ~ ssList(sK49)
    | totalorderedP(sK49)
    | ~ spl51_20 ),
    inference(resolution,[],[f1199,f802]) ).

fof(f802,plain,
    ( strictorderedP(sK49)
    | ~ spl51_20 ),
    inference(avatar_component_clause,[],[f800]) ).

fof(f800,plain,
    ( spl51_20
  <=> strictorderedP(sK49) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_20])]) ).

fof(f1199,plain,
    ! [X0] :
      ( ~ strictorderedP(X0)
      | ~ ssList(X0)
      | totalorderedP(X0) ),
    inference(subsumption_resolution,[],[f1109,f1160]) ).

fof(f1160,plain,
    ! [X0] :
      ( lt(sK24(X0),sK25(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(subsumption_resolution,[],[f1159,f610]) ).

fof(f610,plain,
    ! [X0] :
      ( ~ ssItem(sK24(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f385]) ).

fof(f385,plain,
    ! [X0] :
      ( totalorderedP(X0)
      | ssItem(sK24(X0))
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f279]) ).

fof(f279,plain,
    ! [X0] :
      ( ( ( totalorderedP(X0)
          | ( ~ leq(sK24(X0),sK25(X0))
            & app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),sK28(X0))) = X0
            & ssList(sK28(X0))
            & ssList(sK27(X0))
            & ssList(sK26(X0))
            & ssItem(sK25(X0))
            & ssItem(sK24(X0)) ) )
        & ( ! [X6] :
              ( ! [X7] :
                  ( ! [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( leq(X6,X7)
                              | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | ~ ssItem(X6) )
          | ~ totalorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK24,sK25,sK26,sK27,sK28])],[f273,f278,f277,f276,f275,f274]) ).

fof(f274,plain,
    ! [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ? [X4] :
                      ( ? [X5] :
                          ( ~ leq(X1,X2)
                          & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                          & ssList(X5) )
                      & ssList(X4) )
                  & ssList(X3) )
              & ssItem(X2) )
          & ssItem(X1) )
     => ( ? [X2] :
            ( ? [X3] :
                ( ? [X4] :
                    ( ? [X5] :
                        ( ~ leq(sK24(X0),X2)
                        & app(app(X3,cons(sK24(X0),X4)),cons(X2,X5)) = X0
                        & ssList(X5) )
                    & ssList(X4) )
                & ssList(X3) )
            & ssItem(X2) )
        & ssItem(sK24(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f275,plain,
    ! [X0] :
      ( ? [X2] :
          ( ? [X3] :
              ( ? [X4] :
                  ( ? [X5] :
                      ( ~ leq(sK24(X0),X2)
                      & app(app(X3,cons(sK24(X0),X4)),cons(X2,X5)) = X0
                      & ssList(X5) )
                  & ssList(X4) )
              & ssList(X3) )
          & ssItem(X2) )
     => ( ? [X3] :
            ( ? [X4] :
                ( ? [X5] :
                    ( ~ leq(sK24(X0),sK25(X0))
                    & app(app(X3,cons(sK24(X0),X4)),cons(sK25(X0),X5)) = X0
                    & ssList(X5) )
                & ssList(X4) )
            & ssList(X3) )
        & ssItem(sK25(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f276,plain,
    ! [X0] :
      ( ? [X3] :
          ( ? [X4] :
              ( ? [X5] :
                  ( ~ leq(sK24(X0),sK25(X0))
                  & app(app(X3,cons(sK24(X0),X4)),cons(sK25(X0),X5)) = X0
                  & ssList(X5) )
              & ssList(X4) )
          & ssList(X3) )
     => ( ? [X4] :
            ( ? [X5] :
                ( ~ leq(sK24(X0),sK25(X0))
                & app(app(sK26(X0),cons(sK24(X0),X4)),cons(sK25(X0),X5)) = X0
                & ssList(X5) )
            & ssList(X4) )
        & ssList(sK26(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f277,plain,
    ! [X0] :
      ( ? [X4] :
          ( ? [X5] :
              ( ~ leq(sK24(X0),sK25(X0))
              & app(app(sK26(X0),cons(sK24(X0),X4)),cons(sK25(X0),X5)) = X0
              & ssList(X5) )
          & ssList(X4) )
     => ( ? [X5] :
            ( ~ leq(sK24(X0),sK25(X0))
            & app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),X5)) = X0
            & ssList(X5) )
        & ssList(sK27(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f278,plain,
    ! [X0] :
      ( ? [X5] :
          ( ~ leq(sK24(X0),sK25(X0))
          & app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),X5)) = X0
          & ssList(X5) )
     => ( ~ leq(sK24(X0),sK25(X0))
        & app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),sK28(X0))) = X0
        & ssList(sK28(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f273,plain,
    ! [X0] :
      ( ( ( totalorderedP(X0)
          | ? [X1] :
              ( ? [X2] :
                  ( ? [X3] :
                      ( ? [X4] :
                          ( ? [X5] :
                              ( ~ leq(X1,X2)
                              & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                              & ssList(X5) )
                          & ssList(X4) )
                      & ssList(X3) )
                  & ssItem(X2) )
              & ssItem(X1) ) )
        & ( ! [X6] :
              ( ! [X7] :
                  ( ! [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( leq(X6,X7)
                              | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | ~ ssItem(X6) )
          | ~ totalorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f272]) ).

fof(f272,plain,
    ! [X0] :
      ( ( ( totalorderedP(X0)
          | ? [X1] :
              ( ? [X2] :
                  ( ? [X3] :
                      ( ? [X4] :
                          ( ? [X5] :
                              ( ~ leq(X1,X2)
                              & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                              & ssList(X5) )
                          & ssList(X4) )
                      & ssList(X3) )
                  & ssItem(X2) )
              & ssItem(X1) ) )
        & ( ! [X1] :
              ( ! [X2] :
                  ( ! [X3] :
                      ( ! [X4] :
                          ( ! [X5] :
                              ( leq(X1,X2)
                              | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                              | ~ ssList(X5) )
                          | ~ ssList(X4) )
                      | ~ ssList(X3) )
                  | ~ ssItem(X2) )
              | ~ ssItem(X1) )
          | ~ totalorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f111]) ).

fof(f111,plain,
    ! [X0] :
      ( ( totalorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( leq(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f110]) ).

fof(f110,plain,
    ! [X0] :
      ( ( totalorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( leq(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f11,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( totalorderedP(X0)
      <=> ! [X1] :
            ( ssItem(X1)
           => ! [X2] :
                ( ssItem(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ssList(X5)
                           => ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                             => leq(X1,X2) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax11) ).

fof(f1159,plain,
    ! [X0] :
      ( lt(sK24(X0),sK25(X0))
      | ssItem(sK24(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(subsumption_resolution,[],[f1156,f609]) ).

fof(f609,plain,
    ! [X0] :
      ( ~ ssItem(sK25(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f386]) ).

fof(f386,plain,
    ! [X0] :
      ( totalorderedP(X0)
      | ssItem(sK25(X0))
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f279]) ).

fof(f1156,plain,
    ! [X0] :
      ( lt(sK24(X0),sK25(X0))
      | ssItem(sK25(X0))
      | ssItem(sK24(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(resolution,[],[f695,f608]) ).

fof(f608,plain,
    ! [X0] :
      ( leq(sK24(X0),sK25(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f391]) ).

fof(f391,plain,
    ! [X0] :
      ( totalorderedP(X0)
      | ~ leq(sK24(X0),sK25(X0))
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f279]) ).

fof(f695,plain,
    ! [X0,X1] :
      ( ~ leq(X0,X1)
      | lt(X0,X1)
      | ssItem(X1)
      | ssItem(X0) ),
    inference(consistent_polarity_flipping,[],[f521]) ).

fof(f521,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | ~ lt(X0,X1)
      | ~ ssItem(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f329]) ).

fof(f329,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( lt(X0,X1)
              | ~ leq(X0,X1)
              | X0 = X1 )
            & ( ( leq(X0,X1)
                & X0 != X1 )
              | ~ lt(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(flattening,[],[f328]) ).

fof(f328,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( lt(X0,X1)
              | ~ leq(X0,X1)
              | X0 = X1 )
            & ( ( leq(X0,X1)
                & X0 != X1 )
              | ~ lt(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(nnf_transformation,[],[f216]) ).

fof(f216,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( lt(X0,X1)
          <=> ( leq(X0,X1)
              & X0 != X1 ) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f93]) ).

fof(f93,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ( lt(X0,X1)
          <=> ( leq(X0,X1)
              & X0 != X1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax93) ).

fof(f1109,plain,
    ! [X0] :
      ( ~ strictorderedP(X0)
      | ~ lt(sK24(X0),sK25(X0))
      | ~ ssList(X0)
      | totalorderedP(X0) ),
    inference(subsumption_resolution,[],[f1108,f610]) ).

fof(f1108,plain,
    ! [X0] :
      ( ~ strictorderedP(X0)
      | ssItem(sK24(X0))
      | ~ lt(sK24(X0),sK25(X0))
      | ~ ssList(X0)
      | totalorderedP(X0) ),
    inference(subsumption_resolution,[],[f1107,f609]) ).

fof(f1107,plain,
    ! [X0] :
      ( ~ strictorderedP(X0)
      | ssItem(sK25(X0))
      | ssItem(sK24(X0))
      | ~ lt(sK24(X0),sK25(X0))
      | ~ ssList(X0)
      | totalorderedP(X0) ),
    inference(subsumption_resolution,[],[f1106,f387]) ).

fof(f387,plain,
    ! [X0] :
      ( ssList(sK26(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f279]) ).

fof(f1106,plain,
    ! [X0] :
      ( ~ strictorderedP(X0)
      | ~ ssList(sK26(X0))
      | ssItem(sK25(X0))
      | ssItem(sK24(X0))
      | ~ lt(sK24(X0),sK25(X0))
      | ~ ssList(X0)
      | totalorderedP(X0) ),
    inference(subsumption_resolution,[],[f1105,f388]) ).

fof(f388,plain,
    ! [X0] :
      ( ssList(sK27(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f279]) ).

fof(f1105,plain,
    ! [X0] :
      ( ~ strictorderedP(X0)
      | ~ ssList(sK27(X0))
      | ~ ssList(sK26(X0))
      | ssItem(sK25(X0))
      | ssItem(sK24(X0))
      | ~ lt(sK24(X0),sK25(X0))
      | ~ ssList(X0)
      | totalorderedP(X0) ),
    inference(subsumption_resolution,[],[f1089,f389]) ).

fof(f389,plain,
    ! [X0] :
      ( ssList(sK28(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f279]) ).

fof(f1089,plain,
    ! [X0] :
      ( ~ strictorderedP(X0)
      | ~ ssList(sK28(X0))
      | ~ ssList(sK27(X0))
      | ~ ssList(sK26(X0))
      | ssItem(sK25(X0))
      | ssItem(sK24(X0))
      | ~ lt(sK24(X0),sK25(X0))
      | ~ ssList(X0)
      | totalorderedP(X0) ),
    inference(duplicate_literal_removal,[],[f1084]) ).

fof(f1084,plain,
    ! [X0] :
      ( ~ strictorderedP(X0)
      | ~ ssList(sK28(X0))
      | ~ ssList(sK27(X0))
      | ~ ssList(sK26(X0))
      | ssItem(sK25(X0))
      | ssItem(sK24(X0))
      | ~ lt(sK24(X0),sK25(X0))
      | ~ ssList(X0)
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(superposition,[],[f615,f390]) ).

fof(f390,plain,
    ! [X0] :
      ( app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),sK28(X0))) = X0
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f279]) ).

fof(f615,plain,
    ! [X10,X8,X6,X9,X7] :
      ( ~ strictorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
      | ~ ssList(X10)
      | ~ ssList(X9)
      | ~ ssList(X8)
      | ssItem(X7)
      | ssItem(X6)
      | ~ lt(X6,X7)
      | ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10))) ),
    inference(consistent_polarity_flipping,[],[f546]) ).

fof(f546,plain,
    ! [X10,X8,X6,X9,X7] :
      ( lt(X6,X7)
      | ~ ssList(X10)
      | ~ ssList(X9)
      | ~ ssList(X8)
      | ~ ssItem(X7)
      | ~ ssItem(X6)
      | ~ strictorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
      | ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10))) ),
    inference(equality_resolution,[],[f392]) ).

fof(f392,plain,
    ! [X10,X0,X8,X6,X9,X7] :
      ( lt(X6,X7)
      | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
      | ~ ssList(X10)
      | ~ ssList(X9)
      | ~ ssList(X8)
      | ~ ssItem(X7)
      | ~ ssItem(X6)
      | ~ strictorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f287]) ).

fof(f287,plain,
    ! [X0] :
      ( ( ( strictorderedP(X0)
          | ( ~ lt(sK29(X0),sK30(X0))
            & app(app(sK31(X0),cons(sK29(X0),sK32(X0))),cons(sK30(X0),sK33(X0))) = X0
            & ssList(sK33(X0))
            & ssList(sK32(X0))
            & ssList(sK31(X0))
            & ssItem(sK30(X0))
            & ssItem(sK29(X0)) ) )
        & ( ! [X6] :
              ( ! [X7] :
                  ( ! [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( lt(X6,X7)
                              | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | ~ ssItem(X6) )
          | ~ strictorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK29,sK30,sK31,sK32,sK33])],[f281,f286,f285,f284,f283,f282]) ).

fof(f282,plain,
    ! [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ? [X4] :
                      ( ? [X5] :
                          ( ~ lt(X1,X2)
                          & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                          & ssList(X5) )
                      & ssList(X4) )
                  & ssList(X3) )
              & ssItem(X2) )
          & ssItem(X1) )
     => ( ? [X2] :
            ( ? [X3] :
                ( ? [X4] :
                    ( ? [X5] :
                        ( ~ lt(sK29(X0),X2)
                        & app(app(X3,cons(sK29(X0),X4)),cons(X2,X5)) = X0
                        & ssList(X5) )
                    & ssList(X4) )
                & ssList(X3) )
            & ssItem(X2) )
        & ssItem(sK29(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f283,plain,
    ! [X0] :
      ( ? [X2] :
          ( ? [X3] :
              ( ? [X4] :
                  ( ? [X5] :
                      ( ~ lt(sK29(X0),X2)
                      & app(app(X3,cons(sK29(X0),X4)),cons(X2,X5)) = X0
                      & ssList(X5) )
                  & ssList(X4) )
              & ssList(X3) )
          & ssItem(X2) )
     => ( ? [X3] :
            ( ? [X4] :
                ( ? [X5] :
                    ( ~ lt(sK29(X0),sK30(X0))
                    & app(app(X3,cons(sK29(X0),X4)),cons(sK30(X0),X5)) = X0
                    & ssList(X5) )
                & ssList(X4) )
            & ssList(X3) )
        & ssItem(sK30(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f284,plain,
    ! [X0] :
      ( ? [X3] :
          ( ? [X4] :
              ( ? [X5] :
                  ( ~ lt(sK29(X0),sK30(X0))
                  & app(app(X3,cons(sK29(X0),X4)),cons(sK30(X0),X5)) = X0
                  & ssList(X5) )
              & ssList(X4) )
          & ssList(X3) )
     => ( ? [X4] :
            ( ? [X5] :
                ( ~ lt(sK29(X0),sK30(X0))
                & app(app(sK31(X0),cons(sK29(X0),X4)),cons(sK30(X0),X5)) = X0
                & ssList(X5) )
            & ssList(X4) )
        & ssList(sK31(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f285,plain,
    ! [X0] :
      ( ? [X4] :
          ( ? [X5] :
              ( ~ lt(sK29(X0),sK30(X0))
              & app(app(sK31(X0),cons(sK29(X0),X4)),cons(sK30(X0),X5)) = X0
              & ssList(X5) )
          & ssList(X4) )
     => ( ? [X5] :
            ( ~ lt(sK29(X0),sK30(X0))
            & app(app(sK31(X0),cons(sK29(X0),sK32(X0))),cons(sK30(X0),X5)) = X0
            & ssList(X5) )
        & ssList(sK32(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f286,plain,
    ! [X0] :
      ( ? [X5] :
          ( ~ lt(sK29(X0),sK30(X0))
          & app(app(sK31(X0),cons(sK29(X0),sK32(X0))),cons(sK30(X0),X5)) = X0
          & ssList(X5) )
     => ( ~ lt(sK29(X0),sK30(X0))
        & app(app(sK31(X0),cons(sK29(X0),sK32(X0))),cons(sK30(X0),sK33(X0))) = X0
        & ssList(sK33(X0)) ) ),
    introduced(choice_axiom,[]) ).

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

fof(f280,plain,
    ! [X0] :
      ( ( ( strictorderedP(X0)
          | ? [X1] :
              ( ? [X2] :
                  ( ? [X3] :
                      ( ? [X4] :
                          ( ? [X5] :
                              ( ~ lt(X1,X2)
                              & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                              & ssList(X5) )
                          & ssList(X4) )
                      & ssList(X3) )
                  & ssItem(X2) )
              & ssItem(X1) ) )
        & ( ! [X1] :
              ( ! [X2] :
                  ( ! [X3] :
                      ( ! [X4] :
                          ( ! [X5] :
                              ( lt(X1,X2)
                              | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                              | ~ ssList(X5) )
                          | ~ ssList(X4) )
                      | ~ ssList(X3) )
                  | ~ ssItem(X2) )
              | ~ ssItem(X1) )
          | ~ strictorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f113]) ).

fof(f113,plain,
    ! [X0] :
      ( ( strictorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( lt(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f112]) ).

fof(f112,plain,
    ! [X0] :
      ( ( strictorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( lt(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f12,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( strictorderedP(X0)
      <=> ! [X1] :
            ( ssItem(X1)
           => ! [X2] :
                ( ssItem(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ssList(X5)
                           => ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                             => lt(X1,X2) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax12) ).

fof(f815,plain,
    spl51_22,
    inference(avatar_split_clause,[],[f535,f810]) ).

fof(f535,plain,
    ssList(sK49),
    inference(definition_unfolding,[],[f525,f530]) ).

fof(f530,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f334]) ).

fof(f334,plain,
    ( ~ totalorderedP(sK47)
    & strictorderedP(sK49)
    & sK47 = sK49
    & sK48 = sK50
    & ssList(sK50)
    & ssList(sK49)
    & ssList(sK48)
    & ssList(sK47) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50])],[f221,f333,f332,f331,f330]) ).

fof(f330,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ~ totalorderedP(X0)
                    & strictorderedP(X2)
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ~ totalorderedP(sK47)
                  & strictorderedP(X2)
                  & sK47 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK47) ) ),
    introduced(choice_axiom,[]) ).

fof(f331,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ~ totalorderedP(sK47)
                & strictorderedP(X2)
                & sK47 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ~ totalorderedP(sK47)
              & strictorderedP(X2)
              & sK47 = X2
              & sK48 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK48) ) ),
    introduced(choice_axiom,[]) ).

fof(f332,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ~ totalorderedP(sK47)
            & strictorderedP(X2)
            & sK47 = X2
            & sK48 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ~ totalorderedP(sK47)
          & strictorderedP(sK49)
          & sK47 = sK49
          & sK48 = X3
          & ssList(X3) )
      & ssList(sK49) ) ),
    introduced(choice_axiom,[]) ).

fof(f333,plain,
    ( ? [X3] :
        ( ~ totalorderedP(sK47)
        & strictorderedP(sK49)
        & sK47 = sK49
        & sK48 = X3
        & ssList(X3) )
   => ( ~ totalorderedP(sK47)
      & strictorderedP(sK49)
      & sK47 = sK49
      & sK48 = sK50
      & ssList(sK50) ) ),
    introduced(choice_axiom,[]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ~ totalorderedP(X0)
                  & strictorderedP(X2)
                  & 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] :
                    ( totalorderedP(X0)
                    | ~ strictorderedP(X2)
                    | X0 != X2
                    | X1 != X3
                    | ~ ssList(X3) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( totalorderedP(X0)
                  | ~ strictorderedP(X2)
                  | X0 != X2
                  | X1 != X3
                  | ~ ssList(X3) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f525,plain,
    ssList(sK47),
    inference(cnf_transformation,[],[f334]) ).

fof(f803,plain,
    spl51_20,
    inference(avatar_split_clause,[],[f531,f800]) ).

fof(f531,plain,
    strictorderedP(sK49),
    inference(cnf_transformation,[],[f334]) ).

fof(f798,plain,
    ~ spl51_19,
    inference(avatar_split_clause,[],[f533,f795]) ).

fof(f533,plain,
    ~ totalorderedP(sK49),
    inference(definition_unfolding,[],[f532,f530]) ).

fof(f532,plain,
    ~ totalorderedP(sK47),
    inference(cnf_transformation,[],[f334]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC264+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35  % Computer : n015.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 03:28:08 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.56/0.75  % (2185)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.56/0.75  % (2178)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.56/0.75  % (2180)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.75  % (2182)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.56/0.75  % (2179)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.56/0.75  % (2183)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.56/0.75  % (2181)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.56/0.75  % (2184)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.56/0.75  % (2185)Refutation not found, incomplete strategy% (2185)------------------------------
% 0.56/0.75  % (2185)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75  % (2185)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75  
% 0.56/0.75  % (2185)Memory used [KB]: 1153
% 0.56/0.75  % (2185)Time elapsed: 0.003 s
% 0.56/0.75  % (2185)Instructions burned: 6 (million)
% 0.56/0.75  % (2185)------------------------------
% 0.56/0.75  % (2185)------------------------------
% 0.56/0.75  % (2183)Refutation not found, incomplete strategy% (2183)------------------------------
% 0.56/0.75  % (2183)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75  % (2183)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75  
% 0.56/0.75  % (2183)Memory used [KB]: 1146
% 0.56/0.75  % (2183)Time elapsed: 0.005 s
% 0.56/0.75  % (2183)Instructions burned: 6 (million)
% 0.56/0.75  % (2186)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.56/0.75  % (2183)------------------------------
% 0.56/0.75  % (2183)------------------------------
% 0.56/0.75  % (2181)Refutation not found, incomplete strategy% (2181)------------------------------
% 0.56/0.75  % (2181)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75  % (2181)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75  
% 0.56/0.75  % (2181)Memory used [KB]: 1151
% 0.56/0.75  % (2181)Time elapsed: 0.005 s
% 0.56/0.75  % (2181)Instructions burned: 6 (million)
% 0.56/0.75  % (2181)------------------------------
% 0.56/0.75  % (2181)------------------------------
% 0.56/0.76  % (2186)Refutation not found, incomplete strategy% (2186)------------------------------
% 0.56/0.76  % (2186)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.76  % (2186)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.76  
% 0.56/0.76  % (2186)Memory used [KB]: 1154
% 0.56/0.76  % (2186)Time elapsed: 0.003 s
% 0.56/0.76  % (2186)Instructions burned: 6 (million)
% 0.56/0.76  % (2186)------------------------------
% 0.56/0.76  % (2186)------------------------------
% 0.56/0.76  % (2187)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2996ds/50Mi)
% 0.56/0.76  % (2190)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2996ds/208Mi)
% 0.56/0.76  % (2182)Refutation not found, incomplete strategy% (2182)------------------------------
% 0.56/0.76  % (2182)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.76  % (2182)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.76  
% 0.56/0.76  % (2182)Memory used [KB]: 1507
% 0.56/0.76  % (2182)Time elapsed: 0.010 s
% 0.56/0.76  % (2182)Instructions burned: 17 (million)
% 0.56/0.76  % (2191)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2996ds/52Mi)
% 0.56/0.76  % (2182)------------------------------
% 0.56/0.76  % (2182)------------------------------
% 0.56/0.76  % (2192)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2996ds/518Mi)
% 0.56/0.77  % (2178)Instruction limit reached!
% 0.56/0.77  % (2178)------------------------------
% 0.56/0.77  % (2178)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.77  % (2178)Termination reason: Unknown
% 0.56/0.77  % (2178)Termination phase: Saturation
% 0.56/0.77  
% 0.56/0.77  % (2178)Memory used [KB]: 1384
% 0.56/0.77  % (2178)Time elapsed: 0.020 s
% 0.56/0.77  % (2178)Instructions burned: 34 (million)
% 0.56/0.77  % (2178)------------------------------
% 0.56/0.77  % (2178)------------------------------
% 0.56/0.77  % (2192)Refutation not found, incomplete strategy% (2192)------------------------------
% 0.56/0.77  % (2192)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.77  % (2192)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.77  
% 0.56/0.77  % (2192)Memory used [KB]: 1309
% 0.56/0.77  % (2192)Time elapsed: 0.008 s
% 0.56/0.77  % (2192)Instructions burned: 11 (million)
% 0.56/0.77  % (2192)------------------------------
% 0.56/0.77  % (2192)------------------------------
% 0.56/0.77  % (2193)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2996ds/42Mi)
% 0.56/0.77  % (2194)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on theBenchmark for (2995ds/243Mi)
% 0.56/0.78  % (2191)Instruction limit reached!
% 0.56/0.78  % (2191)------------------------------
% 0.56/0.78  % (2191)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.78  % (2191)Termination reason: Unknown
% 0.56/0.78  % (2191)Termination phase: Saturation
% 0.56/0.78  
% 0.56/0.78  % (2191)Memory used [KB]: 1987
% 0.56/0.78  % (2191)Time elapsed: 0.020 s
% 0.56/0.78  % (2191)Instructions burned: 53 (million)
% 0.56/0.78  % (2191)------------------------------
% 0.56/0.78  % (2191)------------------------------
% 0.56/0.78  % (2179)Instruction limit reached!
% 0.56/0.78  % (2179)------------------------------
% 0.56/0.78  % (2179)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.78  % (2179)Termination reason: Unknown
% 0.56/0.78  % (2179)Termination phase: Saturation
% 0.56/0.78  
% 0.56/0.78  % (2179)Memory used [KB]: 1742
% 0.56/0.78  % (2179)Time elapsed: 0.031 s
% 0.56/0.78  % (2179)Instructions burned: 51 (million)
% 0.56/0.78  % (2179)------------------------------
% 0.56/0.78  % (2179)------------------------------
% 0.56/0.78  % (2195)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on theBenchmark for (2995ds/117Mi)
% 0.71/0.78  % (2187)Instruction limit reached!
% 0.71/0.78  % (2187)------------------------------
% 0.71/0.78  % (2187)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.78  % (2187)Termination reason: Unknown
% 0.71/0.78  % (2187)Termination phase: Saturation
% 0.71/0.78  
% 0.71/0.78  % (2187)Memory used [KB]: 1930
% 0.71/0.78  % (2187)Time elapsed: 0.027 s
% 0.71/0.78  % (2187)Instructions burned: 51 (million)
% 0.71/0.78  % (2187)------------------------------
% 0.71/0.78  % (2187)------------------------------
% 0.71/0.78  % (2196)dis+1011_11:1_sil=2000:avsq=on:i=143:avsqr=1,16:ep=RS:rawr=on:aac=none:lsd=100:mep=off:fde=none:newcnf=on:bsr=unit_only_0 on theBenchmark for (2995ds/143Mi)
% 0.71/0.79  % (2197)lrs+1011_1:2_to=lpo:sil=8000:plsqc=1:plsq=on:plsqr=326,59:sp=weighted_frequency:plsql=on:nwc=10.0:newcnf=on:i=93:awrs=converge:awrsf=200:bd=off:ins=1:rawr=on:alpa=false:avsq=on:avsqr=1,16_0 on theBenchmark for (2995ds/93Mi)
% 0.71/0.79  % (2184)Instruction limit reached!
% 0.71/0.79  % (2184)------------------------------
% 0.71/0.79  % (2184)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.79  % (2184)Termination reason: Unknown
% 0.71/0.79  % (2184)Termination phase: Saturation
% 0.71/0.79  
% 0.71/0.79  % (2184)Memory used [KB]: 2129
% 0.71/0.79  % (2184)Time elapsed: 0.040 s
% 0.71/0.79  % (2184)Instructions burned: 84 (million)
% 0.71/0.79  % (2184)------------------------------
% 0.71/0.79  % (2184)------------------------------
% 0.71/0.79  % (2198)lrs+1666_1:1_sil=4000:sp=occurrence:sos=on:urr=on:newcnf=on:i=62:amm=off:ep=R:erd=off:nm=0:plsq=on:plsqr=14,1_0 on theBenchmark for (2995ds/62Mi)
% 0.71/0.80  % (2180)Instruction limit reached!
% 0.71/0.80  % (2180)------------------------------
% 0.71/0.80  % (2180)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.80  % (2180)Termination reason: Unknown
% 0.71/0.80  % (2180)Termination phase: Saturation
% 0.71/0.80  
% 0.71/0.80  % (2180)Memory used [KB]: 1961
% 0.71/0.80  % (2180)Time elapsed: 0.047 s
% 0.71/0.80  % (2180)Instructions burned: 79 (million)
% 0.71/0.80  % (2180)------------------------------
% 0.71/0.80  % (2180)------------------------------
% 0.71/0.80  % (2193)Instruction limit reached!
% 0.71/0.80  % (2193)------------------------------
% 0.71/0.80  % (2193)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.80  % (2193)Termination reason: Unknown
% 0.71/0.80  % (2193)Termination phase: Saturation
% 0.71/0.80  
% 0.71/0.80  % (2193)Memory used [KB]: 2002
% 0.71/0.80  % (2193)Time elapsed: 0.025 s
% 0.71/0.80  % (2193)Instructions burned: 42 (million)
% 0.71/0.80  % (2193)------------------------------
% 0.71/0.80  % (2193)------------------------------
% 0.71/0.80  % (2199)lrs+21_2461:262144_anc=none:drc=off:sil=2000:sp=occurrence:nwc=6.0:updr=off:st=3.0:i=32:sd=2:afp=4000:erml=3:nm=14:afq=2.0:uhcvi=on:ss=included:er=filter:abs=on:nicw=on:ile=on:sims=off:s2a=on:s2agt=50:s2at=-1.0:plsq=on:plsql=on:plsqc=2:plsqr=1,32:newcnf=on:bd=off:to=lpo_0 on theBenchmark for (2995ds/32Mi)
% 0.71/0.80  % (2200)dis+1011_1:1_sil=16000:nwc=7.0:s2agt=64:s2a=on:i=1919:ss=axioms:sgt=8:lsd=50:sd=7_0 on theBenchmark for (2995ds/1919Mi)
% 0.71/0.81  % (2195)Instruction limit reached!
% 0.71/0.81  % (2195)------------------------------
% 0.71/0.81  % (2195)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.81  % (2195)Termination reason: Unknown
% 0.71/0.81  % (2195)Termination phase: Saturation
% 0.71/0.81  
% 0.71/0.81  % (2195)Memory used [KB]: 1682
% 0.71/0.81  % (2195)Time elapsed: 0.032 s
% 0.71/0.81  % (2195)Instructions burned: 120 (million)
% 0.71/0.81  % (2195)------------------------------
% 0.71/0.81  % (2195)------------------------------
% 0.71/0.81  % (2201)ott-32_5:1_sil=4000:sp=occurrence:urr=full:rp=on:nwc=5.0:newcnf=on:st=5.0:s2pl=on:i=55:sd=2:ins=2:ss=included:rawr=on:anc=none:sos=on:s2agt=8:spb=intro:ep=RS:avsq=on:avsqr=27,155:lma=on_0 on theBenchmark for (2995ds/55Mi)
% 0.71/0.82  % (2199)Instruction limit reached!
% 0.71/0.82  % (2199)------------------------------
% 0.71/0.82  % (2199)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.82  % (2199)Termination reason: Unknown
% 0.71/0.82  % (2199)Termination phase: Saturation
% 0.71/0.82  
% 0.71/0.82  % (2199)Memory used [KB]: 1450
% 0.71/0.82  % (2199)Time elapsed: 0.042 s
% 0.71/0.82  % (2199)Instructions burned: 33 (million)
% 0.71/0.82  % (2199)------------------------------
% 0.71/0.82  % (2199)------------------------------
% 0.71/0.82  % (2202)lrs-1011_1:1_sil=2000:sos=on:urr=on:i=53:sd=1:bd=off:ins=3:av=off:ss=axioms:sgt=16:gsp=on:lsd=10_0 on theBenchmark for (2995ds/53Mi)
% 0.71/0.83  % (2202)Refutation not found, incomplete strategy% (2202)------------------------------
% 0.71/0.83  % (2202)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.83  % (2202)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.83  
% 0.71/0.83  % (2202)Memory used [KB]: 1159
% 0.71/0.83  % (2202)Time elapsed: 0.007 s
% 0.71/0.83  % (2202)Instructions burned: 8 (million)
% 0.71/0.83  % (2198)Instruction limit reached!
% 0.71/0.83  % (2198)------------------------------
% 0.71/0.83  % (2198)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.83  % (2198)Termination reason: Unknown
% 0.71/0.83  % (2198)Termination phase: Saturation
% 0.71/0.83  
% 0.71/0.83  % (2202)------------------------------
% 0.71/0.83  % (2202)------------------------------
% 0.71/0.83  % (2198)Memory used [KB]: 2282
% 0.71/0.83  % (2198)Time elapsed: 0.057 s
% 0.71/0.83  % (2198)Instructions burned: 62 (million)
% 0.71/0.83  % (2198)------------------------------
% 0.71/0.83  % (2198)------------------------------
% 0.71/0.83  % (2203)lrs+1011_6929:65536_anc=all_dependent:sil=2000:fde=none:plsqc=1:plsq=on:plsqr=19,8:plsql=on:nwc=3.0:i=46:afp=4000:ep=R:nm=3:fsr=off:afr=on:aer=off:gsp=on_0 on theBenchmark for (2995ds/46Mi)
% 0.71/0.83  % (2204)dis+10_3:31_sil=2000:sp=frequency:abs=on:acc=on:lcm=reverse:nwc=3.0:alpa=random:st=3.0:i=102:sd=1:nm=4:ins=1:aer=off:ss=axioms_0 on theBenchmark for (2995ds/102Mi)
% 0.71/0.83  % (2201)Instruction limit reached!
% 0.71/0.83  % (2201)------------------------------
% 0.71/0.83  % (2201)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.83  % (2201)Termination reason: Unknown
% 0.71/0.83  % (2201)Termination phase: Saturation
% 0.71/0.83  
% 0.71/0.83  % (2201)Memory used [KB]: 2423
% 0.71/0.83  % (2201)Time elapsed: 0.019 s
% 0.71/0.83  % (2201)Instructions burned: 58 (million)
% 0.71/0.83  % (2201)------------------------------
% 0.71/0.83  % (2201)------------------------------
% 0.71/0.83  % (2205)ott+1011_9:29_slsqr=3,2:sil=2000:tgt=ground:lsd=10:lcm=predicate:avsqc=4:slsq=on:avsq=on:i=35:s2at=4.0:add=large:sd=1:avsqr=1,16:aer=off:ss=axioms:sgt=100:rawr=on:s2a=on:sac=on:afp=1:nwc=10.0:nm=64:bd=preordered:abs=on:rnwc=on:er=filter:nicw=on:spb=non_intro:lma=on_0 on theBenchmark for (2995ds/35Mi)
% 0.71/0.84  % (2197)Instruction limit reached!
% 0.71/0.84  % (2197)------------------------------
% 0.71/0.84  % (2197)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.84  % (2197)Termination reason: Unknown
% 0.71/0.84  % (2197)Termination phase: Saturation
% 0.71/0.84  
% 0.71/0.84  % (2197)Memory used [KB]: 2076
% 0.71/0.84  % (2197)Time elapsed: 0.077 s
% 0.71/0.84  % (2197)Instructions burned: 93 (million)
% 0.71/0.84  % (2197)------------------------------
% 0.71/0.84  % (2197)------------------------------
% 0.71/0.85  % (2205)Instruction limit reached!
% 0.71/0.85  % (2205)------------------------------
% 0.71/0.85  % (2205)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.85  % (2205)Termination reason: Unknown
% 0.71/0.85  % (2205)Termination phase: Saturation
% 0.71/0.85  
% 0.71/0.85  % (2205)Memory used [KB]: 1549
% 0.71/0.85  % (2205)Time elapsed: 0.013 s
% 0.71/0.85  % (2205)Instructions burned: 35 (million)
% 0.71/0.85  % (2205)------------------------------
% 0.71/0.85  % (2205)------------------------------
% 0.71/0.85  % (2208)dis+1003_1:1024_sil=4000:urr=on:newcnf=on:i=87:av=off:fsr=off:bce=on_0 on theBenchmark for (2995ds/87Mi)
% 0.71/0.85  % (2210)dis+1010_12107:524288_anc=none:drc=encompass:sil=2000:bsd=on:rp=on:nwc=10.0:alpa=random:i=109:kws=precedence:awrs=decay:awrsf=2:nm=16:ins=3:rawr=on:s2a=on:s2at=4.5:acc=on:flr=on_0 on theBenchmark for (2995ds/109Mi)
% 0.71/0.86  % (2203)Instruction limit reached!
% 0.71/0.86  % (2203)------------------------------
% 0.71/0.86  % (2203)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.86  % (2203)Termination reason: Unknown
% 0.71/0.86  % (2203)Termination phase: Saturation
% 0.71/0.86  
% 0.71/0.86  % (2203)Memory used [KB]: 2159
% 0.71/0.86  % (2203)Time elapsed: 0.031 s
% 0.71/0.86  % (2203)Instructions burned: 46 (million)
% 0.71/0.86  % (2203)------------------------------
% 0.71/0.86  % (2203)------------------------------
% 0.71/0.86  % (2210)First to succeed.
% 1.08/0.86  % (2210)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2177"
% 1.08/0.86  % (2210)Refutation found. Thanks to Tanya!
% 1.08/0.86  % SZS status Theorem for theBenchmark
% 1.08/0.86  % SZS output start Proof for theBenchmark
% See solution above
% 1.08/0.86  % (2210)------------------------------
% 1.08/0.86  % (2210)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.08/0.86  % (2210)Termination reason: Refutation
% 1.08/0.86  
% 1.08/0.86  % (2210)Memory used [KB]: 1662
% 1.08/0.86  % (2210)Time elapsed: 0.014 s
% 1.08/0.86  % (2210)Instructions burned: 43 (million)
% 1.08/0.86  % (2177)Success in time 0.506 s
% 1.08/0.86  % Vampire---4.8 exiting
%------------------------------------------------------------------------------