MAYBE Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Termination Assumption

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