MAYBE

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

Strict Trs:
  { cond1(true(), x, y) -> cond2(gr(x, y), x, y)
  , cond2(true(), x, y) -> cond3(gr(x, 0()), x, y)
  , cond2(false(), x, y) -> cond4(gr(y, 0()), x, y)
  , gr(0(), x) -> false()
  , gr(s(x), 0()) -> true()
  , gr(s(x), s(y)) -> gr(x, y)
  , cond3(true(), x, y) -> cond3(gr(x, 0()), p(x), y)
  , cond3(false(), x, y) -> cond1(and(gr(x, 0()), gr(y, 0())), x, y)
  , cond4(true(), x, y) -> cond4(gr(y, 0()), x, p(y))
  , cond4(false(), x, y) -> cond1(and(gr(x, 0()), gr(y, 0())), x, y)
  , p(0()) -> 0()
  , p(s(x)) -> x
  , and(x, false()) -> false()
  , and(true(), true()) -> true()
  , and(false(), x) -> false() }
Obligation:
  runtime complexity
Answer:
  MAYBE

None of the processors succeeded.

Details of failed attempt(s):
-----------------------------
1) '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 processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
      2) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
         to the following reason:
         
         The processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
   
   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 perSymbol-enrichment and initial automaton 'match''
         failed due to the following reason:
         
         match-boundness of the problem could not be verified.
      
      2) 'Bounds with minimal-enrichment and initial automaton 'match''
         failed due to the following reason:
         
         match-boundness of the problem could not be verified.
      
   

2) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed
   due to the following reason:
   
   We add the following weak dependency pairs:
   
   Strict DPs:
     { cond1^#(true(), x, y) -> c_1(cond2^#(gr(x, y), x, y))
     , cond2^#(true(), x, y) -> c_2(cond3^#(gr(x, 0()), x, y))
     , cond2^#(false(), x, y) -> c_3(cond4^#(gr(y, 0()), x, y))
     , cond3^#(true(), x, y) -> c_7(cond3^#(gr(x, 0()), p(x), y))
     , cond3^#(false(), x, y) ->
       c_8(cond1^#(and(gr(x, 0()), gr(y, 0())), x, y))
     , cond4^#(true(), x, y) -> c_9(cond4^#(gr(y, 0()), x, p(y)))
     , cond4^#(false(), x, y) ->
       c_10(cond1^#(and(gr(x, 0()), gr(y, 0())), x, y))
     , gr^#(0(), x) -> c_4()
     , gr^#(s(x), 0()) -> c_5()
     , gr^#(s(x), s(y)) -> c_6(gr^#(x, y))
     , p^#(0()) -> c_11()
     , p^#(s(x)) -> c_12(x)
     , and^#(x, false()) -> c_13()
     , and^#(true(), true()) -> c_14()
     , and^#(false(), x) -> c_15() }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { cond1^#(true(), x, y) -> c_1(cond2^#(gr(x, y), x, y))
     , cond2^#(true(), x, y) -> c_2(cond3^#(gr(x, 0()), x, y))
     , cond2^#(false(), x, y) -> c_3(cond4^#(gr(y, 0()), x, y))
     , cond3^#(true(), x, y) -> c_7(cond3^#(gr(x, 0()), p(x), y))
     , cond3^#(false(), x, y) ->
       c_8(cond1^#(and(gr(x, 0()), gr(y, 0())), x, y))
     , cond4^#(true(), x, y) -> c_9(cond4^#(gr(y, 0()), x, p(y)))
     , cond4^#(false(), x, y) ->
       c_10(cond1^#(and(gr(x, 0()), gr(y, 0())), x, y))
     , gr^#(0(), x) -> c_4()
     , gr^#(s(x), 0()) -> c_5()
     , gr^#(s(x), s(y)) -> c_6(gr^#(x, y))
     , p^#(0()) -> c_11()
     , p^#(s(x)) -> c_12(x)
     , and^#(x, false()) -> c_13()
     , and^#(true(), true()) -> c_14()
     , and^#(false(), x) -> c_15() }
   Strict Trs:
     { cond1(true(), x, y) -> cond2(gr(x, y), x, y)
     , cond2(true(), x, y) -> cond3(gr(x, 0()), x, y)
     , cond2(false(), x, y) -> cond4(gr(y, 0()), x, y)
     , gr(0(), x) -> false()
     , gr(s(x), 0()) -> true()
     , gr(s(x), s(y)) -> gr(x, y)
     , cond3(true(), x, y) -> cond3(gr(x, 0()), p(x), y)
     , cond3(false(), x, y) -> cond1(and(gr(x, 0()), gr(y, 0())), x, y)
     , cond4(true(), x, y) -> cond4(gr(y, 0()), x, p(y))
     , cond4(false(), x, y) -> cond1(and(gr(x, 0()), gr(y, 0())), x, y)
     , p(0()) -> 0()
     , p(s(x)) -> x
     , and(x, false()) -> false()
     , and(true(), true()) -> true()
     , and(false(), x) -> false() }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   We estimate the number of application of {8,9,11,13,14,15} by
   applications of Pre({8,9,11,13,14,15}) = {10,12}. Here rules are
   labeled as follows:
   
     DPs:
       { 1: cond1^#(true(), x, y) -> c_1(cond2^#(gr(x, y), x, y))
       , 2: cond2^#(true(), x, y) -> c_2(cond3^#(gr(x, 0()), x, y))
       , 3: cond2^#(false(), x, y) -> c_3(cond4^#(gr(y, 0()), x, y))
       , 4: cond3^#(true(), x, y) -> c_7(cond3^#(gr(x, 0()), p(x), y))
       , 5: cond3^#(false(), x, y) ->
            c_8(cond1^#(and(gr(x, 0()), gr(y, 0())), x, y))
       , 6: cond4^#(true(), x, y) -> c_9(cond4^#(gr(y, 0()), x, p(y)))
       , 7: cond4^#(false(), x, y) ->
            c_10(cond1^#(and(gr(x, 0()), gr(y, 0())), x, y))
       , 8: gr^#(0(), x) -> c_4()
       , 9: gr^#(s(x), 0()) -> c_5()
       , 10: gr^#(s(x), s(y)) -> c_6(gr^#(x, y))
       , 11: p^#(0()) -> c_11()
       , 12: p^#(s(x)) -> c_12(x)
       , 13: and^#(x, false()) -> c_13()
       , 14: and^#(true(), true()) -> c_14()
       , 15: and^#(false(), x) -> c_15() }
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { cond1^#(true(), x, y) -> c_1(cond2^#(gr(x, y), x, y))
     , cond2^#(true(), x, y) -> c_2(cond3^#(gr(x, 0()), x, y))
     , cond2^#(false(), x, y) -> c_3(cond4^#(gr(y, 0()), x, y))
     , cond3^#(true(), x, y) -> c_7(cond3^#(gr(x, 0()), p(x), y))
     , cond3^#(false(), x, y) ->
       c_8(cond1^#(and(gr(x, 0()), gr(y, 0())), x, y))
     , cond4^#(true(), x, y) -> c_9(cond4^#(gr(y, 0()), x, p(y)))
     , cond4^#(false(), x, y) ->
       c_10(cond1^#(and(gr(x, 0()), gr(y, 0())), x, y))
     , gr^#(s(x), s(y)) -> c_6(gr^#(x, y))
     , p^#(s(x)) -> c_12(x) }
   Strict Trs:
     { cond1(true(), x, y) -> cond2(gr(x, y), x, y)
     , cond2(true(), x, y) -> cond3(gr(x, 0()), x, y)
     , cond2(false(), x, y) -> cond4(gr(y, 0()), x, y)
     , gr(0(), x) -> false()
     , gr(s(x), 0()) -> true()
     , gr(s(x), s(y)) -> gr(x, y)
     , cond3(true(), x, y) -> cond3(gr(x, 0()), p(x), y)
     , cond3(false(), x, y) -> cond1(and(gr(x, 0()), gr(y, 0())), x, y)
     , cond4(true(), x, y) -> cond4(gr(y, 0()), x, p(y))
     , cond4(false(), x, y) -> cond1(and(gr(x, 0()), gr(y, 0())), x, y)
     , p(0()) -> 0()
     , p(s(x)) -> x
     , and(x, false()) -> false()
     , and(true(), true()) -> true()
     , and(false(), x) -> false() }
   Weak DPs:
     { gr^#(0(), x) -> c_4()
     , gr^#(s(x), 0()) -> c_5()
     , p^#(0()) -> c_11()
     , and^#(x, false()) -> c_13()
     , and^#(true(), true()) -> c_14()
     , and^#(false(), x) -> c_15() }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..