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