LMPO
| Execution Time (secs) | 0.035 |
| Answer | MAYBE |
| Input | AG01 3.23 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), y) -> 0()
, f(s(x), y) -> f(f(x, y), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.032 |
| Answer | MAYBE |
| Input | AG01 3.23 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), y) -> 0()
, f(s(x), y) -> f(f(x, y), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.033 |
| Answer | MAYBE |
| Input | AG01 3.23 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), y) -> 0()
, f(s(x), y) -> f(f(x, y), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.029 |
| Answer | MAYBE |
| Input | AG01 3.23 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), y) -> 0()
, f(s(x), y) -> f(f(x, y), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.039 |
| Answer | MAYBE |
| Input | AG01 3.23 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), y) -> 0()
, f(s(x), y) -> f(f(x, y), 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 | AG01 3.23 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), y) -> 0()
, f(s(x), y) -> f(f(x, y), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..