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