MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { app(X1, X2) -> n__app(X1, X2)
  , app(nil(), YS) -> YS
  , app(cons(X, XS), YS) -> cons(X, n__app(activate(XS), YS))
  , nil() -> n__nil()
  , activate(X) -> X
  , activate(n__app(X1, X2)) -> app(activate(X1), activate(X2))
  , activate(n__from(X)) -> from(activate(X))
  , activate(n__s(X)) -> s(activate(X))
  , activate(n__nil()) -> nil()
  , activate(n__zWadr(X1, X2)) -> zWadr(activate(X1), activate(X2))
  , activate(n__prefix(X)) -> prefix(activate(X))
  , from(X) -> cons(X, n__from(n__s(X)))
  , from(X) -> n__from(X)
  , zWadr(X1, X2) -> n__zWadr(X1, X2)
  , zWadr(XS, nil()) -> nil()
  , zWadr(nil(), YS) -> nil()
  , zWadr(cons(X, XS), cons(Y, YS)) ->
    cons(app(Y, cons(X, n__nil())),
         n__zWadr(activate(XS), activate(YS)))
  , prefix(L) -> cons(nil(), n__zWadr(L, n__prefix(L)))
  , prefix(X) -> n__prefix(X)
  , s(X) -> n__s(X) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

Arguments of following rules are not normal-forms:

{ app(nil(), YS) -> YS
, zWadr(XS, nil()) -> nil()
, zWadr(nil(), YS) -> nil() }

All above mentioned rules can be savely removed.

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { app(X1, X2) -> n__app(X1, X2)
  , app(cons(X, XS), YS) -> cons(X, n__app(activate(XS), YS))
  , nil() -> n__nil()
  , activate(X) -> X
  , activate(n__app(X1, X2)) -> app(activate(X1), activate(X2))
  , activate(n__from(X)) -> from(activate(X))
  , activate(n__s(X)) -> s(activate(X))
  , activate(n__nil()) -> nil()
  , activate(n__zWadr(X1, X2)) -> zWadr(activate(X1), activate(X2))
  , activate(n__prefix(X)) -> prefix(activate(X))
  , from(X) -> cons(X, n__from(n__s(X)))
  , from(X) -> n__from(X)
  , zWadr(X1, X2) -> n__zWadr(X1, X2)
  , zWadr(cons(X, XS), cons(Y, YS)) ->
    cons(app(Y, cons(X, n__nil())),
         n__zWadr(activate(XS), activate(YS)))
  , prefix(L) -> cons(nil(), n__zWadr(L, n__prefix(L)))
  , prefix(X) -> n__prefix(X)
  , s(X) -> n__s(X) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

None of the processors succeeded.

Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
   
   Empty strict component of the problem is NOT empty.

2) 'Best' failed due to the following reason:
   
   None of the processors succeeded.
   
   Details of failed attempt(s):
   -----------------------------
   1) 'WithProblem (timeout of 60 seconds)' failed due to the
      following reason:
      
      Computation stopped due to timeout after 60.0 seconds.
   
   2) 'Best' failed due to the following reason:
      
      None of the processors succeeded.
      
      Details of failed attempt(s):
      -----------------------------
      1) 'WithProblem (timeout of 30 seconds) (timeout of 60 seconds)'
         failed due to the following reason:
         
         Computation stopped due to timeout after 30.0 seconds.
      
      2) 'Best' failed due to the following reason:
         
         None of the processors succeeded.
         
         Details of failed attempt(s):
         -----------------------------
         1) 'bsearch-popstar (timeout of 60 seconds)' failed due to the
            following reason:
            
            The input cannot be shown compatible
         
         2) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
            to the following reason:
            
            The input cannot be shown compatible
         
      
      3) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed
         due to the following reason:
         
         None of the processors succeeded.
         
         Details of failed attempt(s):
         -----------------------------
         1) 'Bounds with minimal-enrichment and initial automaton 'match''
            failed due to the following reason:
            
            match-boundness of the problem could not be verified.
         
         2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
            failed due to the following reason:
            
            match-boundness of the problem could not be verified.
         
      
   


Arrrr..