Certification Problem

Input (TPDB Runtime_Complexity_Innermost_Rewriting/Transformed_CSR_04/Ex25_Luc06_GM)

The rewrite relation of the following TRS is considered.

a__f(f(X)) a__c(f(g(f(X)))) (1)
a__c(X) d(X) (2)
a__h(X) a__c(d(X)) (3)
mark(f(X)) a__f(mark(X)) (4)
mark(c(X)) a__c(X) (5)
mark(h(X)) a__h(mark(X)) (6)
mark(g(X)) g(X) (7)
mark(d(X)) d(X) (8)
a__f(X) f(X) (9)
a__c(X) c(X) (10)
a__h(X) h(X) (11)
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.