WORST_CASE(?,O(n^1))

Solution:
---------

  @ :: [A(15) x A(0)] -(7)-> A(0)
  Capture :: [] -(0)-> A(0)
  Cons :: [A(0) x A(15)] -(15)-> A(15)
  Cons :: [A(0) x A(8)] -(8)-> A(8)
  Cons :: [A(0) x A(0)] -(0)-> A(0)
  False :: [] -(0)-> A(0)
  Nil :: [] -(0)-> A(15)
  Nil :: [] -(0)-> A(8)
  Swap :: [] -(0)-> A(0)
  True :: [] -(0)-> A(0)
  True :: [] -(0)-> A(4)
  equal :: [A(0) x A(0)] -(15)-> A(0)
  game :: [A(15) x A(15) x A(8)] -(12)-> A(0)
  goal :: [A(15) x A(15) x A(14)] -(15)-> A(0)


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

  @ :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  Capture :: [] -(0)-> A_cf(0)
  Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  Nil :: [] -(0)-> A_cf(0)
  Swap :: [] -(0)-> A_cf(0)
  game :: [A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)


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)