MAYBE

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

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

We add following dependency tuples:

Strict DPs:
  { min^#(x, 0()) -> c_1()
  , min^#(0(), y) -> c_2()
  , min^#(s(x), s(y)) -> c_3(min^#(x, y))
  , max^#(x, 0()) -> c_4()
  , max^#(0(), y) -> c_5()
  , max^#(s(x), s(y)) -> c_6(max^#(x, y))
  , -^#(x, 0()) -> c_7()
  , -^#(s(x), s(y)) -> c_8(-^#(x, y))
  , gcd^#(s(x), s(y)) ->
    c_9(gcd^#(-(s(max(x, y)), s(min(x, y))), s(min(x, y))),
        -^#(s(max(x, y)), s(min(x, y))),
        max^#(x, y),
        min^#(x, y),
        min^#(x, y)) }

and mark the set of starting terms.

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

Strict DPs:
  { min^#(x, 0()) -> c_1()
  , min^#(0(), y) -> c_2()
  , min^#(s(x), s(y)) -> c_3(min^#(x, y))
  , max^#(x, 0()) -> c_4()
  , max^#(0(), y) -> c_5()
  , max^#(s(x), s(y)) -> c_6(max^#(x, y))
  , -^#(x, 0()) -> c_7()
  , -^#(s(x), s(y)) -> c_8(-^#(x, y))
  , gcd^#(s(x), s(y)) ->
    c_9(gcd^#(-(s(max(x, y)), s(min(x, y))), s(min(x, y))),
        -^#(s(max(x, y)), s(min(x, y))),
        max^#(x, y),
        min^#(x, y),
        min^#(x, y)) }
Weak Trs:
  { min(x, 0()) -> 0()
  , min(0(), y) -> 0()
  , min(s(x), s(y)) -> s(min(x, y))
  , max(x, 0()) -> x
  , max(0(), y) -> y
  , max(s(x), s(y)) -> s(max(x, y))
  , -(x, 0()) -> x
  , -(s(x), s(y)) -> -(x, y)
  , gcd(s(x), s(y)) ->
    gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

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

  DPs:
    { 1: min^#(x, 0()) -> c_1()
    , 2: min^#(0(), y) -> c_2()
    , 3: min^#(s(x), s(y)) -> c_3(min^#(x, y))
    , 4: max^#(x, 0()) -> c_4()
    , 5: max^#(0(), y) -> c_5()
    , 6: max^#(s(x), s(y)) -> c_6(max^#(x, y))
    , 7: -^#(x, 0()) -> c_7()
    , 8: -^#(s(x), s(y)) -> c_8(-^#(x, y))
    , 9: gcd^#(s(x), s(y)) ->
         c_9(gcd^#(-(s(max(x, y)), s(min(x, y))), s(min(x, y))),
             -^#(s(max(x, y)), s(min(x, y))),
             max^#(x, y),
             min^#(x, y),
             min^#(x, y)) }

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

Strict DPs:
  { min^#(s(x), s(y)) -> c_3(min^#(x, y))
  , max^#(s(x), s(y)) -> c_6(max^#(x, y))
  , -^#(s(x), s(y)) -> c_8(-^#(x, y))
  , gcd^#(s(x), s(y)) ->
    c_9(gcd^#(-(s(max(x, y)), s(min(x, y))), s(min(x, y))),
        -^#(s(max(x, y)), s(min(x, y))),
        max^#(x, y),
        min^#(x, y),
        min^#(x, y)) }
Weak DPs:
  { min^#(x, 0()) -> c_1()
  , min^#(0(), y) -> c_2()
  , max^#(x, 0()) -> c_4()
  , max^#(0(), y) -> c_5()
  , -^#(x, 0()) -> c_7() }
Weak Trs:
  { min(x, 0()) -> 0()
  , min(0(), y) -> 0()
  , min(s(x), s(y)) -> s(min(x, y))
  , max(x, 0()) -> x
  , max(0(), y) -> y
  , max(s(x), s(y)) -> s(max(x, y))
  , -(x, 0()) -> x
  , -(s(x), s(y)) -> -(x, y)
  , gcd(s(x), s(y)) ->
    gcd(-(s(max(x, y)), s(min(x, y))), s(min(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.

{ min^#(x, 0()) -> c_1()
, min^#(0(), y) -> c_2()
, max^#(x, 0()) -> c_4()
, max^#(0(), y) -> c_5()
, -^#(x, 0()) -> c_7() }

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

Strict DPs:
  { min^#(s(x), s(y)) -> c_3(min^#(x, y))
  , max^#(s(x), s(y)) -> c_6(max^#(x, y))
  , -^#(s(x), s(y)) -> c_8(-^#(x, y))
  , gcd^#(s(x), s(y)) ->
    c_9(gcd^#(-(s(max(x, y)), s(min(x, y))), s(min(x, y))),
        -^#(s(max(x, y)), s(min(x, y))),
        max^#(x, y),
        min^#(x, y),
        min^#(x, y)) }
Weak Trs:
  { min(x, 0()) -> 0()
  , min(0(), y) -> 0()
  , min(s(x), s(y)) -> s(min(x, y))
  , max(x, 0()) -> x
  , max(0(), y) -> y
  , max(s(x), s(y)) -> s(max(x, y))
  , -(x, 0()) -> x
  , -(s(x), s(y)) -> -(x, y)
  , gcd(s(x), s(y)) ->
    gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

We replace rewrite rules by usable rules:

  Weak Usable Rules:
    { min(x, 0()) -> 0()
    , min(0(), y) -> 0()
    , min(s(x), s(y)) -> s(min(x, y))
    , max(x, 0()) -> x
    , max(0(), y) -> y
    , max(s(x), s(y)) -> s(max(x, y))
    , -(x, 0()) -> x
    , -(s(x), s(y)) -> -(x, y) }

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

Strict DPs:
  { min^#(s(x), s(y)) -> c_3(min^#(x, y))
  , max^#(s(x), s(y)) -> c_6(max^#(x, y))
  , -^#(s(x), s(y)) -> c_8(-^#(x, y))
  , gcd^#(s(x), s(y)) ->
    c_9(gcd^#(-(s(max(x, y)), s(min(x, y))), s(min(x, y))),
        -^#(s(max(x, y)), s(min(x, y))),
        max^#(x, y),
        min^#(x, y),
        min^#(x, y)) }
Weak Trs:
  { min(x, 0()) -> 0()
  , min(0(), y) -> 0()
  , min(s(x), s(y)) -> s(min(x, y))
  , max(x, 0()) -> x
  , max(0(), y) -> y
  , max(s(x), s(y)) -> s(max(x, y))
  , -(x, 0()) -> x
  , -(s(x), s(y)) -> -(x, y) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..