LMPO
Execution Time (secs) | 0.045 |
Answer | MAYBE |
Input | AG01 3.2 |
MAYBE
We consider the following Problem:
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
Execution Time (secs) | 0.040 |
Answer | MAYBE |
Input | AG01 3.2 |
MAYBE
We consider the following Problem:
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
Execution Time (secs) | 0.029 |
Answer | MAYBE |
Input | AG01 3.2 |
MAYBE
We consider the following Problem:
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
Execution Time (secs) | 0.037 |
Answer | MAYBE |
Input | AG01 3.2 |
MAYBE
We consider the following Problem:
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
Execution Time (secs) | 0.053 |
Answer | MAYBE |
Input | AG01 3.2 |
MAYBE
We consider the following Problem:
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
Execution Time (secs) | 0.039 |
Answer | MAYBE |
Input | AG01 3.2 |
MAYBE
We consider the following Problem:
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..