WORST_CASE(?,O(n^1))

Solution:
---------

  Cons :: [A(0) x A(15)] -(15)-> A(15)
  Cons :: [A(0) x A(0)] -(0)-> A(0)
  Nil :: [] -(0)-> A(15)
  Nil :: [] -(0)-> A(7)
  comp_f_g :: [A(2) x A(2)] -(2)-> A(2)
  comp_f_g#1 :: [A(2) x A(2) x A(0)] -(2)-> A(0)
  main :: [A(15)] -(5)-> A(0)
  walk#1 :: [A(15)] -(4)-> A(2)
  walk_xs :: [] -(0)-> A(2)
  walk_xs :: [] -(0)-> A(4)
  walk_xs_3 :: [A(0)] -(2)-> A(2)
  walk_xs_3 :: [A(0)] -(4)-> A(4)


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

  Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  Nil :: [] -(0)-> A_cf(0)
  comp_f_g :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  comp_f_g#1 :: [A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  walk#1 :: [A_cf(0)] -(0)-> A_cf(0)
  walk_xs :: [] -(0)-> A_cf(0)
  walk_xs_3 :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  Cons_A :: [A(0) x A(1)] -(1)-> A(1)
  Nil_A :: [] -(0)-> A(1)
  comp_f_g_A :: [A(0) x A(0)] -(1)-> A(1)
  walk_xs_3_A :: [A(0)] -(1)-> A(1)
  walk_xs_A :: [] -(0)-> A(1)