MAYBE Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

a(l(x0))	→	l(a(x0))
r(a(x0))	→	a(r(x0))
b(l(x0))	→	b(a(r(x0)))
r(b(x0))	→	l(b(x0))

Proof

1 Termination Assumption

We assume termination of the following TRS

a(l(x0))	→	l(a(x0))
r(a(x0))	→	a(r(x0))
b(l(x0))	→	b(a(r(x0)))
r(b(x0))	→	l(b(x0))