WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(0)
  < :: [A(0) x A(0)] -(0)-> A(12)
  Cons :: [A(0) x A(5)] -(5)-> A(5)
  Cons :: [A(0) x A(13)] -(13)-> A(13)
  False :: [] -(0)-> A(10)
  False :: [] -(0)-> A(14)
  False :: [] -(0)-> A(12)
  Nil :: [] -(0)-> A(5)
  Nil :: [] -(0)-> A(13)
  S :: [A(0)] -(0)-> A(0)
  True :: [] -(0)-> A(10)
  True :: [] -(0)-> A(12)
  True :: [] -(0)-> A(14)
  goal :: [A(11)] -(15)-> A(0)
  notEmpty :: [A(13)] -(11)-> A(0)
  ordered :: [A(5)] -(14)-> A(6)
  ordered[Ite] :: [A(10) x A(5)] -(11)-> A(6)


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

  0 :: [] -(0)-> A_cf(0)
  < :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  False :: [] -(0)-> A_cf(0)
  Nil :: [] -(0)-> A_cf(0)
  S :: [A_cf(0)] -(0)-> A_cf(0)
  True :: [] -(0)-> A_cf(0)
  ordered :: [A_cf(0)] -(0)-> A_cf(0)
  ordered[Ite] :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  Cons_A :: [A(0) 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)