YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Bounds

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