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))
, +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, y)
, *(x, 0()) -> 0()
, *(x, s(y)) -> +(x, *(x, y))
, p(s(x)) -> x
, f(s(x), s(y)) ->
f(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y))) }
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(0(), y) -> 0()
, min(x, 0()) -> 0()
, min(s(x), s(y)) -> s(min(x, y))
, max(0(), y) -> y
, max(x, 0()) -> x
, max(s(x), s(y)) -> s(max(x, y))
, +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, y)
, *(x, 0()) -> 0()
, *(x, s(y)) -> +(x, *(x, y))
, p(s(x)) -> x
, f(s(x), s(y)) ->
f(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y))) }
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(0(), y) -> 0()
, min(x, 0()) -> 0()
, min(s(x), s(y)) -> s(min(x, y))
, max(0(), y) -> y
, max(x, 0()) -> x
, max(s(x), s(y)) -> s(max(x, y))
, +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, y)
, *(x, 0()) -> 0()
, *(x, s(y)) -> +(x, *(x, y))
, p(s(x)) -> x
, f(s(x), s(y)) ->
f(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y))) }
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(0(), y) -> 0()
, min(x, 0()) -> 0()
, min(s(x), s(y)) -> s(min(x, y))
, max(0(), y) -> y
, max(x, 0()) -> x
, max(s(x), s(y)) -> s(max(x, y))
, +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, y)
, *(x, 0()) -> 0()
, *(x, s(y)) -> +(x, *(x, y))
, p(s(x)) -> x
, f(s(x), s(y)) ->
f(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y))) }
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(0(), y) -> 0()
, min(x, 0()) -> 0()
, min(s(x), s(y)) -> s(min(x, y))
, max(0(), y) -> y
, max(x, 0()) -> x
, max(s(x), s(y)) -> s(max(x, y))
, +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, y)
, *(x, 0()) -> 0()
, *(x, s(y)) -> +(x, *(x, y))
, p(s(x)) -> x
, f(s(x), s(y)) ->
f(-(min(s(x), s(y)), max(s(x), s(y))), *(s(x), s(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..