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