MAYBE

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

Strict Trs:
  { from(X) -> cons(X)
  , length() -> 0()
  , length() -> s(length1())
  , length1() -> length() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

We add following weak dependency pairs:

Strict DPs:
  { from^#(X) -> c_1()
  , length^#() -> c_2()
  , length^#() -> c_3(length1^#())
  , length1^#() -> c_4(length^#()) }

and mark the set of starting terms.

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

Strict DPs:
  { from^#(X) -> c_1()
  , length^#() -> c_2()
  , length^#() -> c_3(length1^#())
  , length1^#() -> c_4(length^#()) }
Strict Trs:
  { from(X) -> cons(X)
  , length() -> 0()
  , length() -> s(length1())
  , length1() -> length() }
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:
  { from^#(X) -> c_1()
  , length^#() -> c_2()
  , length^#() -> c_3(length1^#())
  , length1^#() -> c_4(length^#()) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The weightgap principle applies (using the following constant
growth matrix-interpretation)

The following argument positions are usable:
  Uargs(c_3) = {1}, Uargs(c_4) = {1}

TcT has computed following constructor-restricted matrix
interpretation.

  [from^#](x1) = [1]         
                             
         [c_1] = [0]         
                             
    [length^#] = [1]         
                             
         [c_2] = [0]         
                             
     [c_3](x1) = [1] x1 + [2]
                             
   [length1^#] = [1]         
                             
     [c_4](x1) = [1] x1 + [2]

This order satisfies following ordering constraints:


Further, it can be verified that all rules not oriented are covered by the weightgap condition.

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

Strict DPs:
  { length^#() -> c_3(length1^#())
  , length1^#() -> c_4(length^#()) }
Weak DPs:
  { from^#(X) -> c_1()
  , length^#() -> c_2() }
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.

{ from^#(X) -> c_1()
, length^#() -> c_2() }

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

Strict DPs:
  { length^#() -> c_3(length1^#())
  , length1^#() -> c_4(length^#()) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..