WORST_CASE(?,O(n^1))

Solution:
---------

  "Cons" :: ["__ANY_TYPE__"(0) x "list"(14)] -(14)-> "list"(14)
  "Cons" :: ["__ANY_TYPE__"(0) x "list"(15)] -(15)-> "list"(15)
  "Cons" :: ["__ANY_TYPE__"(0) x "list"(1)] -(1)-> "list"(1)
  "Nil" :: [] -(0)-> "list"(14)
  "Nil" :: [] -(0)-> "list"(15)
  "Nil" :: [] -(0)-> "list"(7)
  "comp_f_g" :: ["list"(8) x "list"(0)] -(8)-> "list"(8)
  "comp_f_g#1" :: ["list"(8) x "list"(13) x "list"(1)] -(3)-> "list"(1)
  "main" :: ["list"(15)] -(13)-> "list"(0)
  "walk#1" :: ["list"(14)] -(1)-> "list"(8)
  "walk_xs" :: [] -(0)-> "list"(8)
  "walk_xs" :: [] -(0)-> "list"(15)
  "walk_xs_3" :: ["__ANY_TYPE__"(0)] -(0)-> "list"(0)
  "walk_xs_3" :: ["__ANY_TYPE__"(0)] -(13)-> "list"(13)


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




Base Constructors:
------------------
  "\"Cons\"_list" :: ["__ANY_TYPE__"(0) x "list"(1)] -(1)-> "list"(1)
  "\"Nil\"_list" :: [] -(0)-> "list"(1)
  "\"comp_f_g\"_list" :: ["list"(0) x "list"(0)] -(1)-> "list"(1)
  "\"walk_xs\"_list" :: [] -(0)-> "list"(1)
  "\"walk_xs_3\"_list" :: ["__ANY_TYPE__"(0)] -(1)-> "list"(1)



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

(STRATEGY
 INNERMOST)
(VAR
 "v4" "v3" "v2" "v1" "v6" "v10" "v5")
(DATATYPES
   "list" = µX.< "Nil", "walk_xs", "Cons"("__ANY_TYPE__", X), "comp_f_g"(X, X), "walk_xs_3"("__ANY_TYPE__") >)
(SIGNATURES
   "walk#1" :: ["list"] --> "list"
   "comp_f_g#1" :: ["list" x "list" x "list"] --> "list"
   "main" :: ["list"] --> "list")
(RULES
 "walk#1"("Nil"()) -> "walk_xs"()
 "walk#1"("Cons"("v4","v3")) -> "comp_f_g"("walk#1"("v3"),"walk_xs_3"("v4"))
 "comp_f_g#1"("comp_f_g"("v4","walk_xs_3"("v3")),"walk_xs_3"("v2"),"v1") -> "comp_f_g#1"("v4","walk_xs_3"("v3"),"Cons"("v2","v1"))
 "comp_f_g#1"("walk_xs"(),"walk_xs_3"("v6"),"v10") -> "Cons"("v6","v10")
 "main"("Nil"()) -> "Nil"()
 "main"("Cons"("v4","v5")) -> "comp_f_g#1"("walk#1"("v5"),"walk_xs_3"("v4"),"Nil"()))


WORST_CASE(?,O(n^1))