WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(0)
  "<" :: ["A"(0) x "A"(0)] -(0)-> "A"(13)
  "Cons" :: ["A"(7) x "A"(7)] -(7)-> "A"(7)
  "Cons" :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
  "False" :: [] -(0)-> "A"(1)
  "False" :: [] -(0)-> "A"(12)
  "False" :: [] -(0)-> "A"(14)
  "Nil" :: [] -(0)-> "A"(7)
  "Nil" :: [] -(0)-> "A"(14)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "True" :: [] -(0)-> "A"(1)
  "True" :: [] -(0)-> "A"(12)
  "True" :: [] -(0)-> "A"(14)
  "goal" :: ["A"(15)] -(15)-> "A"(5)
  "notEmpty" :: ["A"(14)] -(3)-> "A"(2)
  "ordered" :: ["A"(7)] -(14)-> "A"(10)
  "ordered[Ite]" :: ["A"(1) x "A"(7)] -(7)-> "A"(10)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"Cons\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"False\"_A" :: [] -(0)-> "A"(1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1)
  "\"S\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"True\"_A" :: [] -(0)-> "A"(1)