interpretations
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs:
{ f(X) -> g(n__h(n__f(X)))
, f(X) -> n__f(X)
, h(X) -> n__h(X)
, activate(X) -> X
, activate(n__h(X)) -> h(activate(X))
, activate(n__f(X)) -> f(activate(X)) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(f) = {1}, Uargs(g) = {}, Uargs(n__h) = {}, Uargs(n__f) = {},
Uargs(h) = {1}, Uargs(activate) = {}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[f](x1) = [1] x1 + [3]
[g](x1) = [0]
[n__h](x1) = [1] x1 + [2]
[n__f](x1) = [1] x1 + [2]
[h](x1) = [1] x1 + [3]
[activate](x1) = [2] x1 + [1]
This order satisfies following ordering constraints
[f(X)] = [1] X + [3]
> [0]
= [g(n__h(n__f(X)))]
[f(X)] = [1] X + [3]
> [1] X + [2]
= [n__f(X)]
[h(X)] = [1] X + [3]
> [1] X + [2]
= [n__h(X)]
[activate(X)] = [2] X + [1]
> [1] X + [0]
= [X]
[activate(n__h(X))] = [2] X + [5]
> [2] X + [4]
= [h(activate(X))]
[activate(n__f(X))] = [2] X + [5]
> [2] X + [4]
= [f(activate(X))]
Hurray, we answered YES(?,O(n^1))
lmpo
YES(?,ELEMENTARY)
We are left with following problem, upon which TcT provides the
certificate YES(?,ELEMENTARY).
Strict Trs:
{ f(X) -> g(n__h(n__f(X)))
, h(X) -> n__h(X)
, f(X) -> n__f(X)
, activate(n__h(X)) -> h(activate(X))
, activate(n__f(X)) -> f(activate(X))
, activate(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(f) = {1}, safe(g) = {1}, safe(n__h) = {1}, safe(n__f) = {1},
safe(h) = {1}, safe(activate) = {}
and precedence
activate > f, activate > h .
Following symbols are considered recursive:
{f, h, activate}
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:
{ f(; X) -> g(; n__h(; n__f(; X)))
, h(; X) -> n__h(; X)
, f(; X) -> n__f(; X)
, activate(n__h(; X);) -> h(; activate(X;))
, activate(n__f(; X);) -> f(; activate(X;))
, activate(X;) -> X }
Weak Trs :
Hurray, we answered YES(?,ELEMENTARY)
mpo
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ f(X) -> g(n__h(n__f(X)))
, h(X) -> n__h(X)
, f(X) -> n__f(X)
, activate(n__h(X)) -> h(activate(X))
, activate(n__f(X)) -> f(activate(X))
, activate(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
f > g, f > n__h, f > n__f, h > n__h, activate > f, activate > h .
Hurray, we answered YES(?,PRIMREC)
popstar
YES(?,POLY)
We are left with following problem, upon which TcT provides the
certificate YES(?,POLY).
Strict Trs:
{ f(X) -> g(n__h(n__f(X)))
, h(X) -> n__h(X)
, f(X) -> n__f(X)
, activate(n__h(X)) -> h(activate(X))
, activate(n__f(X)) -> f(activate(X))
, activate(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(f) = {1}, safe(g) = {1}, safe(n__h) = {1}, safe(n__f) = {1},
safe(h) = {1}, safe(activate) = {}
and precedence
activate > f, activate > h .
Following symbols are considered recursive:
{f, h, activate}
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:
{ f(; X) -> g(; n__h(; n__f(; X)))
, h(; X) -> n__h(; X)
, f(; X) -> n__f(; X)
, activate(n__h(; X);) -> h(; activate(X;))
, activate(n__f(; X);) -> f(; activate(X;))
, activate(X;) -> X }
Weak Trs :
Hurray, we answered YES(?,POLY)
popstar-ps
YES(?,POLY)
We are left with following problem, upon which TcT provides the
certificate YES(?,POLY).
Strict Trs:
{ f(X) -> g(n__h(n__f(X)))
, h(X) -> n__h(X)
, f(X) -> n__f(X)
, activate(n__h(X)) -> h(activate(X))
, activate(n__f(X)) -> f(activate(X))
, activate(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(f) = {1}, safe(g) = {1}, safe(n__h) = {1}, safe(n__f) = {1},
safe(h) = {1}, safe(activate) = {}
and precedence
activate > f, activate > h .
Following symbols are considered recursive:
{f, h, activate}
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:
{ f(; X) -> g(; n__h(; n__f(; X)))
, h(; X) -> n__h(; X)
, f(; X) -> n__f(; X)
, activate(n__h(; X);) -> h(; activate(X;))
, activate(n__f(; X);) -> f(; activate(X;))
, activate(X;) -> X }
Weak Trs :
Hurray, we answered YES(?,POLY)