MAYBE

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

Strict Trs:
  { active(fst(X1, X2)) -> fst(X1, active(X2))
  , active(fst(X1, X2)) -> fst(active(X1), X2)
  , active(fst(0(), Z)) -> mark(nil())
  , active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
  , active(cons(X1, X2)) -> cons(active(X1), X2)
  , active(from(X)) -> mark(cons(X, from(s(X))))
  , active(from(X)) -> from(active(X))
  , active(add(X1, X2)) -> add(X1, active(X2))
  , active(add(X1, X2)) -> add(active(X1), X2)
  , active(add(0(), X)) -> mark(X)
  , active(add(s(X), Y)) -> mark(s(add(X, Y)))
  , active(len(X)) -> len(active(X))
  , active(len(nil())) -> mark(0())
  , active(len(cons(X, Z))) -> mark(s(len(Z)))
  , fst(X1, mark(X2)) -> mark(fst(X1, X2))
  , fst(mark(X1), X2) -> mark(fst(X1, X2))
  , fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
  , s(ok(X)) -> ok(s(X))
  , cons(mark(X1), X2) -> mark(cons(X1, X2))
  , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
  , from(mark(X)) -> mark(from(X))
  , from(ok(X)) -> ok(from(X))
  , add(X1, mark(X2)) -> mark(add(X1, X2))
  , add(mark(X1), X2) -> mark(add(X1, X2))
  , add(ok(X1), ok(X2)) -> ok(add(X1, X2))
  , len(mark(X)) -> mark(len(X))
  , len(ok(X)) -> ok(len(X))
  , proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
  , proper(0()) -> ok(0())
  , proper(nil()) -> ok(nil())
  , proper(s(X)) -> s(proper(X))
  , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
  , proper(from(X)) -> from(proper(X))
  , proper(add(X1, X2)) -> add(proper(X1), proper(X2))
  , proper(len(X)) -> len(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) '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 perSymbol-enrichment and initial automaton 'match''
            failed due to the following reason:
            
            match-boundness of the problem could not be verified.
         
         2) 'Bounds with minimal-enrichment and initial automaton 'match''
            failed due to the following reason:
            
            match-boundness of the problem could not be verified.
         
      
   


Arrrr..