WORST_CASE(?,O(n^1))

Solution:
---------

  Cons :: [A(2) x A(2)] -(2)-> A(2)
  Cons :: [A(5) x A(5)] -(5)-> A(5)
  Cons :: [A(13) x A(13)] -(13)-> A(13)
  Cons :: [A(0) x A(0)] -(0)-> A(0)
  False :: [] -(0)-> A(13)
  Nil :: [] -(0)-> A(2)
  Nil :: [] -(0)-> A(5)
  Nil :: [] -(0)-> A(13)
  Nil :: [] -(0)-> A(15)
  Nil :: [] -(0)-> A(4)
  Nil :: [] -(0)-> A(12)
  Nil :: [] -(0)-> A(14)
  True :: [] -(0)-> A(13)
  dec :: [A(2)] -(1)-> A(13)
  goal :: [A(15)] -(9)-> A(0)
  isNilNil :: [A(5)] -(8)-> A(3)
  nestdec :: [A(13)] -(6)-> A(0)
  number17 :: [A(0)] -(15)-> A(0)


Cost Free Signatures:
---------------------

  Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  Nil :: [] -(0)-> A_cf(0)
  dec :: [A_cf(0)] -(0)-> A_cf(0)
  nestdec :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  Cons_A :: [A(1) x A(1)] -(1)-> A(1)
  False_A :: [] -(0)-> A(1)
  Nil_A :: [] -(0)-> A(1)
  True_A :: [] -(0)-> A(1)