MAYBE

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

Strict Trs:
  { active(pairNs()) -> mark(cons(0(), incr(oddNs())))
  , active(cons(X1, X2)) -> cons(active(X1), X2)
  , active(incr(X)) -> incr(active(X))
  , active(incr(cons(X, XS))) -> mark(cons(s(X), incr(XS)))
  , active(oddNs()) -> mark(incr(pairNs()))
  , active(s(X)) -> s(active(X))
  , active(take(X1, X2)) -> take(X1, active(X2))
  , active(take(X1, X2)) -> take(active(X1), X2)
  , active(take(0(), XS)) -> mark(nil())
  , active(take(s(N), cons(X, XS))) -> mark(cons(X, take(N, XS)))
  , active(zip(X1, X2)) -> zip(X1, active(X2))
  , active(zip(X1, X2)) -> zip(active(X1), X2)
  , active(zip(X, nil())) -> mark(nil())
  , active(zip(cons(X, XS), cons(Y, YS))) ->
    mark(cons(pair(X, Y), zip(XS, YS)))
  , active(zip(nil(), XS)) -> mark(nil())
  , active(pair(X1, X2)) -> pair(X1, active(X2))
  , active(pair(X1, X2)) -> pair(active(X1), X2)
  , active(tail(X)) -> tail(active(X))
  , active(tail(cons(X, XS))) -> mark(XS)
  , active(repItems(X)) -> repItems(active(X))
  , active(repItems(cons(X, XS))) ->
    mark(cons(X, cons(X, repItems(XS))))
  , active(repItems(nil())) -> mark(nil())
  , cons(mark(X1), X2) -> mark(cons(X1, X2))
  , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
  , incr(mark(X)) -> mark(incr(X))
  , incr(ok(X)) -> ok(incr(X))
  , s(mark(X)) -> mark(s(X))
  , s(ok(X)) -> ok(s(X))
  , take(X1, mark(X2)) -> mark(take(X1, X2))
  , take(mark(X1), X2) -> mark(take(X1, X2))
  , take(ok(X1), ok(X2)) -> ok(take(X1, X2))
  , zip(X1, mark(X2)) -> mark(zip(X1, X2))
  , zip(mark(X1), X2) -> mark(zip(X1, X2))
  , zip(ok(X1), ok(X2)) -> ok(zip(X1, X2))
  , pair(X1, mark(X2)) -> mark(pair(X1, X2))
  , pair(mark(X1), X2) -> mark(pair(X1, X2))
  , pair(ok(X1), ok(X2)) -> ok(pair(X1, X2))
  , tail(mark(X)) -> mark(tail(X))
  , tail(ok(X)) -> ok(tail(X))
  , repItems(mark(X)) -> mark(repItems(X))
  , repItems(ok(X)) -> ok(repItems(X))
  , proper(pairNs()) -> ok(pairNs())
  , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
  , proper(0()) -> ok(0())
  , proper(incr(X)) -> incr(proper(X))
  , proper(oddNs()) -> ok(oddNs())
  , proper(s(X)) -> s(proper(X))
  , proper(take(X1, X2)) -> take(proper(X1), proper(X2))
  , proper(nil()) -> ok(nil())
  , proper(zip(X1, X2)) -> zip(proper(X1), proper(X2))
  , proper(pair(X1, X2)) -> pair(proper(X1), proper(X2))
  , proper(tail(X)) -> tail(proper(X))
  , proper(repItems(X)) -> repItems(proper(X))
  , top(mark(X)) -> top(proper(X))
  , top(ok(X)) -> top(active(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..