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