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