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