WORST_CASE(?,O(n^1))

Solution:
---------

  "@" :: ["A"(15) x "A"(14)] -(3)-> "A"(4)
  "Capture" :: [] -(0)-> "A"(0)
  "Cons" :: ["A"(0) x "A"(15)] -(15)-> "A"(15)
  "Cons" :: ["A"(0) x "A"(3)] -(3)-> "A"(3)
  "Cons" :: ["A"(0) x "A"(4)] -(4)-> "A"(4)
  "False" :: [] -(0)-> "A"(6)
  "False" :: [] -(0)-> "A"(14)
  "Nil" :: [] -(0)-> "A"(15)
  "Nil" :: [] -(0)-> "A"(3)
  "Swap" :: [] -(0)-> "A"(0)
  "True" :: [] -(0)-> "A"(14)
  "equal" :: ["A"(0) x "A"(0)] -(11)-> "A"(0)
  "game" :: ["A"(15) x "A"(15) x "A"(3)] -(8)-> "A"(4)
  "goal" :: ["A"(15) x "A"(15) x "A"(15)] -(9)-> "A"(0)


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




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