interpretations
YES(?,O(n^3))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^3)).
Strict Trs: { h(f(x, y)) -> f(f(a(), h(h(y))), x) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^3))
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[1 0 3] [0]
[h](x1) = [0 0 3] x1 + [0]
[0 1 0] [0]
[1 0 0] [1 0 0] [0]
[f](x1, x2) = [0 1 1] x1 + [0 0 0] x2 + [1]
[0 0 0] [0 1 1] [1]
[0]
[a] = [0]
[0]
This order satisfies following ordering constraints
[h(f(x, y))] = [1 0 0] [1 3 3] [3]
[0 0 0] x + [0 3 3] y + [3]
[0 1 1] [0 0 0] [1]
> [1 0 0] [1 3 3] [0]
[0 0 0] x + [0 3 3] y + [3]
[0 1 1] [0 0 0] [1]
= [f(f(a(), h(h(y))), x)]
Hurray, we answered YES(?,O(n^3))
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs: { h(f(x, y)) -> f(f(a(), h(h(y))), x) }
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: { h(f(x, y)) -> f(f(a(), h(h(y))), x) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs: { h(f(x, y)) -> f(f(a(), h(h(y))), x) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs: { h(f(x, y)) -> f(f(a(), h(h(y))), x) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..