MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { a__and(X1, X2) -> and(X1, X2)
  , a__and(tt(), X) -> mark(X)
  , mark(tt()) -> tt()
  , mark(0()) -> 0()
  , mark(s(X)) -> s(mark(X))
  , mark(and(X1, X2)) -> a__and(mark(X1), X2)
  , mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2))
  , a__plus(X1, X2) -> plus(X1, X2)
  , a__plus(N, 0()) -> mark(N)
  , a__plus(N, s(M)) -> s(a__plus(mark(N), mark(M))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..