WORST_CASE(?,O(n^1))

Solution:
---------

  cons :: [b(13) x a(13)] -(13)-> a(13)
  cons :: [b(4) x a(4)] -(4)-> a(4)
  cons :: [b(10) x a(10)] -(10)-> a(10)
  cons :: [b(15) x a(15)] -(15)-> a(15)
  cons :: [b(3) x a(3)] -(3)-> a(3)
  cons :: [b(2) x a(2)] -(2)-> a(2)
  group3 :: [a(13)] -(11)-> a(3)
  group3#1 :: [a(13)] -(7)-> a(3)
  group3#2 :: [a(13) x b(13)] -(1)-> a(3)
  group3#3 :: [a(13) x b(13) x b(13)] -(10)-> a(3)
  nil :: [] -(0)-> a(13)
  nil :: [] -(0)-> a(4)
  nil :: [] -(0)-> a(10)
  nil :: [] -(0)-> a(15)
  nil :: [] -(0)-> a(5)
  tuple#3 :: [b(9) x b(9) x b(9)] -(0)-> b(9)
  tuple#3 :: [b(2) x b(2) x b(2)] -(0)-> b(2)
  zip3 :: [a(4) x a(10) x a(15)] -(9)-> a(2)
  zip3#1 :: [a(4) x a(10) x a(15)] -(7)-> a(2)
  zip3#2 :: [a(10) x a(15) x b(4) x a(4)] -(2)-> a(2)
  zip3#3 :: [a(15) x b(4) x a(4) x b(10) x a(10)] -(8)-> a(2)


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

  cons :: [b_cf(0) x a_cf(0)] -(0)-> a_cf(0)
  group3 :: [a_cf(0)] -(0)-> a_cf(0)
  group3#1 :: [a_cf(0)] -(0)-> a_cf(0)
  group3#2 :: [a_cf(0) x b_cf(0)] -(0)-> a_cf(0)
  group3#3 :: [a_cf(0) x b_cf(0) x b_cf(0)] -(0)-> a_cf(0)
  nil :: [] -(0)-> a_cf(0)
  tuple#3 :: [b_cf(0) x b_cf(0) x b_cf(0)] -(0)-> b_cf(0)
  zip3 :: [a_cf(0) x a_cf(0) x a_cf(0)] -(0)-> a_cf(0)
  zip3#1 :: [a_cf(0) x a_cf(0) x a_cf(0)] -(0)-> a_cf(0)
  zip3#2 :: [a_cf(0) x a_cf(0) x b_cf(0) x a_cf(0)] -(0)-> a_cf(0)
  zip3#3 :: [a_cf(0) x b_cf(0) x a_cf(0) x b_cf(0) x a_cf(0)] -(0)-> a_cf(0)


Base Constructors:
------------------
  cons_a :: [b(1) x a(1)] -(1)-> a(1)
  nil_a :: [] -(0)-> a(1)
  tuple#3_b :: [b(0) x b(0) x b(0)] -(0)-> b(0)