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