LMPO
Execution Time (secs) | 0.036 |
Answer | MAYBE |
Input | SK90 4.12 |
MAYBE
We consider the following Problem:
Strict Trs:
{ +(0(), y) -> y
, +(s(x), 0()) -> s(x)
, +(s(x), s(y)) -> s(+(s(x), +(y, 0())))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
Execution Time (secs) | 0.042 |
Answer | MAYBE |
Input | SK90 4.12 |
MAYBE
We consider the following Problem:
Strict Trs:
{ +(0(), y) -> y
, +(s(x), 0()) -> s(x)
, +(s(x), s(y)) -> s(+(s(x), +(y, 0())))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
Execution Time (secs) | 0.034 |
Answer | MAYBE |
Input | SK90 4.12 |
MAYBE
We consider the following Problem:
Strict Trs:
{ +(0(), y) -> y
, +(s(x), 0()) -> s(x)
, +(s(x), s(y)) -> s(+(s(x), +(y, 0())))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
Execution Time (secs) | 0.064 |
Answer | MAYBE |
Input | SK90 4.12 |
MAYBE
We consider the following Problem:
Strict Trs:
{ +(0(), y) -> y
, +(s(x), 0()) -> s(x)
, +(s(x), s(y)) -> s(+(s(x), +(y, 0())))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
Execution Time (secs) | 0.056 |
Answer | MAYBE |
Input | SK90 4.12 |
MAYBE
We consider the following Problem:
Strict Trs:
{ +(0(), y) -> y
, +(s(x), 0()) -> s(x)
, +(s(x), s(y)) -> s(+(s(x), +(y, 0())))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
Execution Time (secs) | 0.047 |
Answer | MAYBE |
Input | SK90 4.12 |
MAYBE
We consider the following Problem:
Strict Trs:
{ +(0(), y) -> y
, +(s(x), 0()) -> s(x)
, +(s(x), s(y)) -> s(+(s(x), +(y, 0())))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..