interpretations
Execution Time (secs) | - |
Answer | YES(?,O(n^1)) |
Input | SK90 4.16 |
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs:
{ f(0()) -> s(0())
, f(s(0())) -> s(s(0()))
, f(s(0())) -> *(s(s(0())), f(0()))
, f(+(x, y)) -> *(f(x), f(y))
, f(+(x, s(0()))) -> +(s(s(0())), f(x)) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(f) = {}, Uargs(s) = {}, Uargs(*) = {1, 2}, Uargs(+) = {2}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[f](x1) = [3] x1 + [2]
[0] = [0]
[s](x1) = [1] x1 + [1]
[*](x1, x2) = [1] x1 + [1] x2 + [0]
[+](x1, x2) = [1] x1 + [1] x2 + [1]
This order satisfies following ordering constraints
[f(0())] = [2]
> [1]
= [s(0())]
[f(s(0()))] = [5]
> [2]
= [s(s(0()))]
[f(s(0()))] = [5]
> [4]
= [*(s(s(0())), f(0()))]
[f(+(x, y))] = [3] x + [3] y + [5]
> [3] x + [3] y + [4]
= [*(f(x), f(y))]
[f(+(x, s(0())))] = [3] x + [8]
> [3] x + [5]
= [+(s(s(0())), f(x))]
Hurray, we answered YES(?,O(n^1))
lmpo
Execution Time (secs) | - |
Answer | YES(?,ELEMENTARY) |
Input | SK90 4.16 |
YES(?,ELEMENTARY)
We are left with following problem, upon which TcT provides the
certificate YES(?,ELEMENTARY).
Strict Trs:
{ f(0()) -> s(0())
, f(s(0())) -> s(s(0()))
, f(s(0())) -> *(s(s(0())), f(0()))
, f(+(x, s(0()))) -> +(s(s(0())), f(x))
, f(+(x, y)) -> *(f(x), f(y)) }
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(f) = {}, safe(0) = {}, safe(s) = {1}, safe(*) = {1, 2},
safe(+) = {1, 2}
and precedence
empty .
Following symbols are considered recursive:
{f}
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:
{ f(0();) -> s(; 0())
, f(s(; 0());) -> s(; s(; 0()))
, f(s(; 0());) -> *(; s(; s(; 0())), f(0();))
, f(+(; x, s(; 0()));) -> +(; s(; s(; 0())), f(x;))
, f(+(; x, y);) -> *(; f(x;), f(y;)) }
Weak Trs :
Hurray, we answered YES(?,ELEMENTARY)
mpo
Execution Time (secs) | - |
Answer | YES(?,PRIMREC) |
Input | SK90 4.16 |
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ f(0()) -> s(0())
, f(s(0())) -> s(s(0()))
, f(s(0())) -> *(s(s(0())), f(0()))
, f(+(x, s(0()))) -> +(s(s(0())), f(x))
, f(+(x, y)) -> *(f(x), f(y)) }
Obligation:
innermost runtime complexity
Answer:
YES(?,PRIMREC)
The input was oriented with the instance of'multiset path orders'
as induced by the precedence
f > s, f > *, f > + .
Hurray, we answered YES(?,PRIMREC)
popstar
Execution Time (secs) | 0.121 |
Answer | MAYBE |
Input | SK90 4.16 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0()) -> s(0())
, f(s(0())) -> s(s(0()))
, f(s(0())) -> *(s(s(0())), f(0()))
, f(+(x, s(0()))) -> +(s(s(0())), f(x))
, f(+(x, y)) -> *(f(x), f(y)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.218 |
Answer | MAYBE |
Input | SK90 4.16 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0()) -> s(0())
, f(s(0())) -> s(s(0()))
, f(s(0())) -> *(s(s(0())), f(0()))
, f(+(x, s(0()))) -> +(s(s(0())), f(x))
, f(+(x, y)) -> *(f(x), f(y)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..