interpretations
Execution Time (secs) | - |
Answer | YES(?,O(n^1)) |
Input | TCT 09 ma8 |
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs:
{ f(m, 0()) -> g(m, 0())
, f(0(), n) -> g(0(), n)
, f(s(m), s(n)) -> h(m, n, f(m, p(m, n)), f(s(m), n))
, g(n, m) -> bot()
, h(k, l, m, n) -> bot()
, p(m, n) -> bot() }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(f) = {2}, Uargs(g) = {}, Uargs(s) = {}, Uargs(h) = {3, 4},
Uargs(p) = {}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[f](x1, x2) = [3] x2 + [3]
[0] = [2]
[g](x1, x2) = [3] x2 + [1]
[s](x1) = [1] x1 + [3]
[h](x1, x2, x3, x4) = [1] x3 + [1] x4 + [2]
[p](x1, x2) = [1]
[bot] = [0]
This order satisfies following ordering constraints
[f(m, 0())] = [9]
> [7]
= [g(m, 0())]
[f(0(), n)] = [3] n + [3]
> [3] n + [1]
= [g(0(), n)]
[f(s(m), s(n))] = [3] n + [12]
> [3] n + [11]
= [h(m, n, f(m, p(m, n)), f(s(m), n))]
[g(n, m)] = [3] m + [1]
> [0]
= [bot()]
[h(k, l, m, n)] = [1] n + [1] m + [2]
> [0]
= [bot()]
[p(m, n)] = [1]
> [0]
= [bot()]
Hurray, we answered YES(?,O(n^1))
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0(), n) -> g(0(), n)
, f(m, 0()) -> g(m, 0())
, f(s(m), s(n)) -> h(m, n, f(m, p(m, n)), f(s(m), n))
, g(n, m) -> bot()
, p(m, n) -> bot()
, h(k, l, m, n) -> bot() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0(), n) -> g(0(), n)
, f(m, 0()) -> g(m, 0())
, f(s(m), s(n)) -> h(m, n, f(m, p(m, n)), f(s(m), n))
, g(n, m) -> bot()
, p(m, n) -> bot()
, h(k, l, m, n) -> bot() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
Execution Time (secs) | 0.237 |
Answer | MAYBE |
Input | TCT 09 ma8 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0(), n) -> g(0(), n)
, f(m, 0()) -> g(m, 0())
, f(s(m), s(n)) -> h(m, n, f(m, p(m, n)), f(s(m), n))
, g(n, m) -> bot()
, p(m, n) -> bot()
, h(k, l, m, n) -> bot() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.227 |
Answer | MAYBE |
Input | TCT 09 ma8 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0(), n) -> g(0(), n)
, f(m, 0()) -> g(m, 0())
, f(s(m), s(n)) -> h(m, n, f(m, p(m, n)), f(s(m), n))
, g(n, m) -> bot()
, p(m, n) -> bot()
, h(k, l, m, n) -> bot() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..