WORST_CASE(?,O(n^1))

Solution:
---------

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


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

  "Cons" :: ["__ANY_TYPE__"_cf(0) x "list"_cf(0)] -(0)-> "list"_cf(0)
  "Nil" :: [] -(0)-> "list"_cf(0)
  "foldl#3" :: ["list"_cf(0) x "list"_cf(0)] -(0)-> "list"_cf(0)

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


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

(STRATEGY
 INNERMOST)
(VAR
 "v2" "v16" "v24" "v6" "v1")
(DATATYPES
   "list" = µX.< "Nil", "Cons"("__ANY_TYPE__", X) >)
(SIGNATURES
   "foldl#3" :: ["list" x "list"] --> "list"
   "main" :: ["list"] --> "list")
(RULES
 "foldl#3"("v2","Nil"()) -> "v2"
 "foldl#3"("v16","Cons"("v24","v6")) -> "foldl#3"("Cons"("v24","v16"),"v6")
 "main"("v1") -> "foldl#3"("Nil"(),"v1"))


WORST_CASE(?,O(n^1))