interpretations
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 4.59 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ qsort(nil()) -> nil()
, qsort(.(x, y)) ->
++(qsort(lowers(x, y)), .(x, qsort(greaters(x, y))))
, lowers(x, nil()) -> nil()
, lowers(x, .(y, z)) ->
if(<=(y, x), .(y, lowers(x, z)), lowers(x, z))
, greaters(x, nil()) -> nil()
, greaters(x, .(y, z)) ->
if(<=(y, x), greaters(x, z), .(y, greaters(x, 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 | SK90 4.59 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ qsort(nil()) -> nil()
, qsort(.(x, y)) ->
++(qsort(lowers(x, y)), .(x, qsort(greaters(x, y))))
, lowers(x, nil()) -> nil()
, lowers(x, .(y, z)) ->
if(<=(y, x), .(y, lowers(x, z)), lowers(x, z))
, greaters(x, nil()) -> nil()
, greaters(x, .(y, z)) ->
if(<=(y, x), greaters(x, z), .(y, greaters(x, z))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 4.59 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ qsort(nil()) -> nil()
, qsort(.(x, y)) ->
++(qsort(lowers(x, y)), .(x, qsort(greaters(x, y))))
, lowers(x, nil()) -> nil()
, lowers(x, .(y, z)) ->
if(<=(y, x), .(y, lowers(x, z)), lowers(x, z))
, greaters(x, nil()) -> nil()
, greaters(x, .(y, z)) ->
if(<=(y, x), greaters(x, z), .(y, greaters(x, z))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
Execution Time (secs) | 0.193 |
Answer | MAYBE |
Input | SK90 4.59 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ qsort(nil()) -> nil()
, qsort(.(x, y)) ->
++(qsort(lowers(x, y)), .(x, qsort(greaters(x, y))))
, lowers(x, nil()) -> nil()
, lowers(x, .(y, z)) ->
if(<=(y, x), .(y, lowers(x, z)), lowers(x, z))
, greaters(x, nil()) -> nil()
, greaters(x, .(y, z)) ->
if(<=(y, x), greaters(x, z), .(y, greaters(x, z))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.244 |
Answer | MAYBE |
Input | SK90 4.59 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ qsort(nil()) -> nil()
, qsort(.(x, y)) ->
++(qsort(lowers(x, y)), .(x, qsort(greaters(x, y))))
, lowers(x, nil()) -> nil()
, lowers(x, .(y, z)) ->
if(<=(y, x), .(y, lowers(x, z)), lowers(x, z))
, greaters(x, nil()) -> nil()
, greaters(x, .(y, z)) ->
if(<=(y, x), greaters(x, z), .(y, greaters(x, z))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..