LMPO
| Execution Time (secs) | 0.022 |
| Answer | MAYBE |
| Input | Der95 27 |
MAYBE
We consider the following Problem:
Strict Trs:
{ h(f(x), y) -> f(g(x, y))
, g(x, y) -> h(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.028 |
| Answer | MAYBE |
| Input | Der95 27 |
MAYBE
We consider the following Problem:
Strict Trs:
{ h(f(x), y) -> f(g(x, y))
, g(x, y) -> h(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.026 |
| Answer | MAYBE |
| Input | Der95 27 |
MAYBE
We consider the following Problem:
Strict Trs:
{ h(f(x), y) -> f(g(x, y))
, g(x, y) -> h(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.026 |
| Answer | MAYBE |
| Input | Der95 27 |
MAYBE
We consider the following Problem:
Strict Trs:
{ h(f(x), y) -> f(g(x, y))
, g(x, y) -> h(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.023 |
| Answer | MAYBE |
| Input | Der95 27 |
MAYBE
We consider the following Problem:
Strict Trs:
{ h(f(x), y) -> f(g(x, y))
, g(x, y) -> h(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.022 |
| Answer | MAYBE |
| Input | Der95 27 |
MAYBE
We consider the following Problem:
Strict Trs:
{ h(f(x), y) -> f(g(x, y))
, g(x, y) -> h(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..