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

(0) Obligation:

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

g(X) → h(activate(X))
c → d
h(n__d) → g(n__c)
d → n__d
c → n__c
activate(n__d) → d
activate(n__c) → c
activate(X) → X

Rewrite Strategy: INNERMOST

(1) InfiniteLowerBoundProof (EQUIVALENT transformation)

The loop following loop proves infinite runtime complexity:
The rewrite sequence
g(n__c) →⁺ g(n__c)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [ ].
The result substitution is [ ].

(2) BOUNDS(INF, INF)