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