WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(14)
  U11 :: [A(2) x A(14) x A(14)] -(14)-> A(0)
  U12 :: [A(2) x A(14) x A(14)] -(7)-> A(0)
  activate :: [A(14)] -(1)-> A(14)
  plus :: [A(14) x A(14)] -(1)-> A(0)
  s :: [A(14)] -(14)-> A(14)
  s :: [A(0)] -(0)-> A(0)
  tt :: [] -(0)-> A(2)
  tt :: [] -(0)-> A(13)
  tt :: [] -(0)-> A(12)


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

  0 :: [] -(0)-> A_cf(0)
  U11 :: [A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  U12 :: [A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  activate :: [A_cf(0)] -(0)-> A_cf(0)
  plus :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)
  tt :: [] -(0)-> A_cf(0)


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  s_A :: [A(1)] -(1)-> A(1)
  tt_A :: [] -(0)-> A(1)