TORPAcyc is applied to the string rewriting system a a -> b b b b b -> c c c c c c c -> a b interpretation of a: 9 interpretation of b: 6 interpretation of c: 4 remove rule 3 continue with: a a -> b b b b b -> c c c interpretation of a: 5 interpretation of b: 2 interpretation of c: 1 remove rule 2 continue with: a a -> b b b interpretation of a: 8 interpretation of b: 0 interpretation of c: 10 remove rule 1 termination has been proved