Certification Problem

Input (TPDB TRS_Standard/Secret_06_TRS/gen-10)

The rewrite relation of the following TRS is considered.

f(b(a,z)) z (1)
b(y,b(a,z)) b(f(c(y,y,a)),b(f(z),a)) (2)
f(f(f(c(z,x,a)))) b(f(x),z) (3)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by ttt2 @ termCOMP 2023)

1 Bounds

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