Certification Problem

Input (TPDB TRS_Standard/AG01/#3.51)

The rewrite relation of the following TRS is considered.

f(f(x)) f(c(f(x))) (1)
f(f(x)) f(d(f(x))) (2)
g(c(x)) x (3)
g(d(x)) x (4)
g(c(h(0))) g(d(1)) (5)
g(c(1)) g(d(h(0))) (6)
g(h(x)) g(x) (7)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 Bounds

The given TRS is match-(raise)-bounded by 2. This is shown by the following automaton.