MAYBE Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Termination Assumption

We assume termination of the following TRS

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