WORST_CASE(?,O(n^1))

Solution:
---------

  * :: [A(0) x A(0)] -(0)-> A(3)
  + :: [A(5) x A(5)] -(5)-> A(5)
  + :: [A(0) x A(0)] -(0)-> A(0)
  0 :: [] -(0)-> A(5)
  0 :: [] -(0)-> A(0)
  0 :: [] -(0)-> A(13)
  0 :: [] -(0)-> A(11)
  f :: [A(5)] -(2)-> A(0)
  s :: [A(0)] -(5)-> A(5)
  s :: [A(0)] -(0)-> A(0)
  s :: [A(0)] -(1)-> A(1)


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

  * :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  + :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  0 :: [] -(0)-> A_cf(0)
  f :: [A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  *_A :: [A(0) x A(0)] -(0)-> A(0)
  +_A :: [A(0) x A(0)] -(0)-> A(0)
  0_A :: [] -(0)-> A(1)
  s_A :: [A(0)] -(1)-> A(1)