MAYBE

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

Strict Trs:
  { rec[x_0][1](f(x10), x7) ->
    rec[rpm_0][3](x10, f_0(rec[x_0](f(x10))), bot[0]())
  , rec[rpm_0][3](Leaf(x3), f_0(rec[x_0](f(x2))), x1) ->
    P(rpm_3(f_0(rec[x_0](f(x2)))), rpm_4(x3))
  , rec[rpm_0][3](Node(x4, x3), f_0(rec[x_0](f(x2))), x1) ->
    P(rpm_8(f_0(rec[x_0](f(x2))), x4, x3),
      rpm_9(f_0(rec[x_0](f(x2))), x4, x3))
  , fst_cond[1](P(rpm_3(f_0(rec[x_0](f(x3)))), rpm_4(x2)), x1) ->
    Leaf(snd_cond[1](rec[x_0][1](f(x3), bot[10]()), bot[11]()))
  , fst_cond[1](P(rpm_8(f_0(rec[x_0](f(x7))), x6, x5),
                  rpm_9(f_0(rec[x_0](f(x4))), x3, x2)),
                x1)
    ->
    Node(fst_cond[1](rec[rpm_0][3](x6, f_0(rec[x_0](f(x7))), bot[2]()),
                     bot[3]()),
         fst_cond[1](rec[rpm_0][3](x5, f_0(rec[x_0](f(x7))), bot[4]()),
                     bot[5]()))
  , snd_cond[1](P(rpm_3(f_0(rec[x_0](f(x3)))), rpm_4(x2)), x1) -> x2
  , snd_cond[1](P(rpm_8(f_0(rec[x_0](f(x7))), x6, x5),
                  rpm_9(f_0(rec[x_0](f(x4))), x3, x2)),
                x1)
    ->
    rec[min_0][2](snd_cond[1](rec[rpm_0][3](x3,
                                            f_0(rec[x_0](f(x4))),
                                            bot[6]()),
                              bot[7]()),
                  snd_cond[1](rec[rpm_0][3](x2, f_0(rec[x_0](f(x4))), bot[8]()),
                              bot[9]()))
  , rec[min_0][2](0(), x82) -> 0()
  , rec[min_0][2](S(x90), 0()) -> 0()
  , rec[min_0][2](S(x10), S(x6)) -> S(rec[min_0][2](x10, x6))
  , main(x3) ->
    fst_cond[1](rec[x_0][1](f(x3), bot[12]()), bot[13]()) }
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..