TSTP Solution File: SWC248+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC248+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_uns --cores 0 -t %d %s

% Computer : n017.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:39:52 EDT 2022

% Result   : Theorem 0.20s 0.57s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   87 (   9 unt;   0 def)
%            Number of atoms       :  852 ( 230 equ)
%            Maximal formula atoms :   72 (   9 avg)
%            Number of connectives : 1247 ( 482   ~; 456   |; 277   &)
%                                         (   4 <=>;  28  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   32 (   8 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   5 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-3 aty)
%            Number of variables   :  340 ( 238   !; 102   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f536,plain,
    $false,
    inference(avatar_sat_refutation,[],[f314,f315,f506,f518,f533]) ).

fof(f533,plain,
    ( spl19_1
    | ~ spl19_3
    | ~ spl19_8
    | ~ spl19_9 ),
    inference(avatar_contradiction_clause,[],[f532]) ).

fof(f532,plain,
    ( $false
    | spl19_1
    | ~ spl19_3
    | ~ spl19_8
    | ~ spl19_9 ),
    inference(subsumption_resolution,[],[f530,f505]) ).

fof(f505,plain,
    ( ssItem(sK16(sK1(sK14),nil,sK0(sK14)))
    | ~ spl19_9 ),
    inference(avatar_component_clause,[],[f503]) ).

fof(f503,plain,
    ( spl19_9
  <=> ssItem(sK16(sK1(sK14),nil,sK0(sK14))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl19_9])]) ).

fof(f530,plain,
    ( ~ ssItem(sK16(sK1(sK14),nil,sK0(sK14)))
    | spl19_1
    | ~ spl19_3
    | ~ spl19_8 ),
    inference(resolution,[],[f529,f209]) ).

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

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

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

fof(f529,plain,
    ( memberP(nil,sK16(sK1(sK14),nil,sK0(sK14)))
    | spl19_1
    | ~ spl19_3
    | ~ spl19_8 ),
    inference(subsumption_resolution,[],[f528,f255]) ).

fof(f255,plain,
    ssList(sK14),
    inference(cnf_transformation,[],[f187]) ).

fof(f187,plain,
    ( nil != sK12
    & sK13 = sK15
    & ( nil != sK14
      | nil = sK15 )
    & sK12 = sK14
    & ssList(sK15)
    & ! [X4] :
        ( ~ ssItem(X4)
        | ! [X5] :
            ( ! [X6] :
                ( app(app(X5,cons(X4,nil)),X6) != sK12
                | ( ssItem(sK16(X4,X5,X6))
                  & memberP(X5,sK16(X4,X5,X6))
                  & lt(X4,sK16(X4,X5,X6))
                  & ~ leq(X4,sK16(X4,X5,X6))
                  & memberP(X6,sK16(X4,X5,X6)) )
                | ~ ssList(X6) )
            | ~ ssList(X5) ) )
    & ssList(sK17)
    & ssList(sK18)
    & ! [X10] :
        ( ! [X11] :
            ( ~ ssList(X11)
            | app(X11,cons(X10,nil)) != sK17
            | ! [X12] :
                ( ! [X13] :
                    ( ~ ssList(X13)
                    | ~ leq(X10,X12)
                    | app(cons(X12,nil),X13) != sK14 )
                | ~ ssItem(X12) ) )
        | ~ ssItem(X10) )
    & ! [X14] :
        ( ! [X15] :
            ( app(cons(X14,nil),X15) != sK18
            | ! [X16] :
                ( ~ ssItem(X16)
                | ! [X17] :
                    ( app(X17,cons(X16,nil)) != sK14
                    | ~ leq(X16,X14)
                    | ~ ssList(X17) ) )
            | ~ ssList(X15) )
        | ~ ssItem(X14) )
    & totalorderedP(sK14)
    & app(app(sK17,sK14),sK18) = sK15
    & ssList(sK14)
    & ssList(sK13)
    & ssList(sK12) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15,sK16,sK17,sK18])],[f179,f186,f185,f184,f183,f182,f181,f180]) ).

fof(f180,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( nil != X0
                    & X1 = X3
                    & ( nil != X2
                      | nil = X3 )
                    & X0 = X2
                    & ssList(X3)
                    & ! [X4] :
                        ( ~ ssItem(X4)
                        | ! [X5] :
                            ( ! [X6] :
                                ( app(app(X5,cons(X4,nil)),X6) != X0
                                | ? [X7] :
                                    ( ssItem(X7)
                                    & memberP(X5,X7)
                                    & lt(X4,X7)
                                    & ~ leq(X4,X7)
                                    & memberP(X6,X7) )
                                | ~ ssList(X6) )
                            | ~ ssList(X5) ) )
                    & ? [X8] :
                        ( ssList(X8)
                        & ? [X9] :
                            ( ssList(X9)
                            & ! [X10] :
                                ( ! [X11] :
                                    ( ~ ssList(X11)
                                    | app(X11,cons(X10,nil)) != X8
                                    | ! [X12] :
                                        ( ! [X13] :
                                            ( ~ ssList(X13)
                                            | ~ leq(X10,X12)
                                            | app(cons(X12,nil),X13) != X2 )
                                        | ~ ssItem(X12) ) )
                                | ~ ssItem(X10) )
                            & ! [X14] :
                                ( ! [X15] :
                                    ( app(cons(X14,nil),X15) != X9
                                    | ! [X16] :
                                        ( ~ ssItem(X16)
                                        | ! [X17] :
                                            ( app(X17,cons(X16,nil)) != X2
                                            | ~ leq(X16,X14)
                                            | ~ ssList(X17) ) )
                                    | ~ ssList(X15) )
                                | ~ ssItem(X14) )
                            & totalorderedP(X2)
                            & app(app(X8,X2),X9) = X3 ) ) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( nil != sK12
                  & X1 = X3
                  & ( nil != X2
                    | nil = X3 )
                  & sK12 = X2
                  & ssList(X3)
                  & ! [X4] :
                      ( ~ ssItem(X4)
                      | ! [X5] :
                          ( ! [X6] :
                              ( app(app(X5,cons(X4,nil)),X6) != sK12
                              | ? [X7] :
                                  ( ssItem(X7)
                                  & memberP(X5,X7)
                                  & lt(X4,X7)
                                  & ~ leq(X4,X7)
                                  & memberP(X6,X7) )
                              | ~ ssList(X6) )
                          | ~ ssList(X5) ) )
                  & ? [X8] :
                      ( ssList(X8)
                      & ? [X9] :
                          ( ssList(X9)
                          & ! [X10] :
                              ( ! [X11] :
                                  ( ~ ssList(X11)
                                  | app(X11,cons(X10,nil)) != X8
                                  | ! [X12] :
                                      ( ! [X13] :
                                          ( ~ ssList(X13)
                                          | ~ leq(X10,X12)
                                          | app(cons(X12,nil),X13) != X2 )
                                      | ~ ssItem(X12) ) )
                              | ~ ssItem(X10) )
                          & ! [X14] :
                              ( ! [X15] :
                                  ( app(cons(X14,nil),X15) != X9
                                  | ! [X16] :
                                      ( ~ ssItem(X16)
                                      | ! [X17] :
                                          ( app(X17,cons(X16,nil)) != X2
                                          | ~ leq(X16,X14)
                                          | ~ ssList(X17) ) )
                                  | ~ ssList(X15) )
                              | ~ ssItem(X14) )
                          & totalorderedP(X2)
                          & app(app(X8,X2),X9) = X3 ) ) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK12) ) ),
    introduced(choice_axiom,[]) ).

fof(f181,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( nil != sK12
                & X1 = X3
                & ( nil != X2
                  | nil = X3 )
                & sK12 = X2
                & ssList(X3)
                & ! [X4] :
                    ( ~ ssItem(X4)
                    | ! [X5] :
                        ( ! [X6] :
                            ( app(app(X5,cons(X4,nil)),X6) != sK12
                            | ? [X7] :
                                ( ssItem(X7)
                                & memberP(X5,X7)
                                & lt(X4,X7)
                                & ~ leq(X4,X7)
                                & memberP(X6,X7) )
                            | ~ ssList(X6) )
                        | ~ ssList(X5) ) )
                & ? [X8] :
                    ( ssList(X8)
                    & ? [X9] :
                        ( ssList(X9)
                        & ! [X10] :
                            ( ! [X11] :
                                ( ~ ssList(X11)
                                | app(X11,cons(X10,nil)) != X8
                                | ! [X12] :
                                    ( ! [X13] :
                                        ( ~ ssList(X13)
                                        | ~ leq(X10,X12)
                                        | app(cons(X12,nil),X13) != X2 )
                                    | ~ ssItem(X12) ) )
                            | ~ ssItem(X10) )
                        & ! [X14] :
                            ( ! [X15] :
                                ( app(cons(X14,nil),X15) != X9
                                | ! [X16] :
                                    ( ~ ssItem(X16)
                                    | ! [X17] :
                                        ( app(X17,cons(X16,nil)) != X2
                                        | ~ leq(X16,X14)
                                        | ~ ssList(X17) ) )
                                | ~ ssList(X15) )
                            | ~ ssItem(X14) )
                        & totalorderedP(X2)
                        & app(app(X8,X2),X9) = X3 ) ) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( nil != sK12
              & sK13 = X3
              & ( nil != X2
                | nil = X3 )
              & sK12 = X2
              & ssList(X3)
              & ! [X4] :
                  ( ~ ssItem(X4)
                  | ! [X5] :
                      ( ! [X6] :
                          ( app(app(X5,cons(X4,nil)),X6) != sK12
                          | ? [X7] :
                              ( ssItem(X7)
                              & memberP(X5,X7)
                              & lt(X4,X7)
                              & ~ leq(X4,X7)
                              & memberP(X6,X7) )
                          | ~ ssList(X6) )
                      | ~ ssList(X5) ) )
              & ? [X8] :
                  ( ssList(X8)
                  & ? [X9] :
                      ( ssList(X9)
                      & ! [X10] :
                          ( ! [X11] :
                              ( ~ ssList(X11)
                              | app(X11,cons(X10,nil)) != X8
                              | ! [X12] :
                                  ( ! [X13] :
                                      ( ~ ssList(X13)
                                      | ~ leq(X10,X12)
                                      | app(cons(X12,nil),X13) != X2 )
                                  | ~ ssItem(X12) ) )
                          | ~ ssItem(X10) )
                      & ! [X14] :
                          ( ! [X15] :
                              ( app(cons(X14,nil),X15) != X9
                              | ! [X16] :
                                  ( ~ ssItem(X16)
                                  | ! [X17] :
                                      ( app(X17,cons(X16,nil)) != X2
                                      | ~ leq(X16,X14)
                                      | ~ ssList(X17) ) )
                              | ~ ssList(X15) )
                          | ~ ssItem(X14) )
                      & totalorderedP(X2)
                      & app(app(X8,X2),X9) = X3 ) ) )
          & ssList(X2) )
      & ssList(sK13) ) ),
    introduced(choice_axiom,[]) ).

fof(f182,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( nil != sK12
            & sK13 = X3
            & ( nil != X2
              | nil = X3 )
            & sK12 = X2
            & ssList(X3)
            & ! [X4] :
                ( ~ ssItem(X4)
                | ! [X5] :
                    ( ! [X6] :
                        ( app(app(X5,cons(X4,nil)),X6) != sK12
                        | ? [X7] :
                            ( ssItem(X7)
                            & memberP(X5,X7)
                            & lt(X4,X7)
                            & ~ leq(X4,X7)
                            & memberP(X6,X7) )
                        | ~ ssList(X6) )
                    | ~ ssList(X5) ) )
            & ? [X8] :
                ( ssList(X8)
                & ? [X9] :
                    ( ssList(X9)
                    & ! [X10] :
                        ( ! [X11] :
                            ( ~ ssList(X11)
                            | app(X11,cons(X10,nil)) != X8
                            | ! [X12] :
                                ( ! [X13] :
                                    ( ~ ssList(X13)
                                    | ~ leq(X10,X12)
                                    | app(cons(X12,nil),X13) != X2 )
                                | ~ ssItem(X12) ) )
                        | ~ ssItem(X10) )
                    & ! [X14] :
                        ( ! [X15] :
                            ( app(cons(X14,nil),X15) != X9
                            | ! [X16] :
                                ( ~ ssItem(X16)
                                | ! [X17] :
                                    ( app(X17,cons(X16,nil)) != X2
                                    | ~ leq(X16,X14)
                                    | ~ ssList(X17) ) )
                            | ~ ssList(X15) )
                        | ~ ssItem(X14) )
                    & totalorderedP(X2)
                    & app(app(X8,X2),X9) = X3 ) ) )
        & ssList(X2) )
   => ( ? [X3] :
          ( nil != sK12
          & sK13 = X3
          & ( nil != sK14
            | nil = X3 )
          & sK12 = sK14
          & ssList(X3)
          & ! [X4] :
              ( ~ ssItem(X4)
              | ! [X5] :
                  ( ! [X6] :
                      ( app(app(X5,cons(X4,nil)),X6) != sK12
                      | ? [X7] :
                          ( ssItem(X7)
                          & memberP(X5,X7)
                          & lt(X4,X7)
                          & ~ leq(X4,X7)
                          & memberP(X6,X7) )
                      | ~ ssList(X6) )
                  | ~ ssList(X5) ) )
          & ? [X8] :
              ( ssList(X8)
              & ? [X9] :
                  ( ssList(X9)
                  & ! [X10] :
                      ( ! [X11] :
                          ( ~ ssList(X11)
                          | app(X11,cons(X10,nil)) != X8
                          | ! [X12] :
                              ( ! [X13] :
                                  ( ~ ssList(X13)
                                  | ~ leq(X10,X12)
                                  | app(cons(X12,nil),X13) != sK14 )
                              | ~ ssItem(X12) ) )
                      | ~ ssItem(X10) )
                  & ! [X14] :
                      ( ! [X15] :
                          ( app(cons(X14,nil),X15) != X9
                          | ! [X16] :
                              ( ~ ssItem(X16)
                              | ! [X17] :
                                  ( app(X17,cons(X16,nil)) != sK14
                                  | ~ leq(X16,X14)
                                  | ~ ssList(X17) ) )
                          | ~ ssList(X15) )
                      | ~ ssItem(X14) )
                  & totalorderedP(sK14)
                  & app(app(X8,sK14),X9) = X3 ) ) )
      & ssList(sK14) ) ),
    introduced(choice_axiom,[]) ).

fof(f183,plain,
    ( ? [X3] :
        ( nil != sK12
        & sK13 = X3
        & ( nil != sK14
          | nil = X3 )
        & sK12 = sK14
        & ssList(X3)
        & ! [X4] :
            ( ~ ssItem(X4)
            | ! [X5] :
                ( ! [X6] :
                    ( app(app(X5,cons(X4,nil)),X6) != sK12
                    | ? [X7] :
                        ( ssItem(X7)
                        & memberP(X5,X7)
                        & lt(X4,X7)
                        & ~ leq(X4,X7)
                        & memberP(X6,X7) )
                    | ~ ssList(X6) )
                | ~ ssList(X5) ) )
        & ? [X8] :
            ( ssList(X8)
            & ? [X9] :
                ( ssList(X9)
                & ! [X10] :
                    ( ! [X11] :
                        ( ~ ssList(X11)
                        | app(X11,cons(X10,nil)) != X8
                        | ! [X12] :
                            ( ! [X13] :
                                ( ~ ssList(X13)
                                | ~ leq(X10,X12)
                                | app(cons(X12,nil),X13) != sK14 )
                            | ~ ssItem(X12) ) )
                    | ~ ssItem(X10) )
                & ! [X14] :
                    ( ! [X15] :
                        ( app(cons(X14,nil),X15) != X9
                        | ! [X16] :
                            ( ~ ssItem(X16)
                            | ! [X17] :
                                ( app(X17,cons(X16,nil)) != sK14
                                | ~ leq(X16,X14)
                                | ~ ssList(X17) ) )
                        | ~ ssList(X15) )
                    | ~ ssItem(X14) )
                & totalorderedP(sK14)
                & app(app(X8,sK14),X9) = X3 ) ) )
   => ( nil != sK12
      & sK13 = sK15
      & ( nil != sK14
        | nil = sK15 )
      & sK12 = sK14
      & ssList(sK15)
      & ! [X4] :
          ( ~ ssItem(X4)
          | ! [X5] :
              ( ! [X6] :
                  ( app(app(X5,cons(X4,nil)),X6) != sK12
                  | ? [X7] :
                      ( ssItem(X7)
                      & memberP(X5,X7)
                      & lt(X4,X7)
                      & ~ leq(X4,X7)
                      & memberP(X6,X7) )
                  | ~ ssList(X6) )
              | ~ ssList(X5) ) )
      & ? [X8] :
          ( ssList(X8)
          & ? [X9] :
              ( ssList(X9)
              & ! [X10] :
                  ( ! [X11] :
                      ( ~ ssList(X11)
                      | app(X11,cons(X10,nil)) != X8
                      | ! [X12] :
                          ( ! [X13] :
                              ( ~ ssList(X13)
                              | ~ leq(X10,X12)
                              | app(cons(X12,nil),X13) != sK14 )
                          | ~ ssItem(X12) ) )
                  | ~ ssItem(X10) )
              & ! [X14] :
                  ( ! [X15] :
                      ( app(cons(X14,nil),X15) != X9
                      | ! [X16] :
                          ( ~ ssItem(X16)
                          | ! [X17] :
                              ( app(X17,cons(X16,nil)) != sK14
                              | ~ leq(X16,X14)
                              | ~ ssList(X17) ) )
                      | ~ ssList(X15) )
                  | ~ ssItem(X14) )
              & totalorderedP(sK14)
              & app(app(X8,sK14),X9) = sK15 ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f184,plain,
    ! [X4,X5,X6] :
      ( ? [X7] :
          ( ssItem(X7)
          & memberP(X5,X7)
          & lt(X4,X7)
          & ~ leq(X4,X7)
          & memberP(X6,X7) )
     => ( ssItem(sK16(X4,X5,X6))
        & memberP(X5,sK16(X4,X5,X6))
        & lt(X4,sK16(X4,X5,X6))
        & ~ leq(X4,sK16(X4,X5,X6))
        & memberP(X6,sK16(X4,X5,X6)) ) ),
    introduced(choice_axiom,[]) ).

fof(f185,plain,
    ( ? [X8] :
        ( ssList(X8)
        & ? [X9] :
            ( ssList(X9)
            & ! [X10] :
                ( ! [X11] :
                    ( ~ ssList(X11)
                    | app(X11,cons(X10,nil)) != X8
                    | ! [X12] :
                        ( ! [X13] :
                            ( ~ ssList(X13)
                            | ~ leq(X10,X12)
                            | app(cons(X12,nil),X13) != sK14 )
                        | ~ ssItem(X12) ) )
                | ~ ssItem(X10) )
            & ! [X14] :
                ( ! [X15] :
                    ( app(cons(X14,nil),X15) != X9
                    | ! [X16] :
                        ( ~ ssItem(X16)
                        | ! [X17] :
                            ( app(X17,cons(X16,nil)) != sK14
                            | ~ leq(X16,X14)
                            | ~ ssList(X17) ) )
                    | ~ ssList(X15) )
                | ~ ssItem(X14) )
            & totalorderedP(sK14)
            & app(app(X8,sK14),X9) = sK15 ) )
   => ( ssList(sK17)
      & ? [X9] :
          ( ssList(X9)
          & ! [X10] :
              ( ! [X11] :
                  ( ~ ssList(X11)
                  | app(X11,cons(X10,nil)) != sK17
                  | ! [X12] :
                      ( ! [X13] :
                          ( ~ ssList(X13)
                          | ~ leq(X10,X12)
                          | app(cons(X12,nil),X13) != sK14 )
                      | ~ ssItem(X12) ) )
              | ~ ssItem(X10) )
          & ! [X14] :
              ( ! [X15] :
                  ( app(cons(X14,nil),X15) != X9
                  | ! [X16] :
                      ( ~ ssItem(X16)
                      | ! [X17] :
                          ( app(X17,cons(X16,nil)) != sK14
                          | ~ leq(X16,X14)
                          | ~ ssList(X17) ) )
                  | ~ ssList(X15) )
              | ~ ssItem(X14) )
          & totalorderedP(sK14)
          & app(app(sK17,sK14),X9) = sK15 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f186,plain,
    ( ? [X9] :
        ( ssList(X9)
        & ! [X10] :
            ( ! [X11] :
                ( ~ ssList(X11)
                | app(X11,cons(X10,nil)) != sK17
                | ! [X12] :
                    ( ! [X13] :
                        ( ~ ssList(X13)
                        | ~ leq(X10,X12)
                        | app(cons(X12,nil),X13) != sK14 )
                    | ~ ssItem(X12) ) )
            | ~ ssItem(X10) )
        & ! [X14] :
            ( ! [X15] :
                ( app(cons(X14,nil),X15) != X9
                | ! [X16] :
                    ( ~ ssItem(X16)
                    | ! [X17] :
                        ( app(X17,cons(X16,nil)) != sK14
                        | ~ leq(X16,X14)
                        | ~ ssList(X17) ) )
                | ~ ssList(X15) )
            | ~ ssItem(X14) )
        & totalorderedP(sK14)
        & app(app(sK17,sK14),X9) = sK15 )
   => ( ssList(sK18)
      & ! [X10] :
          ( ! [X11] :
              ( ~ ssList(X11)
              | app(X11,cons(X10,nil)) != sK17
              | ! [X12] :
                  ( ! [X13] :
                      ( ~ ssList(X13)
                      | ~ leq(X10,X12)
                      | app(cons(X12,nil),X13) != sK14 )
                  | ~ ssItem(X12) ) )
          | ~ ssItem(X10) )
      & ! [X14] :
          ( ! [X15] :
              ( app(cons(X14,nil),X15) != sK18
              | ! [X16] :
                  ( ~ ssItem(X16)
                  | ! [X17] :
                      ( app(X17,cons(X16,nil)) != sK14
                      | ~ leq(X16,X14)
                      | ~ ssList(X17) ) )
              | ~ ssList(X15) )
          | ~ ssItem(X14) )
      & totalorderedP(sK14)
      & app(app(sK17,sK14),sK18) = sK15 ) ),
    introduced(choice_axiom,[]) ).

fof(f179,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( nil != X0
                  & X1 = X3
                  & ( nil != X2
                    | nil = X3 )
                  & X0 = X2
                  & ssList(X3)
                  & ! [X4] :
                      ( ~ ssItem(X4)
                      | ! [X5] :
                          ( ! [X6] :
                              ( app(app(X5,cons(X4,nil)),X6) != X0
                              | ? [X7] :
                                  ( ssItem(X7)
                                  & memberP(X5,X7)
                                  & lt(X4,X7)
                                  & ~ leq(X4,X7)
                                  & memberP(X6,X7) )
                              | ~ ssList(X6) )
                          | ~ ssList(X5) ) )
                  & ? [X8] :
                      ( ssList(X8)
                      & ? [X9] :
                          ( ssList(X9)
                          & ! [X10] :
                              ( ! [X11] :
                                  ( ~ ssList(X11)
                                  | app(X11,cons(X10,nil)) != X8
                                  | ! [X12] :
                                      ( ! [X13] :
                                          ( ~ ssList(X13)
                                          | ~ leq(X10,X12)
                                          | app(cons(X12,nil),X13) != X2 )
                                      | ~ ssItem(X12) ) )
                              | ~ ssItem(X10) )
                          & ! [X14] :
                              ( ! [X15] :
                                  ( app(cons(X14,nil),X15) != X9
                                  | ! [X16] :
                                      ( ~ ssItem(X16)
                                      | ! [X17] :
                                          ( app(X17,cons(X16,nil)) != X2
                                          | ~ leq(X16,X14)
                                          | ~ ssList(X17) ) )
                                  | ~ ssList(X15) )
                              | ~ ssItem(X14) )
                          & totalorderedP(X2)
                          & app(app(X8,X2),X9) = X3 ) ) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(rectify,[],[f116]) ).

fof(f116,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( nil != X0
                  & X1 = X3
                  & ( nil != X2
                    | nil = X3 )
                  & X0 = X2
                  & ssList(X3)
                  & ! [X14] :
                      ( ~ ssItem(X14)
                      | ! [X15] :
                          ( ! [X16] :
                              ( app(app(X15,cons(X14,nil)),X16) != X0
                              | ? [X17] :
                                  ( ssItem(X17)
                                  & memberP(X15,X17)
                                  & lt(X14,X17)
                                  & ~ leq(X14,X17)
                                  & memberP(X16,X17) )
                              | ~ ssList(X16) )
                          | ~ ssList(X15) ) )
                  & ? [X4] :
                      ( ssList(X4)
                      & ? [X5] :
                          ( ssList(X5)
                          & ! [X10] :
                              ( ! [X11] :
                                  ( ~ ssList(X11)
                                  | app(X11,cons(X10,nil)) != X4
                                  | ! [X12] :
                                      ( ! [X13] :
                                          ( ~ ssList(X13)
                                          | ~ leq(X10,X12)
                                          | app(cons(X12,nil),X13) != X2 )
                                      | ~ ssItem(X12) ) )
                              | ~ ssItem(X10) )
                          & ! [X6] :
                              ( ! [X7] :
                                  ( app(cons(X6,nil),X7) != X5
                                  | ! [X8] :
                                      ( ~ ssItem(X8)
                                      | ! [X9] :
                                          ( app(X9,cons(X8,nil)) != X2
                                          | ~ leq(X8,X6)
                                          | ~ ssList(X9) ) )
                                  | ~ ssList(X7) )
                              | ~ ssItem(X6) )
                          & totalorderedP(X2)
                          & app(app(X4,X2),X5) = X3 ) ) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f98]) ).

fof(f98,plain,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ~ totalorderedP(X2)
                            | ? [X6] :
                                ( ssItem(X6)
                                & ? [X7] :
                                    ( ? [X8] :
                                        ( ? [X9] :
                                            ( ssList(X9)
                                            & app(X9,cons(X8,nil)) = X2
                                            & leq(X8,X6) )
                                        & ssItem(X8) )
                                    & app(cons(X6,nil),X7) = X5
                                    & ssList(X7) ) )
                            | app(app(X4,X2),X5) != X3
                            | ~ ssList(X5)
                            | ? [X10] :
                                ( ? [X11] :
                                    ( app(X11,cons(X10,nil)) = X4
                                    & ssList(X11)
                                    & ? [X12] :
                                        ( ssItem(X12)
                                        & ? [X13] :
                                            ( ssList(X13)
                                            & leq(X10,X12)
                                            & app(cons(X12,nil),X13) = X2 ) ) )
                                & ssItem(X10) ) ) )
                    | X1 != X3
                    | nil = X0
                    | X0 != X2
                    | ~ ssList(X3)
                    | ( nil != X3
                      & nil = X2 )
                    | ? [X14] :
                        ( ssItem(X14)
                        & ? [X15] :
                            ( ? [X16] :
                                ( app(app(X15,cons(X14,nil)),X16) = X0
                                & ! [X17] :
                                    ( ~ ssItem(X17)
                                    | ~ lt(X14,X17)
                                    | ~ memberP(X16,X17)
                                    | leq(X14,X17)
                                    | ~ memberP(X15,X17) )
                                & ssList(X16) )
                            & ssList(X15) ) ) ) ) ) ),
    inference(rectify,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ( nil != X3
                      & nil = X2 )
                    | nil = X0
                    | X1 != X3
                    | ~ ssList(X3)
                    | ! [X8] :
                        ( ssList(X8)
                       => ! [X9] :
                            ( ? [X14] :
                                ( ssItem(X14)
                                & ? [X15] :
                                    ( ? [X16] :
                                        ( ssItem(X16)
                                        & ? [X17] :
                                            ( app(X17,cons(X16,nil)) = X2
                                            & leq(X16,X14)
                                            & ssList(X17) ) )
                                    & app(cons(X14,nil),X15) = X9
                                    & ssList(X15) ) )
                            | app(app(X8,X2),X9) != X3
                            | ? [X10] :
                                ( ? [X11] :
                                    ( ssList(X11)
                                    & app(X11,cons(X10,nil)) = X8
                                    & ? [X12] :
                                        ( ssItem(X12)
                                        & ? [X13] :
                                            ( ssList(X13)
                                            & leq(X10,X12)
                                            & app(cons(X12,nil),X13) = X2 ) ) )
                                & ssItem(X10) )
                            | ~ totalorderedP(X2)
                            | ~ ssList(X9) ) )
                    | X0 != X2
                    | ? [X4] :
                        ( ? [X5] :
                            ( ssList(X5)
                            & ? [X6] :
                                ( ! [X7] :
                                    ( ~ memberP(X5,X7)
                                    | leq(X4,X7)
                                    | ~ ssItem(X7)
                                    | ~ lt(X4,X7)
                                    | ~ memberP(X6,X7) )
                                & app(app(X5,cons(X4,nil)),X6) = X0
                                & ssList(X6) ) )
                        & ssItem(X4) ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ( nil != X3
                    & nil = X2 )
                  | nil = X0
                  | X1 != X3
                  | ~ ssList(X3)
                  | ! [X8] :
                      ( ssList(X8)
                     => ! [X9] :
                          ( ? [X14] :
                              ( ssItem(X14)
                              & ? [X15] :
                                  ( ? [X16] :
                                      ( ssItem(X16)
                                      & ? [X17] :
                                          ( app(X17,cons(X16,nil)) = X2
                                          & leq(X16,X14)
                                          & ssList(X17) ) )
                                  & app(cons(X14,nil),X15) = X9
                                  & ssList(X15) ) )
                          | app(app(X8,X2),X9) != X3
                          | ? [X10] :
                              ( ? [X11] :
                                  ( ssList(X11)
                                  & app(X11,cons(X10,nil)) = X8
                                  & ? [X12] :
                                      ( ssItem(X12)
                                      & ? [X13] :
                                          ( ssList(X13)
                                          & leq(X10,X12)
                                          & app(cons(X12,nil),X13) = X2 ) ) )
                              & ssItem(X10) )
                          | ~ totalorderedP(X2)
                          | ~ ssList(X9) ) )
                  | X0 != X2
                  | ? [X4] :
                      ( ? [X5] :
                          ( ssList(X5)
                          & ? [X6] :
                              ( ! [X7] :
                                  ( ~ memberP(X5,X7)
                                  | leq(X4,X7)
                                  | ~ ssItem(X7)
                                  | ~ lt(X4,X7)
                                  | ~ memberP(X6,X7) )
                              & app(app(X5,cons(X4,nil)),X6) = X0
                              & ssList(X6) ) )
                      & ssItem(X4) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f528,plain,
    ( ~ ssList(sK14)
    | memberP(nil,sK16(sK1(sK14),nil,sK0(sK14)))
    | spl19_1
    | ~ spl19_3
    | ~ spl19_8 ),
    inference(subsumption_resolution,[],[f527,f294]) ).

fof(f294,plain,
    ( nil != sK14
    | spl19_1 ),
    inference(avatar_component_clause,[],[f292]) ).

fof(f292,plain,
    ( spl19_1
  <=> nil = sK14 ),
    introduced(avatar_definition,[new_symbols(naming,[spl19_1])]) ).

fof(f527,plain,
    ( memberP(nil,sK16(sK1(sK14),nil,sK0(sK14)))
    | nil = sK14
    | ~ ssList(sK14)
    | ~ spl19_3
    | ~ spl19_8 ),
    inference(subsumption_resolution,[],[f526,f500]) ).

fof(f500,plain,
    ( ssList(cons(sK1(sK14),nil))
    | ~ spl19_8 ),
    inference(avatar_component_clause,[],[f499]) ).

fof(f499,plain,
    ( spl19_8
  <=> ssList(cons(sK1(sK14),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl19_8])]) ).

fof(f526,plain,
    ( memberP(nil,sK16(sK1(sK14),nil,sK0(sK14)))
    | ~ ssList(cons(sK1(sK14),nil))
    | ~ ssList(sK14)
    | nil = sK14
    | ~ spl19_3 ),
    inference(equality_resolution,[],[f492]) ).

fof(f492,plain,
    ( ! [X0] :
        ( sK14 != X0
        | nil = X0
        | ~ ssList(cons(sK1(X0),nil))
        | memberP(nil,sK16(sK1(X0),nil,sK0(X0)))
        | ~ ssList(X0) )
    | ~ spl19_3 ),
    inference(subsumption_resolution,[],[f491,f208]) ).

fof(f208,plain,
    ! [X0] :
      ( ssList(sK0(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f156]) ).

fof(f156,plain,
    ! [X0] :
      ( nil = X0
      | ( ssList(sK0(X0))
        & cons(sK1(X0),sK0(X0)) = X0
        & ssItem(sK1(X0)) )
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f104,f155,f154]) ).

fof(f154,plain,
    ! [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( cons(X2,X1) = X0
              & ssItem(X2) ) )
     => ( ssList(sK0(X0))
        & ? [X2] :
            ( cons(X2,sK0(X0)) = X0
            & ssItem(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f155,plain,
    ! [X0] :
      ( ? [X2] :
          ( cons(X2,sK0(X0)) = X0
          & ssItem(X2) )
     => ( cons(sK1(X0),sK0(X0)) = X0
        & ssItem(sK1(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f104,plain,
    ! [X0] :
      ( nil = X0
      | ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( cons(X2,X1) = X0
              & ssItem(X2) ) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f103]) ).

fof(f103,plain,
    ! [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( cons(X2,X1) = X0
              & ssItem(X2) ) )
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f20,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( cons(X2,X1) = X0
                & ssItem(X2) ) )
        | nil = X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).

fof(f491,plain,
    ( ! [X0] :
        ( ~ ssList(sK0(X0))
        | sK14 != X0
        | memberP(nil,sK16(sK1(X0),nil,sK0(X0)))
        | ~ ssList(X0)
        | nil = X0
        | ~ ssList(cons(sK1(X0),nil)) )
    | ~ spl19_3 ),
    inference(subsumption_resolution,[],[f489,f206]) ).

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

fof(f489,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | ~ ssItem(sK1(X0))
        | nil = X0
        | ~ ssList(cons(sK1(X0),nil))
        | memberP(nil,sK16(sK1(X0),nil,sK0(X0)))
        | sK14 != X0
        | ~ ssList(sK0(X0)) )
    | ~ spl19_3 ),
    inference(superposition,[],[f454,f207]) ).

fof(f207,plain,
    ! [X0] :
      ( cons(sK1(X0),sK0(X0)) = X0
      | ~ ssList(X0)
      | nil = X0 ),
    inference(cnf_transformation,[],[f156]) ).

fof(f454,plain,
    ( ! [X14,X15] :
        ( sK14 != cons(X14,X15)
        | ~ ssItem(X14)
        | ~ ssList(X15)
        | memberP(nil,sK16(X14,nil,X15))
        | ~ ssList(cons(X14,nil)) )
    | ~ spl19_3 ),
    inference(duplicate_literal_removal,[],[f433]) ).

fof(f433,plain,
    ( ! [X14,X15] :
        ( memberP(nil,sK16(X14,nil,X15))
        | ~ ssItem(X14)
        | ~ ssItem(X14)
        | ~ ssList(X15)
        | ~ ssList(X15)
        | ~ ssList(cons(X14,nil))
        | sK14 != cons(X14,X15) )
    | ~ spl19_3 ),
    inference(superposition,[],[f357,f219]) ).

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

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

fof(f357,plain,
    ( ! [X2,X3] :
        ( sK14 != app(cons(X2,nil),X3)
        | ~ ssItem(X2)
        | ~ ssList(X3)
        | memberP(nil,sK16(X2,nil,X3))
        | ~ ssList(cons(X2,nil)) )
    | ~ spl19_3 ),
    inference(subsumption_resolution,[],[f331,f302]) ).

fof(f302,plain,
    ( ssList(nil)
    | ~ spl19_3 ),
    inference(avatar_component_clause,[],[f301]) ).

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

fof(f331,plain,
    ! [X2,X3] :
      ( ~ ssItem(X2)
      | ~ ssList(X3)
      | ~ ssList(cons(X2,nil))
      | memberP(nil,sK16(X2,nil,X3))
      | sK14 != app(cons(X2,nil),X3)
      | ~ ssList(nil) ),
    inference(superposition,[],[f274,f252]) ).

fof(f252,plain,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f125]) ).

fof(f125,plain,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f28]) ).

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

fof(f274,plain,
    ! [X6,X4,X5] :
      ( app(app(X5,cons(X4,nil)),X6) != sK14
      | ~ ssItem(X4)
      | memberP(X5,sK16(X4,X5,X6))
      | ~ ssList(X5)
      | ~ ssList(X6) ),
    inference(definition_unfolding,[],[f265,f268]) ).

fof(f268,plain,
    sK12 = sK14,
    inference(cnf_transformation,[],[f187]) ).

fof(f265,plain,
    ! [X6,X4,X5] :
      ( ~ ssItem(X4)
      | app(app(X5,cons(X4,nil)),X6) != sK12
      | memberP(X5,sK16(X4,X5,X6))
      | ~ ssList(X6)
      | ~ ssList(X5) ),
    inference(cnf_transformation,[],[f187]) ).

fof(f518,plain,
    ( spl19_1
    | ~ spl19_3
    | spl19_8 ),
    inference(avatar_contradiction_clause,[],[f517]) ).

fof(f517,plain,
    ( $false
    | spl19_1
    | ~ spl19_3
    | spl19_8 ),
    inference(subsumption_resolution,[],[f516,f255]) ).

fof(f516,plain,
    ( ~ ssList(sK14)
    | spl19_1
    | ~ spl19_3
    | spl19_8 ),
    inference(subsumption_resolution,[],[f512,f294]) ).

fof(f512,plain,
    ( nil = sK14
    | ~ ssList(sK14)
    | ~ spl19_3
    | spl19_8 ),
    inference(resolution,[],[f509,f206]) ).

fof(f509,plain,
    ( ~ ssItem(sK1(sK14))
    | ~ spl19_3
    | spl19_8 ),
    inference(subsumption_resolution,[],[f507,f302]) ).

fof(f507,plain,
    ( ~ ssList(nil)
    | ~ ssItem(sK1(sK14))
    | spl19_8 ),
    inference(resolution,[],[f501,f195]) ).

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

fof(f118,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ssList(cons(X1,X0))
          | ~ ssItem(X1) ) ),
    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(f501,plain,
    ( ~ ssList(cons(sK1(sK14),nil))
    | spl19_8 ),
    inference(avatar_component_clause,[],[f499]) ).

fof(f506,plain,
    ( ~ spl19_8
    | spl19_9
    | spl19_1
    | ~ spl19_3 ),
    inference(avatar_split_clause,[],[f497,f301,f292,f503,f499]) ).

fof(f497,plain,
    ( ssItem(sK16(sK1(sK14),nil,sK0(sK14)))
    | ~ ssList(cons(sK1(sK14),nil))
    | spl19_1
    | ~ spl19_3 ),
    inference(subsumption_resolution,[],[f496,f294]) ).

fof(f496,plain,
    ( ~ ssList(cons(sK1(sK14),nil))
    | nil = sK14
    | ssItem(sK16(sK1(sK14),nil,sK0(sK14)))
    | ~ spl19_3 ),
    inference(subsumption_resolution,[],[f495,f255]) ).

fof(f495,plain,
    ( ~ ssList(sK14)
    | ~ ssList(cons(sK1(sK14),nil))
    | nil = sK14
    | ssItem(sK16(sK1(sK14),nil,sK0(sK14)))
    | ~ spl19_3 ),
    inference(equality_resolution,[],[f468]) ).

fof(f468,plain,
    ( ! [X0] :
        ( sK14 != X0
        | ~ ssList(cons(sK1(X0),nil))
        | ~ ssList(X0)
        | nil = X0
        | ssItem(sK16(sK1(X0),nil,sK0(X0))) )
    | ~ spl19_3 ),
    inference(subsumption_resolution,[],[f467,f208]) ).

fof(f467,plain,
    ( ! [X0] :
        ( ssItem(sK16(sK1(X0),nil,sK0(X0)))
        | nil = X0
        | sK14 != X0
        | ~ ssList(cons(sK1(X0),nil))
        | ~ ssList(sK0(X0))
        | ~ ssList(X0) )
    | ~ spl19_3 ),
    inference(subsumption_resolution,[],[f465,f206]) ).

fof(f465,plain,
    ( ! [X0] :
        ( ssItem(sK16(sK1(X0),nil,sK0(X0)))
        | ~ ssList(X0)
        | nil = X0
        | ~ ssItem(sK1(X0))
        | ~ ssList(cons(sK1(X0),nil))
        | ~ ssList(sK0(X0))
        | sK14 != X0 )
    | ~ spl19_3 ),
    inference(superposition,[],[f459,f207]) ).

fof(f459,plain,
    ( ! [X12,X13] :
        ( sK14 != cons(X12,X13)
        | ~ ssItem(X12)
        | ssItem(sK16(X12,nil,X13))
        | ~ ssList(cons(X12,nil))
        | ~ ssList(X13) )
    | ~ spl19_3 ),
    inference(duplicate_literal_removal,[],[f432]) ).

fof(f432,plain,
    ( ! [X12,X13] :
        ( ~ ssItem(X12)
        | ~ ssItem(X12)
        | sK14 != cons(X12,X13)
        | ~ ssList(X13)
        | ssItem(sK16(X12,nil,X13))
        | ~ ssList(cons(X12,nil))
        | ~ ssList(X13) )
    | ~ spl19_3 ),
    inference(superposition,[],[f355,f219]) ).

fof(f355,plain,
    ( ! [X0,X1] :
        ( app(cons(X0,nil),X1) != sK14
        | ~ ssItem(X0)
        | ssItem(sK16(X0,nil,X1))
        | ~ ssList(X1)
        | ~ ssList(cons(X0,nil)) )
    | ~ spl19_3 ),
    inference(subsumption_resolution,[],[f330,f302]) ).

fof(f330,plain,
    ! [X0,X1] :
      ( ~ ssList(X1)
      | ~ ssList(nil)
      | ~ ssItem(X0)
      | ssItem(sK16(X0,nil,X1))
      | app(cons(X0,nil),X1) != sK14
      | ~ ssList(cons(X0,nil)) ),
    inference(superposition,[],[f273,f252]) ).

fof(f273,plain,
    ! [X6,X4,X5] :
      ( app(app(X5,cons(X4,nil)),X6) != sK14
      | ~ ssItem(X4)
      | ~ ssList(X6)
      | ssItem(sK16(X4,X5,X6))
      | ~ ssList(X5) ),
    inference(definition_unfolding,[],[f266,f268]) ).

fof(f266,plain,
    ! [X6,X4,X5] :
      ( ~ ssItem(X4)
      | app(app(X5,cons(X4,nil)),X6) != sK12
      | ssItem(sK16(X4,X5,X6))
      | ~ ssList(X6)
      | ~ ssList(X5) ),
    inference(cnf_transformation,[],[f187]) ).

fof(f315,plain,
    ~ spl19_1,
    inference(avatar_split_clause,[],[f272,f292]) ).

fof(f272,plain,
    nil != sK14,
    inference(definition_unfolding,[],[f271,f268]) ).

fof(f271,plain,
    nil != sK12,
    inference(cnf_transformation,[],[f187]) ).

fof(f314,plain,
    spl19_3,
    inference(avatar_split_clause,[],[f217,f301]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SWC248+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 18:02:50 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.20/0.50  % (14541)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.51  % (14546)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.20/0.51  % (14551)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.51  % (14559)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.20/0.51  % (14557)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.51  % (14543)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.51  % (14547)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52  % (14551)Instruction limit reached!
% 0.20/0.52  % (14551)------------------------------
% 0.20/0.52  % (14551)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (14534)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.52  % (14556)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.52  % (14551)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (14551)Termination reason: Unknown
% 0.20/0.52  % (14551)Termination phase: Preprocessing 3
% 0.20/0.52  
% 0.20/0.52  % (14551)Memory used [KB]: 1663
% 0.20/0.52  % (14551)Time elapsed: 0.004 s
% 0.20/0.52  % (14551)Instructions burned: 4 (million)
% 0.20/0.52  % (14551)------------------------------
% 0.20/0.52  % (14551)------------------------------
% 0.20/0.52  % (14536)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52  % (14536)Instruction limit reached!
% 0.20/0.52  % (14536)------------------------------
% 0.20/0.52  % (14536)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (14536)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (14536)Termination reason: Unknown
% 0.20/0.52  % (14536)Termination phase: Preprocessing 2
% 0.20/0.52  
% 0.20/0.52  % (14536)Memory used [KB]: 1535
% 0.20/0.52  % (14536)Time elapsed: 0.002 s
% 0.20/0.52  % (14536)Instructions burned: 3 (million)
% 0.20/0.52  % (14536)------------------------------
% 0.20/0.52  % (14536)------------------------------
% 0.20/0.52  % (14549)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52  % (14540)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.52  % (14538)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.52  % (14535)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.53  % (14537)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53  % (14560)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.53  % (14545)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.53  % (14539)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.53  % (14549)Instruction limit reached!
% 0.20/0.53  % (14549)------------------------------
% 0.20/0.53  % (14549)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (14552)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.53  % (14545)Instruction limit reached!
% 0.20/0.53  % (14545)------------------------------
% 0.20/0.53  % (14545)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (14545)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (14545)Termination reason: Unknown
% 0.20/0.53  % (14545)Termination phase: Saturation
% 0.20/0.53  
% 0.20/0.53  % (14545)Memory used [KB]: 6140
% 0.20/0.53  % (14545)Time elapsed: 0.004 s
% 0.20/0.53  % (14545)Instructions burned: 7 (million)
% 0.20/0.53  % (14545)------------------------------
% 0.20/0.53  % (14545)------------------------------
% 0.20/0.53  % (14552)Instruction limit reached!
% 0.20/0.53  % (14552)------------------------------
% 0.20/0.53  % (14552)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (14552)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (14552)Termination reason: Unknown
% 0.20/0.53  % (14552)Termination phase: SInE selection
% 0.20/0.53  
% 0.20/0.53  % (14552)Memory used [KB]: 1535
% 0.20/0.53  % (14552)Time elapsed: 0.002 s
% 0.20/0.53  % (14552)Instructions burned: 2 (million)
% 0.20/0.53  % (14552)------------------------------
% 0.20/0.53  % (14552)------------------------------
% 0.20/0.53  % (14550)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.53  % (14546)Instruction limit reached!
% 0.20/0.53  % (14546)------------------------------
% 0.20/0.53  % (14546)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (14546)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (14546)Termination reason: Unknown
% 0.20/0.53  % (14546)Termination phase: Saturation
% 0.20/0.53  
% 0.20/0.53  % (14546)Memory used [KB]: 2046
% 0.20/0.53  % (14546)Time elapsed: 0.009 s
% 0.20/0.53  % (14546)Instructions burned: 16 (million)
% 0.20/0.53  % (14546)------------------------------
% 0.20/0.53  % (14546)------------------------------
% 0.20/0.53  % (14549)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (14549)Termination reason: Unknown
% 0.20/0.53  % (14549)Termination phase: Property scanning
% 0.20/0.53  
% 0.20/0.53  % (14549)Memory used [KB]: 1791
% 0.20/0.53  % (14549)Time elapsed: 0.009 s
% 0.20/0.53  % (14549)Instructions burned: 8 (million)
% 0.20/0.53  % (14549)------------------------------
% 0.20/0.53  % (14549)------------------------------
% 0.20/0.53  % (14548)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.53  % (14562)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.20/0.53  % (14548)Instruction limit reached!
% 0.20/0.53  % (14548)------------------------------
% 0.20/0.53  % (14548)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (14548)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (14548)Termination reason: Unknown
% 0.20/0.53  % (14548)Termination phase: Preprocessing 3
% 0.20/0.53  
% 0.20/0.53  % (14548)Memory used [KB]: 1663
% 0.20/0.53  % (14548)Time elapsed: 0.004 s
% 0.20/0.53  % (14548)Instructions burned: 4 (million)
% 0.20/0.53  % (14548)------------------------------
% 0.20/0.53  % (14548)------------------------------
% 0.20/0.54  % (14544)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.54  % (14563)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.54  % (14561)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.54  % (14562)Instruction limit reached!
% 0.20/0.54  % (14562)------------------------------
% 0.20/0.54  % (14562)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (14562)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (14562)Termination reason: Unknown
% 0.20/0.54  % (14562)Termination phase: Function definition elimination
% 0.20/0.54  
% 0.20/0.54  % (14562)Memory used [KB]: 1791
% 0.20/0.54  % (14562)Time elapsed: 0.005 s
% 0.20/0.54  % (14562)Instructions burned: 8 (million)
% 0.20/0.54  % (14562)------------------------------
% 0.20/0.54  % (14562)------------------------------
% 0.20/0.54  % (14554)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.20/0.54  % (14542)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.54  % (14558)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.54  % (14553)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.55  % (14543)Instruction limit reached!
% 0.20/0.55  % (14543)------------------------------
% 0.20/0.55  % (14543)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55  % (14543)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (14543)Termination reason: Unknown
% 0.20/0.55  % (14543)Termination phase: Saturation
% 0.20/0.55  
% 0.20/0.55  % (14543)Memory used [KB]: 6780
% 0.20/0.55  % (14543)Time elapsed: 0.137 s
% 0.20/0.55  % (14543)Instructions burned: 34 (million)
% 0.20/0.55  % (14543)------------------------------
% 0.20/0.55  % (14543)------------------------------
% 0.20/0.55  % (14538)Instruction limit reached!
% 0.20/0.55  % (14538)------------------------------
% 0.20/0.55  % (14538)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55  % (14538)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (14538)Termination reason: Unknown
% 0.20/0.55  % (14538)Termination phase: Saturation
% 0.20/0.55  
% 0.20/0.55  % (14538)Memory used [KB]: 6396
% 0.20/0.55  % (14538)Time elapsed: 0.129 s
% 0.20/0.55  % (14538)Instructions burned: 14 (million)
% 0.20/0.55  % (14538)------------------------------
% 0.20/0.55  % (14538)------------------------------
% 0.20/0.55  % (14540)First to succeed.
% 0.20/0.55  % (14555)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.55  % (14535)Instruction limit reached!
% 0.20/0.55  % (14535)------------------------------
% 0.20/0.55  % (14535)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55  % (14535)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (14535)Termination reason: Unknown
% 0.20/0.55  % (14535)Termination phase: Saturation
% 0.20/0.55  
% 0.20/0.55  % (14535)Memory used [KB]: 6524
% 0.20/0.55  % (14535)Time elapsed: 0.151 s
% 0.20/0.55  % (14535)Instructions burned: 14 (million)
% 0.20/0.55  % (14535)------------------------------
% 0.20/0.55  % (14535)------------------------------
% 0.20/0.56  % (14539)Instruction limit reached!
% 0.20/0.56  % (14539)------------------------------
% 0.20/0.56  % (14539)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (14539)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (14539)Termination reason: Unknown
% 0.20/0.56  % (14539)Termination phase: Saturation
% 0.20/0.56  
% 0.20/0.56  % (14539)Memory used [KB]: 1791
% 0.20/0.56  % (14539)Time elapsed: 0.157 s
% 0.20/0.56  % (14539)Instructions burned: 16 (million)
% 0.20/0.56  % (14539)------------------------------
% 0.20/0.56  % (14539)------------------------------
% 0.20/0.56  % (14544)Instruction limit reached!
% 0.20/0.56  % (14544)------------------------------
% 0.20/0.56  % (14544)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (14544)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (14544)Termination reason: Unknown
% 0.20/0.56  % (14544)Termination phase: Saturation
% 0.20/0.56  
% 0.20/0.56  % (14544)Memory used [KB]: 6396
% 0.20/0.56  % (14544)Time elapsed: 0.168 s
% 0.20/0.56  % (14544)Instructions burned: 14 (million)
% 0.20/0.56  % (14544)------------------------------
% 0.20/0.56  % (14544)------------------------------
% 0.20/0.57  % (14541)Refutation not found, non-redundant clauses discarded% (14541)------------------------------
% 0.20/0.57  % (14541)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57  % (14541)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57  % (14541)Termination reason: Refutation not found, non-redundant clauses discarded
% 0.20/0.57  
% 0.20/0.57  % (14541)Memory used [KB]: 6780
% 0.20/0.57  % (14541)Time elapsed: 0.140 s
% 0.20/0.57  % (14541)Instructions burned: 38 (million)
% 0.20/0.57  % (14541)------------------------------
% 0.20/0.57  % (14541)------------------------------
% 0.20/0.57  % (14553)Instruction limit reached!
% 0.20/0.57  % (14553)------------------------------
% 0.20/0.57  % (14553)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57  % (14553)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57  % (14553)Termination reason: Unknown
% 0.20/0.57  % (14553)Termination phase: Saturation
% 0.20/0.57  
% 0.20/0.57  % (14553)Memory used [KB]: 6396
% 0.20/0.57  % (14553)Time elapsed: 0.149 s
% 0.20/0.57  % (14553)Instructions burned: 11 (million)
% 0.20/0.57  % (14553)------------------------------
% 0.20/0.57  % (14553)------------------------------
% 0.20/0.57  % (14540)Refutation found. Thanks to Tanya!
% 0.20/0.57  % SZS status Theorem for theBenchmark
% 0.20/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.57  % (14540)------------------------------
% 0.20/0.57  % (14540)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57  % (14540)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57  % (14540)Termination reason: Refutation
% 0.20/0.57  
% 0.20/0.57  % (14540)Memory used [KB]: 6396
% 0.20/0.57  % (14540)Time elapsed: 0.101 s
% 0.20/0.57  % (14540)Instructions burned: 19 (million)
% 0.20/0.57  % (14540)------------------------------
% 0.20/0.57  % (14540)------------------------------
% 0.20/0.57  % (14533)Success in time 0.22 s
%------------------------------------------------------------------------------