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