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