MAYBE Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

a(a(a(b(b(x0))))) → b(b(a(b(b(a(a(a(x0))))))))
b(b(a(x0))) → x0
a(x0) → b(b(b(x0)))
a(x0) → b(x0)

Proof

1 Termination Assumption

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