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