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(X) -> U11(X)
  , a__U11(tt()) -> tt()
  , a__U21(X) -> U21(X)
  , a__U21(tt()) -> tt()
  , a__U31(X) -> U31(X)
  , a__U31(tt()) -> tt()
  , a__U41(X1, X2) -> U41(X1, X2)
  , a__U41(tt(), V2) -> a__U42(a__isNatIList(V2))
  , a__U42(X) -> U42(X)
  , a__U42(tt()) -> tt()
  , a__isNatIList(V) -> a__U31(a__isNatList(V))
  , a__isNatIList(X) -> isNatIList(X)
  , a__isNatIList(cons(V1, V2)) -> a__U41(a__isNat(V1), V2)
  , a__isNatIList(zeros()) -> tt()
  , a__U51(X1, X2) -> U51(X1, X2)
  , a__U51(tt(), V2) -> a__U52(a__isNatList(V2))
  , a__U52(X) -> U52(X)
  , a__U52(tt()) -> tt()
  , a__isNatList(X) -> isNatList(X)
  , a__isNatList(cons(V1, V2)) -> a__U51(a__isNat(V1), V2)
  , a__isNatList(nil()) -> tt()
  , a__U61(X1, X2, X3) -> U61(X1, X2, X3)
  , a__U61(tt(), L, N) -> a__U62(a__isNat(N), L)
  , a__U62(X1, X2) -> U62(X1, X2)
  , a__U62(tt(), L) -> s(a__length(mark(L)))
  , a__isNat(X) -> isNat(X)
  , a__isNat(0()) -> tt()
  , a__isNat(s(V1)) -> a__U21(a__isNat(V1))
  , a__isNat(length(V1)) -> a__U11(a__isNatList(V1))
  , a__length(X) -> length(X)
  , a__length(cons(N, L)) -> a__U61(a__isNatList(L), L, N)
  , 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(length(X)) -> a__length(mark(X))
  , mark(nil()) -> nil()
  , mark(U11(X)) -> a__U11(mark(X))
  , mark(U21(X)) -> a__U21(mark(X))
  , mark(U31(X)) -> a__U31(mark(X))
  , mark(U41(X1, X2)) -> a__U41(mark(X1), X2)
  , mark(U42(X)) -> a__U42(mark(X))
  , mark(isNatIList(X)) -> a__isNatIList(X)
  , mark(U51(X1, X2)) -> a__U51(mark(X1), X2)
  , mark(U52(X)) -> a__U52(mark(X))
  , mark(isNatList(X)) -> a__isNatList(X)
  , mark(U61(X1, X2, X3)) -> a__U61(mark(X1), X2, X3)
  , mark(U62(X1, X2)) -> a__U62(mark(X1), X2)
  , mark(isNat(X)) -> a__isNat(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..