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