YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 String Reversal

Since only unary symbols occur, one can reverse all terms and obtains the TRS
a(c(b(a(a(c(x0)))))) c(b(a(a(c(c(b(a(a(x0)))))))))

1.1 Bounds

The given TRS is match-bounded by 1. This is shown by the following automaton.