YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 String Reversal

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

1.1 Bounds

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