LMPO
| Execution Time (secs) | 0.056 |
| Answer | MAYBE |
| Input | SK90 4.31 |
MAYBE
We consider the following Problem:
Strict Trs:
{ purge(nil()) -> nil()
, purge(.(x, y)) -> .(x, purge(remove(x, y)))
, remove(x, nil()) -> nil()
, remove(x, .(y, z)) ->
if(=(x, y), remove(x, z), .(y, remove(x, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.083 |
| Answer | MAYBE |
| Input | SK90 4.31 |
MAYBE
We consider the following Problem:
Strict Trs:
{ purge(nil()) -> nil()
, purge(.(x, y)) -> .(x, purge(remove(x, y)))
, remove(x, nil()) -> nil()
, remove(x, .(y, z)) ->
if(=(x, y), remove(x, z), .(y, remove(x, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.057 |
| Answer | MAYBE |
| Input | SK90 4.31 |
MAYBE
We consider the following Problem:
Strict Trs:
{ purge(nil()) -> nil()
, purge(.(x, y)) -> .(x, purge(remove(x, y)))
, remove(x, nil()) -> nil()
, remove(x, .(y, z)) ->
if(=(x, y), remove(x, z), .(y, remove(x, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.050 |
| Answer | MAYBE |
| Input | SK90 4.31 |
MAYBE
We consider the following Problem:
Strict Trs:
{ purge(nil()) -> nil()
, purge(.(x, y)) -> .(x, purge(remove(x, y)))
, remove(x, nil()) -> nil()
, remove(x, .(y, z)) ->
if(=(x, y), remove(x, z), .(y, remove(x, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.053 |
| Answer | MAYBE |
| Input | SK90 4.31 |
MAYBE
We consider the following Problem:
Strict Trs:
{ purge(nil()) -> nil()
, purge(.(x, y)) -> .(x, purge(remove(x, y)))
, remove(x, nil()) -> nil()
, remove(x, .(y, z)) ->
if(=(x, y), remove(x, z), .(y, remove(x, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.037 |
| Answer | MAYBE |
| Input | SK90 4.31 |
MAYBE
We consider the following Problem:
Strict Trs:
{ purge(nil()) -> nil()
, purge(.(x, y)) -> .(x, purge(remove(x, y)))
, remove(x, nil()) -> nil()
, remove(x, .(y, z)) ->
if(=(x, y), remove(x, z), .(y, remove(x, z)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..