WORST_CASE(?,O(n^1))

Solution:
---------

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


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)