LMPO
| Execution Time (secs) | 0.055 |
| Answer | MAYBE |
| Input | Der95 21 |
MAYBE
We consider the following Problem:
Strict Trs:
{ p(s(x)) -> x
, fact(0()) -> s(0())
, fact(s(x)) -> *(s(x), fact(p(s(x))))
, *(0(), y) -> 0()
, *(s(x), y) -> +(*(x, y), y)
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.050 |
| Answer | MAYBE |
| Input | Der95 21 |
MAYBE
We consider the following Problem:
Strict Trs:
{ p(s(x)) -> x
, fact(0()) -> s(0())
, fact(s(x)) -> *(s(x), fact(p(s(x))))
, *(0(), y) -> 0()
, *(s(x), y) -> +(*(x, y), y)
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.035 |
| Answer | MAYBE |
| Input | Der95 21 |
MAYBE
We consider the following Problem:
Strict Trs:
{ p(s(x)) -> x
, fact(0()) -> s(0())
, fact(s(x)) -> *(s(x), fact(p(s(x))))
, *(0(), y) -> 0()
, *(s(x), y) -> +(*(x, y), y)
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.046 |
| Answer | MAYBE |
| Input | Der95 21 |
MAYBE
We consider the following Problem:
Strict Trs:
{ p(s(x)) -> x
, fact(0()) -> s(0())
, fact(s(x)) -> *(s(x), fact(p(s(x))))
, *(0(), y) -> 0()
, *(s(x), y) -> +(*(x, y), y)
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.040 |
| Answer | MAYBE |
| Input | Der95 21 |
MAYBE
We consider the following Problem:
Strict Trs:
{ p(s(x)) -> x
, fact(0()) -> s(0())
, fact(s(x)) -> *(s(x), fact(p(s(x))))
, *(0(), y) -> 0()
, *(s(x), y) -> +(*(x, y), y)
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.040 |
| Answer | MAYBE |
| Input | Der95 21 |
MAYBE
We consider the following Problem:
Strict Trs:
{ p(s(x)) -> x
, fact(0()) -> s(0())
, fact(s(x)) -> *(s(x), fact(p(s(x))))
, *(0(), y) -> 0()
, *(s(x), y) -> +(*(x, y), y)
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..