WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(3)
  "0" :: [] -(0)-> "A"(14)
  "activate" :: ["A"(3)] -(13)-> "A"(3)
  "cons" :: ["A"(0) x "A"(3)] -(0)-> "A"(3)
  "cons" :: ["A"(0) x "A"(7)] -(0)-> "A"(7)
  "first" :: ["A"(3) x "A"(3)] -(12)-> "A"(3)
  "from" :: ["A"(0)] -(8)-> "A"(3)
  "n__first" :: ["A"(3) x "A"(3)] -(0)-> "A"(3)
  "n__from" :: ["A"(0)] -(0)-> "A"(3)
  "n__from" :: ["A"(0)] -(0)-> "A"(10)
  "n__from" :: ["A"(0)] -(0)-> "A"(15)
  "nil" :: [] -(0)-> "A"(11)
  "s" :: ["A"(3)] -(3)-> "A"(3)
  "s" :: ["A"(14)] -(14)-> "A"(14)
  "s" :: ["A"(0)] -(0)-> "A"(0)
  "sel" :: ["A"(14) x "A"(3)] -(15)-> "A"(0)


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




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