interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ from(X) -> cons(X, n__from(n__s(X)))
, from(X) -> n__from(X)
, cons(X1, X2) -> n__cons(X1, X2)
, length(n__nil()) -> 0()
, length(n__cons(X, Y)) -> s(length1(activate(Y)))
, s(X) -> n__s(X)
, length1(X) -> length(activate(X))
, activate(X) -> X
, activate(n__from(X)) -> from(activate(X))
, activate(n__s(X)) -> s(activate(X))
, activate(n__nil()) -> nil()
, activate(n__cons(X1, X2)) -> cons(activate(X1), X2)
, nil() -> n__nil() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
2) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
3) 'matrix interpretation of dimension 3' failed due to the
following reason:
The input cannot be shown compatible
4) 'matrix interpretation of dimension 1' failed due to the
following reason:
The input cannot be shown compatible
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ from(X) -> cons(X, n__from(n__s(X)))
, length(n__nil()) -> 0()
, length(n__cons(X, Y)) -> s(length1(activate(Y)))
, length1(X) -> length(activate(X))
, from(X) -> n__from(X)
, s(X) -> n__s(X)
, nil() -> n__nil()
, cons(X1, X2) -> n__cons(X1, X2)
, activate(n__from(X)) -> from(activate(X))
, activate(n__s(X)) -> s(activate(X))
, activate(n__nil()) -> nil()
, activate(n__cons(X1, X2)) -> cons(activate(X1), X2)
, activate(X) -> X }
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:
{ from(X) -> cons(X, n__from(n__s(X)))
, length(n__nil()) -> 0()
, length(n__cons(X, Y)) -> s(length1(activate(Y)))
, length1(X) -> length(activate(X))
, from(X) -> n__from(X)
, s(X) -> n__s(X)
, nil() -> n__nil()
, cons(X1, X2) -> n__cons(X1, X2)
, activate(n__from(X)) -> from(activate(X))
, activate(n__s(X)) -> s(activate(X))
, activate(n__nil()) -> nil()
, activate(n__cons(X1, X2)) -> cons(activate(X1), X2)
, activate(X) -> X }
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:
{ from(X) -> cons(X, n__from(n__s(X)))
, length(n__nil()) -> 0()
, length(n__cons(X, Y)) -> s(length1(activate(Y)))
, length1(X) -> length(activate(X))
, from(X) -> n__from(X)
, s(X) -> n__s(X)
, nil() -> n__nil()
, cons(X1, X2) -> n__cons(X1, X2)
, activate(n__from(X)) -> from(activate(X))
, activate(n__s(X)) -> s(activate(X))
, activate(n__nil()) -> nil()
, activate(n__cons(X1, X2)) -> cons(activate(X1), X2)
, activate(X) -> X }
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:
{ from(X) -> cons(X, n__from(n__s(X)))
, length(n__nil()) -> 0()
, length(n__cons(X, Y)) -> s(length1(activate(Y)))
, length1(X) -> length(activate(X))
, from(X) -> n__from(X)
, s(X) -> n__s(X)
, nil() -> n__nil()
, cons(X1, X2) -> n__cons(X1, X2)
, activate(n__from(X)) -> from(activate(X))
, activate(n__s(X)) -> s(activate(X))
, activate(n__nil()) -> nil()
, activate(n__cons(X1, X2)) -> cons(activate(X1), X2)
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..