Certification Problem

Input (TPDB Runtime_Complexity_Innermost_Rewriting/Zantema_05/z23)

The rewrite relation of the following TRS is considered.

f(x,a(b(c(y)))) f(b(c(a(b(x)))),y) (1)
f(a(x),y) f(x,a(y)) (2)
f(b(x),y) f(x,b(y)) (3)
f(c(x),y) f(x,c(y)) (4)
The evaluation strategy is innermost.

Property / Task

Determine bounds on the runtime complexity.

Answer / Result

An upperbound for the complexity is O(n).

Proof (by AProVE @ termCOMP 2023)

1 Bounds

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