MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          activate(X) -> X
          activate(n__c()) -> c()
          activate(n__d()) -> d()
          c() -> d()
          c() -> n__c()
          d() -> n__d()
          g(X) -> h(activate(X))
          h(n__d()) -> g(n__c())
      - Signature:
          {activate/1,c/0,d/0,g/1,h/1} / {n__c/0,n__d/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {activate,c,d,g,h} and constructors {n__c,n__d}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
  + Details:
      The input can not be schown compatible.
MAYBE