MAYBE Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Termination Assumption

We assume termination of the following TRS

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