YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

b(a(b(c(c(b(x0)))))) → a(b(b(c(c(b(a(x0)))))))

Proof

1 String Reversal

Since only unary symbols occur, one can reverse all terms and obtains the TRS
b(c(c(b(a(b(x0)))))) → a(b(c(c(b(b(a(x0)))))))

1.1 Bounds

The given TRS is match-bounded by 0. This is shown by the following automaton.