MAYBE

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

Strict Trs:
  { 0(#()) -> #()
  , +(x, #()) -> x
  , +(0(x), 0(y)) -> 0(+(x, y))
  , +(0(x), 1(y)) -> 1(+(x, y))
  , +(#(), x) -> x
  , +(+(x, y), z) -> +(x, +(y, z))
  , +(1(x), 0(y)) -> 1(+(x, y))
  , +(1(x), 1(y)) -> 0(+(+(x, y), 1(#())))
  , -(x, #()) -> x
  , -(0(x), 0(y)) -> 0(-(x, y))
  , -(0(x), 1(y)) -> 1(-(-(x, y), 1(#())))
  , -(#(), x) -> #()
  , -(1(x), 0(y)) -> 1(-(x, y))
  , -(1(x), 1(y)) -> 0(-(x, y))
  , not(true()) -> false()
  , not(false()) -> true()
  , if(true(), x, y) -> x
  , if(false(), x, y) -> y
  , eq(0(x), 0(y)) -> eq(x, y)
  , eq(0(x), #()) -> eq(x, #())
  , eq(0(x), 1(y)) -> false()
  , eq(#(), 0(y)) -> eq(#(), y)
  , eq(#(), #()) -> true()
  , eq(#(), 1(y)) -> false()
  , eq(1(x), 0(y)) -> false()
  , eq(1(x), #()) -> false()
  , eq(1(x), 1(y)) -> eq(x, y)
  , ge(x, #()) -> true()
  , ge(0(x), 0(y)) -> ge(x, y)
  , ge(0(x), 1(y)) -> not(ge(y, x))
  , ge(#(), 0(x)) -> ge(#(), x)
  , ge(#(), 1(x)) -> false()
  , ge(1(x), 0(y)) -> ge(x, y)
  , ge(1(x), 1(y)) -> ge(x, y)
  , log(x) -> -(log'(x), 1(#()))
  , log'(0(x)) -> if(ge(x, 1(#())), +(log'(x), 1(#())), #())
  , log'(#()) -> #()
  , log'(1(x)) -> +(log'(x), 1(#()))
  , *(x, +(y, z)) -> +(*(x, y), *(x, z))
  , *(0(x), y) -> 0(*(x, y))
  , *(#(), x) -> #()
  , *(1(x), y) -> +(0(*(x, y)), y)
  , *(*(x, y), z) -> *(x, *(y, z))
  , app(nil(), l) -> l
  , app(cons(x, l1), l2) -> cons(x, app(l1, l2))
  , sum(app(l1, l2)) -> +(sum(l1), sum(l2))
  , sum(nil()) -> 0(#())
  , sum(cons(x, l)) -> +(x, sum(l))
  , prod(app(l1, l2)) -> *(prod(l1), prod(l2))
  , prod(nil()) -> 1(#())
  , prod(cons(x, l)) -> *(x, prod(l))
  , mem(x, nil()) -> false()
  , mem(x, cons(y, l)) -> if(eq(x, y), true(), mem(x, l))
  , inter(l1, app(l2, l3)) -> app(inter(l1, l2), inter(l1, l3))
  , inter(x, nil()) -> nil()
  , inter(l1, cons(x, l2)) -> ifinter(mem(x, l1), x, l2, l1)
  , inter(app(l1, l2), l3) -> app(inter(l1, l3), inter(l2, l3))
  , inter(nil(), x) -> nil()
  , inter(cons(x, l1), l2) -> ifinter(mem(x, l2), x, l1, l2)
  , ifinter(true(), x, l1, l2) -> cons(x, inter(l1, l2))
  , ifinter(false(), x, l1, l2) -> inter(l1, l2) }
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..