WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(0)
  "0" :: [] -(0)-> "A"(15)
  "0" :: [] -(0)-> "A"(14)
  "a__add" :: ["A"(0) x "A"(15)] -(10)-> "A"(0)
  "a__and" :: ["A"(0) x "A"(15)] -(12)-> "A"(0)
  "a__first" :: ["A"(0) x "A"(0)] -(2)-> "A"(0)
  "a__from" :: ["A"(14)] -(12)-> "A"(0)
  "a__if" :: ["A"(0) x "A"(15) x "A"(15)] -(12)-> "A"(0)
  "add" :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
  "add" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "and" :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
  "and" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "cons" :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
  "cons" :: ["A"(3) x "A"(3)] -(3)-> "A"(3)
  "false" :: [] -(0)-> "A"(0)
  "false" :: [] -(0)-> "A"(15)
  "false" :: [] -(0)-> "A"(8)
  "first" :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
  "first" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "from" :: ["A"(15)] -(15)-> "A"(15)
  "from" :: ["A"(2)] -(2)-> "A"(2)
  "from" :: ["A"(8)] -(8)-> "A"(8)
  "if" :: ["A"(15) x "A"(15) x "A"(15)] -(15)-> "A"(15)
  "if" :: ["A"(0) x "A"(0) x "A"(0)] -(0)-> "A"(0)
  "mark" :: ["A"(15)] -(9)-> "A"(0)
  "nil" :: [] -(0)-> "A"(15)
  "nil" :: [] -(0)-> "A"(8)
  "s" :: ["A"(0)] -(0)-> "A"(0)
  "s" :: ["A"(0)] -(15)-> "A"(15)
  "s" :: ["A"(0)] -(4)-> "A"(4)
  "s" :: ["A"(0)] -(2)-> "A"(2)
  "true" :: [] -(0)-> "A"(0)
  "true" :: [] -(0)-> "A"(15)
  "true" :: [] -(0)-> "A"(8)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"add\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"and\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"cons\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"false\"_A" :: [] -(0)-> "A"(1)
  "\"first\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"from\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"if\"_A" :: ["A"(1) x "A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"nil\"_A" :: [] -(0)-> "A"(1)
  "\"s\"_A" :: ["A"(0)] -(1)-> "A"(1)
  "\"true\"_A" :: [] -(0)-> "A"(1)