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