MAYBE

'epo* (timeout of 60.0 seconds)'
--------------------------------
Answer:           MAYBE
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  from(X) -> cons(X, n__from(s(X)))
     , sel(0(), cons(X, XS)) -> X
     , sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
     , minus(X, 0()) -> 0()
     , minus(s(X), s(Y)) -> minus(X, Y)
     , quot(0(), s(Y)) -> 0()
     , quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
     , zWquot(XS, nil()) -> nil()
     , zWquot(nil(), XS) -> nil()
     , zWquot(cons(X, XS), cons(Y, YS)) ->
       cons(quot(X, Y), n__zWquot(activate(XS), activate(YS)))
     , from(X) -> n__from(X)
     , zWquot(X1, X2) -> n__zWquot(X1, X2)
     , activate(n__from(X)) -> from(X)
     , activate(n__zWquot(X1, X2)) -> zWquot(X1, X2)
     , activate(X) -> X}

Proof Output:    
  The input cannot be shown compatible