WORST_CASE(?,O(n^1))

Solution:
---------

  * :: [A(3) x A(5)] -(10)-> A(1)
  + :: [A(0) x A(0)] -(0)-> A(2)
  +Full :: [A(15) x A(3)] -(7)-> A(1)
  0 :: [] -(0)-> A(15)
  0 :: [] -(0)-> A(5)
  0 :: [] -(0)-> A(3)
  0 :: [] -(0)-> A(7)
  Cons :: [A(15) x A(15)] -(15)-> A(15)
  Cons :: [A(0) x A(0)] -(0)-> A(0)
  Nil :: [] -(0)-> A(15)
  Nil :: [] -(0)-> A(7)
  S :: [A(15)] -(15)-> A(15)
  S :: [A(5)] -(5)-> A(5)
  S :: [A(3)] -(3)-> A(3)
  f :: [A(15)] -(11)-> A(1)
  goal :: [A(15)] -(12)-> A(0)
  map :: [A(15)] -(9)-> A(0)


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

  * :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  + :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  +Full :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  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)
  f :: [A_cf(0)] -(0)-> A_cf(0)
  map :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  +_A :: [A(0) x A(0)] -(0)-> A(0)
  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)