WORST_CASE(?,O(n^1))

Solution:
---------

  Cons :: [A(0) x A(0)] -(0)-> A(2)
  Cons :: [A(0) x A(0)] -(0)-> A(3)
  Cons :: [A(0) x A(0)] -(0)-> A(5)
  Cons :: [A(0) x A(0)] -(0)-> A(1)
  Leaf :: [A(0)] -(15)-> A(15)
  Nil :: [] -(0)-> A(14)
  Node :: [A(15) x A(15)] -(15)-> A(15)
  comp_f_g :: [A(7) x A(7)] -(7)-> A(7)
  comp_f_g :: [A(8) x A(8)] -(8)-> A(8)
  comp_f_g#1 :: [A(7) x A(7) x A(2)] -(8)-> A(2)
  cons_x :: [A(0)] -(7)-> A(7)
  cons_x :: [A(0)] -(10)-> A(10)
  main :: [A(15)] -(12)-> A(1)
  walk#1 :: [A(15)] -(5)-> A(8)


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

  Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  Leaf :: [A_cf(0)] -(0)-> A_cf(0)
  Node :: [A_cf(0) x A_cf(0)] -(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)
  cons_x :: [A_cf(0)] -(0)-> A_cf(0)
  walk#1 :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  Cons_A :: [A(0) x A(0)] -(0)-> A(1)
  Leaf_A :: [A(0)] -(1)-> A(1)
  Nil_A :: [] -(0)-> A(1)
  Node_A :: [A(1) x A(1)] -(1)-> A(1)
  comp_f_g_A :: [A(0) x A(0)] -(1)-> A(1)
  cons_x_A :: [A(0)] -(1)-> A(1)