MAYBE Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Termination Assumption

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