interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ minus(x, x) -> 0()
, minus(x, y) -> cond(min(x, y), x, y)
, cond(y, x, y) -> s(minus(x, s(y)))
, min(u, 0()) -> 0()
, min(0(), v) -> 0()
, min(s(u), s(v)) -> s(min(u, v)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix interpretation of dimension 3' failed due to the
following reason:
The input cannot be shown compatible
2) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
3) 'matrix interpretation of dimension 1' failed due to the
following reason:
The input cannot be shown compatible
4) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ minus(x, x) -> 0()
, minus(x, y) -> cond(min(x, y), x, y)
, cond(y, x, y) -> s(minus(x, s(y)))
, min(0(), v) -> 0()
, min(u, 0()) -> 0()
, min(s(u), s(v)) -> s(min(u, v)) }
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:
{ minus(x, x) -> 0()
, minus(x, y) -> cond(min(x, y), x, y)
, cond(y, x, y) -> s(minus(x, s(y)))
, min(0(), v) -> 0()
, min(u, 0()) -> 0()
, min(s(u), s(v)) -> s(min(u, v)) }
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:
{ minus(x, x) -> 0()
, minus(x, y) -> cond(min(x, y), x, y)
, cond(y, x, y) -> s(minus(x, s(y)))
, min(0(), v) -> 0()
, min(u, 0()) -> 0()
, min(s(u), s(v)) -> s(min(u, v)) }
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:
{ minus(x, x) -> 0()
, minus(x, y) -> cond(min(x, y), x, y)
, cond(y, x, y) -> s(minus(x, s(y)))
, min(0(), v) -> 0()
, min(u, 0()) -> 0()
, min(s(u), s(v)) -> s(min(u, v)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..