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