WORST_CASE(?,O(n^1))

Solution:
---------

  "Cons" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Cons" :: ["A"(0) x "A"(9)] -(9)-> "A"(9)
  "Cons" :: ["A"(0) x "A"(3)] -(3)-> "A"(3)
  "Cons" :: ["A"(0) x "A"(6)] -(6)-> "A"(6)
  "Cons" :: ["A"(0) x "A"(2)] -(2)-> "A"(2)
  "Cons" :: ["A"(0) x "A"(4)] -(4)-> "A"(4)
  "False" :: [] -(0)-> "A"(1)
  "False" :: [] -(0)-> "A"(13)
  "False" :: [] -(0)-> "A"(12)
  "Nil" :: [] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(3)
  "Nil" :: [] -(0)-> "A"(9)
  "Nil" :: [] -(0)-> "A"(1)
  "Nil" :: [] -(0)-> "A"(12)
  "Nil" :: [] -(0)-> "A"(4)
  "Nil" :: [] -(0)-> "A"(14)
  "Nil" :: [] -(0)-> "A"(8)
  "Nil" :: [] -(0)-> "A"(10)
  "True" :: [] -(0)-> "A"(1)
  "True" :: [] -(0)-> "A"(12)
  "True" :: [] -(0)-> "A"(13)
  "f" :: ["A"(9) x "A"(3)] -(10)-> "A"(0)
  "f[Ite][False][Ite]" :: ["A"(1) x "A"(9) x "A"(3)] -(7)-> "A"(0)
  "g" :: ["A"(6) x "A"(3)] -(4)-> "A"(0)
  "g[Ite][False][Ite]" :: ["A"(1) x "A"(6) x "A"(3)] -(1)-> "A"(0)
  "goal" :: ["A"(15) x "A"(15)] -(16)-> "A"(0)
  "lt0" :: ["A"(0) x "A"(1)] -(1)-> "A"(2)
  "notEmpty" :: ["A"(9)] -(15)-> "A"(3)
  "number4" :: ["A"(0)] -(16)-> "A"(0)


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




Base Constructors:
------------------
  "\"Cons\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "\"False\"_A" :: [] -(0)-> "A"(1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1)
  "\"True\"_A" :: [] -(0)-> "A"(1)