MAYBE

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

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

We add following dependency tuples:

Strict DPs:
  { times^#(x, 0()) -> c_1()
  , times^#(x, s(y)) -> c_2(plus^#(times(x, y), x), times^#(x, y))
  , plus^#(x, 0()) -> c_3()
  , plus^#(x, s(y)) -> c_4(plus^#(x, y))
  , plus^#(0(), x) -> c_5()
  , plus^#(s(x), y) -> c_6(plus^#(x, y)) }

and mark the set of starting terms.

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

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

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

  DPs:
    { 1: times^#(x, 0()) -> c_1()
    , 2: times^#(x, s(y)) -> c_2(plus^#(times(x, y), x), times^#(x, y))
    , 3: plus^#(x, 0()) -> c_3()
    , 4: plus^#(x, s(y)) -> c_4(plus^#(x, y))
    , 5: plus^#(0(), x) -> c_5()
    , 6: plus^#(s(x), y) -> c_6(plus^#(x, y)) }

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

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

{ times^#(x, 0()) -> c_1()
, plus^#(x, 0()) -> c_3()
, plus^#(0(), x) -> c_5() }

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

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

The input cannot be shown compatible

Arrrr..