LMPO
| Execution Time (secs) | 0.066 |
| Answer | MAYBE |
| Input | TCT 09 ma8 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), n) -> g(0(), n)
, f(m, 0()) -> g(m, 0())
, f(s(m), s(n)) -> h(m, n, f(m, p(m, n)), f(s(m), n))
, g(n, m) -> bot()
, p(m, n) -> bot()
, h(k, l, m, n) -> bot()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.112 |
| Answer | MAYBE |
| Input | TCT 09 ma8 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), n) -> g(0(), n)
, f(m, 0()) -> g(m, 0())
, f(s(m), s(n)) -> h(m, n, f(m, p(m, n)), f(s(m), n))
, g(n, m) -> bot()
, p(m, n) -> bot()
, h(k, l, m, n) -> bot()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.042 |
| Answer | MAYBE |
| Input | TCT 09 ma8 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), n) -> g(0(), n)
, f(m, 0()) -> g(m, 0())
, f(s(m), s(n)) -> h(m, n, f(m, p(m, n)), f(s(m), n))
, g(n, m) -> bot()
, p(m, n) -> bot()
, h(k, l, m, n) -> bot()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.051 |
| Answer | MAYBE |
| Input | TCT 09 ma8 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), n) -> g(0(), n)
, f(m, 0()) -> g(m, 0())
, f(s(m), s(n)) -> h(m, n, f(m, p(m, n)), f(s(m), n))
, g(n, m) -> bot()
, p(m, n) -> bot()
, h(k, l, m, n) -> bot()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.073 |
| Answer | MAYBE |
| Input | TCT 09 ma8 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), n) -> g(0(), n)
, f(m, 0()) -> g(m, 0())
, f(s(m), s(n)) -> h(m, n, f(m, p(m, n)), f(s(m), n))
, g(n, m) -> bot()
, p(m, n) -> bot()
, h(k, l, m, n) -> bot()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.051 |
| Answer | MAYBE |
| Input | TCT 09 ma8 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), n) -> g(0(), n)
, f(m, 0()) -> g(m, 0())
, f(s(m), s(n)) -> h(m, n, f(m, p(m, n)), f(s(m), n))
, g(n, m) -> bot()
, p(m, n) -> bot()
, h(k, l, m, n) -> bot()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..