MAYBE

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

Strict Trs:
  { a__from(X) -> cons(mark(X), from(s(X)))
  , a__from(X) -> from(X)
  , mark(cons(X1, X2)) -> cons(mark(X1), X2)
  , mark(from(X)) -> a__from(mark(X))
  , mark(s(X)) -> s(mark(X))
  , mark(0()) -> 0()
  , mark(rnil()) -> rnil()
  , mark(rcons(X1, X2)) -> rcons(mark(X1), mark(X2))
  , mark(posrecip(X)) -> posrecip(mark(X))
  , mark(negrecip(X)) -> negrecip(mark(X))
  , mark(2ndspos(X1, X2)) -> a__2ndspos(mark(X1), mark(X2))
  , mark(2ndsneg(X1, X2)) -> a__2ndsneg(mark(X1), mark(X2))
  , mark(pi(X)) -> a__pi(mark(X))
  , mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2))
  , mark(times(X1, X2)) -> a__times(mark(X1), mark(X2))
  , mark(square(X)) -> a__square(mark(X))
  , mark(nil()) -> nil()
  , a__2ndspos(X1, X2) -> 2ndspos(X1, X2)
  , a__2ndspos(s(N), cons(X, cons(Y, Z))) ->
    rcons(posrecip(mark(Y)), a__2ndsneg(mark(N), mark(Z)))
  , a__2ndspos(0(), Z) -> rnil()
  , a__2ndsneg(X1, X2) -> 2ndsneg(X1, X2)
  , a__2ndsneg(s(N), cons(X, cons(Y, Z))) ->
    rcons(negrecip(mark(Y)), a__2ndspos(mark(N), mark(Z)))
  , a__2ndsneg(0(), Z) -> rnil()
  , a__pi(X) -> a__2ndspos(mark(X), a__from(0()))
  , a__pi(X) -> pi(X)
  , a__plus(X1, X2) -> plus(X1, X2)
  , a__plus(s(X), Y) -> s(a__plus(mark(X), mark(Y)))
  , a__plus(0(), Y) -> mark(Y)
  , a__times(X1, X2) -> times(X1, X2)
  , a__times(s(X), Y) -> a__plus(mark(Y), a__times(mark(X), mark(Y)))
  , a__times(0(), Y) -> 0()
  , a__square(X) -> a__times(mark(X), mark(X))
  , a__square(X) -> square(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..