MAYBE

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

Strict Trs:
  { p(s(x)) -> x
  , fact(s(x)) -> *(s(x), fact(p(s(x))))
  , fact(0()) -> s(0())
  , *(s(x), y) -> +(*(x, y), y)
  , *(0(), y) -> 0()
  , +(x, s(y)) -> s(+(x, y))
  , +(x, 0()) -> x }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..