WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(6)
  "2nd" :: ["A"(14)] -(14)-> "A"(0)
  "activate" :: ["A"(6)] -(5)-> "A"(6)
  "cons" :: ["A"(0) x "A"(6)] -(0)-> "A"(6)
  "cons" :: ["A"(0) x "A"(14)] -(0)-> "A"(14)
  "cons" :: ["A"(0) x "A"(8)] -(0)-> "A"(8)
  "from" :: ["A"(0)] -(4)-> "A"(6)
  "head" :: ["A"(6)] -(2)-> "A"(0)
  "n__from" :: ["A"(0)] -(0)-> "A"(6)
  "n__from" :: ["A"(0)] -(0)-> "A"(13)
  "n__from" :: ["A"(0)] -(0)-> "A"(14)
  "n__take" :: ["A"(6) x "A"(6)] -(6)-> "A"(6)
  "nil" :: [] -(0)-> "A"(14)
  "s" :: ["A"(6)] -(6)-> "A"(6)
  "s" :: ["A"(0)] -(0)-> "A"(0)
  "sel" :: ["A"(6) x "A"(6)] -(8)-> "A"(0)
  "take" :: ["A"(6) x "A"(6)] -(9)-> "A"(6)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"cons\"_A" :: ["A"(0) x "A"(1)] -(0)-> "A"(1)
  "\"n__from\"_A" :: ["A"(0)] -(0)-> "A"(1)
  "\"n__take\"_A" :: ["A"(0) x "A"(0)] -(1)-> "A"(1)
  "\"nil\"_A" :: [] -(0)-> "A"(1)
  "\"s\"_A" :: ["A"(1)] -(1)-> "A"(1)