YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 String Reversal

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

1.1 Bounds

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