MAYBE Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Termination Assumption

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