WORST_CASE(?,O(n^1))

Solution:
---------

  Cons :: [A(0) x A(15)] -(15)-> A(15)
  Cons :: [A(0) x A(1)] -(1)-> A(1)
  Nil :: [] -(0)-> A(15)
  goal :: [A(15) x A(11)] -(8)-> A(0)
  revapp :: [A(15) x A(1)] -(1)-> A(0)


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

  Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  Nil :: [] -(0)-> A_cf(0)
  revapp :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)


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