LMPO
| Execution Time (secs) | 0.063 |
| Answer | MAYBE |
| Input | SK90 4.60 |
MAYBE
We consider the following Problem:
Strict Trs:
{ msort(nil()) -> nil()
, msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
, min(x, nil()) -> x
, min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
, del(x, nil()) -> nil()
, del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.094 |
| Answer | MAYBE |
| Input | SK90 4.60 |
MAYBE
We consider the following Problem:
Strict Trs:
{ msort(nil()) -> nil()
, msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
, min(x, nil()) -> x
, min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
, del(x, nil()) -> nil()
, del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.123 |
| Answer | MAYBE |
| Input | SK90 4.60 |
MAYBE
We consider the following Problem:
Strict Trs:
{ msort(nil()) -> nil()
, msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
, min(x, nil()) -> x
, min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
, del(x, nil()) -> nil()
, del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.110 |
| Answer | MAYBE |
| Input | SK90 4.60 |
MAYBE
We consider the following Problem:
Strict Trs:
{ msort(nil()) -> nil()
, msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
, min(x, nil()) -> x
, min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
, del(x, nil()) -> nil()
, del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.076 |
| Answer | MAYBE |
| Input | SK90 4.60 |
MAYBE
We consider the following Problem:
Strict Trs:
{ msort(nil()) -> nil()
, msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
, min(x, nil()) -> x
, min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
, del(x, nil()) -> nil()
, del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.069 |
| Answer | MAYBE |
| Input | SK90 4.60 |
MAYBE
We consider the following Problem:
Strict Trs:
{ msort(nil()) -> nil()
, msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
, min(x, nil()) -> x
, min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
, del(x, nil()) -> nil()
, del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..