LMPO
| Execution Time (secs) | 0.056 |
| Answer | MAYBE |
| Input | SK90 4.30 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(nil()) -> nil()
, f(.(nil(), y)) -> .(nil(), f(y))
, f(.(.(x, y), z)) -> f(.(x, .(y, z)))
, g(nil()) -> nil()
, g(.(x, nil())) -> .(g(x), nil())
, g(.(x, .(y, z))) -> g(.(.(x, y), z))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.096 |
| Answer | MAYBE |
| Input | SK90 4.30 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(nil()) -> nil()
, f(.(nil(), y)) -> .(nil(), f(y))
, f(.(.(x, y), z)) -> f(.(x, .(y, z)))
, g(nil()) -> nil()
, g(.(x, nil())) -> .(g(x), nil())
, g(.(x, .(y, z))) -> g(.(.(x, y), z))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.076 |
| Answer | MAYBE |
| Input | SK90 4.30 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(nil()) -> nil()
, f(.(nil(), y)) -> .(nil(), f(y))
, f(.(.(x, y), z)) -> f(.(x, .(y, z)))
, g(nil()) -> nil()
, g(.(x, nil())) -> .(g(x), nil())
, g(.(x, .(y, z))) -> g(.(.(x, y), z))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.054 |
| Answer | MAYBE |
| Input | SK90 4.30 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(nil()) -> nil()
, f(.(nil(), y)) -> .(nil(), f(y))
, f(.(.(x, y), z)) -> f(.(x, .(y, z)))
, g(nil()) -> nil()
, g(.(x, nil())) -> .(g(x), nil())
, g(.(x, .(y, z))) -> g(.(.(x, y), z))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.084 |
| Answer | MAYBE |
| Input | SK90 4.30 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(nil()) -> nil()
, f(.(nil(), y)) -> .(nil(), f(y))
, f(.(.(x, y), z)) -> f(.(x, .(y, z)))
, g(nil()) -> nil()
, g(.(x, nil())) -> .(g(x), nil())
, g(.(x, .(y, z))) -> g(.(.(x, y), z))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.070 |
| Answer | MAYBE |
| Input | SK90 4.30 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(nil()) -> nil()
, f(.(nil(), y)) -> .(nil(), f(y))
, f(.(.(x, y), z)) -> f(.(x, .(y, z)))
, g(nil()) -> nil()
, g(.(x, nil())) -> .(g(x), nil())
, g(.(x, .(y, z))) -> g(.(.(x, y), z))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..