LMPO
| Execution Time (secs) | 0.050 |
| Answer | MAYBE |
| Input | AG01 3.18 |
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, double(0()) -> 0()
, double(s(x)) -> s(s(double(x)))
, plus(0(), y) -> y
, plus(s(x), y) -> s(plus(x, y))
, plus(s(x), y) -> plus(x, s(y))
, plus(s(x), y) -> s(plus(minus(x, y), double(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.051 |
| Answer | MAYBE |
| Input | AG01 3.18 |
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, double(0()) -> 0()
, double(s(x)) -> s(s(double(x)))
, plus(0(), y) -> y
, plus(s(x), y) -> s(plus(x, y))
, plus(s(x), y) -> plus(x, s(y))
, plus(s(x), y) -> s(plus(minus(x, y), double(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.048 |
| Answer | MAYBE |
| Input | AG01 3.18 |
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, double(0()) -> 0()
, double(s(x)) -> s(s(double(x)))
, plus(0(), y) -> y
, plus(s(x), y) -> s(plus(x, y))
, plus(s(x), y) -> plus(x, s(y))
, plus(s(x), y) -> s(plus(minus(x, y), double(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.045 |
| Answer | MAYBE |
| Input | AG01 3.18 |
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, double(0()) -> 0()
, double(s(x)) -> s(s(double(x)))
, plus(0(), y) -> y
, plus(s(x), y) -> s(plus(x, y))
, plus(s(x), y) -> plus(x, s(y))
, plus(s(x), y) -> s(plus(minus(x, y), double(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.059 |
| Answer | MAYBE |
| Input | AG01 3.18 |
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, double(0()) -> 0()
, double(s(x)) -> s(s(double(x)))
, plus(0(), y) -> y
, plus(s(x), y) -> s(plus(x, y))
, plus(s(x), y) -> plus(x, s(y))
, plus(s(x), y) -> s(plus(minus(x, y), double(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.059 |
| Answer | MAYBE |
| Input | AG01 3.18 |
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, double(0()) -> 0()
, double(s(x)) -> s(s(double(x)))
, plus(0(), y) -> y
, plus(s(x), y) -> s(plus(x, y))
, plus(s(x), y) -> plus(x, s(y))
, plus(s(x), y) -> s(plus(minus(x, y), double(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..