WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(0)
  0 :: [] -(0)-> A(3)
  0 :: [] -(0)-> A(13)
  0 :: [] -(0)-> A(15)
  0 :: [] -(0)-> A(7)
  Cons :: [A(15) x A(15)] -(15)-> A(15)
  Cons :: [A(7) x A(7)] -(7)-> A(7)
  Cons :: [A(6) x A(6)] -(6)-> A(6)
  Nil :: [] -(0)-> A(15)
  Nil :: [] -(0)-> A(7)
  Nil :: [] -(0)-> A(6)
  Nil :: [] -(0)-> A(13)
  S :: [A(3)] -(3)-> A(3)
  S :: [A(1)] -(1)-> A(1)
  comp_f_g :: [A(5) x A(5)] -(0)-> A(5)
  comp_f_g :: [A(6) x A(6)] -(0)-> A(6)
  comp_f_g#1 :: [A(5) x A(5) x A(0)] -(5)-> A(1)
  foldr#3 :: [A(6)] -(4)-> A(6)
  foldr_f#3 :: [A(7) x A(13)] -(8)-> A(0)
  id :: [] -(0)-> A(5)
  id :: [] -(0)-> A(12)
  main :: [A(15)] -(14)-> A(0)
  map#2 :: [A(15)] -(5)-> A(7)
  plus_x :: [A(5)] -(5)-> A(5)
  plus_x :: [A(7)] -(7)-> A(7)
  plus_x#1 :: [A(3) x A(1)] -(1)-> A(1)


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

  0 :: [] -(0)-> A_cf(0)
  Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  Nil :: [] -(0)-> A_cf(0)
  S :: [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)
  foldr#3 :: [A_cf(0)] -(0)-> A_cf(0)
  id :: [] -(0)-> A_cf(0)
  map#2 :: [A_cf(0)] -(0)-> A_cf(0)
  plus_x :: [A_cf(0)] -(0)-> A_cf(0)
  plus_x#1 :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  Cons_A :: [A(1) x A(1)] -(1)-> A(1)
  Nil_A :: [] -(0)-> A(1)
  S_A :: [A(1)] -(1)-> A(1)
  comp_f_g_A :: [A(0) x A(0)] -(0)-> A(1)
  id_A :: [] -(0)-> A(1)
  plus_x_A :: [A(0)] -(1)-> A(1)