WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(7)
  U11 :: [A(0) x A(7) x A(7)] -(7)-> A(0)
  U12 :: [A(0) x A(7) x A(7)] -(4)-> A(0)
  activate :: [A(7)] -(1)-> A(7)
  plus :: [A(7) x A(7)] -(1)-> A(0)
  s :: [A(7)] -(7)-> A(7)
  s :: [A(0)] -(0)-> A(0)
  tt :: [] -(0)-> A(0)


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)