WORST_CASE(?,O(n^1))

Solution:
---------

  "Cons" :: ["__ANY_TYPE__"(0) x "list"(3)] -(3)-> "list"(3)
  "Cons" :: ["__ANY_TYPE__"(0) x "list"(0)] -(0)-> "list"(0)
  "Nil" :: [] -(0)-> "list"(3)
  "Nil" :: [] -(0)-> "list"(0)
  "fleft_op_e_xs_1" :: [] -(0)-> "list"(2)
  "foldr#3" :: ["list"(3)] -(1)-> "list"(2)
  "main" :: ["list"(3)] -(1)-> "list"(0)
  "rev_l#2" :: ["list"(0) x "__ANY_TYPE__"(0)] -(1)-> "list"(0)
  "step_x_f" :: ["__ANY_TYPE__"(0) x "list"(2)] -(2)-> "list"(2)
  "step_x_f#1" :: ["__ANY_TYPE__"(0) x "list"(2) x "list"(0)] -(2)-> "list"(0)


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



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


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

(STRATEGY
 INNERMOST)
(VAR
 "v8" "v10" "v4" "v3" "v2" "v1" "v5" "v16" "v6" "v9")
(DATATYPES
   "list" = µX.< "Cons"("__ANY_TYPE__", X), "step_x_f"("__ANY_TYPE__", X), "fleft_op_e_xs_1", "Nil" >)
(SIGNATURES
   "rev_l#2" :: ["list" x "__ANY_TYPE__"] --> "list"
   "step_x_f#1" :: ["__ANY_TYPE__" x "list" x "list"] --> "list"
   "foldr#3" :: ["list"] --> "list"
   "main" :: ["list"] --> "list")
(RULES
 "rev_l#2"("v8","v10") -> "Cons"("v10","v8")
 "step_x_f#1"("v4","step_x_f"("v3","v2"),"v1") -> "step_x_f#1"("v3","v2","rev_l#2"("v1","v4"))
 "step_x_f#1"("v5","fleft_op_e_xs_1"(),"v3") -> "rev_l#2"("v3","v5")
 "foldr#3"("Nil"()) -> "fleft_op_e_xs_1"()
 "foldr#3"("Cons"("v16","v6")) -> "step_x_f"("v16","foldr#3"("v6"))
 "main"("Nil"()) -> "Nil"()
 "main"("Cons"("v8","v9")) -> "step_x_f#1"("v8","foldr#3"("v9"),"Nil"()))


WORST_CASE(?,O(n^1))