TORPAcyc is applied to the string rewriting system c c -> a a a b b b b b b a -> b b b b b b b b b b c c -> c c c a a a a Tropical matrix interpretation interpretation of c: / 3 0 \ \ 2 2 / interpretation of a: / 2 1 \ \ 0 0 / interpretation of b: / 0 0 \ \ - - / remove rule 1 continue with: b b b a -> b b b b b b b b b b c c -> c c c a a a a Tropical matrix interpretation interpretation of c: / 2 0 \ \ 0 1 / interpretation of a: / 2 - \ \ 0 0 / interpretation of b: / 0 - \ \ - - / remove rule 1 continue with: b b c c -> c c c a a a a interpretation of c: 3 interpretation of a: 0 interpretation of b: 2 remove rule 1 termination has been proved