WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "nat"(1)
  "False" :: [] -(0)-> "bool"(0)
  "S" :: ["nat"(1)] -(1)-> "nat"(1)
  "True" :: [] -(0)-> "bool"(0)
  "even#1" :: ["nat"(1)] -(1)-> "bool"(0)
  "main" :: ["nat"(1)] -(2)-> "bool"(0)


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

  "0" :: [] -(0)-> "nat"_cf(0)
  "False" :: [] -(0)-> "bool"_cf(0)
  "S" :: ["nat"_cf(0)] -(0)-> "nat"_cf(0)
  "True" :: [] -(0)-> "bool"_cf(0)
  "even#1" :: ["nat"_cf(0)] -(0)-> "bool"_cf(0)

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


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

(STRATEGY
 INNERMOST)
(VAR
 "v16" "v6")
(DATATYPES
   "bool" = < "True", "False" >
   "nat" = µX.< "0", "S"(X) >)
(SIGNATURES
   "even#1" :: ["nat"] --> "bool"
   "main" :: ["nat"] --> "bool")
(RULES
 "even#1"("0"()) -> "True"()
 "even#1"("S"("0"())) -> "False"()
 "even#1"("S"("S"("v16"))) -> "even#1"("v16")
 "main"("v6") -> "even#1"("v6"))


WORST_CASE(?,O(n^1))