MAYBE Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

c(b(x0)) b(a(x0))
a(c(x0)) a(b(c(x0)))
b(b(x0)) b(c(x0))
c(a(x0)) c(c(c(x0)))

Proof

1 Termination Assumption

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