LMPO
| Execution Time (secs) | 0.053 |
| Answer | YES(?,ELEMENTARY) |
| Input | SK90 4.05 |
YES(?,ELEMENTARY)
We consider the following Problem:
Strict Trs:
{ *(x, +(y, z)) -> +(*(x, y), *(x, z))
, *(+(x, y), z) -> +(*(x, z), *(y, z))
, *(x, 1()) -> x
, *(1(), y) -> y}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,ELEMENTARY)
Proof:
The input was oriented with the instance of
Lightweight Multiset Path Order () as induced by the safe mapping
safe(*) = {}, safe(+) = {1, 2}, safe(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:
{ *(x, +(; y, z);) -> +(; *(x, y;), *(x, z;))
, *(+(; x, y), z;) -> +(; *(x, z;), *(y, z;))
, *(x, 1();) -> x
, *(1(), y;) -> y}
Weak Trs : {}
Hurray, we answered YES(?,ELEMENTARY)
MPO
| Execution Time (secs) | 0.074 |
| Answer | YES(?,PRIMREC) |
| Input | SK90 4.05 |
YES(?,PRIMREC)
We consider the following Problem:
Strict Trs:
{ *(x, +(y, z)) -> +(*(x, y), *(x, z))
, *(+(x, y), z) -> +(*(x, z), *(y, z))
, *(x, 1()) -> x
, *(1(), y) -> y}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,PRIMREC)
Proof:
The input was oriented with the instance of
'multiset path orders' as induced by the precedence
* > + .
Hurray, we answered YES(?,PRIMREC)
POP*
| Execution Time (secs) | 0.046 |
| Answer | MAYBE |
| Input | SK90 4.05 |
MAYBE
We consider the following Problem:
Strict Trs:
{ *(x, +(y, z)) -> +(*(x, y), *(x, z))
, *(+(x, y), z) -> +(*(x, z), *(y, z))
, *(x, 1()) -> x
, *(1(), y) -> y}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.081 |
| Answer | MAYBE |
| Input | SK90 4.05 |
MAYBE
We consider the following Problem:
Strict Trs:
{ *(x, +(y, z)) -> +(*(x, y), *(x, z))
, *(+(x, y), z) -> +(*(x, z), *(y, z))
, *(x, 1()) -> x
, *(1(), y) -> y}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.051 |
| Answer | MAYBE |
| Input | SK90 4.05 |
MAYBE
We consider the following Problem:
Strict Trs:
{ *(x, +(y, z)) -> +(*(x, y), *(x, z))
, *(+(x, y), z) -> +(*(x, z), *(y, z))
, *(x, 1()) -> x
, *(1(), y) -> y}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.052 |
| Answer | MAYBE |
| Input | SK90 4.05 |
MAYBE
We consider the following Problem:
Strict Trs:
{ *(x, +(y, z)) -> +(*(x, y), *(x, z))
, *(+(x, y), z) -> +(*(x, z), *(y, z))
, *(x, 1()) -> x
, *(1(), y) -> y}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..