WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(6)
  "0" :: [] -(0)-> "A"(3)
  "0" :: [] -(0)-> "A"(0)
  "0" :: [] -(0)-> "A"(15)
  "0" :: [] -(0)-> "A"(14)
  "0" :: [] -(0)-> "A"(8)
  "a__eq" :: ["A"(6) x "A"(3)] -(11)-> "A"(2)
  "a__inf" :: ["A"(0)] -(8)-> "A"(0)
  "a__length" :: ["A"(0)] -(9)-> "A"(0)
  "a__take" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "cons" :: ["A"(0) x "A"(0)] -(15)-> "A"(15)
  "cons" :: ["A"(0) x "A"(0)] -(1)-> "A"(1)
  "cons" :: ["A"(0) x "A"(0)] -(5)-> "A"(5)
  "eq" :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
  "eq" :: ["A"(2) x "A"(2)] -(2)-> "A"(2)
  "false" :: [] -(0)-> "A"(15)
  "false" :: [] -(0)-> "A"(12)
  "false" :: [] -(0)-> "A"(8)
  "inf" :: ["A"(15)] -(15)-> "A"(15)
  "inf" :: ["A"(0)] -(0)-> "A"(0)
  "length" :: ["A"(15)] -(15)-> "A"(15)
  "length" :: ["A"(0)] -(0)-> "A"(0)
  "mark" :: ["A"(15)] -(13)-> "A"(0)
  "nil" :: [] -(0)-> "A"(0)
  "nil" :: [] -(0)-> "A"(15)
  "nil" :: [] -(0)-> "A"(8)
  "nil" :: [] -(0)-> "A"(10)
  "s" :: ["A"(6)] -(6)-> "A"(6)
  "s" :: ["A"(3)] -(3)-> "A"(3)
  "s" :: ["A"(0)] -(0)-> "A"(0)
  "s" :: ["A"(15)] -(15)-> "A"(15)
  "s" :: ["A"(5)] -(5)-> "A"(5)
  "take" :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
  "take" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "true" :: [] -(0)-> "A"(15)
  "true" :: [] -(0)-> "A"(12)
  "true" :: [] -(0)-> "A"(8)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"cons\"_A" :: ["A"(0) x "A"(0)] -(1)-> "A"(1)
  "\"eq\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"false\"_A" :: [] -(0)-> "A"(1)
  "\"inf\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"length\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"nil\"_A" :: [] -(0)-> "A"(1)
  "\"s\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"take\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"true\"_A" :: [] -(0)-> "A"(1)