WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "nat"(1)
  "Cons" :: ["list"(0)] -(0)-> "list"(0)
  "Nil" :: [] -(0)-> "list"(0)
  "S" :: ["nat"(1)] -(1)-> "nat"(1)
  "main" :: ["nat"(1)] -(2)-> "list"(0)
  "take_l#2" :: ["nat"(1)] -(1)-> "list"(0)


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

  "0" :: [] -(0)-> "nat"_cf(0)
  "Cons" :: ["list"_cf(0)] -(0)-> "list"_cf(0)
  "Nil" :: [] -(0)-> "list"_cf(0)
  "S" :: ["nat"_cf(0)] -(0)-> "nat"_cf(0)
  "take_l#2" :: ["nat"_cf(0)] -(0)-> "list"_cf(0)

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


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

(STRATEGY
 INNERMOST)
(VAR
 "v2" "v1")
(DATATYPES
   "list" = µX.< "Nil", "Cons"(X) >
   "nat" = µX.< "0", "S"(X) >)
(SIGNATURES
   "take_l#2" :: ["nat"] --> "list"
   "main" :: ["nat"] --> "list")
(RULES
 "take_l#2"("0"()) -> "Nil"()
 "take_l#2"("S"("v2")) -> "Cons"("take_l#2"("v2"))
 "main"("v1") -> "take_l#2"("v1"))


WORST_CASE(?,O(n^1))