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