MAYBE

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

Strict Trs:
  { le(0(), y) -> true()
  , le(s(x), 0()) -> false()
  , le(s(x), s(y)) -> le(x, y)
  , minus(x, 0()) -> x
  , minus(s(x), s(y)) -> minus(x, y)
  , gcd(0(), y) -> y
  , gcd(s(x), 0()) -> s(x)
  , gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y))
  , if_gcd(true(), s(x), s(y)) -> gcd(minus(x, y), s(y))
  , if_gcd(false(), s(x), s(y)) -> gcd(minus(y, x), s(x)) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

We add following dependency tuples:

Strict DPs:
  { le^#(0(), y) -> c_1()
  , le^#(s(x), 0()) -> c_2()
  , le^#(s(x), s(y)) -> c_3(le^#(x, y))
  , minus^#(x, 0()) -> c_4()
  , minus^#(s(x), s(y)) -> c_5(minus^#(x, y))
  , gcd^#(0(), y) -> c_6()
  , gcd^#(s(x), 0()) -> c_7()
  , gcd^#(s(x), s(y)) ->
    c_8(if_gcd^#(le(y, x), s(x), s(y)), le^#(y, x))
  , if_gcd^#(true(), s(x), s(y)) ->
    c_9(gcd^#(minus(x, y), s(y)), minus^#(x, y))
  , if_gcd^#(false(), s(x), s(y)) ->
    c_10(gcd^#(minus(y, x), s(x)), minus^#(y, x)) }

and mark the set of starting terms.

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

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

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

  DPs:
    { 1: le^#(0(), y) -> c_1()
    , 2: le^#(s(x), 0()) -> c_2()
    , 3: le^#(s(x), s(y)) -> c_3(le^#(x, y))
    , 4: minus^#(x, 0()) -> c_4()
    , 5: minus^#(s(x), s(y)) -> c_5(minus^#(x, y))
    , 6: gcd^#(0(), y) -> c_6()
    , 7: gcd^#(s(x), 0()) -> c_7()
    , 8: gcd^#(s(x), s(y)) ->
         c_8(if_gcd^#(le(y, x), s(x), s(y)), le^#(y, x))
    , 9: if_gcd^#(true(), s(x), s(y)) ->
         c_9(gcd^#(minus(x, y), s(y)), minus^#(x, y))
    , 10: if_gcd^#(false(), s(x), s(y)) ->
          c_10(gcd^#(minus(y, x), s(x)), minus^#(y, x)) }

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

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

{ le^#(0(), y) -> c_1()
, le^#(s(x), 0()) -> c_2()
, minus^#(x, 0()) -> c_4()
, gcd^#(0(), y) -> c_6()
, gcd^#(s(x), 0()) -> c_7() }

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

Strict DPs:
  { le^#(s(x), s(y)) -> c_3(le^#(x, y))
  , minus^#(s(x), s(y)) -> c_5(minus^#(x, y))
  , gcd^#(s(x), s(y)) ->
    c_8(if_gcd^#(le(y, x), s(x), s(y)), le^#(y, x))
  , if_gcd^#(true(), s(x), s(y)) ->
    c_9(gcd^#(minus(x, y), s(y)), minus^#(x, y))
  , if_gcd^#(false(), s(x), s(y)) ->
    c_10(gcd^#(minus(y, x), s(x)), minus^#(y, x)) }
Weak Trs:
  { le(0(), y) -> true()
  , le(s(x), 0()) -> false()
  , le(s(x), s(y)) -> le(x, y)
  , minus(x, 0()) -> x
  , minus(s(x), s(y)) -> minus(x, y)
  , gcd(0(), y) -> y
  , gcd(s(x), 0()) -> s(x)
  , gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y))
  , if_gcd(true(), s(x), s(y)) -> gcd(minus(x, y), s(y))
  , if_gcd(false(), s(x), s(y)) -> gcd(minus(y, x), s(x)) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

We replace rewrite rules by usable rules:

  Weak Usable Rules:
    { le(0(), y) -> true()
    , le(s(x), 0()) -> false()
    , le(s(x), s(y)) -> le(x, y)
    , minus(x, 0()) -> x
    , minus(s(x), s(y)) -> minus(x, y) }

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

Strict DPs:
  { le^#(s(x), s(y)) -> c_3(le^#(x, y))
  , minus^#(s(x), s(y)) -> c_5(minus^#(x, y))
  , gcd^#(s(x), s(y)) ->
    c_8(if_gcd^#(le(y, x), s(x), s(y)), le^#(y, x))
  , if_gcd^#(true(), s(x), s(y)) ->
    c_9(gcd^#(minus(x, y), s(y)), minus^#(x, y))
  , if_gcd^#(false(), s(x), s(y)) ->
    c_10(gcd^#(minus(y, x), s(x)), minus^#(y, x)) }
Weak Trs:
  { le(0(), y) -> true()
  , le(s(x), 0()) -> false()
  , le(s(x), s(y)) -> le(x, y)
  , minus(x, 0()) -> x
  , minus(s(x), s(y)) -> minus(x, y) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..