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