MAYBE

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

Strict Trs:
  { rev(a()) -> a()
  , rev(b()) -> b()
  , rev(++(x, x)) -> rev(x)
  , rev(++(x, y)) -> ++(rev(y), rev(x)) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

We add following weak dependency pairs:

Strict DPs:
  { rev^#(a()) -> c_1()
  , rev^#(b()) -> c_2()
  , rev^#(++(x, x)) -> c_3(rev^#(x))
  , rev^#(++(x, y)) -> c_4(rev^#(y), rev^#(x)) }

and mark the set of starting terms.

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

Strict DPs:
  { rev^#(a()) -> c_1()
  , rev^#(b()) -> c_2()
  , rev^#(++(x, x)) -> c_3(rev^#(x))
  , rev^#(++(x, y)) -> c_4(rev^#(y), rev^#(x)) }
Strict Trs:
  { rev(a()) -> a()
  , rev(b()) -> b()
  , rev(++(x, x)) -> rev(x)
  , rev(++(x, y)) -> ++(rev(y), rev(x)) }
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:
  { rev^#(a()) -> c_1()
  , rev^#(b()) -> c_2()
  , rev^#(++(x, x)) -> c_3(rev^#(x))
  , rev^#(++(x, y)) -> c_4(rev^#(y), rev^#(x)) }
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, 2}

TcT has computed following constructor-restricted matrix
interpretation.

            [a] = [2]                  
                                       
            [b] = [1]                  
                                       
   [++](x1, x2) = [1] x1 + [1] x2 + [2]
                                       
    [rev^#](x1) = [1]                  
                                       
          [c_1] = [0]                  
                                       
          [c_2] = [0]                  
                                       
      [c_3](x1) = [1] x1 + [1]         
                                       
  [c_4](x1, x2) = [1] x1 + [1] x2 + [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:
  { rev^#(++(x, x)) -> c_3(rev^#(x))
  , rev^#(++(x, y)) -> c_4(rev^#(y), rev^#(x)) }
Weak DPs:
  { rev^#(a()) -> c_1()
  , rev^#(b()) -> 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.

{ rev^#(a()) -> c_1()
, rev^#(b()) -> c_2() }

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

Strict DPs:
  { rev^#(++(x, x)) -> c_3(rev^#(x))
  , rev^#(++(x, y)) -> c_4(rev^#(y), rev^#(x)) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..