MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          0() -> n__0()
          U11(tt(),N) -> activate(N)
          U21(tt(),M,N) -> s(plus(activate(N),activate(M)))
          activate(X) -> X
          activate(n__0()) -> 0()
          activate(n__isNat(X)) -> isNat(X)
          activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2))
          activate(n__s(X)) -> s(activate(X))
          and(tt(),X) -> activate(X)
          isNat(X) -> n__isNat(X)
          isNat(n__0()) -> tt()
          isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2)))
          isNat(n__s(V1)) -> isNat(activate(V1))
          plus(N,0()) -> U11(isNat(N),N)
          plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N)
          plus(X1,X2) -> n__plus(X1,X2)
          s(X) -> n__s(X)
      - Signature:
          {0/0,U11/2,U21/3,activate/1,and/2,isNat/1,plus/2,s/1} / {n__0/0,n__isNat/1,n__plus/2,n__s/1,tt/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {0,U11,U21,activate,and,isNat,plus
          ,s} and constructors {n__0,n__isNat,n__plus,n__s,tt}
  + Applied Processor:
      MI {miKind = Automaton Nothing, miDimension = 3, miUArgs = NoUArgs, miURules = NoURules, miSelector = Nothing}
  + Details:
      Incompatible
MAYBE