LMPO
| Execution Time (secs) | 0.029 |
| Answer | MAYBE |
| Input | AG01 3.31 |
MAYBE
We consider the following Problem:
Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.042 |
| Answer | MAYBE |
| Input | AG01 3.31 |
MAYBE
We consider the following Problem:
Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.019 |
| Answer | MAYBE |
| Input | AG01 3.31 |
MAYBE
We consider the following Problem:
Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.023 |
| Answer | MAYBE |
| Input | AG01 3.31 |
MAYBE
We consider the following Problem:
Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.031 |
| Answer | MAYBE |
| Input | AG01 3.31 |
MAYBE
We consider the following Problem:
Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.024 |
| Answer | MAYBE |
| Input | AG01 3.31 |
MAYBE
We consider the following Problem:
Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..