WORST_CASE(?,O(n^2))

Solution:
---------

  C :: [A(15, 10) x A(15, 10)] -(5)-> A(5, 10)
  C :: [A(4, 0) x A(4, 0)] -(4)-> A(4, 0)
  C :: [A(10, 7) x A(10, 7)] -(3)-> A(3, 7)
  C :: [A(2, 2) x A(2, 2)] -(0)-> A(0, 2)
  C :: [A(0, 0) x A(0, 0)] -(0)-> A(0, 0)
  False :: [] -(0)-> A(14, 14)
  S :: [] -(0)-> A(7, 13)
  True :: [] -(0)-> A(14, 14)
  Z :: [] -(0)-> A(5, 10)
  Z :: [] -(0)-> A(4, 0)
  Z :: [] -(0)-> A(0, 2)
  Z :: [] -(0)-> A(7, 6)
  add0 :: [A(4, 0) x A(0, 0)] -(4)-> A(0, 0)
  goal :: [A(11, 12) x A(14, 11)] -(12)-> A(0, 0)
  isZero :: [A(0, 2)] -(10)-> A(0, 0)
  mul0 :: [A(5, 10) x A(0, 5)] -(1)-> A(0, 0)
  second :: [A(3, 7)] -(8)-> A(4, 0)


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

  C :: [A_cf(10, 0) x A_cf(10, 0)] -(10)-> A_cf(10, 0)
  C :: [A_cf(5, 0) x A_cf(5, 0)] -(5)-> A_cf(5, 0)
  C :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  S :: [] -(0)-> A_cf(15, 11)
  S :: [] -(0)-> A_cf(0, 0)
  Z :: [] -(0)-> A_cf(10, 0)
  Z :: [] -(0)-> A_cf(5, 0)
  Z :: [] -(0)-> A_cf(11, 2)
  Z :: [] -(0)-> A_cf(0, 0)
  add0 :: [A_cf(5, 0) x A_cf(5, 0)] -(1)-> A_cf(5, 0)
  add0 :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  mul0 :: [A_cf(10, 0) x A_cf(1, 0)] -(0)-> A_cf(5, 0)


Base Constructors:
------------------
  C_A :: [A(1, 0) x A(1, 0)] -(1)-> A(1, 0)
  C_A :: [A(1, 1) x A(1, 1)] -(0)-> A(0, 1)
  False_A :: [] -(0)-> A(1, 0)
  False_A :: [] -(0)-> A(0, 1)
  S_A :: [] -(0)-> A(1, 0)
  S_A :: [] -(0)-> A(0, 1)
  True_A :: [] -(0)-> A(1, 0)
  True_A :: [] -(0)-> A(0, 1)
  Z_A :: [] -(0)-> A(1, 0)
  Z_A :: [] -(0)-> A(0, 1)