WORST_CASE(?,O(n^1))

Solution:
---------

  :: :: [A(13) x A(13)] -(13)-> A(13)
  :: :: [A(4) x A(4)] -(4)-> A(4)
  :: :: [A(10) x A(10)] -(10)-> A(10)
  :: :: [A(15) x A(15)] -(15)-> A(15)
  :: :: [A(3) x A(3)] -(3)-> A(3)
  :: :: [A(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 A(13)] -(1)-> A(3)
  group3#3 :: [A(13) x A(13) x A(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 :: [A(9) x A(9) x A(9)] -(0)-> A(9)
  tuple#3 :: [A(2) x A(2) x A(2)] -(0)-> A(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 A(4) x A(4)] -(2)-> A(2)
  zip3#3 :: [A(15) x A(4) x A(4) x A(10) x A(10)] -(8)-> A(2)


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

  :: :: [A_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 A_cf(0)] -(0)-> A_cf(0)
  group3#3 :: [A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  nil :: [] -(0)-> A_cf(0)
  tuple#3 :: [A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_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 A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  zip3#3 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  ::_A :: [A(0) x A(0)] -(0)-> A(0)
  nil_A :: [] -(0)-> A(1)
  tuple#3_A :: [A(0) x A(0) x A(0)] -(0)-> A(0)