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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC311+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 18:43:04 EDT 2022

% Result   : Theorem 3.59s 0.92s
% Output   : Refutation 3.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   32
%            Number of leaves      :   17
% Syntax   : Number of formulae    :  108 (  18 unt;   0 def)
%            Number of atoms       :  690 ( 316 equ)
%            Maximal formula atoms :   54 (   6 avg)
%            Number of connectives :  969 ( 387   ~; 403   |; 147   &)
%                                         (   2 <=>;  30  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   30 (   7 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   9 con; 0-2 aty)
%            Number of variables   :  179 ( 137   !;  42   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1910,plain,
    $false,
    inference(subsumption_resolution,[],[f1908,f411]) ).

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

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

fof(f1908,plain,
    ~ ssList(nil),
    inference(resolution,[],[f1906,f601]) ).

fof(f601,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f590]) ).

fof(f590,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ~ ssList(X1)
      | ~ neq(X1,X1) ),
    inference(equality_resolution,[],[f557]) ).

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

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

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

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

fof(f1906,plain,
    neq(nil,nil),
    inference(trivial_inequality_removal,[],[f1904]) ).

fof(f1904,plain,
    ( nil != nil
    | neq(nil,nil) ),
    inference(backward_demodulation,[],[f1846,f1881]) ).

fof(f1881,plain,
    nil = sK12,
    inference(trivial_inequality_removal,[],[f1880]) ).

fof(f1880,plain,
    ( nil = sK12
    | nil != nil ),
    inference(superposition,[],[f614,f1847]) ).

fof(f1847,plain,
    nil = sK15,
    inference(backward_demodulation,[],[f382,f1844]) ).

fof(f1844,plain,
    nil = sK13,
    inference(subsumption_resolution,[],[f1843,f935]) ).

fof(f935,plain,
    ( sF60 = sK12
    | nil = sK13 ),
    inference(subsumption_resolution,[],[f934,f411]) ).

fof(f934,plain,
    ( nil = sK13
    | sF60 = sK12
    | ~ ssList(nil) ),
    inference(subsumption_resolution,[],[f932,f609]) ).

fof(f609,plain,
    ssList(sK13),
    inference(forward_demodulation,[],[f376,f382]) ).

fof(f376,plain,
    ssList(sK15),
    inference(cnf_transformation,[],[f253]) ).

fof(f253,plain,
    ( ssList(sK14)
    & sK14 = sK12
    & sK13 = sK15
    & ( ( nil = sK13
        & nil != sK12 )
      | ( neq(sK13,nil)
        & ! [X4] :
            ( ! [X5] :
                ( app(cons(X4,nil),X5) != sK13
                | app(X5,cons(X4,nil)) != sK12
                | ~ ssList(X5) )
            | ~ ssItem(X4) ) ) )
    & ( nil = sK14
      | nil != sK15 )
    & ssList(sK15)
    & ( ! [X6] :
          ( ~ ssList(X6)
          | ! [X7] :
              ( ! [X8] :
                  ( ~ neq(nil,sK15)
                  | ~ ssList(X8)
                  | tl(sK15) != X7
                  | ! [X9] :
                      ( cons(X9,nil) != X8
                      | ~ ssItem(X9)
                      | ~ neq(nil,sK15)
                      | hd(sK15) != X9 )
                  | app(X7,X8) != X6 )
              | ~ ssList(X7) )
          | sK14 = X6 )
      | ~ neq(sK15,nil) )
    & ssList(sK13)
    & ssList(sK12) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15])],[f220,f252,f251,f250,f249]) ).

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

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

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

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

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

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

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

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

fof(f932,plain,
    ( nil = sK13
    | sF60 = sK12
    | ~ ssList(sK13)
    | ~ ssList(nil) ),
    inference(duplicate_literal_removal,[],[f930]) ).

fof(f930,plain,
    ( nil = sK13
    | sF60 = sK12
    | ~ ssList(sK13)
    | nil = sK13
    | ~ ssList(nil) ),
    inference(resolution,[],[f558,f733]) ).

fof(f733,plain,
    ( ~ neq(nil,sK13)
    | sF60 = sK12
    | nil = sK13 ),
    inference(subsumption_resolution,[],[f732,f381]) ).

fof(f381,plain,
    ( neq(sK13,nil)
    | nil = sK13 ),
    inference(cnf_transformation,[],[f253]) ).

fof(f732,plain,
    ( ~ neq(sK13,nil)
    | sF60 = sK12
    | nil = sK13
    | ~ neq(nil,sK13) ),
    inference(subsumption_resolution,[],[f731,f722]) ).

fof(f722,plain,
    ( ssList(sF57)
    | nil = sK13 ),
    inference(subsumption_resolution,[],[f721,f609]) ).

fof(f721,plain,
    ( nil = sK13
    | ssList(sF57)
    | ~ ssList(sK13) ),
    inference(superposition,[],[f554,f608]) ).

fof(f608,plain,
    tl(sK13) = sF57,
    inference(forward_demodulation,[],[f591,f382]) ).

fof(f591,plain,
    tl(sK15) = sF57,
    introduced(function_definition,[]) ).

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

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

fof(f119,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/sandbox/benchmark/theBenchmark.p',ax24) ).

fof(f731,plain,
    ( ~ neq(sK13,nil)
    | ~ ssList(sF57)
    | nil = sK13
    | sF60 = sK12
    | ~ neq(nil,sK13) ),
    inference(subsumption_resolution,[],[f730,f687]) ).

fof(f687,plain,
    ( ssList(sF59)
    | nil = sK13 ),
    inference(resolution,[],[f684,f680]) ).

fof(f680,plain,
    ( ssItem(sF58)
    | nil = sK13 ),
    inference(subsumption_resolution,[],[f679,f609]) ).

fof(f679,plain,
    ( ssItem(sF58)
    | ~ ssList(sK13)
    | nil = sK13 ),
    inference(superposition,[],[f410,f607]) ).

fof(f607,plain,
    sF58 = hd(sK13),
    inference(forward_demodulation,[],[f592,f382]) ).

fof(f592,plain,
    hd(sK15) = sF58,
    introduced(function_definition,[]) ).

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

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

fof(f205,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/sandbox/benchmark/theBenchmark.p',ax22) ).

fof(f684,plain,
    ( ~ ssItem(sF58)
    | ssList(sF59) ),
    inference(subsumption_resolution,[],[f683,f411]) ).

fof(f683,plain,
    ( ~ ssItem(sF58)
    | ssList(sF59)
    | ~ ssList(nil) ),
    inference(superposition,[],[f448,f593]) ).

fof(f593,plain,
    sF59 = cons(sF58,nil),
    introduced(function_definition,[]) ).

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

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

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

fof(f730,plain,
    ( ~ neq(sK13,nil)
    | sF60 = sK12
    | ~ ssList(sF57)
    | ~ ssList(sF59)
    | ~ neq(nil,sK13)
    | nil = sK13 ),
    inference(subsumption_resolution,[],[f727,f680]) ).

fof(f727,plain,
    ( ~ ssItem(sF58)
    | ~ neq(nil,sK13)
    | ~ neq(sK13,nil)
    | ~ ssList(sF57)
    | ~ ssList(sF59)
    | nil = sK13
    | sF60 = sK12 ),
    inference(resolution,[],[f726,f613]) ).

fof(f613,plain,
    ( ~ ssList(sF60)
    | ~ neq(nil,sK13)
    | ~ ssItem(sF58)
    | sF60 = sK12
    | ~ ssList(sF57)
    | ~ ssList(sF59)
    | ~ neq(sK13,nil) ),
    inference(backward_demodulation,[],[f606,f383]) ).

fof(f383,plain,
    sK14 = sK12,
    inference(cnf_transformation,[],[f253]) ).

fof(f606,plain,
    ( ~ neq(nil,sK13)
    | ~ neq(sK13,nil)
    | ~ ssList(sF60)
    | sK14 = sF60
    | ~ ssList(sF59)
    | ~ ssItem(sF58)
    | ~ ssList(sF57) ),
    inference(forward_demodulation,[],[f605,f382]) ).

fof(f605,plain,
    ( ~ neq(sK13,nil)
    | ~ ssList(sF59)
    | ~ neq(nil,sK15)
    | ~ ssList(sF60)
    | ~ ssItem(sF58)
    | sK14 = sF60
    | ~ ssList(sF57) ),
    inference(forward_demodulation,[],[f600,f382]) ).

fof(f600,plain,
    ( ~ ssList(sF59)
    | ~ ssItem(sF58)
    | ~ ssList(sF57)
    | sK14 = sF60
    | ~ ssList(sF60)
    | ~ neq(sK15,nil)
    | ~ neq(nil,sK15) ),
    inference(duplicate_literal_removal,[],[f595]) ).

fof(f595,plain,
    ( ~ ssItem(sF58)
    | ~ neq(nil,sK15)
    | ~ ssList(sF57)
    | ~ neq(sK15,nil)
    | ~ ssList(sF60)
    | sK14 = sF60
    | ~ ssList(sF59)
    | ~ neq(nil,sK15) ),
    inference(definition_folding,[],[f569,f594,f593,f592,f591,f591,f592,f593,f592,f594,f593,f592,f591]) ).

fof(f594,plain,
    sF60 = app(sF57,sF59),
    introduced(function_definition,[]) ).

fof(f569,plain,
    ( ~ ssList(app(tl(sK15),cons(hd(sK15),nil)))
    | ~ neq(nil,sK15)
    | ~ ssList(cons(hd(sK15),nil))
    | ~ ssItem(hd(sK15))
    | ~ neq(nil,sK15)
    | ~ ssList(tl(sK15))
    | app(tl(sK15),cons(hd(sK15),nil)) = sK14
    | ~ neq(sK15,nil) ),
    inference(equality_resolution,[],[f568]) ).

fof(f568,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | ~ neq(nil,sK15)
      | ~ ssList(cons(hd(sK15),nil))
      | ~ ssItem(hd(sK15))
      | ~ neq(nil,sK15)
      | app(tl(sK15),cons(hd(sK15),nil)) != X6
      | ~ ssList(tl(sK15))
      | sK14 = X6
      | ~ neq(sK15,nil) ),
    inference(equality_resolution,[],[f567]) ).

fof(f567,plain,
    ! [X6,X9] :
      ( ~ ssList(X6)
      | ~ neq(nil,sK15)
      | ~ ssList(cons(X9,nil))
      | ~ ssItem(X9)
      | ~ neq(nil,sK15)
      | hd(sK15) != X9
      | app(tl(sK15),cons(X9,nil)) != X6
      | ~ ssList(tl(sK15))
      | sK14 = X6
      | ~ neq(sK15,nil) ),
    inference(equality_resolution,[],[f566]) ).

fof(f566,plain,
    ! [X8,X6,X9] :
      ( ~ ssList(X6)
      | ~ neq(nil,sK15)
      | ~ ssList(X8)
      | cons(X9,nil) != X8
      | ~ ssItem(X9)
      | ~ neq(nil,sK15)
      | hd(sK15) != X9
      | app(tl(sK15),X8) != X6
      | ~ ssList(tl(sK15))
      | sK14 = X6
      | ~ neq(sK15,nil) ),
    inference(equality_resolution,[],[f375]) ).

fof(f375,plain,
    ! [X8,X6,X9,X7] :
      ( ~ ssList(X6)
      | ~ neq(nil,sK15)
      | ~ ssList(X8)
      | tl(sK15) != X7
      | cons(X9,nil) != X8
      | ~ ssItem(X9)
      | ~ neq(nil,sK15)
      | hd(sK15) != X9
      | app(X7,X8) != X6
      | ~ ssList(X7)
      | sK14 = X6
      | ~ neq(sK15,nil) ),
    inference(cnf_transformation,[],[f253]) ).

fof(f726,plain,
    ( ssList(sF60)
    | nil = sK13 ),
    inference(subsumption_resolution,[],[f723,f687]) ).

fof(f723,plain,
    ( ~ ssList(sF59)
    | ssList(sF60)
    | nil = sK13 ),
    inference(resolution,[],[f722,f705]) ).

fof(f705,plain,
    ( ~ ssList(sF57)
    | ~ ssList(sF59)
    | ssList(sF60) ),
    inference(superposition,[],[f468,f594]) ).

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

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

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

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

fof(f1843,plain,
    ( sF60 != sK12
    | nil = sK13 ),
    inference(superposition,[],[f1714,f594]) ).

fof(f1714,plain,
    ( sK12 != app(sF57,sF59)
    | nil = sK13 ),
    inference(subsumption_resolution,[],[f1713,f1080]) ).

fof(f1080,plain,
    ( cons(sF58,sF57) = sK13
    | nil = sK13 ),
    inference(forward_demodulation,[],[f1079,f607]) ).

fof(f1079,plain,
    ( nil = sK13
    | cons(hd(sK13),sF57) = sK13 ),
    inference(forward_demodulation,[],[f1056,f608]) ).

fof(f1056,plain,
    ( nil = sK13
    | sK13 = cons(hd(sK13),tl(sK13)) ),
    inference(resolution,[],[f457,f609]) ).

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

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

fof(f128,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/sandbox/benchmark/theBenchmark.p',ax78) ).

fof(f1713,plain,
    ( nil = sK13
    | sK12 != app(sF57,sF59)
    | cons(sF58,sF57) != sK13 ),
    inference(subsumption_resolution,[],[f1701,f722]) ).

fof(f1701,plain,
    ( ~ ssList(sF57)
    | sK12 != app(sF57,sF59)
    | nil = sK13
    | cons(sF58,sF57) != sK13 ),
    inference(duplicate_literal_removal,[],[f1695]) ).

fof(f1695,plain,
    ( ~ ssList(sF57)
    | nil = sK13
    | cons(sF58,sF57) != sK13
    | sK12 != app(sF57,sF59)
    | nil = sK13 ),
    inference(superposition,[],[f686,f1281]) ).

fof(f1281,plain,
    ( cons(sF58,sF57) = app(sF59,sF57)
    | nil = sK13 ),
    inference(duplicate_literal_removal,[],[f1274]) ).

fof(f1274,plain,
    ( cons(sF58,sF57) = app(sF59,sF57)
    | nil = sK13
    | nil = sK13 ),
    inference(resolution,[],[f1220,f722]) ).

fof(f1220,plain,
    ! [X38] :
      ( ~ ssList(X38)
      | app(sF59,X38) = cons(sF58,X38)
      | nil = sK13 ),
    inference(forward_demodulation,[],[f1219,f593]) ).

fof(f1219,plain,
    ! [X38] :
      ( nil = sK13
      | ~ ssList(X38)
      | app(cons(sF58,nil),X38) = cons(sF58,X38) ),
    inference(resolution,[],[f424,f680]) ).

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

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

fof(f81,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => cons(X1,X0) = app(cons(X1,nil),X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).

fof(f686,plain,
    ! [X0] :
      ( sK13 != app(sF59,X0)
      | app(X0,sF59) != sK12
      | ~ ssList(X0)
      | nil = sK13 ),
    inference(duplicate_literal_removal,[],[f685]) ).

fof(f685,plain,
    ! [X0] :
      ( nil = sK13
      | nil = sK13
      | ~ ssList(X0)
      | sK13 != app(sF59,X0)
      | app(X0,sF59) != sK12 ),
    inference(resolution,[],[f680,f617]) ).

fof(f617,plain,
    ! [X0] :
      ( ~ ssItem(sF58)
      | app(X0,sF59) != sK12
      | nil = sK13
      | ~ ssList(X0)
      | sK13 != app(sF59,X0) ),
    inference(superposition,[],[f380,f593]) ).

fof(f380,plain,
    ! [X4,X5] :
      ( app(cons(X4,nil),X5) != sK13
      | nil = sK13
      | ~ ssList(X5)
      | ~ ssItem(X4)
      | app(X5,cons(X4,nil)) != sK12 ),
    inference(cnf_transformation,[],[f253]) ).

fof(f382,plain,
    sK13 = sK15,
    inference(cnf_transformation,[],[f253]) ).

fof(f614,plain,
    ( nil != sK15
    | nil = sK12 ),
    inference(backward_demodulation,[],[f377,f383]) ).

fof(f377,plain,
    ( nil = sK14
    | nil != sK15 ),
    inference(cnf_transformation,[],[f253]) ).

fof(f1846,plain,
    ( nil != sK12
    | neq(nil,nil) ),
    inference(backward_demodulation,[],[f379,f1844]) ).

fof(f379,plain,
    ( neq(sK13,nil)
    | nil != sK12 ),
    inference(cnf_transformation,[],[f253]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC311+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34  % Computer : n009.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 18:42:50 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.20/0.54  % (10993)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.54  % (10979)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.51/0.55  % (10985)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 1.51/0.55  % (10970)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.51/0.55  % (10978)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.51/0.55  % (10978)Instruction limit reached!
% 1.51/0.55  % (10978)------------------------------
% 1.51/0.55  % (10978)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.55  % (10978)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.55  % (10978)Termination reason: Unknown
% 1.51/0.55  % (10978)Termination phase: shuffling
% 1.51/0.55  
% 1.51/0.55  % (10978)Memory used [KB]: 895
% 1.51/0.55  % (10978)Time elapsed: 0.003 s
% 1.51/0.55  % (10978)Instructions burned: 2 (million)
% 1.51/0.55  % (10978)------------------------------
% 1.51/0.55  % (10978)------------------------------
% 1.51/0.56  % (10975)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.51/0.56  % (10976)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.51/0.57  % (10994)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.73/0.58  % (10971)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.73/0.58  % (10973)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.73/0.58  % (10974)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.73/0.60  % (10995)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.73/0.60  % (10972)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.73/0.60  % (10999)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.73/0.60  % (10998)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.73/0.60  % (10984)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.73/0.61  % (10992)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 1.73/0.61  % (10988)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.73/0.61  % (10997)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.73/0.62  TRYING [1]
% 1.73/0.62  % (10987)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.73/0.62  % (10991)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.73/0.62  % (10982)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.73/0.62  % (10989)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.73/0.62  TRYING [2]
% 1.73/0.62  TRYING [1]
% 1.73/0.62  % (10983)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.73/0.62  % (10986)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.73/0.63  % (10990)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.73/0.63  % (10981)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.73/0.63  % (10971)Refutation not found, incomplete strategy% (10971)------------------------------
% 1.73/0.63  % (10971)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.73/0.63  % (10971)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.73/0.63  % (10971)Termination reason: Refutation not found, incomplete strategy
% 1.73/0.63  
% 1.73/0.63  % (10971)Memory used [KB]: 6140
% 1.73/0.63  % (10971)Time elapsed: 0.209 s
% 1.73/0.63  % (10971)Instructions burned: 21 (million)
% 1.73/0.63  % (10971)------------------------------
% 1.73/0.63  % (10971)------------------------------
% 1.73/0.64  % (10977)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.73/0.64  % (10979)Instruction limit reached!
% 1.73/0.64  % (10979)------------------------------
% 1.73/0.64  % (10979)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.73/0.64  % (10977)Instruction limit reached!
% 1.73/0.64  % (10977)------------------------------
% 1.73/0.64  % (10977)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.73/0.64  % (10977)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.73/0.64  % (10977)Termination reason: Unknown
% 1.73/0.64  % (10977)Termination phase: Function definition elimination
% 1.73/0.64  
% 1.73/0.64  % (10977)Memory used [KB]: 1279
% 1.73/0.64  % (10977)Time elapsed: 0.007 s
% 1.73/0.64  % (10977)Instructions burned: 8 (million)
% 1.73/0.64  % (10977)------------------------------
% 1.73/0.64  % (10977)------------------------------
% 1.73/0.64  % (10996)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.73/0.64  TRYING [2]
% 2.27/0.65  % (10980)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 2.27/0.65  % (10979)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.27/0.65  % (10979)Termination reason: Unknown
% 2.27/0.65  % (10979)Termination phase: Saturation
% 2.27/0.65  
% 2.27/0.65  % (10979)Memory used [KB]: 2174
% 2.27/0.65  % (10979)Time elapsed: 0.147 s
% 2.27/0.65  % (10979)Instructions burned: 52 (million)
% 2.27/0.65  % (10979)------------------------------
% 2.27/0.65  % (10979)------------------------------
% 2.27/0.66  TRYING [3]
% 2.49/0.68  % (10976)Instruction limit reached!
% 2.49/0.68  % (10976)------------------------------
% 2.49/0.68  % (10976)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.49/0.68  % (10976)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.49/0.68  % (10976)Termination reason: Unknown
% 2.49/0.68  % (10976)Termination phase: Finite model building SAT solving
% 2.49/0.68  
% 2.49/0.68  % (10976)Memory used [KB]: 7164
% 2.49/0.68  % (10976)Time elapsed: 0.241 s
% 2.49/0.68  % (10976)Instructions burned: 51 (million)
% 2.49/0.68  % (10976)------------------------------
% 2.49/0.68  % (10976)------------------------------
% 2.49/0.69  % (10972)Instruction limit reached!
% 2.49/0.69  % (10972)------------------------------
% 2.49/0.69  % (10972)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.49/0.69  % (10972)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.49/0.69  % (10972)Termination reason: Unknown
% 2.49/0.69  % (10972)Termination phase: Saturation
% 2.49/0.69  
% 2.49/0.69  % (10972)Memory used [KB]: 1663
% 2.49/0.69  % (10972)Time elapsed: 0.258 s
% 2.49/0.69  % (10972)Instructions burned: 38 (million)
% 2.49/0.69  % (10972)------------------------------
% 2.49/0.69  % (10972)------------------------------
% 2.49/0.70  % (10975)Instruction limit reached!
% 2.49/0.70  % (10975)------------------------------
% 2.49/0.70  % (10975)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.49/0.70  % (10975)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.49/0.70  % (10975)Termination reason: Unknown
% 2.49/0.70  % (10975)Termination phase: Saturation
% 2.49/0.70  
% 2.49/0.70  % (10975)Memory used [KB]: 6268
% 2.49/0.70  % (10975)Time elapsed: 0.283 s
% 2.49/0.70  % (10975)Instructions burned: 48 (million)
% 2.49/0.70  % (10975)------------------------------
% 2.49/0.70  % (10975)------------------------------
% 2.49/0.70  % (10985)Instruction limit reached!
% 2.49/0.70  % (10985)------------------------------
% 2.49/0.70  % (10985)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.49/0.70  % (10985)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.49/0.70  % (10985)Termination reason: Unknown
% 2.49/0.70  % (10985)Termination phase: Saturation
% 2.49/0.70  
% 2.49/0.70  % (10985)Memory used [KB]: 2302
% 2.49/0.70  % (10985)Time elapsed: 0.212 s
% 2.49/0.70  % (10985)Instructions burned: 75 (million)
% 2.49/0.70  % (10985)------------------------------
% 2.49/0.70  % (10985)------------------------------
% 2.49/0.70  TRYING [1]
% 2.49/0.70  TRYING [2]
% 2.49/0.72  % (10973)Instruction limit reached!
% 2.49/0.72  % (10973)------------------------------
% 2.49/0.72  % (10973)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.49/0.72  % (10973)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.49/0.72  % (10973)Termination reason: Unknown
% 2.49/0.72  % (10973)Termination phase: Saturation
% 2.49/0.72  
% 2.49/0.72  % (10973)Memory used [KB]: 6652
% 2.49/0.72  % (10973)Time elapsed: 0.300 s
% 2.49/0.72  % (10973)Instructions burned: 51 (million)
% 2.49/0.72  % (10973)------------------------------
% 2.49/0.72  % (10973)------------------------------
% 2.49/0.72  % (10974)Instruction limit reached!
% 2.49/0.72  % (10974)------------------------------
% 2.49/0.72  % (10974)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.49/0.72  % (10974)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.49/0.72  % (10974)Termination reason: Unknown
% 2.49/0.72  % (10974)Termination phase: Saturation
% 2.49/0.72  
% 2.49/0.72  % (10974)Memory used [KB]: 6652
% 2.49/0.72  % (10974)Time elapsed: 0.309 s
% 2.49/0.72  % (10974)Instructions burned: 51 (million)
% 2.49/0.72  % (10974)------------------------------
% 2.49/0.72  % (10974)------------------------------
% 2.96/0.75  % (10987)Instruction limit reached!
% 2.96/0.75  % (10987)------------------------------
% 2.96/0.75  % (10987)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.96/0.75  % (10987)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.96/0.75  % (10987)Termination reason: Unknown
% 2.96/0.75  % (10987)Termination phase: Finite model building SAT solving
% 2.96/0.75  
% 2.96/0.75  % (10987)Memory used [KB]: 7419
% 2.96/0.75  % (10987)Time elapsed: 0.289 s
% 2.96/0.75  % (10987)Instructions burned: 60 (million)
% 2.96/0.75  % (10987)------------------------------
% 2.96/0.75  % (10987)------------------------------
% 2.96/0.77  % (11032)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=388:si=on:rawr=on:rtra=on_0 on theBenchmark for (2997ds/388Mi)
% 2.96/0.79  % (10980)Instruction limit reached!
% 2.96/0.79  % (10980)------------------------------
% 2.96/0.79  % (10980)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.96/0.79  % (10980)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.96/0.79  % (10980)Termination reason: Unknown
% 2.96/0.79  % (10980)Termination phase: Saturation
% 2.96/0.79  
% 2.96/0.79  % (10980)Memory used [KB]: 6524
% 2.96/0.79  % (10980)Time elapsed: 0.366 s
% 2.96/0.79  % (10980)Instructions burned: 50 (million)
% 2.96/0.79  % (10980)------------------------------
% 2.96/0.79  % (10980)------------------------------
% 2.96/0.80  % (10984)Instruction limit reached!
% 2.96/0.80  % (10984)------------------------------
% 2.96/0.80  % (10984)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.96/0.80  % (10984)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.96/0.80  % (10984)Termination reason: Unknown
% 2.96/0.80  % (10984)Termination phase: Saturation
% 2.96/0.80  
% 2.96/0.80  % (10984)Memory used [KB]: 7036
% 2.96/0.80  % (10984)Time elapsed: 0.058 s
% 2.96/0.80  % (10984)Instructions burned: 68 (million)
% 2.96/0.80  % (10984)------------------------------
% 2.96/0.80  % (10984)------------------------------
% 3.36/0.83  % (10996)Instruction limit reached!
% 3.36/0.83  % (10996)------------------------------
% 3.36/0.83  % (10996)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.36/0.83  % (10996)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.36/0.83  % (10996)Termination reason: Unknown
% 3.36/0.83  % (10996)Termination phase: Saturation
% 3.36/0.83  
% 3.36/0.83  % (10996)Memory used [KB]: 7164
% 3.36/0.83  % (10996)Time elapsed: 0.061 s
% 3.36/0.83  % (10996)Instructions burned: 69 (million)
% 3.36/0.83  % (10996)------------------------------
% 3.36/0.83  % (10996)------------------------------
% 3.36/0.83  TRYING [4]
% 3.36/0.85  % (11035)ott+1_1:2_i=920:si=on:rawr=on:rtra=on_0 on theBenchmark for (2996ds/920Mi)
% 3.59/0.87  % (10982)Instruction limit reached!
% 3.59/0.87  % (10982)------------------------------
% 3.59/0.87  % (10982)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.59/0.88  % (10986)Instruction limit reached!
% 3.59/0.88  % (10986)------------------------------
% 3.59/0.88  % (10986)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.59/0.88  % (11033)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=211:si=on:rawr=on:rtra=on_0 on theBenchmark for (2997ds/211Mi)
% 3.59/0.88  % (10986)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.59/0.88  % (10986)Termination reason: Unknown
% 3.59/0.88  % (10986)Termination phase: Saturation
% 3.59/0.88  
% 3.59/0.88  % (10986)Memory used [KB]: 6908
% 3.59/0.88  % (10986)Time elapsed: 0.461 s
% 3.59/0.88  % (10986)Instructions burned: 99 (million)
% 3.59/0.88  % (10986)------------------------------
% 3.59/0.88  % (10986)------------------------------
% 3.59/0.88  % (10982)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.59/0.88  % (10982)Termination reason: Unknown
% 3.59/0.88  % (10982)Termination phase: Saturation
% 3.59/0.88  
% 3.59/0.88  % (10982)Memory used [KB]: 7547
% 3.59/0.88  % (10982)Time elapsed: 0.449 s
% 3.59/0.88  % (10982)Instructions burned: 101 (million)
% 3.59/0.88  % (10982)------------------------------
% 3.59/0.88  % (10982)------------------------------
% 3.59/0.89  % (11034)dis+22_1:128_bsd=on:rp=on:slsq=on:slsqc=1:slsqr=1,6:sp=frequency:spb=goal:thsq=on:thsqc=16:thsqd=1:thsql=off:i=90:si=on:rawr=on:rtra=on_0 on theBenchmark for (2997ds/90Mi)
% 3.59/0.89  % (10989)Instruction limit reached!
% 3.59/0.89  % (10989)------------------------------
% 3.59/0.89  % (10989)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.59/0.89  % (10988)Instruction limit reached!
% 3.59/0.89  % (10988)------------------------------
% 3.59/0.89  % (10988)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.59/0.89  % (10988)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.59/0.89  % (10989)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.59/0.89  % (10988)Termination reason: Unknown
% 3.59/0.89  % (10989)Termination reason: Unknown
% 3.59/0.89  % (10988)Termination phase: Saturation
% 3.59/0.89  % (10989)Termination phase: Saturation
% 3.59/0.89  
% 3.59/0.89  
% 3.59/0.89  % (10988)Memory used [KB]: 7419
% 3.59/0.89  % (10989)Memory used [KB]: 2686
% 3.59/0.89  % (10988)Time elapsed: 0.471 s
% 3.59/0.89  % (10989)Time elapsed: 0.478 s
% 3.59/0.89  % (10988)Instructions burned: 100 (million)
% 3.59/0.89  % (10989)Instructions burned: 100 (million)
% 3.59/0.89  % (10988)------------------------------
% 3.59/0.89  % (10988)------------------------------
% 3.59/0.89  % (10989)------------------------------
% 3.59/0.89  % (10989)------------------------------
% 3.59/0.90  % (11037)ott+1_1:7_bd=off:i=934:si=on:rawr=on:rtra=on_0 on theBenchmark for (2996ds/934Mi)
% 3.59/0.90  % (10983)Instruction limit reached!
% 3.59/0.90  % (10983)------------------------------
% 3.59/0.90  % (10983)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.59/0.90  % (10981)Instruction limit reached!
% 3.59/0.90  % (10981)------------------------------
% 3.59/0.90  % (10981)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.59/0.90  % (10981)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.59/0.90  % (10983)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.59/0.90  % (10981)Termination reason: Unknown
% 3.59/0.90  % (10983)Termination reason: Unknown
% 3.59/0.90  % (10981)Termination phase: Saturation
% 3.59/0.90  % (10983)Termination phase: Saturation
% 3.59/0.90  
% 3.59/0.90  
% 3.59/0.90  % (10981)Memory used [KB]: 7675
% 3.59/0.90  % (10983)Memory used [KB]: 7291
% 3.59/0.90  % (10981)Time elapsed: 0.485 s
% 3.59/0.90  % (10983)Time elapsed: 0.468 s
% 3.59/0.90  % (10981)Instructions burned: 100 (million)
% 3.59/0.90  % (10983)Instructions burned: 99 (million)
% 3.59/0.90  % (10981)------------------------------
% 3.59/0.90  % (10981)------------------------------
% 3.59/0.90  % (10983)------------------------------
% 3.59/0.90  % (10983)------------------------------
% 3.59/0.90  % (11039)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=655:si=on:rawr=on:rtra=on_0 on theBenchmark for (2996ds/655Mi)
% 3.59/0.91  % (10997)First to succeed.
% 3.59/0.92  % (11042)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=940:si=on:rawr=on:rtra=on_0 on theBenchmark for (2996ds/940Mi)
% 3.59/0.92  % (10997)Refutation found. Thanks to Tanya!
% 3.59/0.92  % SZS status Theorem for theBenchmark
% 3.59/0.92  % SZS output start Proof for theBenchmark
% See solution above
% 3.59/0.92  % (10997)------------------------------
% 3.59/0.92  % (10997)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.59/0.92  % (10997)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.59/0.92  % (10997)Termination reason: Refutation
% 3.59/0.92  
% 3.59/0.92  % (10997)Memory used [KB]: 2686
% 3.59/0.92  % (10997)Time elapsed: 0.479 s
% 3.59/0.92  % (10997)Instructions burned: 110 (million)
% 3.59/0.92  % (10997)------------------------------
% 3.59/0.92  % (10997)------------------------------
% 3.59/0.92  % (10969)Success in time 0.562 s
%------------------------------------------------------------------------------