TORPAcyc is applied to the string rewriting system a b a a b b -> a a b a b b a Terminating due to match bound 1, proved by the graph consisting of the following edges: from 1 to 1, label: a0 from 1 to 1, label: b0 from 1 to 2, label: a1 from 2 to 3, label: a1 from 3 to 4, label: b1 from 4 to 5, label: a1 from 5 to 6, label: b1 from 6 to 7, label: b1 from 7 to 1, label: a1 from 7 to 2, label: a1