MAYBE

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

Strict Trs:
  { active(from(X)) -> from(active(X))
  , active(from(X)) -> mark(cons(X, from(s(X))))
  , active(cons(X1, X2)) -> cons(active(X1), X2)
  , active(s(X)) -> s(active(X))
  , active(sel(X1, X2)) -> sel(X1, active(X2))
  , active(sel(X1, X2)) -> sel(active(X1), X2)
  , active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
  , active(sel(0(), cons(X, XS))) -> mark(X)
  , active(minus(X1, X2)) -> minus(X1, active(X2))
  , active(minus(X1, X2)) -> minus(active(X1), X2)
  , active(minus(X, 0())) -> mark(0())
  , active(minus(s(X), s(Y))) -> mark(minus(X, Y))
  , active(quot(X1, X2)) -> quot(X1, active(X2))
  , active(quot(X1, X2)) -> quot(active(X1), X2)
  , active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
  , active(quot(0(), s(Y))) -> mark(0())
  , active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
  , active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
  , active(zWquot(XS, nil())) -> mark(nil())
  , active(zWquot(cons(X, XS), cons(Y, YS))) ->
    mark(cons(quot(X, Y), zWquot(XS, YS)))
  , active(zWquot(nil(), XS)) -> mark(nil())
  , from(mark(X)) -> mark(from(X))
  , from(ok(X)) -> ok(from(X))
  , cons(mark(X1), X2) -> mark(cons(X1, X2))
  , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
  , s(mark(X)) -> mark(s(X))
  , s(ok(X)) -> ok(s(X))
  , sel(X1, mark(X2)) -> mark(sel(X1, X2))
  , sel(mark(X1), X2) -> mark(sel(X1, X2))
  , sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
  , minus(X1, mark(X2)) -> mark(minus(X1, X2))
  , minus(mark(X1), X2) -> mark(minus(X1, X2))
  , minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
  , quot(X1, mark(X2)) -> mark(quot(X1, X2))
  , quot(mark(X1), X2) -> mark(quot(X1, X2))
  , quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
  , zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
  , zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
  , zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
  , proper(from(X)) -> from(proper(X))
  , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
  , proper(s(X)) -> s(proper(X))
  , proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
  , proper(0()) -> ok(0())
  , proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
  , proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
  , proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
  , proper(nil()) -> ok(nil())
  , 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) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
            to the following reason:
            
            The input cannot be shown compatible
         
         2) 'bsearch-popstar (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..