Certification Problem

Input (TPDB Runtime_Complexity_Innermost_Rewriting/Transformed_CSR_04/Ex4_7_77_Bor03_GM)

The rewrite relation of the following TRS is considered.

a__zeros cons(0,zeros) (1)
a__tail(cons(X,XS)) mark(XS) (2)
mark(zeros) a__zeros (3)
mark(tail(X)) a__tail(mark(X)) (4)
mark(cons(X1,X2)) cons(mark(X1),X2) (5)
mark(0) 0 (6)
a__zeros zeros (7)
a__tail(X) tail(X) (8)
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 4. This is shown by the following automaton.