LMPO
| Execution Time (secs) | 0.031 |
| Answer | MAYBE |
| Input | SK90 2.09 |
MAYBE
We consider the following Problem:
Strict Trs:
{ +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, +(s(x), y) -> +(x, s(y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.028 |
| Answer | MAYBE |
| Input | SK90 2.09 |
MAYBE
We consider the following Problem:
Strict Trs:
{ +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, +(s(x), y) -> +(x, s(y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.032 |
| Answer | MAYBE |
| Input | SK90 2.09 |
MAYBE
We consider the following Problem:
Strict Trs:
{ +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, +(s(x), y) -> +(x, s(y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.042 |
| Answer | YES(?,POLY) |
| Input | SK90 2.09 |
YES(?,POLY)
We consider the following Problem:
Strict Trs:
{ +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, +(s(x), y) -> +(x, s(y))}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,POLY)
Proof:
The input was oriented with the instance of
Polynomial Path Order (PS) as induced by the safe mapping
safe(+) = {2}, safe(0) = {}, safe(s) = {1}
and precedence
empty .
Following symbols are considered recursive:
{+}
The recursion depth is 1 .
For your convenience, here are the oriented rules in predicative
notation (possibly applying argument filtering):
Strict DPs: {}
Weak DPs : {}
Strict Trs:
{ +(0(); y) -> y
, +(s(; x); y) -> s(; +(x; y))
, +(s(; x); y) -> +(x; s(; y))}
Weak Trs : {}
Hurray, we answered YES(?,POLY)
Small POP*
| Execution Time (secs) | 0.032 |
| Answer | MAYBE |
| Input | SK90 2.09 |
MAYBE
We consider the following Problem:
Strict Trs:
{ +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, +(s(x), y) -> +(x, s(y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.041 |
| Answer | YES(?,O(n^1)) |
| Input | SK90 2.09 |
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{ +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, +(s(x), y) -> +(x, s(y))}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,O(n^1))
Proof:
The input was oriented with the instance of
Small Polynomial Path Order (WSC,
PS) as induced by the safe mapping
safe(+) = {2}, safe(0) = {}, safe(s) = {1}
and precedence
empty .
Following symbols are considered recursive:
{+}
The recursion depth is 1 .
For your convenience, here are the oriented rules in predicative
notation (possibly applying argument filtering):
Strict DPs: {}
Weak DPs : {}
Strict Trs:
{ +(0(); y) -> y
, +(s(; x); y) -> s(; +(x; y))
, +(s(; x); y) -> +(x; s(; y))}
Weak Trs : {}
Hurray, we answered YES(?,O(n^1))