Certification Problem

Input (TPDB SRS_Standard/Zantema_04/z039)

The rewrite relation of the following TRS is considered.

c(a(a(b(c(a(x1)))))) a(a(b(c(c(a(a(b(c(x1))))))))) (1)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by ttt2 @ termCOMP 2023)

1 String Reversal

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

1.1 Bounds

The given TRS is match-(raise)-bounded by 3. This is shown by the following automaton. The automaton is closed under rewriting as it is compatible.