MAYBE Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Termination Assumption

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