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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC395+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/sandbox2/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:38:40 EDT 2024

% Result   : Theorem 0.63s 0.85s
% Output   : Refutation 0.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   31
% Syntax   : Number of formulae    :  152 (  16 unt;   0 def)
%            Number of atoms       :  807 ( 193 equ)
%            Maximal formula atoms :   46 (   5 avg)
%            Number of connectives : 1090 ( 435   ~; 468   |; 137   &)
%                                         (  17 <=>;  33  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   17 (  15 usr;  12 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;  10 con; 0-2 aty)
%            Number of variables   :  193 ( 151   !;  42   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1466,plain,
    $false,
    inference(avatar_sat_refutation,[],[f284,f293,f296,f320,f323,f330,f333,f349,f354,f1327,f1415,f1465]) ).

fof(f1465,plain,
    ( ~ spl17_3
    | ~ spl17_5
    | spl17_9
    | ~ spl17_31 ),
    inference(avatar_contradiction_clause,[],[f1464]) ).

fof(f1464,plain,
    ( $false
    | ~ spl17_3
    | ~ spl17_5
    | spl17_9
    | ~ spl17_31 ),
    inference(subsumption_resolution,[],[f1463,f177]) ).

fof(f177,plain,
    ssItem(sK4),
    inference(cnf_transformation,[],[f147]) ).

fof(f147,plain,
    ( ( ~ neq(sK3,nil)
      | ! [X4] :
          ( ! [X5] :
              ( ! [X6] :
                  ( ~ neq(nil,sK3)
                  | ! [X7] :
                      ( ~ neq(nil,sK3)
                      | hd(sK3) != X7
                      | cons(X7,nil) != X6
                      | ~ ssItem(X7) )
                  | app(X5,X6) != X4
                  | tl(sK3) != X5
                  | ~ ssList(X6) )
              | ~ ssList(X5) )
          | sK2 = X4
          | ~ ssList(X4) ) )
    & ( nil != sK3
      | nil = sK2 )
    & ~ memberP(sK1,sK4)
    & memberP(sK0,sK4)
    & ssItem(sK4)
    & sK0 = sK2
    & sK1 = sK3
    & ssList(sK3)
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f146,f145,f144,f143,f142]) ).

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

fof(f143,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( ~ neq(X3,nil)
                  | ! [X4] :
                      ( ! [X5] :
                          ( ! [X6] :
                              ( ~ neq(nil,X3)
                              | ! [X7] :
                                  ( ~ neq(nil,X3)
                                  | hd(X3) != X7
                                  | cons(X7,nil) != X6
                                  | ~ ssItem(X7) )
                              | app(X5,X6) != X4
                              | tl(X3) != X5
                              | ~ ssList(X6) )
                          | ~ ssList(X5) )
                      | X2 = X4
                      | ~ ssList(X4) ) )
                & ( nil != X3
                  | nil = X2 )
                & ? [X8] :
                    ( ~ memberP(X1,X8)
                    & memberP(sK0,X8)
                    & ssItem(X8) )
                & sK0 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( ~ neq(X3,nil)
                | ! [X4] :
                    ( ! [X5] :
                        ( ! [X6] :
                            ( ~ neq(nil,X3)
                            | ! [X7] :
                                ( ~ neq(nil,X3)
                                | hd(X3) != X7
                                | cons(X7,nil) != X6
                                | ~ ssItem(X7) )
                            | app(X5,X6) != X4
                            | tl(X3) != X5
                            | ~ ssList(X6) )
                        | ~ ssList(X5) )
                    | X2 = X4
                    | ~ ssList(X4) ) )
              & ( nil != X3
                | nil = X2 )
              & ? [X8] :
                  ( ~ memberP(sK1,X8)
                  & memberP(sK0,X8)
                  & ssItem(X8) )
              & sK0 = X2
              & sK1 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f144,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ~ neq(X3,nil)
              | ! [X4] :
                  ( ! [X5] :
                      ( ! [X6] :
                          ( ~ neq(nil,X3)
                          | ! [X7] :
                              ( ~ neq(nil,X3)
                              | hd(X3) != X7
                              | cons(X7,nil) != X6
                              | ~ ssItem(X7) )
                          | app(X5,X6) != X4
                          | tl(X3) != X5
                          | ~ ssList(X6) )
                      | ~ ssList(X5) )
                  | X2 = X4
                  | ~ ssList(X4) ) )
            & ( nil != X3
              | nil = X2 )
            & ? [X8] :
                ( ~ memberP(sK1,X8)
                & memberP(sK0,X8)
                & ssItem(X8) )
            & sK0 = X2
            & sK1 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ~ neq(X3,nil)
            | ! [X4] :
                ( ! [X5] :
                    ( ! [X6] :
                        ( ~ neq(nil,X3)
                        | ! [X7] :
                            ( ~ neq(nil,X3)
                            | hd(X3) != X7
                            | cons(X7,nil) != X6
                            | ~ ssItem(X7) )
                        | app(X5,X6) != X4
                        | tl(X3) != X5
                        | ~ ssList(X6) )
                    | ~ ssList(X5) )
                | sK2 = X4
                | ~ ssList(X4) ) )
          & ( nil != X3
            | nil = sK2 )
          & ? [X8] :
              ( ~ memberP(sK1,X8)
              & memberP(sK0,X8)
              & ssItem(X8) )
          & sK0 = sK2
          & sK1 = X3
          & ssList(X3) )
      & ssList(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f145,plain,
    ( ? [X3] :
        ( ( ~ neq(X3,nil)
          | ! [X4] :
              ( ! [X5] :
                  ( ! [X6] :
                      ( ~ neq(nil,X3)
                      | ! [X7] :
                          ( ~ neq(nil,X3)
                          | hd(X3) != X7
                          | cons(X7,nil) != X6
                          | ~ ssItem(X7) )
                      | app(X5,X6) != X4
                      | tl(X3) != X5
                      | ~ ssList(X6) )
                  | ~ ssList(X5) )
              | sK2 = X4
              | ~ ssList(X4) ) )
        & ( nil != X3
          | nil = sK2 )
        & ? [X8] :
            ( ~ memberP(sK1,X8)
            & memberP(sK0,X8)
            & ssItem(X8) )
        & sK0 = sK2
        & sK1 = X3
        & ssList(X3) )
   => ( ( ~ neq(sK3,nil)
        | ! [X4] :
            ( ! [X5] :
                ( ! [X6] :
                    ( ~ neq(nil,sK3)
                    | ! [X7] :
                        ( ~ neq(nil,sK3)
                        | hd(sK3) != X7
                        | cons(X7,nil) != X6
                        | ~ ssItem(X7) )
                    | app(X5,X6) != X4
                    | tl(sK3) != X5
                    | ~ ssList(X6) )
                | ~ ssList(X5) )
            | sK2 = X4
            | ~ ssList(X4) ) )
      & ( nil != sK3
        | nil = sK2 )
      & ? [X8] :
          ( ~ memberP(sK1,X8)
          & memberP(sK0,X8)
          & ssItem(X8) )
      & sK0 = sK2
      & sK1 = sK3
      & ssList(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f146,plain,
    ( ? [X8] :
        ( ~ memberP(sK1,X8)
        & memberP(sK0,X8)
        & ssItem(X8) )
   => ( ~ memberP(sK1,sK4)
      & memberP(sK0,sK4)
      & ssItem(sK4) ) ),
    introduced(choice_axiom,[]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ~ neq(X3,nil)
                    | ! [X4] :
                        ( ! [X5] :
                            ( ! [X6] :
                                ( ~ neq(nil,X3)
                                | ! [X7] :
                                    ( ~ neq(nil,X3)
                                    | hd(X3) != X7
                                    | cons(X7,nil) != X6
                                    | ~ ssItem(X7) )
                                | app(X5,X6) != X4
                                | tl(X3) != X5
                                | ~ ssList(X6) )
                            | ~ ssList(X5) )
                        | X2 = X4
                        | ~ ssList(X4) ) )
                  & ( nil != X3
                    | nil = X2 )
                  & ? [X8] :
                      ( ~ memberP(X1,X8)
                      & memberP(X0,X8)
                      & ssItem(X8) )
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f98]) ).

fof(f98,plain,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ( neq(X3,nil)
                      & ? [X4] :
                          ( ? [X5] :
                              ( ? [X6] :
                                  ( neq(nil,X3)
                                  & ? [X7] :
                                      ( neq(nil,X3)
                                      & hd(X3) = X7
                                      & cons(X7,nil) = X6
                                      & ssItem(X7) )
                                  & app(X5,X6) = X4
                                  & tl(X3) = X5
                                  & ssList(X6) )
                              & ssList(X5) )
                          & X2 != X4
                          & ssList(X4) ) )
                    | ( nil = X3
                      & nil != X2 )
                    | ! [X8] :
                        ( memberP(X1,X8)
                        | ~ memberP(X0,X8)
                        | ~ ssItem(X8) )
                    | X0 != X2
                    | X1 != X3
                    | ~ ssList(X3) ) ) ) ),
    inference(rectify,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ( neq(X3,nil)
                      & ? [X5] :
                          ( ? [X6] :
                              ( ? [X7] :
                                  ( neq(nil,X3)
                                  & ? [X8] :
                                      ( neq(nil,X3)
                                      & hd(X3) = X8
                                      & cons(X8,nil) = X7
                                      & ssItem(X8) )
                                  & app(X6,X7) = X5
                                  & tl(X3) = X6
                                  & ssList(X7) )
                              & ssList(X6) )
                          & X2 != X5
                          & ssList(X5) ) )
                    | ( nil = X3
                      & nil != X2 )
                    | ! [X4] :
                        ( memberP(X1,X4)
                        | ~ memberP(X0,X4)
                        | ~ ssItem(X4) )
                    | X0 != X2
                    | X1 != X3
                    | ~ ssList(X3) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

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

fof(f1463,plain,
    ( ~ ssItem(sK4)
    | ~ spl17_3
    | ~ spl17_5
    | spl17_9
    | ~ spl17_31 ),
    inference(subsumption_resolution,[],[f1461,f232]) ).

fof(f232,plain,
    ~ memberP(sK3,sK4),
    inference(definition_unfolding,[],[f179,f175]) ).

fof(f175,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f147]) ).

fof(f179,plain,
    ~ memberP(sK1,sK4),
    inference(cnf_transformation,[],[f147]) ).

fof(f1461,plain,
    ( memberP(sK3,sK4)
    | ~ ssItem(sK4)
    | ~ spl17_3
    | ~ spl17_5
    | spl17_9
    | ~ spl17_31 ),
    inference(resolution,[],[f1326,f510]) ).

fof(f510,plain,
    ( ! [X0] :
        ( ~ memberP(sF15,X0)
        | memberP(sK3,X0)
        | ~ ssItem(X0) )
    | ~ spl17_3
    | ~ spl17_5
    | spl17_9 ),
    inference(subsumption_resolution,[],[f509,f274]) ).

fof(f274,plain,
    ( ssItem(sF13)
    | ~ spl17_5 ),
    inference(avatar_component_clause,[],[f273]) ).

fof(f273,plain,
    ( spl17_5
  <=> ssItem(sF13) ),
    introduced(avatar_definition,[new_symbols(naming,[spl17_5])]) ).

fof(f509,plain,
    ( ! [X0] :
        ( memberP(sK3,X0)
        | ~ memberP(sF15,X0)
        | ~ ssItem(sF13)
        | ~ ssItem(X0) )
    | ~ spl17_3
    | spl17_9 ),
    inference(subsumption_resolution,[],[f506,f266]) ).

fof(f266,plain,
    ( ssList(sF15)
    | ~ spl17_3 ),
    inference(avatar_component_clause,[],[f265]) ).

fof(f265,plain,
    ( spl17_3
  <=> ssList(sF15) ),
    introduced(avatar_definition,[new_symbols(naming,[spl17_3])]) ).

fof(f506,plain,
    ( ! [X0] :
        ( memberP(sK3,X0)
        | ~ memberP(sF15,X0)
        | ~ ssList(sF15)
        | ~ ssItem(sF13)
        | ~ ssItem(X0) )
    | spl17_9 ),
    inference(superposition,[],[f219,f413]) ).

fof(f413,plain,
    ( sK3 = cons(sF13,sF15)
    | spl17_9 ),
    inference(forward_demodulation,[],[f412,f248]) ).

fof(f248,plain,
    tl(sK3) = sF15,
    introduced(function_definition,[new_symbols(definition,[sF15])]) ).

fof(f412,plain,
    ( sK3 = cons(sF13,tl(sK3))
    | spl17_9 ),
    inference(subsumption_resolution,[],[f411,f174]) ).

fof(f174,plain,
    ssList(sK3),
    inference(cnf_transformation,[],[f147]) ).

fof(f411,plain,
    ( sK3 = cons(sF13,tl(sK3))
    | ~ ssList(sK3)
    | spl17_9 ),
    inference(subsumption_resolution,[],[f401,f292]) ).

fof(f292,plain,
    ( nil != sK3
    | spl17_9 ),
    inference(avatar_component_clause,[],[f290]) ).

fof(f290,plain,
    ( spl17_9
  <=> nil = sK3 ),
    introduced(avatar_definition,[new_symbols(naming,[spl17_9])]) ).

fof(f401,plain,
    ( sK3 = cons(sF13,tl(sK3))
    | nil = sK3
    | ~ ssList(sK3) ),
    inference(superposition,[],[f210,f246]) ).

fof(f246,plain,
    hd(sK3) = sF13,
    introduced(function_definition,[new_symbols(definition,[sF13])]) ).

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

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

fof(f122,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(f219,plain,
    ! [X2,X0,X1] :
      ( memberP(cons(X1,X2),X0)
      | ~ memberP(X2,X0)
      | ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f161]) ).

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

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

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

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

fof(f1326,plain,
    ( memberP(sF15,sK4)
    | ~ spl17_31 ),
    inference(avatar_component_clause,[],[f1324]) ).

fof(f1324,plain,
    ( spl17_31
  <=> memberP(sF15,sK4) ),
    introduced(avatar_definition,[new_symbols(naming,[spl17_31])]) ).

fof(f1415,plain,
    ( ~ spl17_3
    | ~ spl17_5
    | spl17_9
    | ~ spl17_30 ),
    inference(avatar_contradiction_clause,[],[f1414]) ).

fof(f1414,plain,
    ( $false
    | ~ spl17_3
    | ~ spl17_5
    | spl17_9
    | ~ spl17_30 ),
    inference(subsumption_resolution,[],[f1405,f232]) ).

fof(f1405,plain,
    ( memberP(sK3,sK4)
    | ~ spl17_3
    | ~ spl17_5
    | spl17_9
    | ~ spl17_30 ),
    inference(superposition,[],[f438,f1358]) ).

fof(f1358,plain,
    ( sK4 = sF13
    | ~ spl17_5
    | ~ spl17_30 ),
    inference(subsumption_resolution,[],[f1356,f177]) ).

fof(f1356,plain,
    ( sK4 = sF13
    | ~ ssItem(sK4)
    | ~ spl17_5
    | ~ spl17_30 ),
    inference(resolution,[],[f1322,f892]) ).

fof(f892,plain,
    ( ! [X0] :
        ( ~ memberP(sF14,X0)
        | sF13 = X0
        | ~ ssItem(X0) )
    | ~ spl17_5 ),
    inference(subsumption_resolution,[],[f891,f216]) ).

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

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

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

fof(f891,plain,
    ( ! [X0] :
        ( ~ memberP(sF14,X0)
        | sF13 = X0
        | memberP(nil,X0)
        | ~ ssItem(X0) )
    | ~ spl17_5 ),
    inference(subsumption_resolution,[],[f890,f274]) ).

fof(f890,plain,
    ! [X0] :
      ( ~ memberP(sF14,X0)
      | sF13 = X0
      | memberP(nil,X0)
      | ~ ssItem(sF13)
      | ~ ssItem(X0) ),
    inference(subsumption_resolution,[],[f880,f208]) ).

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

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

fof(f880,plain,
    ! [X0] :
      ( ~ memberP(sF14,X0)
      | sF13 = X0
      | memberP(nil,X0)
      | ~ ssList(nil)
      | ~ ssItem(sF13)
      | ~ ssItem(X0) ),
    inference(superposition,[],[f217,f247]) ).

fof(f247,plain,
    cons(sF13,nil) = sF14,
    introduced(function_definition,[new_symbols(definition,[sF14])]) ).

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

fof(f1322,plain,
    ( memberP(sF14,sK4)
    | ~ spl17_30 ),
    inference(avatar_component_clause,[],[f1320]) ).

fof(f1320,plain,
    ( spl17_30
  <=> memberP(sF14,sK4) ),
    introduced(avatar_definition,[new_symbols(naming,[spl17_30])]) ).

fof(f438,plain,
    ( memberP(sK3,sF13)
    | ~ spl17_3
    | ~ spl17_5
    | spl17_9 ),
    inference(subsumption_resolution,[],[f437,f274]) ).

fof(f437,plain,
    ( memberP(sK3,sF13)
    | ~ ssItem(sF13)
    | ~ spl17_3
    | spl17_9 ),
    inference(subsumption_resolution,[],[f433,f266]) ).

fof(f433,plain,
    ( memberP(sK3,sF13)
    | ~ ssList(sF15)
    | ~ ssItem(sF13)
    | spl17_9 ),
    inference(superposition,[],[f251,f413]) ).

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

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

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

fof(f1327,plain,
    ( spl17_30
    | spl17_31
    | ~ spl17_2
    | ~ spl17_3
    | ~ spl17_4 ),
    inference(avatar_split_clause,[],[f1318,f269,f265,f261,f1324,f1320]) ).

fof(f261,plain,
    ( spl17_2
  <=> sK2 = sF16 ),
    introduced(avatar_definition,[new_symbols(naming,[spl17_2])]) ).

fof(f269,plain,
    ( spl17_4
  <=> ssList(sF14) ),
    introduced(avatar_definition,[new_symbols(naming,[spl17_4])]) ).

fof(f1318,plain,
    ( memberP(sF15,sK4)
    | memberP(sF14,sK4)
    | ~ spl17_2
    | ~ spl17_3
    | ~ spl17_4 ),
    inference(subsumption_resolution,[],[f1313,f177]) ).

fof(f1313,plain,
    ( memberP(sF15,sK4)
    | memberP(sF14,sK4)
    | ~ ssItem(sK4)
    | ~ spl17_2
    | ~ spl17_3
    | ~ spl17_4 ),
    inference(resolution,[],[f943,f233]) ).

fof(f233,plain,
    memberP(sK2,sK4),
    inference(definition_unfolding,[],[f178,f176]) ).

fof(f176,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f147]) ).

fof(f178,plain,
    memberP(sK0,sK4),
    inference(cnf_transformation,[],[f147]) ).

fof(f943,plain,
    ( ! [X0] :
        ( ~ memberP(sK2,X0)
        | memberP(sF15,X0)
        | memberP(sF14,X0)
        | ~ ssItem(X0) )
    | ~ spl17_2
    | ~ spl17_3
    | ~ spl17_4 ),
    inference(forward_demodulation,[],[f942,f263]) ).

fof(f263,plain,
    ( sK2 = sF16
    | ~ spl17_2 ),
    inference(avatar_component_clause,[],[f261]) ).

fof(f942,plain,
    ( ! [X0] :
        ( ~ memberP(sF16,X0)
        | memberP(sF15,X0)
        | memberP(sF14,X0)
        | ~ ssItem(X0) )
    | ~ spl17_3
    | ~ spl17_4 ),
    inference(subsumption_resolution,[],[f941,f266]) ).

fof(f941,plain,
    ( ! [X0] :
        ( ~ memberP(sF16,X0)
        | memberP(sF15,X0)
        | memberP(sF14,X0)
        | ~ ssList(sF15)
        | ~ ssItem(X0) )
    | ~ spl17_4 ),
    inference(subsumption_resolution,[],[f925,f270]) ).

fof(f270,plain,
    ( ssList(sF14)
    | ~ spl17_4 ),
    inference(avatar_component_clause,[],[f269]) ).

fof(f925,plain,
    ! [X0] :
      ( ~ memberP(sF16,X0)
      | memberP(sF15,X0)
      | memberP(sF14,X0)
      | ~ ssList(sF14)
      | ~ ssList(sF15)
      | ~ ssItem(X0) ),
    inference(superposition,[],[f220,f249]) ).

fof(f249,plain,
    app(sF15,sF14) = sF16,
    introduced(function_definition,[new_symbols(definition,[sF16])]) ).

fof(f220,plain,
    ! [X2,X0,X1] :
      ( ~ memberP(app(X1,X2),X0)
      | memberP(X1,X0)
      | memberP(X2,X0)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f163]) ).

fof(f163,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( memberP(app(X1,X2),X0)
                  | ( ~ memberP(X2,X0)
                    & ~ memberP(X1,X0) ) )
                & ( memberP(X2,X0)
                  | memberP(X1,X0)
                  | ~ memberP(app(X1,X2),X0) ) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssItem(X0) ),
    inference(flattening,[],[f162]) ).

fof(f162,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( memberP(app(X1,X2),X0)
                  | ( ~ memberP(X2,X0)
                    & ~ memberP(X1,X0) ) )
                & ( memberP(X2,X0)
                  | memberP(X1,X0)
                  | ~ memberP(app(X1,X2),X0) ) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssItem(X0) ),
    inference(nnf_transformation,[],[f133]) ).

fof(f133,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( memberP(app(X1,X2),X0)
              <=> ( memberP(X2,X0)
                  | memberP(X1,X0) ) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f36]) ).

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

fof(f354,plain,
    ( spl17_7
    | spl17_9 ),
    inference(avatar_contradiction_clause,[],[f353]) ).

fof(f353,plain,
    ( $false
    | spl17_7
    | spl17_9 ),
    inference(subsumption_resolution,[],[f352,f174]) ).

fof(f352,plain,
    ( ~ ssList(sK3)
    | spl17_7
    | spl17_9 ),
    inference(subsumption_resolution,[],[f351,f208]) ).

fof(f351,plain,
    ( ~ ssList(nil)
    | ~ ssList(sK3)
    | spl17_7
    | spl17_9 ),
    inference(subsumption_resolution,[],[f350,f292]) ).

fof(f350,plain,
    ( nil = sK3
    | ~ ssList(nil)
    | ~ ssList(sK3)
    | spl17_7 ),
    inference(resolution,[],[f283,f205]) ).

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

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

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

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

fof(f283,plain,
    ( ~ neq(sK3,nil)
    | spl17_7 ),
    inference(avatar_component_clause,[],[f281]) ).

fof(f281,plain,
    ( spl17_7
  <=> neq(sK3,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl17_7])]) ).

fof(f349,plain,
    ( spl17_6
    | spl17_9 ),
    inference(avatar_contradiction_clause,[],[f348]) ).

fof(f348,plain,
    ( $false
    | spl17_6
    | spl17_9 ),
    inference(subsumption_resolution,[],[f347,f208]) ).

fof(f347,plain,
    ( ~ ssList(nil)
    | spl17_6
    | spl17_9 ),
    inference(subsumption_resolution,[],[f346,f174]) ).

fof(f346,plain,
    ( ~ ssList(sK3)
    | ~ ssList(nil)
    | spl17_6
    | spl17_9 ),
    inference(subsumption_resolution,[],[f343,f292]) ).

fof(f343,plain,
    ( nil = sK3
    | ~ ssList(sK3)
    | ~ ssList(nil)
    | spl17_6 ),
    inference(resolution,[],[f205,f279]) ).

fof(f279,plain,
    ( ~ neq(nil,sK3)
    | spl17_6 ),
    inference(avatar_component_clause,[],[f277]) ).

fof(f277,plain,
    ( spl17_6
  <=> neq(nil,sK3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl17_6])]) ).

fof(f333,plain,
    ( spl17_3
    | spl17_9 ),
    inference(avatar_split_clause,[],[f332,f290,f265]) ).

fof(f332,plain,
    ( ssList(sF15)
    | spl17_9 ),
    inference(subsumption_resolution,[],[f331,f174]) ).

fof(f331,plain,
    ( ssList(sF15)
    | ~ ssList(sK3)
    | spl17_9 ),
    inference(subsumption_resolution,[],[f324,f292]) ).

fof(f324,plain,
    ( ssList(sF15)
    | nil = sK3
    | ~ ssList(sK3) ),
    inference(superposition,[],[f231,f248]) ).

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

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

fof(f140,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(f330,plain,
    ( ~ spl17_3
    | spl17_1
    | ~ spl17_4 ),
    inference(avatar_split_clause,[],[f329,f269,f257,f265]) ).

fof(f257,plain,
    ( spl17_1
  <=> ssList(sF16) ),
    introduced(avatar_definition,[new_symbols(naming,[spl17_1])]) ).

fof(f329,plain,
    ( ssList(sF16)
    | ~ ssList(sF15)
    | ~ spl17_4 ),
    inference(subsumption_resolution,[],[f297,f270]) ).

fof(f297,plain,
    ( ssList(sF16)
    | ~ ssList(sF14)
    | ~ ssList(sF15) ),
    inference(superposition,[],[f203,f249]) ).

fof(f203,plain,
    ! [X0,X1] :
      ( ssList(app(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f117]) ).

fof(f117,plain,
    ! [X0] :
      ( ! [X1] :
          ( ssList(app(X0,X1))
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f26]) ).

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

fof(f323,plain,
    ~ spl17_8,
    inference(avatar_contradiction_clause,[],[f322]) ).

fof(f322,plain,
    ( $false
    | ~ spl17_8 ),
    inference(subsumption_resolution,[],[f321,f177]) ).

fof(f321,plain,
    ( ~ ssItem(sK4)
    | ~ spl17_8 ),
    inference(resolution,[],[f311,f216]) ).

fof(f311,plain,
    ( memberP(nil,sK4)
    | ~ spl17_8 ),
    inference(superposition,[],[f233,f288]) ).

fof(f288,plain,
    ( nil = sK2
    | ~ spl17_8 ),
    inference(avatar_component_clause,[],[f286]) ).

fof(f286,plain,
    ( spl17_8
  <=> nil = sK2 ),
    introduced(avatar_definition,[new_symbols(naming,[spl17_8])]) ).

fof(f320,plain,
    ( spl17_9
    | spl17_5 ),
    inference(avatar_split_clause,[],[f319,f273,f290]) ).

fof(f319,plain,
    ( ssItem(sF13)
    | nil = sK3 ),
    inference(subsumption_resolution,[],[f304,f174]) ).

fof(f304,plain,
    ( ssItem(sF13)
    | nil = sK3
    | ~ ssList(sK3) ),
    inference(superposition,[],[f215,f246]) ).

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

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

fof(f129,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(f296,plain,
    ( ~ spl17_5
    | spl17_4 ),
    inference(avatar_split_clause,[],[f295,f269,f273]) ).

fof(f295,plain,
    ( ssList(sF14)
    | ~ ssItem(sF13) ),
    inference(subsumption_resolution,[],[f294,f208]) ).

fof(f294,plain,
    ( ssList(sF14)
    | ~ ssItem(sF13)
    | ~ ssList(nil) ),
    inference(superposition,[],[f202,f247]) ).

fof(f202,plain,
    ! [X0,X1] :
      ( ssList(cons(X1,X0))
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f116]) ).

fof(f116,plain,
    ! [X0] :
      ( ! [X1] :
          ( ssList(cons(X1,X0))
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f16,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ssList(cons(X1,X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).

fof(f293,plain,
    ( spl17_8
    | ~ spl17_9 ),
    inference(avatar_split_clause,[],[f180,f290,f286]) ).

fof(f180,plain,
    ( nil != sK3
    | nil = sK2 ),
    inference(cnf_transformation,[],[f147]) ).

fof(f284,plain,
    ( ~ spl17_1
    | spl17_2
    | ~ spl17_3
    | ~ spl17_4
    | ~ spl17_5
    | ~ spl17_6
    | ~ spl17_7 ),
    inference(avatar_split_clause,[],[f255,f281,f277,f273,f269,f265,f261,f257]) ).

fof(f255,plain,
    ( ~ neq(sK3,nil)
    | ~ neq(nil,sK3)
    | ~ ssItem(sF13)
    | ~ ssList(sF14)
    | ~ ssList(sF15)
    | sK2 = sF16
    | ~ ssList(sF16) ),
    inference(duplicate_literal_removal,[],[f250]) ).

fof(f250,plain,
    ( ~ neq(sK3,nil)
    | ~ neq(nil,sK3)
    | ~ neq(nil,sK3)
    | ~ ssItem(sF13)
    | ~ ssList(sF14)
    | ~ ssList(sF15)
    | sK2 = sF16
    | ~ ssList(sF16) ),
    inference(definition_folding,[],[f239,f249,f247,f246,f248,f249,f247,f246,f248,f248,f247,f246,f246]) ).

fof(f239,plain,
    ( ~ neq(sK3,nil)
    | ~ neq(nil,sK3)
    | ~ neq(nil,sK3)
    | ~ ssItem(hd(sK3))
    | ~ ssList(cons(hd(sK3),nil))
    | ~ ssList(tl(sK3))
    | sK2 = app(tl(sK3),cons(hd(sK3),nil))
    | ~ ssList(app(tl(sK3),cons(hd(sK3),nil))) ),
    inference(equality_resolution,[],[f238]) ).

fof(f238,plain,
    ! [X5] :
      ( ~ neq(sK3,nil)
      | ~ neq(nil,sK3)
      | ~ neq(nil,sK3)
      | ~ ssItem(hd(sK3))
      | tl(sK3) != X5
      | ~ ssList(cons(hd(sK3),nil))
      | ~ ssList(X5)
      | sK2 = app(X5,cons(hd(sK3),nil))
      | ~ ssList(app(X5,cons(hd(sK3),nil))) ),
    inference(equality_resolution,[],[f237]) ).

fof(f237,plain,
    ! [X4,X5] :
      ( ~ neq(sK3,nil)
      | ~ neq(nil,sK3)
      | ~ neq(nil,sK3)
      | ~ ssItem(hd(sK3))
      | app(X5,cons(hd(sK3),nil)) != X4
      | tl(sK3) != X5
      | ~ ssList(cons(hd(sK3),nil))
      | ~ ssList(X5)
      | sK2 = X4
      | ~ ssList(X4) ),
    inference(equality_resolution,[],[f236]) ).

fof(f236,plain,
    ! [X6,X4,X5] :
      ( ~ neq(sK3,nil)
      | ~ neq(nil,sK3)
      | ~ neq(nil,sK3)
      | cons(hd(sK3),nil) != X6
      | ~ ssItem(hd(sK3))
      | app(X5,X6) != X4
      | tl(sK3) != X5
      | ~ ssList(X6)
      | ~ ssList(X5)
      | sK2 = X4
      | ~ ssList(X4) ),
    inference(equality_resolution,[],[f181]) ).

fof(f181,plain,
    ! [X6,X7,X4,X5] :
      ( ~ neq(sK3,nil)
      | ~ neq(nil,sK3)
      | ~ neq(nil,sK3)
      | hd(sK3) != X7
      | cons(X7,nil) != X6
      | ~ ssItem(X7)
      | app(X5,X6) != X4
      | tl(sK3) != X5
      | ~ ssList(X6)
      | ~ ssList(X5)
      | sK2 = X4
      | ~ ssList(X4) ),
    inference(cnf_transformation,[],[f147]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SWC395+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.33  % Computer : n015.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Sun May 19 02:41:38 EDT 2024
% 0.13/0.33  % CPUTime    : 
% 0.13/0.33  This is a FOF_THM_RFO_SEQ problem
% 0.13/0.33  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.63/0.80  % (9930)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 (2995ds/34Mi)
% 0.63/0.80  % (9934)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 (2995ds/34Mi)
% 0.63/0.80  % (9933)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.63/0.80  % (9935)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.63/0.80  % (9937)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 (2995ds/56Mi)
% 0.63/0.80  % (9936)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 (2995ds/83Mi)
% 0.63/0.80  % (9931)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 (2995ds/51Mi)
% 0.63/0.80  % (9937)Refutation not found, incomplete strategy% (9937)------------------------------
% 0.63/0.80  % (9937)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80  % (9937)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.80  
% 0.63/0.80  % (9937)Memory used [KB]: 1179
% 0.63/0.80  % (9937)Time elapsed: 0.005 s
% 0.63/0.80  % (9937)Instructions burned: 6 (million)
% 0.63/0.80  % (9937)------------------------------
% 0.63/0.80  % (9937)------------------------------
% 0.63/0.80  % (9938)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 (2995ds/55Mi)
% 0.63/0.80  % (9932)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.63/0.81  % (9934)Instruction limit reached!
% 0.63/0.81  % (9934)------------------------------
% 0.63/0.81  % (9934)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.81  % (9934)Termination reason: Unknown
% 0.63/0.81  % (9934)Termination phase: Saturation
% 0.63/0.81  
% 0.63/0.81  % (9934)Memory used [KB]: 2086
% 0.63/0.81  % (9934)Time elapsed: 0.019 s
% 0.63/0.81  % (9934)Instructions burned: 35 (million)
% 0.63/0.81  % (9934)------------------------------
% 0.63/0.81  % (9934)------------------------------
% 0.63/0.81  % (9933)Instruction limit reached!
% 0.63/0.81  % (9933)------------------------------
% 0.63/0.81  % (9933)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.81  % (9933)Termination reason: Unknown
% 0.63/0.81  % (9933)Termination phase: Saturation
% 0.63/0.81  
% 0.63/0.81  % (9933)Memory used [KB]: 1621
% 0.63/0.81  % (9933)Time elapsed: 0.020 s
% 0.63/0.81  % (9933)Instructions burned: 34 (million)
% 0.63/0.81  % (9933)------------------------------
% 0.63/0.81  % (9933)------------------------------
% 0.63/0.81  % (9930)Instruction limit reached!
% 0.63/0.81  % (9930)------------------------------
% 0.63/0.81  % (9930)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.81  % (9930)Termination reason: Unknown
% 0.63/0.81  % (9930)Termination phase: Saturation
% 0.63/0.81  
% 0.63/0.81  % (9930)Memory used [KB]: 1471
% 0.63/0.81  % (9930)Time elapsed: 0.020 s
% 0.63/0.81  % (9930)Instructions burned: 35 (million)
% 0.63/0.81  % (9930)------------------------------
% 0.63/0.81  % (9930)------------------------------
% 0.63/0.82  % (9939)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 (2995ds/50Mi)
% 0.63/0.82  % (9940)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 (2995ds/208Mi)
% 0.63/0.82  % (9941)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 (2995ds/52Mi)
% 0.63/0.82  % (9935)Instruction limit reached!
% 0.63/0.82  % (9935)------------------------------
% 0.63/0.82  % (9935)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82  % (9935)Termination reason: Unknown
% 0.63/0.82  % (9935)Termination phase: Saturation
% 0.63/0.82  
% 0.63/0.82  % (9935)Memory used [KB]: 1632
% 0.63/0.82  % (9935)Time elapsed: 0.026 s
% 0.63/0.82  % (9935)Instructions burned: 45 (million)
% 0.63/0.82  % (9935)------------------------------
% 0.63/0.82  % (9935)------------------------------
% 0.63/0.82  % (9931)Instruction limit reached!
% 0.63/0.82  % (9931)------------------------------
% 0.63/0.82  % (9931)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82  % (9931)Termination reason: Unknown
% 0.63/0.82  % (9931)Termination phase: Saturation
% 0.63/0.82  
% 0.63/0.82  % (9931)Memory used [KB]: 1960
% 0.63/0.82  % (9931)Time elapsed: 0.026 s
% 0.63/0.82  % (9931)Instructions burned: 51 (million)
% 0.63/0.82  % (9931)------------------------------
% 0.63/0.82  % (9931)------------------------------
% 0.63/0.83  % (9943)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 (2995ds/42Mi)
% 0.63/0.83  % (9938)Instruction limit reached!
% 0.63/0.83  % (9938)------------------------------
% 0.63/0.83  % (9938)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.83  % (9938)Termination reason: Unknown
% 0.63/0.83  % (9938)Termination phase: Saturation
% 0.63/0.83  
% 0.63/0.83  % (9938)Memory used [KB]: 2171
% 0.63/0.83  % (9938)Time elapsed: 0.029 s
% 0.63/0.83  % (9938)Instructions burned: 55 (million)
% 0.63/0.83  % (9938)------------------------------
% 0.63/0.83  % (9938)------------------------------
% 0.63/0.83  % (9936)Instruction limit reached!
% 0.63/0.83  % (9936)------------------------------
% 0.63/0.83  % (9936)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.83  % (9936)Termination reason: Unknown
% 0.63/0.83  % (9936)Termination phase: Saturation
% 0.63/0.83  
% 0.63/0.83  % (9936)Memory used [KB]: 2070
% 0.63/0.83  % (9936)Time elapsed: 0.039 s
% 0.63/0.83  % (9936)Instructions burned: 83 (million)
% 0.63/0.83  % (9936)------------------------------
% 0.63/0.83  % (9936)------------------------------
% 0.63/0.83  % (9942)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 (2995ds/518Mi)
% 0.63/0.84  % (9944)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.63/0.84  % (9945)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.63/0.84  % (9939)Instruction limit reached!
% 0.63/0.84  % (9939)------------------------------
% 0.63/0.84  % (9939)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.84  % (9939)Termination reason: Unknown
% 0.63/0.84  % (9939)Termination phase: Saturation
% 0.63/0.84  
% 0.63/0.84  % (9939)Memory used [KB]: 1910
% 0.63/0.84  % (9939)Time elapsed: 0.025 s
% 0.63/0.84  % (9939)Instructions burned: 52 (million)
% 0.63/0.84  % (9939)------------------------------
% 0.63/0.84  % (9939)------------------------------
% 0.63/0.84  % (9946)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.63/0.84  % (9940)First to succeed.
% 0.63/0.85  % (9940)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-9929"
% 0.63/0.85  % (9940)Refutation found. Thanks to Tanya!
% 0.63/0.85  % SZS status Theorem for theBenchmark
% 0.63/0.85  % SZS output start Proof for theBenchmark
% See solution above
% 0.63/0.85  % (9940)------------------------------
% 0.63/0.85  % (9940)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.85  % (9940)Termination reason: Refutation
% 0.63/0.85  
% 0.63/0.85  % (9940)Memory used [KB]: 1546
% 0.63/0.85  % (9940)Time elapsed: 0.031 s
% 0.63/0.85  % (9940)Instructions burned: 61 (million)
% 0.63/0.85  % (9929)Success in time 0.503 s
% 0.63/0.85  % Vampire---4.8 exiting
%------------------------------------------------------------------------------