WORST_CASE(?,O(n^1))

Solution:
---------

  "Cons" :: ["__ANY_TYPE__"(0) x "list"(2)] -(2)-> "list"(2)
  "Cons" :: ["__ANY_TYPE__"(0) x "list"(1)] -(1)-> "list"(1)
  "Cons" :: ["__ANY_TYPE__"(0) x "list"(0)] -(0)-> "list"(0)
  "Nil" :: [] -(0)-> "list"(2)
  "Nil" :: [] -(0)-> "list"(1)
  "Nil" :: [] -(0)-> "list"(0)
  "main" :: ["list"(2)] -(3)-> "list"(0)
  "map#2" :: ["list"(1)] -(1)-> "list"(0)
  "rmap#2" :: ["list"(2) x "list"(1)] -(1)-> "list"(1)


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



Used heuristics (no base constructurs)
--------------------------------------


Parsed Typed Term Rewrite System:
---------------------------------

(STRATEGY
 INNERMOST)
(VAR
 "v2" "v32" "v10" "v6" "v1")
(DATATYPES
   "list" = µX.< "Nil", "Cons"("__ANY_TYPE__", X) >)
(SIGNATURES
   "rmap#2" :: ["list" x "list"] --> "list"
   "map#2" :: ["list"] --> "list"
   "main" :: ["list"] --> "list")
(RULES
 "rmap#2"("Nil"(),"v2") -> "v2"
 "rmap#2"("Cons"("v32","v10"),"v6") -> "rmap#2"("v10","Cons"("v32","v6"))
 "map#2"("Nil"()) -> "Nil"()
 "map#2"("Cons"("v32","v6")) -> "Cons"("v32","map#2"("v6"))
 "main"("v1") -> "map#2"("rmap#2"("v1","Nil"())))


WORST_CASE(?,O(n^1))