MAYBE

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

Strict Trs:
  { minus(X, s(Y)) -> pred(minus(X, Y))
  , minus(X, 0()) -> X
  , pred(s(X)) -> X
  , le(s(X), s(Y)) -> le(X, Y)
  , le(s(X), 0()) -> false()
  , le(0(), Y) -> true()
  , gcd(s(X), s(Y)) -> if(le(Y, X), s(X), s(Y))
  , gcd(s(X), 0()) -> s(X)
  , gcd(0(), Y) -> 0()
  , if(false(), s(X), s(Y)) -> gcd(minus(Y, X), s(X))
  , if(true(), s(X), s(Y)) -> gcd(minus(X, Y), s(Y)) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..