WORST_CASE(?,O(n^0))

Solution:
---------

  "0" :: [] -(0)-> "nat"(0)
  "S" :: ["nat"(0)] -(0)-> "nat"(0)
  "main" :: ["nat"(0)] -(1)-> "nat"(0)


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



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


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

(STRATEGY
 INNERMOST)
(VAR
 "v4")
(DATATYPES
   "nat" = µX.< "0", "S"(X) >)
(SIGNATURES
   "main" :: ["nat"] --> "nat")
(RULES
 "main"("0"()) -> "0"()
 "main"("S"("v4")) -> "v4")


WORST_CASE(?,O(n^0))