BEST_CASE(Omega(n^1),?)

Solution:
---------

  "Cons" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(1)
  "goal" :: ["A"(1)] -(1)-> "A"(0)
  "mapconsapp" :: ["A"(0) x "A"(0) x "A"(0)] -(1)-> "A"(0)
  "permute" :: ["A"(1)] -(1)-> "A"(0)
  "revapp" :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
  "select" :: ["A"(0) x "A"(0) 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)
  "mapconsapp" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "permute" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "revapp" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "select" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)