We study the derivational complexity of Zantema?s string rewriting system over the alphabet {a, b, c} with the set of rules {aa -> bc, bb -> ac, cc -> ab}.
