MAYBE Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Termination Assumption

We assume termination of the following TRS

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