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