WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(8)
  "0" :: [] -(0)-> "A"(0)
  "E" :: [] -(0)-> "A"(13)
  "E" :: [] -(0)-> "A"(15)
  "Elem" :: ["A"(8)] -(8)-> "A"(8)
  "Elem" :: ["A"(0)] -(0)-> "A"(0)
  "False" :: [] -(0)-> "A"(0)
  "False" :: [] -(0)-> "A"(15)
  "Pair" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Pair" :: ["A"(0) x "A"(0)] -(0)-> "A"(14)
  "Pair" :: ["A"(0) x "A"(0)] -(0)-> "A"(15)
  "Pair" :: ["A"(0) x "A"(0)] -(0)-> "A"(12)
  "S" :: ["A"(8)] -(8)-> "A"(8)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "T" :: ["A"(13) x "A"(13) x "A"(13)] -(13)-> "A"(13)
  "T" :: ["A"(0) x "A"(0) x "A"(0)] -(0)-> "A"(0)
  "True" :: [] -(0)-> "A"(0)
  "True" :: [] -(0)-> "A"(15)
  "cond_partition_pivot_heap_1" :: ["A"(0) x "A"(8) x "A"(13) x "A"(0) x "A"(13)] -(11)-> "A"(4)
  "cond_partition_pivot_heap_3" :: ["A"(0) x "A"(8) x "A"(13) x "A"(0) x "A"(13) x "A"(5) x "A"(13)] -(15)-> "A"(4)
  "cond_partition_pivot_heap_4" :: ["A"(0) x "A"(5) x "A"(0) x "A"(5) x "A"(5)] -(5)-> "A"(13)
  "cond_partition_pivot_heap_5" :: ["A"(0) x "A"(1) x "A"(0) x "A"(5) x "A"(1)] -(2)-> "A"(12)
  "cond_partition_pivot_heap_7" :: ["A"(0) x "A"(8) x "A"(0) x "A"(9) x "A"(13) x "A"(2) x "A"(13)] -(15)-> "A"(6)
  "cond_partition_pivot_heap_8" :: ["A"(0) x "A"(0) x "A"(1) x "A"(1) x "A"(1)] -(2)-> "A"(12)
  "cond_partition_pivot_heap_9" :: ["A"(0) x "A"(0) x "A"(1) x "A"(1) x "A"(1)] -(1)-> "A"(8)
  "leq#2" :: ["A"(8) x "A"(0)] -(8)-> "A"(12)
  "leqElem#2" :: ["A"(8) x "A"(0)] -(4)-> "A"(12)
  "main" :: ["A"(15) x "A"(14)] -(13)-> "A"(0)
  "partition#2" :: ["A"(8) x "A"(13)] -(9)-> "A"(1)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"E\"_A" :: [] -(0)-> "A"(1)
  "\"Elem\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"False\"_A" :: [] -(0)-> "A"(1)
  "\"Pair\"_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1)
  "\"S\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"T\"_A" :: ["A"(1) x "A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"True\"_A" :: [] -(0)-> "A"(1)