interpretations
Execution Time (secs) | - |
Answer | YES(?,O(n^1)) |
Input | SK90 2.17 |
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs:
{ sum(0()) -> 0()
, sum(s(x)) -> +(sum(x), s(x))
, sum1(0()) -> 0()
, sum1(s(x)) -> s(+(sum1(x), +(x, x))) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(sum) = {}, Uargs(s) = {1}, Uargs(+) = {1}, Uargs(sum1) = {}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[sum](x1) = [2] x1 + [0]
[0] = [2]
[s](x1) = [1] x1 + [2]
[+](x1, x2) = [1] x1 + [0]
[sum1](x1) = [2] x1 + [0]
This order satisfies following ordering constraints
[sum(0())] = [4]
> [2]
= [0()]
[sum(s(x))] = [2] x + [4]
> [2] x + [0]
= [+(sum(x), s(x))]
[sum1(0())] = [4]
> [2]
= [0()]
[sum1(s(x))] = [2] x + [4]
> [2] x + [2]
= [s(+(sum1(x), +(x, x)))]
Hurray, we answered YES(?,O(n^1))
lmpo
Execution Time (secs) | - |
Answer | YES(?,ELEMENTARY) |
Input | SK90 2.17 |
YES(?,ELEMENTARY)
We are left with following problem, upon which TcT provides the
certificate YES(?,ELEMENTARY).
Strict Trs:
{ sum(0()) -> 0()
, sum(s(x)) -> +(sum(x), s(x))
, sum1(0()) -> 0()
, sum1(s(x)) -> s(+(sum1(x), +(x, x))) }
Obligation:
innermost runtime complexity
Answer:
YES(?,ELEMENTARY)
The input was oriented with the instance of 'Lightweight Multiset
Path Order' as induced by the safe mapping
safe(sum) = {}, safe(0) = {}, safe(s) = {1}, safe(+) = {1, 2},
safe(sum1) = {}
and precedence
empty .
Following symbols are considered recursive:
{sum, sum1}
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:
{ sum(0();) -> 0()
, sum(s(; x);) -> +(; sum(x;), s(; x))
, sum1(0();) -> 0()
, sum1(s(; x);) -> s(; +(; sum1(x;), +(; x, x))) }
Weak Trs :
Hurray, we answered YES(?,ELEMENTARY)
mpo
Execution Time (secs) | - |
Answer | YES(?,PRIMREC) |
Input | SK90 2.17 |
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ sum(0()) -> 0()
, sum(s(x)) -> +(sum(x), s(x))
, sum1(0()) -> 0()
, sum1(s(x)) -> s(+(sum1(x), +(x, x))) }
Obligation:
innermost runtime complexity
Answer:
YES(?,PRIMREC)
The input was oriented with the instance of'multiset path orders'
as induced by the precedence
sum > +, sum1 > s, sum1 > + .
Hurray, we answered YES(?,PRIMREC)
popstar
Execution Time (secs) | 0.138 |
Answer | YES(?,POLY) |
Input | SK90 2.17 |
YES(?,POLY)
We are left with following problem, upon which TcT provides the
certificate YES(?,POLY).
Strict Trs:
{ sum(0()) -> 0()
, sum(s(x)) -> +(sum(x), s(x))
, sum1(0()) -> 0()
, sum1(s(x)) -> s(+(sum1(x), +(x, x))) }
Obligation:
innermost runtime complexity
Answer:
YES(?,POLY)
The input was oriented with the instance of 'Polynomial Path Order'
as induced by the safe mapping
safe(sum) = {}, safe(0) = {}, safe(s) = {1}, safe(+) = {1, 2},
safe(sum1) = {}
and precedence
empty .
Following symbols are considered recursive:
{sum, sum1}
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:
{ sum(0();) -> 0()
, sum(s(; x);) -> +(; sum(x;), s(; x))
, sum1(0();) -> 0()
, sum1(s(; x);) -> s(; +(; sum1(x;), +(; x, x))) }
Weak Trs :
Hurray, we answered YES(?,POLY)
popstar-ps
Execution Time (secs) | 0.160 |
Answer | YES(?,POLY) |
Input | SK90 2.17 |
YES(?,POLY)
We are left with following problem, upon which TcT provides the
certificate YES(?,POLY).
Strict Trs:
{ sum(0()) -> 0()
, sum(s(x)) -> +(sum(x), s(x))
, sum1(0()) -> 0()
, sum1(s(x)) -> s(+(sum1(x), +(x, x))) }
Obligation:
innermost runtime complexity
Answer:
YES(?,POLY)
The input was oriented with the instance of 'Polynomial Path Order
(PS)' as induced by the safe mapping
safe(sum) = {}, safe(0) = {}, safe(s) = {1}, safe(+) = {1, 2},
safe(sum1) = {}
and precedence
empty .
Following symbols are considered recursive:
{sum, sum1}
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:
{ sum(0();) -> 0()
, sum(s(; x);) -> +(; sum(x;), s(; x))
, sum1(0();) -> 0()
, sum1(s(; x);) -> s(; +(; sum1(x;), +(; x, x))) }
Weak Trs :
Hurray, we answered YES(?,POLY)