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