LMPO
| Execution Time (secs) | 0.041 |
| Answer | MAYBE |
| Input | AG01 3.36 |
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
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.36 |
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.032 |
| Answer | MAYBE |
| Input | AG01 3.36 |
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.057 |
| Answer | MAYBE |
| Input | AG01 3.36 |
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.033 |
| Answer | MAYBE |
| Input | AG01 3.36 |
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.037 |
| Answer | MAYBE |
| Input | AG01 3.36 |
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..