MAYBE

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

Strict Trs:
  { d(0()) -> 0()
  , d(s(x)) -> s(s(d(x)))
  , e(0(), x) -> x
  , e(s(x), y) -> e(x, d(y)) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

We add following dependency tuples:

Strict DPs:
  { d^#(0()) -> c_1()
  , d^#(s(x)) -> c_2(d^#(x))
  , e^#(0(), x) -> c_3()
  , e^#(s(x), y) -> c_4(e^#(x, d(y)), d^#(y)) }

and mark the set of starting terms.

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

Strict DPs:
  { d^#(0()) -> c_1()
  , d^#(s(x)) -> c_2(d^#(x))
  , e^#(0(), x) -> c_3()
  , e^#(s(x), y) -> c_4(e^#(x, d(y)), d^#(y)) }
Weak Trs:
  { d(0()) -> 0()
  , d(s(x)) -> s(s(d(x)))
  , e(0(), x) -> x
  , e(s(x), y) -> e(x, d(y)) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

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

  DPs:
    { 1: d^#(0()) -> c_1()
    , 2: d^#(s(x)) -> c_2(d^#(x))
    , 3: e^#(0(), x) -> c_3()
    , 4: e^#(s(x), y) -> c_4(e^#(x, d(y)), d^#(y)) }

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

Strict DPs:
  { d^#(s(x)) -> c_2(d^#(x))
  , e^#(s(x), y) -> c_4(e^#(x, d(y)), d^#(y)) }
Weak DPs:
  { d^#(0()) -> c_1()
  , e^#(0(), x) -> c_3() }
Weak Trs:
  { d(0()) -> 0()
  , d(s(x)) -> s(s(d(x)))
  , e(0(), x) -> x
  , e(s(x), y) -> e(x, d(y)) }
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.

{ d^#(0()) -> c_1()
, e^#(0(), x) -> c_3() }

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

Strict DPs:
  { d^#(s(x)) -> c_2(d^#(x))
  , e^#(s(x), y) -> c_4(e^#(x, d(y)), d^#(y)) }
Weak Trs:
  { d(0()) -> 0()
  , d(s(x)) -> s(s(d(x)))
  , e(0(), x) -> x
  , e(s(x), y) -> e(x, d(y)) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

We replace rewrite rules by usable rules:

  Weak Usable Rules:
    { d(0()) -> 0()
    , d(s(x)) -> s(s(d(x))) }

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

Strict DPs:
  { d^#(s(x)) -> c_2(d^#(x))
  , e^#(s(x), y) -> c_4(e^#(x, d(y)), d^#(y)) }
Weak Trs:
  { d(0()) -> 0()
  , d(s(x)) -> s(s(d(x))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

None of the processors succeeded.

Details of failed attempt(s):
-----------------------------
1) 'matrices' failed due to the following reason:
   
   None of the processors succeeded.
   
   Details of failed attempt(s):
   -----------------------------
   1) 'matrix interpretation of dimension 4' failed due to the
      following reason:
      
      The input cannot be shown compatible
   
   2) 'matrix interpretation of dimension 3' failed due to the
      following reason:
      
      The input cannot be shown compatible
   
   3) 'matrix interpretation of dimension 3' failed due to the
      following reason:
      
      The input cannot be shown compatible
   
   4) 'matrix interpretation of dimension 2' failed due to the
      following reason:
      
      The input cannot be shown compatible
   
   5) 'matrix interpretation of dimension 2' failed due to the
      following reason:
      
      The input cannot be shown compatible
   
   6) 'matrix interpretation of dimension 1' failed due to the
      following reason:
      
      The input cannot be shown compatible
   

2) 'empty' failed due to the following reason:
   
   Empty strict component of the problem is NOT empty.


Arrrr..