WORST_CASE(?,O(n^1))

Solution:
---------

  ackin :: [A(0) x A(6)] -(9)-> A(6)
  ackout :: [A(6)] -(6)-> A(6)
  s :: [A(0)] -(0)-> A(0)
  s :: [A(6)] -(6)-> A(6)
  u21 :: [A(6) x A(0)] -(4)-> A(6)
  u22 :: [A(0)] -(0)-> A(13)


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

  ackin :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  ackout :: [A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)
  u21 :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  u22 :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  ackout_A :: [A(1)] -(1)-> A(1)
  s_A :: [A(1)] -(1)-> A(1)
  u22_A :: [A(0)] -(0)-> A(1)