interpretations
Execution Time (secs) | - |
Answer | YES(?,O(n^1)) |
Input | SK90 4.12 |
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), 0()) -> s(x)
, +(s(x), s(y)) -> s(+(s(x), +(y, 0()))) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(+) = {2}, Uargs(s) = {1}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[+](x1, x2) = [1] x1 + [3] x2 + [1]
[0] = [0]
[s](x1) = [1] x1 + [2]
This order satisfies following ordering constraints
[+(0(), y)] = [3] y + [1]
> [1] y + [0]
= [y]
[+(s(x), 0())] = [1] x + [3]
> [1] x + [2]
= [s(x)]
[+(s(x), s(y))] = [3] y + [1] x + [9]
> [3] y + [1] x + [8]
= [s(+(s(x), +(y, 0())))]
Hurray, we answered YES(?,O(n^1))
lmpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 4.12 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ +(0(), y) -> y
, +(s(x), 0()) -> s(x)
, +(s(x), s(y)) -> s(+(s(x), +(y, 0()))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 4.12 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ +(0(), y) -> y
, +(s(x), 0()) -> s(x)
, +(s(x), s(y)) -> s(+(s(x), +(y, 0()))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
Execution Time (secs) | 0.121 |
Answer | MAYBE |
Input | SK90 4.12 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ +(0(), y) -> y
, +(s(x), 0()) -> s(x)
, +(s(x), s(y)) -> s(+(s(x), +(y, 0()))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.093 |
Answer | MAYBE |
Input | SK90 4.12 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ +(0(), y) -> y
, +(s(x), 0()) -> s(x)
, +(s(x), s(y)) -> s(+(s(x), +(y, 0()))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..