MAYBE

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

Strict Trs:
  { a__zeros() -> cons(0(), zeros())
  , a__zeros() -> zeros()
  , a__U11(X1, X2) -> U11(X1, X2)
  , a__U11(tt(), L) -> a__U12(tt(), L)
  , a__U12(X1, X2) -> U12(X1, X2)
  , a__U12(tt(), L) -> s(a__length(mark(L)))
  , a__length(X) -> length(X)
  , a__length(cons(N, L)) -> a__U11(tt(), L)
  , a__length(nil()) -> 0()
  , mark(cons(X1, X2)) -> cons(mark(X1), X2)
  , mark(0()) -> 0()
  , mark(zeros()) -> a__zeros()
  , mark(tt()) -> tt()
  , mark(s(X)) -> s(mark(X))
  , mark(nil()) -> nil()
  , mark(U11(X1, X2)) -> a__U11(mark(X1), X2)
  , mark(U12(X1, X2)) -> a__U12(mark(X1), X2)
  , mark(length(X)) -> a__length(mark(X)) }
Obligation:
  runtime complexity
Answer:
  MAYBE

The input is overlay and right-linear. Switching to innermost
rewriting.

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

Strict Trs:
  { a__zeros() -> cons(0(), zeros())
  , a__zeros() -> zeros()
  , a__U11(X1, X2) -> U11(X1, X2)
  , a__U11(tt(), L) -> a__U12(tt(), L)
  , a__U12(X1, X2) -> U12(X1, X2)
  , a__U12(tt(), L) -> s(a__length(mark(L)))
  , a__length(X) -> length(X)
  , a__length(cons(N, L)) -> a__U11(tt(), L)
  , a__length(nil()) -> 0()
  , mark(cons(X1, X2)) -> cons(mark(X1), X2)
  , mark(0()) -> 0()
  , mark(zeros()) -> a__zeros()
  , mark(tt()) -> tt()
  , mark(s(X)) -> s(mark(X))
  , mark(nil()) -> nil()
  , mark(U11(X1, X2)) -> a__U11(mark(X1), X2)
  , mark(U12(X1, X2)) -> a__U12(mark(X1), X2)
  , mark(length(X)) -> a__length(mark(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) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed
         due to the following reason:
         
         Computation stopped due to timeout after 5.0 seconds.
      
      3) '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
         
      
   


Arrrr..