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