WORST_CASE(?,O(n^1))

Solution:
---------

  "2nd" :: ["A"(15)] -(8)-> "A"(0)
  "activate" :: ["A"(15)] -(9)-> "A"(1)
  "cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "cons" :: ["A"(0) x "A"(15)] -(15)-> "A"(15)
  "cons" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "cons1" :: ["A"(0) x "A"(0)] -(0)-> "A"(15)
  "from" :: ["A"(1)] -(14)-> "A"(1)
  "n__from" :: ["A"(15)] -(15)-> "A"(15)
  "n__from" :: ["A"(1)] -(1)-> "A"(1)
  "n__s" :: ["A"(15)] -(15)-> "A"(15)
  "n__s" :: ["A"(1)] -(1)-> "A"(1)
  "s" :: ["A"(1)] -(8)-> "A"(1)


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




Base Constructors:
------------------
  "\"cons\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "\"cons1\"_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1)
  "\"n__from\"_A" :: ["A"(0)] -(1)-> "A"(1)
  "\"n__s\"_A" :: ["A"(0)] -(1)-> "A"(1)