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