interpretations
Execution Time (secs) | - |
Answer | YES(?,O(n^1)) |
Input | SK90 2.11 |
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs:
{ +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, -(x, 0()) -> x
, -(0(), y) -> 0()
, -(s(x), s(y)) -> -(x, y) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(+) = {}, Uargs(s) = {1}, Uargs(-) = {}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[+](x1, x2) = [2] x1 + [1] x2 + [0]
[0] = [2]
[s](x1) = [1] x1 + [2]
[-](x1, x2) = [1] x1 + [1]
This order satisfies following ordering constraints
[+(0(), y)] = [1] y + [4]
> [1] y + [0]
= [y]
[+(s(x), y)] = [1] y + [2] x + [4]
> [1] y + [2] x + [2]
= [s(+(x, y))]
[-(x, 0())] = [1] x + [1]
> [1] x + [0]
= [x]
[-(0(), y)] = [3]
> [2]
= [0()]
[-(s(x), s(y))] = [1] x + [3]
> [1] x + [1]
= [-(x, y)]
Hurray, we answered YES(?,O(n^1))
lmpo
Execution Time (secs) | - |
Answer | YES(?,ELEMENTARY) |
Input | SK90 2.11 |
YES(?,ELEMENTARY)
We are left with following problem, upon which TcT provides the
certificate YES(?,ELEMENTARY).
Strict Trs:
{ +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, -(0(), y) -> 0()
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(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(+) = {}, safe(0) = {}, safe(s) = {1}, safe(-) = {}
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:
{ +(0(), y;) -> y
, +(s(; x), y;) -> s(; +(x, y;))
, -(0(), y;) -> 0()
, -(x, 0();) -> x
, -(s(; x), s(; y);) -> -(x, y;) }
Weak Trs :
Hurray, we answered YES(?,ELEMENTARY)
mpo
Execution Time (secs) | - |
Answer | YES(?,PRIMREC) |
Input | SK90 2.11 |
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, -(0(), y) -> 0()
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(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
+ > s .
Hurray, we answered YES(?,PRIMREC)
popstar
Execution Time (secs) | 0.111 |
Answer | YES(?,POLY) |
Input | SK90 2.11 |
YES(?,POLY)
We are left with following problem, upon which TcT provides the
certificate YES(?,POLY).
Strict Trs:
{ +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, -(0(), y) -> 0()
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(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(+) = {}, safe(0) = {}, safe(s) = {1}, safe(-) = {}
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:
{ +(0(), y;) -> y
, +(s(; x), y;) -> s(; +(x, y;))
, -(0(), y;) -> 0()
, -(x, 0();) -> x
, -(s(; x), s(; y);) -> -(x, y;) }
Weak Trs :
Hurray, we answered YES(?,POLY)
popstar-ps
Execution Time (secs) | 0.130 |
Answer | YES(?,POLY) |
Input | SK90 2.11 |
YES(?,POLY)
We are left with following problem, upon which TcT provides the
certificate YES(?,POLY).
Strict Trs:
{ +(0(), y) -> y
, +(s(x), y) -> s(+(x, y))
, -(0(), y) -> 0()
, -(x, 0()) -> x
, -(s(x), s(y)) -> -(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(+) = {2}, safe(0) = {}, safe(s) = {1}, safe(-) = {}
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:
{ +(0(); y) -> y
, +(s(; x); y) -> s(; +(x; y))
, -(0(), y;) -> 0()
, -(x, 0();) -> x
, -(s(; x), s(; y);) -> -(x, y;) }
Weak Trs :
Hurray, we answered YES(?,POLY)