MAYBE

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

Strict Trs:
  { second(Op(x, y)) -> y
  , isOp(Op(x, y)) -> True()
  , isOp(Val(n)) -> False()
  , assrewrite(exp) -> rewrite(exp)
  , rewrite(Op(Op(x', y'), Op(x', Op(x, y)))) -> rw(x', x)
  , rewrite(Op(Op(x', y'), Op(x, Val(n)))) -> rw(x, Val(n))
  , rewrite(Op(Op(x, y), Val(n))) ->
    rw(Val(n), first(second(Val(n))))
  , rewrite(Op(Val(n), y)) -> Op(Val(n), y)
  , rewrite(Val(n)) -> Val(n)
  , first(Op(x, y)) -> x
  , first(Val(n)) -> Val(n)
  , rw(Op(Op(x', y'), Op(x, y)), c) ->
    rw[Ite][True][Let](Op(Op(x', y'), Op(x, y)), c, rewrite(x))
  , rw(Op(Op(x, y), Val(n)), c) ->
    rw[Ite][True][Let](Op(Op(x, y), Val(n)), c, Val(n))
  , rw(Op(Val(n), y), c) -> Op(Op(Val(n), y), rewrite(c))
  , rw(Val(n), c) -> Op(Val(n), rewrite(c)) }
Weak Trs:
  { rw[Ite][True][Let](Op(x', Op(x', Op(x, y))), c, a1) ->
    rw[Ite][True][Let][Let](Op(x', Op(x', Op(x, y))),
                            c,
                            a1,
                            rewrite(x))
  , rw[Ite][True][Let](Op(x', Op(x, Val(n))), c, a1) ->
    rw[Ite][True][Let][Let](Op(x', Op(x, Val(n))), c, a1, Val(n)) }
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..