interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
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(x, 0(), 0()) -> x
, gcd(x, s(y), s(z)) ->
gcd(x, -(max(y, z), min(y, z)), s(min(y, z)))
, gcd(0(), y, 0()) -> y
, gcd(0(), 0(), z) -> z
, gcd(s(x), y, s(z)) ->
gcd(-(max(x, z), min(x, z)), y, s(min(x, z)))
, gcd(s(x), s(y), z) ->
gcd(-(max(x, y), min(x, y)), s(min(x, y)), z) }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
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), z) ->
gcd(-(max(x, y), min(x, y)), s(min(x, y)), z)
, gcd(x, s(y), s(z)) ->
gcd(x, -(max(y, z), min(y, z)), s(min(y, z)))
, gcd(s(x), y, s(z)) ->
gcd(-(max(x, z), min(x, z)), y, s(min(x, z)))
, gcd(x, 0(), 0()) -> x
, gcd(0(), y, 0()) -> y
, gcd(0(), 0(), z) -> z }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
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), z) ->
gcd(-(max(x, y), min(x, y)), s(min(x, y)), z)
, gcd(x, s(y), s(z)) ->
gcd(x, -(max(y, z), min(y, z)), s(min(y, z)))
, gcd(s(x), y, s(z)) ->
gcd(-(max(x, z), min(x, z)), y, s(min(x, z)))
, gcd(x, 0(), 0()) -> x
, gcd(0(), y, 0()) -> y
, gcd(0(), 0(), z) -> z }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
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), z) ->
gcd(-(max(x, y), min(x, y)), s(min(x, y)), z)
, gcd(x, s(y), s(z)) ->
gcd(x, -(max(y, z), min(y, z)), s(min(y, z)))
, gcd(s(x), y, s(z)) ->
gcd(-(max(x, z), min(x, z)), y, s(min(x, z)))
, gcd(x, 0(), 0()) -> x
, gcd(0(), y, 0()) -> y
, gcd(0(), 0(), z) -> z }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
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), z) ->
gcd(-(max(x, y), min(x, y)), s(min(x, y)), z)
, gcd(x, s(y), s(z)) ->
gcd(x, -(max(y, z), min(y, z)), s(min(y, z)))
, gcd(s(x), y, s(z)) ->
gcd(-(max(x, z), min(x, z)), y, s(min(x, z)))
, gcd(x, 0(), 0()) -> x
, gcd(0(), y, 0()) -> y
, gcd(0(), 0(), z) -> z }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..