interpretations
Execution Time (secs) | - |
Answer | MAYBE |
Input | AG01 3.2 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ pred(s(x)) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, minus(x, 0()) -> x
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
, quot(0(), s(y)) -> 0() }
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) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
4) 'matrix interpretation of dimension 1' failed due to the
following reason:
The input cannot be shown compatible
Arrrr..
lmpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | AG01 3.2 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | AG01 3.2 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
Execution Time (secs) | 0.144 |
Answer | MAYBE |
Input | AG01 3.2 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.128 |
Answer | MAYBE |
Input | AG01 3.2 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..