Certification Problem

Input (TPDB SRS_Standard/ICFP_2010/40708)

The rewrite relation of the following TRS is considered.

0(1(2(3(4(5(1(x1))))))) 0(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))) (1)
0(1(2(3(4(5(1(x1))))))) 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))))))))) (2)
0(1(2(3(4(5(1(x1))))))) 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1))))))))))))))))))))))))))))))) (3)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by ttt2 @ termCOMP 2023)

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.