LMPO
Execution Time (secs) | 0.054 |
Answer | YES(?,ELEMENTARY) |
Input | SK90 2.22 |
YES(?,ELEMENTARY)
We consider the following Problem:
Strict Trs:
{ exp(x, 0()) -> s(0())
, exp(x, s(y)) -> *(x, exp(x, y))
, *(0(), y) -> 0()
, *(s(x), y) -> +(y, *(x, y))
, -(0(), y) -> 0()
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, 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(exp) = {}, safe(0) = {}, safe(s) = {1}, safe(*) = {2},
safe(+) = {1, 2}, safe(-) = {2}
and precedence
exp > * .
Following symbols are considered recursive:
{exp, *, -}
The recursion depth is 2 .
For your convenience, here are the oriented rules in predicative
notation (possibly applying argument filtering):
Strict DPs: {}
Weak DPs : {}
Strict Trs:
{ exp(x, 0();) -> s(; 0())
, exp(x, s(; y);) -> *(x; exp(x, y;))
, *(0(); y) -> 0()
, *(s(; x); y) -> +(; y, *(x; y))
, -(0(); y) -> 0()
, -(x; 0()) -> x
, -(s(; x); s(; y)) -> -(x; y)}
Weak Trs : {}
Hurray, we answered YES(?,ELEMENTARY)
MPO
Execution Time (secs) | 0.050 |
Answer | YES(?,PRIMREC) |
Input | SK90 2.22 |
YES(?,PRIMREC)
We consider the following Problem:
Strict Trs:
{ exp(x, 0()) -> s(0())
, exp(x, s(y)) -> *(x, exp(x, y))
, *(0(), y) -> 0()
, *(s(x), y) -> +(y, *(x, y))
, -(0(), y) -> 0()
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, 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
exp > s, exp > *, * > + .
Hurray, we answered YES(?,PRIMREC)
POP*
Execution Time (secs) | 0.052 |
Answer | YES(?,POLY) |
Input | SK90 2.22 |
YES(?,POLY)
We consider the following Problem:
Strict Trs:
{ exp(x, 0()) -> s(0())
, exp(x, s(y)) -> *(x, exp(x, y))
, *(0(), y) -> 0()
, *(s(x), y) -> +(y, *(x, y))
, -(0(), y) -> 0()
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,POLY)
Proof:
The input was oriented with the instance of
Polynomial Path Order () as induced by the safe mapping
safe(exp) = {}, safe(0) = {}, safe(s) = {1}, safe(*) = {2},
safe(+) = {1, 2}, safe(-) = {1}
and precedence
exp > * .
Following symbols are considered recursive:
{exp, *, -}
The recursion depth is 2 .
For your convenience, here are the oriented rules in predicative
notation (possibly applying argument filtering):
Strict DPs: {}
Weak DPs : {}
Strict Trs:
{ exp(x, 0();) -> s(; 0())
, exp(x, s(; y);) -> *(x; exp(x, y;))
, *(0(); y) -> 0()
, *(s(; x); y) -> +(; y, *(x; y))
, -(y; 0()) -> 0()
, -(0(); x) -> x
, -(s(; y); s(; x)) -> -(y; x)}
Weak Trs : {}
Hurray, we answered YES(?,POLY)
POP* (PS)
Execution Time (secs) | 0.043 |
Answer | YES(?,POLY) |
Input | SK90 2.22 |
YES(?,POLY)
We consider the following Problem:
Strict Trs:
{ exp(x, 0()) -> s(0())
, exp(x, s(y)) -> *(x, exp(x, y))
, *(0(), y) -> 0()
, *(s(x), y) -> +(y, *(x, y))
, -(0(), y) -> 0()
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, 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(exp) = {}, safe(0) = {}, safe(s) = {1}, safe(*) = {2},
safe(+) = {1, 2}, safe(-) = {1}
and precedence
exp > * .
Following symbols are considered recursive:
{exp, *, -}
The recursion depth is 2 .
For your convenience, here are the oriented rules in predicative
notation (possibly applying argument filtering):
Strict DPs: {}
Weak DPs : {}
Strict Trs:
{ exp(x, 0();) -> s(; 0())
, exp(x, s(; y);) -> *(x; exp(x, y;))
, *(0(); y) -> 0()
, *(s(; x); y) -> +(; y, *(x; y))
, -(y; 0()) -> 0()
, -(0(); x) -> x
, -(s(; y); s(; x)) -> -(y; x)}
Weak Trs : {}
Hurray, we answered YES(?,POLY)
Small POP*
Execution Time (secs) | 0.095 |
Answer | YES(?,O(n^2)) |
Input | SK90 2.22 |
YES(?,O(n^2))
We consider the following Problem:
Strict Trs:
{ exp(x, 0()) -> s(0())
, exp(x, s(y)) -> *(x, exp(x, y))
, *(0(), y) -> 0()
, *(s(x), y) -> +(y, *(x, y))
, -(0(), y) -> 0()
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,O(n^2))
Proof:
The input was oriented with the instance of
Small Polynomial Path Order (WSC) as induced by the safe mapping
safe(exp) = {}, safe(0) = {}, safe(s) = {1}, safe(*) = {2},
safe(+) = {1, 2}, safe(-) = {2}
and precedence
exp > * .
Following symbols are considered recursive:
{exp, *, -}
The recursion depth is 2 .
For your convenience, here are the oriented rules in predicative
notation (possibly applying argument filtering):
Strict DPs: {}
Weak DPs : {}
Strict Trs:
{ exp(x, 0();) -> s(; 0())
, exp(x, s(; y);) -> *(x; exp(x, y;))
, *(0(); y) -> 0()
, *(s(; x); y) -> +(; y, *(x; y))
, -(0(); y) -> 0()
, -(x; 0()) -> x
, -(s(; x); s(; y)) -> -(x; y)}
Weak Trs : {}
Hurray, we answered YES(?,O(n^2))
Small POP* (PS)
Execution Time (secs) | 0.086 |
Answer | YES(?,O(n^2)) |
Input | SK90 2.22 |
YES(?,O(n^2))
We consider the following Problem:
Strict Trs:
{ exp(x, 0()) -> s(0())
, exp(x, s(y)) -> *(x, exp(x, y))
, *(0(), y) -> 0()
, *(s(x), y) -> +(y, *(x, y))
, -(0(), y) -> 0()
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,O(n^2))
Proof:
The input was oriented with the instance of
Small Polynomial Path Order (WSC,
PS) as induced by the safe mapping
safe(exp) = {}, safe(0) = {}, safe(s) = {1}, safe(*) = {2},
safe(+) = {1, 2}, safe(-) = {2}
and precedence
exp > * .
Following symbols are considered recursive:
{exp, *, -}
The recursion depth is 2 .
For your convenience, here are the oriented rules in predicative
notation (possibly applying argument filtering):
Strict DPs: {}
Weak DPs : {}
Strict Trs:
{ exp(x, 0();) -> s(; 0())
, exp(x, s(; y);) -> *(x; exp(x, y;))
, *(0(); y) -> 0()
, *(s(; x); y) -> +(; y, *(x; y))
, -(0(); y) -> 0()
, -(x; 0()) -> x
, -(s(; x); s(; y)) -> -(x; y)}
Weak Trs : {}
Hurray, we answered YES(?,O(n^2))