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