MAYBE Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Termination Assumption

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