Certification Problem

Input (TPDB SRS_Standard/Zantema_04/z032)

The rewrite relation of the following TRS is considered.

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

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by ttt2 @ termCOMP 2023)

1 Bounds

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