WORST_CASE(?,O(n^1))

Solution:
---------

  app :: [A(0) x A(6)] -(8)-> A(4)
  cons :: [A(0)] -(0)-> A(0)
  cons :: [A(0)] -(8)-> A(8)
  cons :: [A(0)] -(4)-> A(4)
  cons :: [A(0)] -(14)-> A(14)
  cons :: [A(0)] -(6)-> A(6)
  from :: [A(14)] -(15)-> A(0)
  nil :: [] -(0)-> A(0)
  nil :: [] -(0)-> A(8)
  nil :: [] -(0)-> A(14)
  prefix :: [A(0)] -(14)-> A(0)
  zWadr :: [A(8) x A(8)] -(7)-> A(0)


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




Base Constructors:
------------------
  cons_A :: [A(0)] -(1)-> A(1)
  nil_A :: [] -(0)-> A(1)