YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Bounds

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