LMPO
Execution Time (secs) | 0.075 |
Answer | MAYBE |
Input | SK90 4.59 |
MAYBE
We consider the following Problem:
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)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
Execution Time (secs) | 0.104 |
Answer | MAYBE |
Input | SK90 4.59 |
MAYBE
We consider the following Problem:
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)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
Execution Time (secs) | 0.063 |
Answer | MAYBE |
Input | SK90 4.59 |
MAYBE
We consider the following Problem:
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)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
Execution Time (secs) | 0.075 |
Answer | MAYBE |
Input | SK90 4.59 |
MAYBE
We consider the following Problem:
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)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
Execution Time (secs) | 0.077 |
Answer | MAYBE |
Input | SK90 4.59 |
MAYBE
We consider the following Problem:
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)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
Execution Time (secs) | 0.101 |
Answer | MAYBE |
Input | SK90 4.59 |
MAYBE
We consider the following Problem:
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)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..