MAYBE

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

Strict Trs:
  { max(L(x)) -> x
  , max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z)))))
  , max(N(L(0()), L(y))) -> y
  , max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y)))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..