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