MAYBE

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

Strict Trs:
  { a(b(c(x1))) -> a(a(b(x1)))
  , a(b(c(x1))) -> b(c(b(c(x1))))
  , a(b(c(x1))) -> c(b(c(a(x1)))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

We add following dependency tuples:

Strict DPs:
  { a^#(b(c(x1))) -> c_1(a^#(a(b(x1))), a^#(b(x1)))
  , a^#(b(c(x1))) -> c_2()
  , a^#(b(c(x1))) -> c_3(a^#(x1)) }

and mark the set of starting terms.

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

Strict DPs:
  { a^#(b(c(x1))) -> c_1(a^#(a(b(x1))), a^#(b(x1)))
  , a^#(b(c(x1))) -> c_2()
  , a^#(b(c(x1))) -> c_3(a^#(x1)) }
Weak Trs:
  { a(b(c(x1))) -> a(a(b(x1)))
  , a(b(c(x1))) -> b(c(b(c(x1))))
  , a(b(c(x1))) -> c(b(c(a(x1)))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

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

  DPs:
    { 1: a^#(b(c(x1))) -> c_1(a^#(a(b(x1))), a^#(b(x1)))
    , 2: a^#(b(c(x1))) -> c_2()
    , 3: a^#(b(c(x1))) -> c_3(a^#(x1)) }

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

Strict DPs:
  { a^#(b(c(x1))) -> c_1(a^#(a(b(x1))), a^#(b(x1)))
  , a^#(b(c(x1))) -> c_3(a^#(x1)) }
Weak DPs: { a^#(b(c(x1))) -> c_2() }
Weak Trs:
  { a(b(c(x1))) -> a(a(b(x1)))
  , a(b(c(x1))) -> b(c(b(c(x1))))
  , a(b(c(x1))) -> c(b(c(a(x1)))) }
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.

{ a^#(b(c(x1))) -> c_2() }

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

Strict DPs:
  { a^#(b(c(x1))) -> c_1(a^#(a(b(x1))), a^#(b(x1)))
  , a^#(b(c(x1))) -> c_3(a^#(x1)) }
Weak Trs:
  { a(b(c(x1))) -> a(a(b(x1)))
  , a(b(c(x1))) -> b(c(b(c(x1))))
  , a(b(c(x1))) -> c(b(c(a(x1)))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..