YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Bounds

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