LMPO
| Execution Time (secs) | 0.044 |
| Answer | MAYBE |
| Input | SK90 4.54 |
MAYBE
We consider the following Problem:
Strict Trs:
{g(f(x, y)) -> f(f(g(g(x)), g(g(y))), f(g(g(x)), g(g(y))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.067 |
| Answer | MAYBE |
| Input | SK90 4.54 |
MAYBE
We consider the following Problem:
Strict Trs:
{g(f(x, y)) -> f(f(g(g(x)), g(g(y))), f(g(g(x)), g(g(y))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.037 |
| Answer | MAYBE |
| Input | SK90 4.54 |
MAYBE
We consider the following Problem:
Strict Trs:
{g(f(x, y)) -> f(f(g(g(x)), g(g(y))), f(g(g(x)), g(g(y))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.036 |
| Answer | MAYBE |
| Input | SK90 4.54 |
MAYBE
We consider the following Problem:
Strict Trs:
{g(f(x, y)) -> f(f(g(g(x)), g(g(y))), f(g(g(x)), g(g(y))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.035 |
| Answer | MAYBE |
| Input | SK90 4.54 |
MAYBE
We consider the following Problem:
Strict Trs:
{g(f(x, y)) -> f(f(g(g(x)), g(g(y))), f(g(g(x)), g(g(y))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.055 |
| Answer | MAYBE |
| Input | SK90 4.54 |
MAYBE
We consider the following Problem:
Strict Trs:
{g(f(x, y)) -> f(f(g(g(x)), g(g(y))), f(g(g(x)), g(g(y))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..