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