BEST_CASE(Omega(n^1),?)

Solution:
---------

  "#0" :: [] -(0)-> "b"(0)
  "#EQ" :: [] -(0)-> "c"(0)
  "#GT" :: [] -(0)-> "c"(0)
  "#LT" :: [] -(0)-> "c"(0)
  "#and" :: ["a"(0) x "a"(0)] -(1)-> "a"(0)
  "#ckgt" :: ["c"(0)] -(1)-> "a"(0)
  "#compare" :: ["b"(0) x "b"(0)] -(1)-> "c"(0)
  "#eq" :: ["b"(0) x "b"(0)] -(1)-> "a"(0)
  "#equal" :: ["b"(0) x "b"(0)] -(1)-> "a"(0)
  "#false" :: [] -(0)-> "a"(0)
  "#greater" :: ["b"(0) x "b"(0)] -(1)-> "a"(0)
  "#neg" :: ["b"(0)] -(0)-> "b"(0)
  "#pos" :: ["b"(0)] -(0)-> "b"(0)
  "#s" :: ["b"(0)] -(0)-> "b"(0)
  "#true" :: [] -(0)-> "a"(0)
  "append" :: ["b"(0) x "b"(0)] -(1)-> "b"(0)
  "append#1" :: ["b"(0) x "b"(0)] -(1)-> "b"(0)
  "dd" :: ["b"(0) x "b"(0)] -(0)-> "b"(0)
  "dd" :: ["b"(0) x "b"(1)] -(1)-> "b"(1)
  "insert" :: ["b"(0) x "b"(0)] -(1)-> "b"(0)
  "insert#1" :: ["b"(0) x "b"(0) x "b"(0)] -(1)-> "b"(0)
  "insert#2" :: ["b"(0) x "b"(0) x "b"(0) x "b"(0)] -(1)-> "b"(0)
  "insert#3" :: ["b"(0) x "b"(0) x "b"(0) x "b"(0) x "b"(0)] -(1)-> "b"(0)
  "insert#4" :: ["a"(0) x "b"(0) x "b"(0) x "b"(0) x "b"(0) x "b"(0)] -(1)-> "b"(0)
  "nil" :: [] -(0)-> "b"(0)
  "nil" :: [] -(0)-> "b"(1)
  "quicksort" :: ["b"(0)] -(1)-> "b"(0)
  "quicksort#1" :: ["b"(0)] -(1)-> "b"(0)
  "quicksort#2" :: ["b"(0) x "b"(0)] -(1)-> "b"(0)
  "sortAll" :: ["b"(0)] -(1)-> "b"(0)
  "sortAll#1" :: ["b"(0)] -(1)-> "b"(0)
  "sortAll#2" :: ["b"(0) x "b"(0)] -(1)-> "b"(0)
  "split" :: ["b"(1)] -(1)-> "b"(0)
  "split#1" :: ["b"(1)] -(1)-> "b"(0)
  "splitAndSort" :: ["b"(1)] -(1)-> "b"(0)
  "splitqs" :: ["b"(0) x "b"(0)] -(1)-> "b"(0)
  "splitqs#1" :: ["b"(0) x "b"(0)] -(1)-> "b"(0)
  "splitqs#2" :: ["b"(0) x "b"(0) x "b"(0)] -(1)-> "b"(0)
  "splitqs#3" :: ["a"(0) x "b"(0) x "b"(0) x "b"(0)] -(1)-> "b"(0)
  "tuple#2" :: ["b"(0) x "b"(0)] -(0)-> "b"(0)


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




Base Constructors:
------------------