MAYBE

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

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

We add following weak dependency pairs:

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

and mark the set of starting terms.

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

Strict DPs:
  { average^#(x, s(s(s(y)))) -> c_1(average^#(s(x), y))
  , average^#(s(x), y) -> c_2(average^#(x, s(y)))
  , average^#(0(), s(s(0()))) -> c_3()
  , average^#(0(), s(0())) -> c_4()
  , average^#(0(), 0()) -> c_5() }
Strict Trs:
  { average(x, s(s(s(y)))) -> s(average(s(x), y))
  , average(s(x), y) -> average(x, s(y))
  , average(0(), s(s(0()))) -> s(0())
  , average(0(), s(0())) -> 0()
  , average(0(), 0()) -> 0() }
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:
  { average^#(x, s(s(s(y)))) -> c_1(average^#(s(x), y))
  , average^#(s(x), y) -> c_2(average^#(x, s(y)))
  , average^#(0(), s(s(0()))) -> c_3()
  , average^#(0(), s(0())) -> c_4()
  , average^#(0(), 0()) -> c_5() }
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_1) = {1}, Uargs(c_2) = {1}

TcT has computed following constructor-restricted matrix
interpretation.

              [s](x1) = [1] x1 + [0]
                                    
                  [0] = [0]         
                                    
  [average^#](x1, x2) = [1]         
                                    
            [c_1](x1) = [1] x1 + [0]
                                    
            [c_2](x1) = [1] x1 + [0]
                                    
                [c_3] = [0]         
                                    
                [c_4] = [0]         
                                    
                [c_5] = [0]         

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

{ average^#(0(), s(s(0()))) -> c_3()
, average^#(0(), s(0())) -> c_4()
, average^#(0(), 0()) -> c_5() }

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

Strict DPs:
  { average^#(x, s(s(s(y)))) -> c_1(average^#(s(x), y))
  , average^#(s(x), y) -> c_2(average^#(x, s(y))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..