MAYBE

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

Strict Trs: { f(X) -> g(h(f(X))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

We add following dependency tuples:

Strict DPs: { f^#(X) -> c_1(f^#(X)) }

and mark the set of starting terms.

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

Strict DPs: { f^#(X) -> c_1(f^#(X)) }
Weak Trs: { f(X) -> g(h(f(X))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

No rule is usable, rules are removed from the input problem.

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

Strict DPs: { f^#(X) -> c_1(f^#(X)) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..