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