MAYBE

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

Strict Trs:
  { f(x, x) -> g(f(x, x))
  , g(x) -> a() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

We add following dependency tuples:

Strict DPs:
  { f^#(x, x) -> c_1(g^#(f(x, x)), f^#(x, x))
  , g^#(x) -> c_2() }

and mark the set of starting terms.

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

Strict DPs:
  { f^#(x, x) -> c_1(g^#(f(x, x)), f^#(x, x))
  , g^#(x) -> c_2() }
Weak Trs:
  { f(x, x) -> g(f(x, x))
  , g(x) -> a() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

We estimate the number of application of {2} by applications of
Pre({2}) = {1}. Here rules are labeled as follows:

  DPs:
    { 1: f^#(x, x) -> c_1(g^#(f(x, x)), f^#(x, x))
    , 2: g^#(x) -> c_2() }

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

Strict DPs: { f^#(x, x) -> c_1(g^#(f(x, x)), f^#(x, x)) }
Weak DPs: { g^#(x) -> c_2() }
Weak Trs:
  { f(x, x) -> g(f(x, x))
  , g(x) -> a() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The following weak DPs constitute a sub-graph of the DG that is
closed under successors. The DPs are removed.

{ g^#(x) -> c_2() }

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

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

Due to missing edges in the dependency-graph, the right-hand sides
of following rules could be simplified:

  { f^#(x, x) -> c_1(g^#(f(x, x)), f^#(x, x)) }

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

Strict DPs: { f^#(x, x) -> c_1(f^#(x, x)) }
Weak Trs:
  { f(x, x) -> g(f(x, x))
  , g(x) -> a() }
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, x) -> c_1(f^#(x, x)) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..