WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> Nat(15)
  checkF :: [Q(4)] -(6)-> Q(4)
  cons :: [Nat(0) x L(4)] -(4)-> L(4)
  cons :: [Nat(0) x L(0)] -(0)-> L(0)
  empty :: [] -(6)-> Q(4)
  enq :: [Nat(15)] -(7)-> Q(4)
  errorHead :: [] -(0)-> Nat(6)
  errorTail :: [] -(0)-> Q(10)
  head :: [Q(15)] -(9)-> Nat(0)
  nil :: [] -(0)-> L(4)
  nil :: [] -(0)-> L(0)
  nil :: [] -(0)-> L(6)
  nil :: [] -(0)-> L(12)
  nil :: [] -(0)-> L(14)
  queue :: [L(0) x L(4)] -(4)-> Q(4)
  queue :: [L(0) x L(15)] -(15)-> Q(15)
  queue :: [L(0) x L(9)] -(9)-> Q(9)
  rev :: [L(4)] -(5)-> L(0)
  rev' :: [L(4) x L(0)] -(2)-> L(0)
  s :: [Nat(15)] -(15)-> Nat(15)
  snoc :: [Q(4) x Nat(0)] -(14)-> Q(4)
  tail :: [Q(9)] -(13)-> Q(4)


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

  0 :: [] -(0)-> Nat_cf(0)
  checkF :: [Q_cf(0)] -(0)-> Q_cf(0)
  cons :: [Nat_cf(0) x L_cf(0)] -(0)-> L_cf(0)
  empty :: [] -(0)-> Q_cf(0)
  enq :: [Nat_cf(0)] -(0)-> Q_cf(0)
  nil :: [] -(0)-> L_cf(0)
  queue :: [L_cf(0) x L_cf(0)] -(0)-> Q_cf(0)
  rev :: [L_cf(0)] -(0)-> L_cf(0)
  rev' :: [L_cf(0) x L_cf(0)] -(0)-> L_cf(0)
  s :: [Nat_cf(0)] -(0)-> Nat_cf(0)
  snoc :: [Q_cf(0) x Nat_cf(0)] -(0)-> Q_cf(0)


Base Constructors:
------------------
  0_Nat :: [] -(0)-> Nat(1)
  cons_L :: [Nat(0) x L(1)] -(1)-> L(1)
  errorHead_Nat :: [] -(0)-> Nat(1)
  errorTail_Q :: [] -(0)-> Q(1)
  nil_L :: [] -(0)-> L(1)
  queue_Q :: [L(0) x L(1)] -(1)-> Q(1)
  s_Nat :: [Nat(1)] -(1)-> Nat(1)