LMPO
| Execution Time (secs) | 0.120 |
| Answer | MAYBE |
| Input | SK90 4.61 |
MAYBE
We consider the following Problem:
Strict Trs:
{ bsort(nil()) -> nil()
, bsort(.(x, y)) ->
last(.(bubble(.(x, y)), bsort(butlast(bubble(.(x, y))))))
, bubble(nil()) -> nil()
, bubble(.(x, nil())) -> .(x, nil())
, bubble(.(x, .(y, z))) ->
if(<=(x, y), .(y, bubble(.(x, z))), .(x, bubble(.(y, z))))
, last(nil()) -> 0()
, last(.(x, nil())) -> x
, last(.(x, .(y, z))) -> last(.(y, z))
, butlast(nil()) -> nil()
, butlast(.(x, nil())) -> nil()
, butlast(.(x, .(y, z))) -> .(x, butlast(.(y, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.153 |
| Answer | MAYBE |
| Input | SK90 4.61 |
MAYBE
We consider the following Problem:
Strict Trs:
{ bsort(nil()) -> nil()
, bsort(.(x, y)) ->
last(.(bubble(.(x, y)), bsort(butlast(bubble(.(x, y))))))
, bubble(nil()) -> nil()
, bubble(.(x, nil())) -> .(x, nil())
, bubble(.(x, .(y, z))) ->
if(<=(x, y), .(y, bubble(.(x, z))), .(x, bubble(.(y, z))))
, last(nil()) -> 0()
, last(.(x, nil())) -> x
, last(.(x, .(y, z))) -> last(.(y, z))
, butlast(nil()) -> nil()
, butlast(.(x, nil())) -> nil()
, butlast(.(x, .(y, z))) -> .(x, butlast(.(y, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.103 |
| Answer | MAYBE |
| Input | SK90 4.61 |
MAYBE
We consider the following Problem:
Strict Trs:
{ bsort(nil()) -> nil()
, bsort(.(x, y)) ->
last(.(bubble(.(x, y)), bsort(butlast(bubble(.(x, y))))))
, bubble(nil()) -> nil()
, bubble(.(x, nil())) -> .(x, nil())
, bubble(.(x, .(y, z))) ->
if(<=(x, y), .(y, bubble(.(x, z))), .(x, bubble(.(y, z))))
, last(nil()) -> 0()
, last(.(x, nil())) -> x
, last(.(x, .(y, z))) -> last(.(y, z))
, butlast(nil()) -> nil()
, butlast(.(x, nil())) -> nil()
, butlast(.(x, .(y, z))) -> .(x, butlast(.(y, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.104 |
| Answer | MAYBE |
| Input | SK90 4.61 |
MAYBE
We consider the following Problem:
Strict Trs:
{ bsort(nil()) -> nil()
, bsort(.(x, y)) ->
last(.(bubble(.(x, y)), bsort(butlast(bubble(.(x, y))))))
, bubble(nil()) -> nil()
, bubble(.(x, nil())) -> .(x, nil())
, bubble(.(x, .(y, z))) ->
if(<=(x, y), .(y, bubble(.(x, z))), .(x, bubble(.(y, z))))
, last(nil()) -> 0()
, last(.(x, nil())) -> x
, last(.(x, .(y, z))) -> last(.(y, z))
, butlast(nil()) -> nil()
, butlast(.(x, nil())) -> nil()
, butlast(.(x, .(y, z))) -> .(x, butlast(.(y, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.149 |
| Answer | MAYBE |
| Input | SK90 4.61 |
MAYBE
We consider the following Problem:
Strict Trs:
{ bsort(nil()) -> nil()
, bsort(.(x, y)) ->
last(.(bubble(.(x, y)), bsort(butlast(bubble(.(x, y))))))
, bubble(nil()) -> nil()
, bubble(.(x, nil())) -> .(x, nil())
, bubble(.(x, .(y, z))) ->
if(<=(x, y), .(y, bubble(.(x, z))), .(x, bubble(.(y, z))))
, last(nil()) -> 0()
, last(.(x, nil())) -> x
, last(.(x, .(y, z))) -> last(.(y, z))
, butlast(nil()) -> nil()
, butlast(.(x, nil())) -> nil()
, butlast(.(x, .(y, z))) -> .(x, butlast(.(y, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.091 |
| Answer | MAYBE |
| Input | SK90 4.61 |
MAYBE
We consider the following Problem:
Strict Trs:
{ bsort(nil()) -> nil()
, bsort(.(x, y)) ->
last(.(bubble(.(x, y)), bsort(butlast(bubble(.(x, y))))))
, bubble(nil()) -> nil()
, bubble(.(x, nil())) -> .(x, nil())
, bubble(.(x, .(y, z))) ->
if(<=(x, y), .(y, bubble(.(x, z))), .(x, bubble(.(y, z))))
, last(nil()) -> 0()
, last(.(x, nil())) -> x
, last(.(x, .(y, z))) -> last(.(y, z))
, butlast(nil()) -> nil()
, butlast(.(x, nil())) -> nil()
, butlast(.(x, .(y, z))) -> .(x, butlast(.(y, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..