The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

f(f(a)) → f(g(n__f(n__a)))
f(X) → n__f(X)
a → n__a
activate(n__f(X)) → f(activate(X))
activate(n__a) → a
activate(X) → X

Rewrite Strategy: INNERMOST

(1) CpxTrsMatchBoundsProof (EQUIVALENT transformation)

A linear upper bound on the runtime complexity of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 3.
The certificate found is represented by the following graph.

Start state: 1
Accept states: [2]
Transitions:
1→2[f_1|0, a|0, activate_1|0, n__f_1|1, n__a|1, a|1, g_1|1, n__a|2]
1→3[f_1|1, n__f_1|2]
1→4[f_1|2, n__f_1|3]
2→2[g_1|0, n__f_1|0, n__a|0]
3→2[activate_1|1, n__f_1|1, a|1, n__a|1, g_1|1, n__a|2]
3→3[f_1|1, n__f_1|2]
3→4[f_1|2, n__f_1|3]
4→5[g_1|2]
5→6[n__f_1|2]
6→2[n__a|2]

(2) BOUNDS(1, n^1)