YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Bounds

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