interpretations
| Execution Time (secs) | - |
| Answer | MAYBE |
| Input | Der95 32 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ sort(nil()) -> nil()
, sort(cons(x, y)) -> insert(x, sort(y))
, insert(x, nil()) -> cons(x, nil())
, insert(x, cons(v, w)) -> choose(x, cons(v, w), x, v)
, choose(x, cons(v, w), y, 0()) -> cons(x, cons(v, w))
, choose(x, cons(v, w), 0(), s(z)) -> cons(v, insert(x, w))
, choose(x, cons(v, w), s(y), s(z)) ->
choose(x, cons(v, w), y, z) }
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 | Der95 32 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ sort(nil()) -> nil()
, sort(cons(x, y)) -> insert(x, sort(y))
, insert(x, nil()) -> cons(x, nil())
, insert(x, cons(v, w)) -> choose(x, cons(v, w), x, v)
, choose(x, cons(v, w), y, 0()) -> cons(x, cons(v, w))
, choose(x, cons(v, w), 0(), s(z)) -> cons(v, insert(x, w))
, choose(x, cons(v, w), s(y), s(z)) ->
choose(x, cons(v, w), y, z) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
| Execution Time (secs) | - |
| Answer | MAYBE |
| Input | Der95 32 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ sort(nil()) -> nil()
, sort(cons(x, y)) -> insert(x, sort(y))
, insert(x, nil()) -> cons(x, nil())
, insert(x, cons(v, w)) -> choose(x, cons(v, w), x, v)
, choose(x, cons(v, w), y, 0()) -> cons(x, cons(v, w))
, choose(x, cons(v, w), 0(), s(z)) -> cons(v, insert(x, w))
, choose(x, cons(v, w), s(y), s(z)) ->
choose(x, cons(v, w), y, z) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
| Execution Time (secs) | 0.401 |
| Answer | MAYBE |
| Input | Der95 32 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ sort(nil()) -> nil()
, sort(cons(x, y)) -> insert(x, sort(y))
, insert(x, nil()) -> cons(x, nil())
, insert(x, cons(v, w)) -> choose(x, cons(v, w), x, v)
, choose(x, cons(v, w), y, 0()) -> cons(x, cons(v, w))
, choose(x, cons(v, w), 0(), s(z)) -> cons(v, insert(x, w))
, choose(x, cons(v, w), s(y), s(z)) ->
choose(x, cons(v, w), y, z) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
| Execution Time (secs) | 0.322 |
| Answer | MAYBE |
| Input | Der95 32 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ sort(nil()) -> nil()
, sort(cons(x, y)) -> insert(x, sort(y))
, insert(x, nil()) -> cons(x, nil())
, insert(x, cons(v, w)) -> choose(x, cons(v, w), x, v)
, choose(x, cons(v, w), y, 0()) -> cons(x, cons(v, w))
, choose(x, cons(v, w), 0(), s(z)) -> cons(v, insert(x, w))
, choose(x, cons(v, w), s(y), s(z)) ->
choose(x, cons(v, w), y, z) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..