MAYBE

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

Strict Trs:
  { O(0()) -> 0()
  , +(x, 0()) -> x
  , +(x, +(y, z)) -> +(+(x, y), z)
  , +(O(x), O(y)) -> O(+(x, y))
  , +(O(x), I(y)) -> I(+(x, y))
  , +(0(), x) -> x
  , +(I(x), O(y)) -> I(+(x, y))
  , +(I(x), I(y)) -> O(+(+(x, y), I(0())))
  , -(x, 0()) -> x
  , -(O(x), O(y)) -> O(-(x, y))
  , -(O(x), I(y)) -> I(-(-(x, y), I(1())))
  , -(0(), x) -> 0()
  , -(I(x), O(y)) -> I(-(x, y))
  , -(I(x), I(y)) -> O(-(x, y))
  , not(true()) -> false()
  , not(false()) -> true()
  , and(x, true()) -> x
  , and(x, false()) -> false()
  , if(true(), x, y) -> x
  , if(false(), x, y) -> y
  , ge(x, 0()) -> true()
  , ge(O(x), O(y)) -> ge(x, y)
  , ge(O(x), I(y)) -> not(ge(y, x))
  , ge(0(), O(x)) -> ge(0(), x)
  , ge(0(), I(x)) -> false()
  , ge(I(x), O(y)) -> ge(x, y)
  , ge(I(x), I(y)) -> ge(x, y)
  , Log'(O(x)) -> if(ge(x, I(0())), +(Log'(x), I(0())), 0())
  , Log'(0()) -> 0()
  , Log'(I(x)) -> +(Log'(x), I(0()))
  , Log(x) -> -(Log'(x), I(0()))
  , Val(L(x)) -> x
  , Val(N(x, l(), r())) -> x
  , Min(L(x)) -> x
  , Min(N(x, l(), r())) -> Min(l())
  , Max(L(x)) -> x
  , Max(N(x, l(), r())) -> Max(r())
  , BS(L(x)) -> true()
  , BS(N(x, l(), r())) ->
    and(and(ge(x, Max(l())), ge(Min(r()), x)), and(BS(l()), BS(r())))
  , Size(L(x)) -> I(0())
  , Size(N(x, l(), r())) -> +(+(Size(l()), Size(r())), I(1()))
  , WB(L(x)) -> true()
  , WB(N(x, l(), r())) ->
    and(if(ge(Size(l()), Size(r())),
           ge(I(0()), -(Size(l()), Size(r()))),
           ge(I(0()), -(Size(r()), Size(l())))),
        and(WB(l()), WB(r()))) }
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..