MAYBE 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(x0))
b(a(c(x0))) → c(c(a(a(a(x0)))))

Proof

1 Termination Assumption

We assume termination of the following TRS
a(a(x0)) → a(b(x0))
b(a(c(x0))) → c(c(a(a(a(x0)))))