interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ fib(N) -> sel(N, fib1(s(0()), s(0())))
, sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
, sel(0(), cons(X, XS)) -> X
, fib1(X, Y) -> cons(X, n__fib1(Y, n__add(X, Y)))
, fib1(X1, X2) -> n__fib1(X1, X2)
, add(X1, X2) -> n__add(X1, X2)
, add(s(X), Y) -> s(add(X, Y))
, add(0(), X) -> X
, activate(X) -> X
, activate(n__fib1(X1, X2)) -> fib1(activate(X1), activate(X2))
, activate(n__add(X1, X2)) -> add(activate(X1), activate(X2)) }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ fib(N) -> sel(N, fib1(s(0()), s(0())))
, fib1(X, Y) -> cons(X, n__fib1(Y, n__add(X, Y)))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
, fib1(X1, X2) -> n__fib1(X1, X2)
, add(X1, X2) -> n__add(X1, X2)
, activate(n__fib1(X1, X2)) -> fib1(activate(X1), activate(X2))
, activate(n__add(X1, X2)) -> add(activate(X1), activate(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:
{ fib(N) -> sel(N, fib1(s(0()), s(0())))
, fib1(X, Y) -> cons(X, n__fib1(Y, n__add(X, Y)))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
, fib1(X1, X2) -> n__fib1(X1, X2)
, add(X1, X2) -> n__add(X1, X2)
, activate(n__fib1(X1, X2)) -> fib1(activate(X1), activate(X2))
, activate(n__add(X1, X2)) -> add(activate(X1), activate(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:
{ fib(N) -> sel(N, fib1(s(0()), s(0())))
, fib1(X, Y) -> cons(X, n__fib1(Y, n__add(X, Y)))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
, fib1(X1, X2) -> n__fib1(X1, X2)
, add(X1, X2) -> n__add(X1, X2)
, activate(n__fib1(X1, X2)) -> fib1(activate(X1), activate(X2))
, activate(n__add(X1, X2)) -> add(activate(X1), activate(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:
{ fib(N) -> sel(N, fib1(s(0()), s(0())))
, fib1(X, Y) -> cons(X, n__fib1(Y, n__add(X, Y)))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
, fib1(X1, X2) -> n__fib1(X1, X2)
, add(X1, X2) -> n__add(X1, X2)
, activate(n__fib1(X1, X2)) -> fib1(activate(X1), activate(X2))
, activate(n__add(X1, X2)) -> add(activate(X1), activate(X2))
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..