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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC316+1 : TPTP v8.1.2. 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 : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May  1 04:01:21 EDT 2024

% Result   : Theorem 0.68s 0.84s
% Output   : Refutation 0.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   34
% Syntax   : Number of formulae    :  124 (  13 unt;   0 def)
%            Number of atoms       :  705 ( 207 equ)
%            Maximal formula atoms :   50 (   5 avg)
%            Number of connectives :  947 ( 366   ~; 354   |; 167   &)
%                                         (  20 <=>;  40  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   23 (  21 usr;  19 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-2 aty)
%            Number of variables   :  182 ( 122   !;  60   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f921,plain,
    $false,
    inference(avatar_sat_refutation,[],[f635,f640,f645,f650,f655,f662,f664,f674,f676,f682,f684,f773,f778,f814,f861,f872,f877,f913,f915]) ).

fof(f915,plain,
    ( ~ spl53_11
    | ~ spl53_12
    | ~ spl53_14
    | ~ spl53_23 ),
    inference(avatar_split_clause,[],[f865,f857,f671,f652,f647]) ).

fof(f647,plain,
    ( spl53_11
  <=> ssList(sK52) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_11])]) ).

fof(f652,plain,
    ( spl53_12
  <=> ssItem(sK51) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_12])]) ).

fof(f671,plain,
    ( spl53_14
  <=> nil = sK49 ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_14])]) ).

fof(f857,plain,
    ( spl53_23
  <=> sK49 = cons(sK51,sK52) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_23])]) ).

fof(f865,plain,
    ( nil != sK49
    | ~ ssItem(sK51)
    | ~ ssList(sK52)
    | ~ spl53_23 ),
    inference(superposition,[],[f429,f859]) ).

fof(f859,plain,
    ( sK49 = cons(sK51,sK52)
    | ~ spl53_23 ),
    inference(avatar_component_clause,[],[f857]) ).

fof(f429,plain,
    ! [X0,X1] :
      ( nil != cons(X1,X0)
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f126]) ).

fof(f126,plain,
    ! [X0] :
      ( ! [X1] :
          ( nil != cons(X1,X0)
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f21,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => nil != cons(X1,X0) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.QBmyQA9UOw/Vampire---4.8_13202',ax21) ).

fof(f913,plain,
    ( ~ spl53_9
    | spl53_2
    | ~ spl53_24
    | ~ spl53_25 ),
    inference(avatar_split_clause,[],[f912,f874,f869,f608,f637]) ).

fof(f637,plain,
    ( spl53_9
  <=> sK50 = app(sK52,cons(sK51,nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_9])]) ).

fof(f608,plain,
    ( spl53_2
  <=> sK50 = app(tl(sK49),cons(hd(sK49),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_2])]) ).

fof(f869,plain,
    ( spl53_24
  <=> sK52 = tl(sK49) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_24])]) ).

fof(f874,plain,
    ( spl53_25
  <=> sK51 = hd(sK49) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_25])]) ).

fof(f912,plain,
    ( sK50 != app(sK52,cons(sK51,nil))
    | spl53_2
    | ~ spl53_24
    | ~ spl53_25 ),
    inference(forward_demodulation,[],[f907,f876]) ).

fof(f876,plain,
    ( sK51 = hd(sK49)
    | ~ spl53_25 ),
    inference(avatar_component_clause,[],[f874]) ).

fof(f907,plain,
    ( sK50 != app(sK52,cons(hd(sK49),nil))
    | spl53_2
    | ~ spl53_24 ),
    inference(superposition,[],[f610,f871]) ).

fof(f871,plain,
    ( sK52 = tl(sK49)
    | ~ spl53_24 ),
    inference(avatar_component_clause,[],[f869]) ).

fof(f610,plain,
    ( sK50 != app(tl(sK49),cons(hd(sK49),nil))
    | spl53_2 ),
    inference(avatar_component_clause,[],[f608]) ).

fof(f877,plain,
    ( ~ spl53_11
    | ~ spl53_12
    | spl53_25
    | ~ spl53_23 ),
    inference(avatar_split_clause,[],[f863,f857,f874,f652,f647]) ).

fof(f863,plain,
    ( sK51 = hd(sK49)
    | ~ ssItem(sK51)
    | ~ ssList(sK52)
    | ~ spl53_23 ),
    inference(superposition,[],[f431,f859]) ).

fof(f431,plain,
    ! [X0,X1] :
      ( hd(cons(X1,X0)) = X1
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f129]) ).

fof(f129,plain,
    ! [X0] :
      ( ! [X1] :
          ( hd(cons(X1,X0)) = X1
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f23]) ).

fof(f23,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => hd(cons(X1,X0)) = X1 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.QBmyQA9UOw/Vampire---4.8_13202',ax23) ).

fof(f872,plain,
    ( ~ spl53_11
    | ~ spl53_12
    | spl53_24
    | ~ spl53_23 ),
    inference(avatar_split_clause,[],[f862,f857,f869,f652,f647]) ).

fof(f862,plain,
    ( sK52 = tl(sK49)
    | ~ ssItem(sK51)
    | ~ ssList(sK52)
    | ~ spl53_23 ),
    inference(superposition,[],[f433,f859]) ).

fof(f433,plain,
    ! [X0,X1] :
      ( tl(cons(X1,X0)) = X0
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f132]) ).

fof(f132,plain,
    ! [X0] :
      ( ! [X1] :
          ( tl(cons(X1,X0)) = X0
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f25]) ).

fof(f25,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => tl(cons(X1,X0)) = X0 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.QBmyQA9UOw/Vampire---4.8_13202',ax25) ).

fof(f861,plain,
    ( ~ spl53_11
    | ~ spl53_12
    | spl53_23
    | ~ spl53_10 ),
    inference(avatar_split_clause,[],[f849,f642,f857,f652,f647]) ).

fof(f642,plain,
    ( spl53_10
  <=> sK49 = app(cons(sK51,nil),sK52) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_10])]) ).

fof(f849,plain,
    ( sK49 = cons(sK51,sK52)
    | ~ ssItem(sK51)
    | ~ ssList(sK52)
    | ~ spl53_10 ),
    inference(superposition,[],[f644,f510]) ).

fof(f510,plain,
    ! [X0,X1] :
      ( cons(X1,X0) = app(cons(X1,nil),X0)
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f199]) ).

fof(f199,plain,
    ! [X0] :
      ( ! [X1] :
          ( cons(X1,X0) = app(cons(X1,nil),X0)
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f81]) ).

fof(f81,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => cons(X1,X0) = app(cons(X1,nil),X0) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.QBmyQA9UOw/Vampire---4.8_13202',ax81) ).

fof(f644,plain,
    ( sK49 = app(cons(sK51,nil),sK52)
    | ~ spl53_10 ),
    inference(avatar_component_clause,[],[f642]) ).

fof(f814,plain,
    ( ~ spl53_13
    | ~ spl53_15
    | spl53_14
    | spl53_7 ),
    inference(avatar_split_clause,[],[f812,f628,f671,f679,f667]) ).

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

fof(f679,plain,
    ( spl53_15
  <=> ssList(nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_15])]) ).

fof(f628,plain,
    ( spl53_7
  <=> neq(sK49,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_7])]) ).

fof(f812,plain,
    ( nil = sK49
    | ~ ssList(nil)
    | ~ ssList(sK49)
    | spl53_7 ),
    inference(resolution,[],[f630,f420]) ).

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

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

fof(f119,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/tmp/tmp.QBmyQA9UOw/Vampire---4.8_13202',ax15) ).

fof(f630,plain,
    ( ~ neq(sK49,nil)
    | spl53_7 ),
    inference(avatar_component_clause,[],[f628]) ).

fof(f778,plain,
    ( ~ spl53_15
    | ~ spl53_13
    | spl53_14
    | spl53_6 ),
    inference(avatar_split_clause,[],[f776,f624,f671,f667,f679]) ).

fof(f624,plain,
    ( spl53_6
  <=> neq(nil,sK49) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_6])]) ).

fof(f776,plain,
    ( nil = sK49
    | ~ ssList(sK49)
    | ~ ssList(nil)
    | spl53_6 ),
    inference(resolution,[],[f626,f420]) ).

fof(f626,plain,
    ( ~ neq(nil,sK49)
    | spl53_6 ),
    inference(avatar_component_clause,[],[f624]) ).

fof(f773,plain,
    spl53_15,
    inference(avatar_contradiction_clause,[],[f772]) ).

fof(f772,plain,
    ( $false
    | spl53_15 ),
    inference(resolution,[],[f681,f422]) ).

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

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/tmp/tmp.QBmyQA9UOw/Vampire---4.8_13202',ax17) ).

fof(f681,plain,
    ( ~ ssList(nil)
    | spl53_15 ),
    inference(avatar_component_clause,[],[f679]) ).

fof(f684,plain,
    ( ~ spl53_13
    | spl53_14
    | spl53_5 ),
    inference(avatar_split_clause,[],[f683,f620,f671,f667]) ).

fof(f620,plain,
    ( spl53_5
  <=> ssItem(hd(sK49)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_5])]) ).

fof(f683,plain,
    ( nil = sK49
    | ~ ssList(sK49)
    | spl53_5 ),
    inference(resolution,[],[f622,f430]) ).

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

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

fof(f127,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/tmp/tmp.QBmyQA9UOw/Vampire---4.8_13202',ax22) ).

fof(f622,plain,
    ( ~ ssItem(hd(sK49))
    | spl53_5 ),
    inference(avatar_component_clause,[],[f620]) ).

fof(f682,plain,
    ( ~ spl53_15
    | ~ spl53_5
    | spl53_4 ),
    inference(avatar_split_clause,[],[f677,f616,f620,f679]) ).

fof(f616,plain,
    ( spl53_4
  <=> ssList(cons(hd(sK49),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_4])]) ).

fof(f677,plain,
    ( ~ ssItem(hd(sK49))
    | ~ ssList(nil)
    | spl53_4 ),
    inference(resolution,[],[f618,f421]) ).

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

fof(f120,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/tmp/tmp.QBmyQA9UOw/Vampire---4.8_13202',ax16) ).

fof(f618,plain,
    ( ~ ssList(cons(hd(sK49),nil))
    | spl53_4 ),
    inference(avatar_component_clause,[],[f616]) ).

fof(f676,plain,
    spl53_13,
    inference(avatar_contradiction_clause,[],[f675]) ).

fof(f675,plain,
    ( $false
    | spl53_13 ),
    inference(resolution,[],[f669,f531]) ).

fof(f531,plain,
    ssList(sK49),
    inference(cnf_transformation,[],[f338]) ).

fof(f338,plain,
    ( ( ( ~ neq(sK50,nil)
        & neq(sK48,nil) )
      | ( ( ~ neq(sK47,nil)
          | ! [X4] :
              ( ! [X5] :
                  ( ! [X6] :
                      ( ~ neq(nil,sK47)
                      | ! [X7] :
                          ( ~ neq(nil,sK47)
                          | hd(sK47) != X7
                          | cons(X7,nil) != X6
                          | ~ ssItem(X7) )
                      | app(X5,X6) != X4
                      | tl(sK47) != X5
                      | ~ ssList(X6) )
                  | ~ ssList(X5) )
              | sK48 != X4
              | ~ ssList(X4) ) )
        & sK50 = app(sK52,cons(sK51,nil))
        & sK49 = app(cons(sK51,nil),sK52)
        & ssList(sK52)
        & ssItem(sK51)
        & neq(sK48,nil) ) )
    & sK47 = sK49
    & sK48 = sK50
    & ssList(sK50)
    & ssList(sK49)
    & ssList(sK48)
    & ssList(sK47) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50,sK51,sK52])],[f223,f337,f336,f335,f334,f333,f332]) ).

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

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

fof(f334,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ( ~ neq(X3,nil)
                & neq(sK48,nil) )
              | ( ( ~ neq(sK47,nil)
                  | ! [X4] :
                      ( ! [X5] :
                          ( ! [X6] :
                              ( ~ neq(nil,sK47)
                              | ! [X7] :
                                  ( ~ neq(nil,sK47)
                                  | hd(sK47) != X7
                                  | cons(X7,nil) != X6
                                  | ~ ssItem(X7) )
                              | app(X5,X6) != X4
                              | tl(sK47) != X5
                              | ~ ssList(X6) )
                          | ~ ssList(X5) )
                      | sK48 != X4
                      | ~ ssList(X4) ) )
                & ? [X8] :
                    ( ? [X9] :
                        ( app(X9,cons(X8,nil)) = X3
                        & app(cons(X8,nil),X9) = X2
                        & ssList(X9) )
                    & ssItem(X8) )
                & neq(sK48,nil) ) )
            & sK47 = X2
            & sK48 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ( ~ neq(X3,nil)
              & neq(sK48,nil) )
            | ( ( ~ neq(sK47,nil)
                | ! [X4] :
                    ( ! [X5] :
                        ( ! [X6] :
                            ( ~ neq(nil,sK47)
                            | ! [X7] :
                                ( ~ neq(nil,sK47)
                                | hd(sK47) != X7
                                | cons(X7,nil) != X6
                                | ~ ssItem(X7) )
                            | app(X5,X6) != X4
                            | tl(sK47) != X5
                            | ~ ssList(X6) )
                        | ~ ssList(X5) )
                    | sK48 != X4
                    | ~ ssList(X4) ) )
              & ? [X8] :
                  ( ? [X9] :
                      ( app(X9,cons(X8,nil)) = X3
                      & app(cons(X8,nil),X9) = sK49
                      & ssList(X9) )
                  & ssItem(X8) )
              & neq(sK48,nil) ) )
          & sK47 = sK49
          & sK48 = X3
          & ssList(X3) )
      & ssList(sK49) ) ),
    introduced(choice_axiom,[]) ).

fof(f335,plain,
    ( ? [X3] :
        ( ( ( ~ neq(X3,nil)
            & neq(sK48,nil) )
          | ( ( ~ neq(sK47,nil)
              | ! [X4] :
                  ( ! [X5] :
                      ( ! [X6] :
                          ( ~ neq(nil,sK47)
                          | ! [X7] :
                              ( ~ neq(nil,sK47)
                              | hd(sK47) != X7
                              | cons(X7,nil) != X6
                              | ~ ssItem(X7) )
                          | app(X5,X6) != X4
                          | tl(sK47) != X5
                          | ~ ssList(X6) )
                      | ~ ssList(X5) )
                  | sK48 != X4
                  | ~ ssList(X4) ) )
            & ? [X8] :
                ( ? [X9] :
                    ( app(X9,cons(X8,nil)) = X3
                    & app(cons(X8,nil),X9) = sK49
                    & ssList(X9) )
                & ssItem(X8) )
            & neq(sK48,nil) ) )
        & sK47 = sK49
        & sK48 = X3
        & ssList(X3) )
   => ( ( ( ~ neq(sK50,nil)
          & neq(sK48,nil) )
        | ( ( ~ neq(sK47,nil)
            | ! [X4] :
                ( ! [X5] :
                    ( ! [X6] :
                        ( ~ neq(nil,sK47)
                        | ! [X7] :
                            ( ~ neq(nil,sK47)
                            | hd(sK47) != X7
                            | cons(X7,nil) != X6
                            | ~ ssItem(X7) )
                        | app(X5,X6) != X4
                        | tl(sK47) != X5
                        | ~ ssList(X6) )
                    | ~ ssList(X5) )
                | sK48 != X4
                | ~ ssList(X4) ) )
          & ? [X8] :
              ( ? [X9] :
                  ( app(X9,cons(X8,nil)) = sK50
                  & app(cons(X8,nil),X9) = sK49
                  & ssList(X9) )
              & ssItem(X8) )
          & neq(sK48,nil) ) )
      & sK47 = sK49
      & sK48 = sK50
      & ssList(sK50) ) ),
    introduced(choice_axiom,[]) ).

fof(f336,plain,
    ( ? [X8] :
        ( ? [X9] :
            ( app(X9,cons(X8,nil)) = sK50
            & app(cons(X8,nil),X9) = sK49
            & ssList(X9) )
        & ssItem(X8) )
   => ( ? [X9] :
          ( sK50 = app(X9,cons(sK51,nil))
          & sK49 = app(cons(sK51,nil),X9)
          & ssList(X9) )
      & ssItem(sK51) ) ),
    introduced(choice_axiom,[]) ).

fof(f337,plain,
    ( ? [X9] :
        ( sK50 = app(X9,cons(sK51,nil))
        & sK49 = app(cons(sK51,nil),X9)
        & ssList(X9) )
   => ( sK50 = app(sK52,cons(sK51,nil))
      & sK49 = app(cons(sK51,nil),sK52)
      & ssList(sK52) ) ),
    introduced(choice_axiom,[]) ).

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

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | ( ( ~ neq(X0,nil)
                        | ! [X4] :
                            ( ! [X5] :
                                ( ! [X6] :
                                    ( ~ neq(nil,X0)
                                    | ! [X7] :
                                        ( ~ neq(nil,X0)
                                        | hd(X0) != X7
                                        | cons(X7,nil) != X6
                                        | ~ ssItem(X7) )
                                    | app(X5,X6) != X4
                                    | tl(X0) != X5
                                    | ~ ssList(X6) )
                                | ~ ssList(X5) )
                            | X1 != X4
                            | ~ ssList(X4) ) )
                      & ? [X8] :
                          ( ? [X9] :
                              ( app(X9,cons(X8,nil)) = X3
                              & app(cons(X8,nil),X9) = X2
                              & ssList(X9) )
                          & ssItem(X8) )
                      & neq(X1,nil) ) )
                  & 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] :
                    ( ssList(X3)
                   => ( ( ( neq(X3,nil)
                          | ~ neq(X1,nil) )
                        & ( ( neq(X0,nil)
                            & ? [X4] :
                                ( ? [X5] :
                                    ( ? [X6] :
                                        ( neq(nil,X0)
                                        & ? [X7] :
                                            ( neq(nil,X0)
                                            & hd(X0) = X7
                                            & cons(X7,nil) = X6
                                            & ssItem(X7) )
                                        & app(X5,X6) = X4
                                        & tl(X0) = X5
                                        & ssList(X6) )
                                    & ssList(X5) )
                                & X1 = X4
                                & ssList(X4) ) )
                          | ! [X8] :
                              ( ssItem(X8)
                             => ! [X9] :
                                  ( ssList(X9)
                                 => ( app(X9,cons(X8,nil)) != X3
                                    | app(cons(X8,nil),X9) != X2 ) ) )
                          | ~ neq(X1,nil) ) )
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(rectify,[],[f97]) ).

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

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( ( neq(X3,nil)
                        | ~ neq(X1,nil) )
                      & ( ( neq(X0,nil)
                          & ? [X6] :
                              ( ? [X7] :
                                  ( ? [X8] :
                                      ( neq(nil,X0)
                                      & ? [X9] :
                                          ( neq(nil,X0)
                                          & hd(X0) = X9
                                          & cons(X9,nil) = X8
                                          & ssItem(X9) )
                                      & app(X7,X8) = X6
                                      & tl(X0) = X7
                                      & ssList(X8) )
                                  & ssList(X7) )
                              & X1 = X6
                              & ssList(X6) ) )
                        | ! [X4] :
                            ( ssItem(X4)
                           => ! [X5] :
                                ( ssList(X5)
                               => ( app(X5,cons(X4,nil)) != X3
                                  | app(cons(X4,nil),X5) != X2 ) ) )
                        | ~ neq(X1,nil) ) )
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.QBmyQA9UOw/Vampire---4.8_13202',co1) ).

fof(f669,plain,
    ( ~ ssList(sK49)
    | spl53_13 ),
    inference(avatar_component_clause,[],[f667]) ).

fof(f674,plain,
    ( ~ spl53_13
    | spl53_14
    | spl53_3 ),
    inference(avatar_split_clause,[],[f665,f612,f671,f667]) ).

fof(f612,plain,
    ( spl53_3
  <=> ssList(tl(sK49)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_3])]) ).

fof(f665,plain,
    ( nil = sK49
    | ~ ssList(sK49)
    | spl53_3 ),
    inference(resolution,[],[f432,f614]) ).

fof(f614,plain,
    ( ~ ssList(tl(sK49))
    | spl53_3 ),
    inference(avatar_component_clause,[],[f612]) ).

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

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

fof(f130,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/tmp/tmp.QBmyQA9UOw/Vampire---4.8_13202',ax24) ).

fof(f664,plain,
    spl53_1,
    inference(avatar_split_clause,[],[f555,f604]) ).

fof(f604,plain,
    ( spl53_1
  <=> ssList(sK50) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_1])]) ).

fof(f555,plain,
    ssList(sK50),
    inference(definition_unfolding,[],[f530,f533]) ).

fof(f533,plain,
    sK48 = sK50,
    inference(cnf_transformation,[],[f338]) ).

fof(f530,plain,
    ssList(sK48),
    inference(cnf_transformation,[],[f338]) ).

fof(f662,plain,
    spl53_8,
    inference(avatar_split_clause,[],[f592,f632]) ).

fof(f632,plain,
    ( spl53_8
  <=> neq(sK50,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_8])]) ).

fof(f592,plain,
    neq(sK50,nil),
    inference(duplicate_literal_removal,[],[f554]) ).

fof(f554,plain,
    ( neq(sK50,nil)
    | neq(sK50,nil) ),
    inference(definition_unfolding,[],[f535,f533,f533]) ).

fof(f535,plain,
    ( neq(sK48,nil)
    | neq(sK48,nil) ),
    inference(cnf_transformation,[],[f338]) ).

fof(f655,plain,
    ( spl53_12
    | ~ spl53_8 ),
    inference(avatar_split_clause,[],[f542,f632,f652]) ).

fof(f542,plain,
    ( ~ neq(sK50,nil)
    | ssItem(sK51) ),
    inference(cnf_transformation,[],[f338]) ).

fof(f650,plain,
    ( spl53_11
    | ~ spl53_8 ),
    inference(avatar_split_clause,[],[f543,f632,f647]) ).

fof(f543,plain,
    ( ~ neq(sK50,nil)
    | ssList(sK52) ),
    inference(cnf_transformation,[],[f338]) ).

fof(f645,plain,
    ( spl53_10
    | ~ spl53_8 ),
    inference(avatar_split_clause,[],[f544,f632,f642]) ).

fof(f544,plain,
    ( ~ neq(sK50,nil)
    | sK49 = app(cons(sK51,nil),sK52) ),
    inference(cnf_transformation,[],[f338]) ).

fof(f640,plain,
    ( spl53_9
    | ~ spl53_8 ),
    inference(avatar_split_clause,[],[f545,f632,f637]) ).

fof(f545,plain,
    ( ~ neq(sK50,nil)
    | sK50 = app(sK52,cons(sK51,nil)) ),
    inference(cnf_transformation,[],[f338]) ).

fof(f635,plain,
    ( ~ spl53_1
    | ~ spl53_2
    | ~ spl53_3
    | ~ spl53_4
    | ~ spl53_5
    | ~ spl53_6
    | ~ spl53_7
    | ~ spl53_8 ),
    inference(avatar_split_clause,[],[f602,f632,f628,f624,f620,f616,f612,f608,f604]) ).

fof(f602,plain,
    ( ~ neq(sK50,nil)
    | ~ neq(sK49,nil)
    | ~ neq(nil,sK49)
    | ~ ssItem(hd(sK49))
    | ~ ssList(cons(hd(sK49),nil))
    | ~ ssList(tl(sK49))
    | sK50 != app(tl(sK49),cons(hd(sK49),nil))
    | ~ ssList(sK50) ),
    inference(inner_rewriting,[],[f594]) ).

fof(f594,plain,
    ( ~ neq(sK50,nil)
    | ~ neq(sK49,nil)
    | ~ neq(nil,sK49)
    | ~ ssItem(hd(sK49))
    | ~ ssList(cons(hd(sK49),nil))
    | ~ ssList(tl(sK49))
    | sK50 != app(tl(sK49),cons(hd(sK49),nil))
    | ~ ssList(app(tl(sK49),cons(hd(sK49),nil))) ),
    inference(duplicate_literal_removal,[],[f587]) ).

fof(f587,plain,
    ( ~ neq(sK50,nil)
    | ~ neq(sK49,nil)
    | ~ neq(nil,sK49)
    | ~ neq(nil,sK49)
    | ~ ssItem(hd(sK49))
    | ~ ssList(cons(hd(sK49),nil))
    | ~ ssList(tl(sK49))
    | sK50 != app(tl(sK49),cons(hd(sK49),nil))
    | ~ ssList(app(tl(sK49),cons(hd(sK49),nil))) ),
    inference(equality_resolution,[],[f586]) ).

fof(f586,plain,
    ! [X5] :
      ( ~ neq(sK50,nil)
      | ~ neq(sK49,nil)
      | ~ neq(nil,sK49)
      | ~ neq(nil,sK49)
      | ~ ssItem(hd(sK49))
      | tl(sK49) != X5
      | ~ ssList(cons(hd(sK49),nil))
      | ~ ssList(X5)
      | sK50 != app(X5,cons(hd(sK49),nil))
      | ~ ssList(app(X5,cons(hd(sK49),nil))) ),
    inference(equality_resolution,[],[f585]) ).

fof(f585,plain,
    ! [X4,X5] :
      ( ~ neq(sK50,nil)
      | ~ neq(sK49,nil)
      | ~ neq(nil,sK49)
      | ~ neq(nil,sK49)
      | ~ ssItem(hd(sK49))
      | app(X5,cons(hd(sK49),nil)) != X4
      | tl(sK49) != X5
      | ~ ssList(cons(hd(sK49),nil))
      | ~ ssList(X5)
      | sK50 != X4
      | ~ ssList(X4) ),
    inference(equality_resolution,[],[f584]) ).

fof(f584,plain,
    ! [X6,X4,X5] :
      ( ~ neq(sK50,nil)
      | ~ neq(sK49,nil)
      | ~ neq(nil,sK49)
      | ~ neq(nil,sK49)
      | cons(hd(sK49),nil) != X6
      | ~ ssItem(hd(sK49))
      | app(X5,X6) != X4
      | tl(sK49) != X5
      | ~ ssList(X6)
      | ~ ssList(X5)
      | sK50 != X4
      | ~ ssList(X4) ),
    inference(equality_resolution,[],[f547]) ).

fof(f547,plain,
    ! [X6,X7,X4,X5] :
      ( ~ neq(sK50,nil)
      | ~ neq(sK49,nil)
      | ~ neq(nil,sK49)
      | ~ neq(nil,sK49)
      | hd(sK49) != X7
      | cons(X7,nil) != X6
      | ~ ssItem(X7)
      | app(X5,X6) != X4
      | tl(sK49) != X5
      | ~ ssList(X6)
      | ~ ssList(X5)
      | sK50 != X4
      | ~ ssList(X4) ),
    inference(definition_unfolding,[],[f546,f534,f534,f534,f534,f534,f533]) ).

fof(f534,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f338]) ).

fof(f546,plain,
    ! [X6,X7,X4,X5] :
      ( ~ neq(sK50,nil)
      | ~ neq(sK47,nil)
      | ~ neq(nil,sK47)
      | ~ neq(nil,sK47)
      | hd(sK47) != X7
      | cons(X7,nil) != X6
      | ~ ssItem(X7)
      | app(X5,X6) != X4
      | tl(sK47) != X5
      | ~ ssList(X6)
      | ~ ssList(X5)
      | sK48 != X4
      | ~ ssList(X4) ),
    inference(cnf_transformation,[],[f338]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SWC316+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.15  % 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.16/0.36  % Computer : n013.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 300
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Tue Apr 30 18:15:04 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.16/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.16/0.36  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/tmp/tmp.QBmyQA9UOw/Vampire---4.8_13202
% 0.66/0.82  % (13439)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.66/0.82  % (13443)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.66/0.82  % (13436)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 Vampire---4 for (2995ds/34Mi)
% 0.66/0.82  % (13438)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.66/0.82  % (13437)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 Vampire---4 for (2995ds/51Mi)
% 0.66/0.82  % (13440)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 Vampire---4 for (2995ds/34Mi)
% 0.66/0.82  % (13441)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.66/0.82  % (13442)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 Vampire---4 for (2995ds/83Mi)
% 0.66/0.82  % (13443)Refutation not found, incomplete strategy% (13443)------------------------------
% 0.66/0.82  % (13443)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.82  % (13443)Termination reason: Refutation not found, incomplete strategy
% 0.66/0.82  
% 0.66/0.82  % (13443)Memory used [KB]: 1153
% 0.66/0.82  % (13443)Time elapsed: 0.003 s
% 0.66/0.82  % (13443)Instructions burned: 5 (million)
% 0.66/0.82  % (13443)------------------------------
% 0.66/0.82  % (13443)------------------------------
% 0.66/0.83  % (13441)Refutation not found, incomplete strategy% (13441)------------------------------
% 0.66/0.83  % (13441)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.83  % (13441)Termination reason: Refutation not found, incomplete strategy
% 0.66/0.83  
% 0.66/0.83  % (13441)Memory used [KB]: 1149
% 0.66/0.83  % (13441)Time elapsed: 0.004 s
% 0.66/0.83  % (13441)Instructions burned: 5 (million)
% 0.66/0.83  % (13441)------------------------------
% 0.66/0.83  % (13441)------------------------------
% 0.66/0.83  % (13445)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 Vampire---4 for (2995ds/55Mi)
% 0.66/0.83  % (13446)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 Vampire---4 for (2995ds/50Mi)
% 0.66/0.83  % (13439)Instruction limit reached!
% 0.66/0.83  % (13439)------------------------------
% 0.66/0.83  % (13439)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.83  % (13439)Termination reason: Unknown
% 0.66/0.83  % (13439)Termination phase: Saturation
% 0.66/0.83  
% 0.66/0.83  % (13439)Memory used [KB]: 1678
% 0.66/0.83  % (13439)Time elapsed: 0.011 s
% 0.66/0.83  % (13439)Instructions burned: 33 (million)
% 0.66/0.83  % (13439)------------------------------
% 0.66/0.83  % (13439)------------------------------
% 0.66/0.83  % (13450)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/208Mi)
% 0.66/0.84  % (13437)First to succeed.
% 0.68/0.84  % (13440)Instruction limit reached!
% 0.68/0.84  % (13440)------------------------------
% 0.68/0.84  % (13440)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.68/0.84  % (13437)Refutation found. Thanks to Tanya!
% 0.68/0.84  % SZS status Theorem for Vampire---4
% 0.68/0.84  % SZS output start Proof for Vampire---4
% See solution above
% 0.68/0.84  % (13437)------------------------------
% 0.68/0.84  % (13437)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.68/0.84  % (13437)Termination reason: Refutation
% 0.68/0.84  
% 0.68/0.84  % (13437)Memory used [KB]: 1503
% 0.68/0.84  % (13437)Time elapsed: 0.019 s
% 0.68/0.84  % (13437)Instructions burned: 30 (million)
% 0.68/0.84  % (13437)------------------------------
% 0.68/0.84  % (13437)------------------------------
% 0.68/0.84  % (13369)Success in time 0.461 s
% 0.68/0.84  % Vampire---4.8 exiting
%------------------------------------------------------------------------------