MAYBE

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

Strict Trs:
  { a__a() -> a__c()
  , a__a() -> a__d()
  , a__a() -> a()
  , a__c() -> e()
  , a__c() -> l()
  , a__c() -> c()
  , a__b() -> a__c()
  , a__b() -> a__d()
  , a__b() -> b()
  , a__k() -> l()
  , a__k() -> m()
  , a__k() -> k()
  , a__d() -> m()
  , a__d() -> d()
  , a__A() -> a__h(a__f(a__a()), a__f(a__b()))
  , a__A() -> A()
  , a__h(X, X) -> a__g(mark(X), mark(X), a__f(a__k()))
  , a__h(X1, X2) -> h(X1, X2)
  , a__f(X) -> a__z(mark(X), X)
  , a__f(X) -> f(X)
  , a__g(X1, X2, X3) -> g(X1, X2, X3)
  , a__g(d(), X, X) -> a__A()
  , mark(e()) -> e()
  , mark(l()) -> l()
  , mark(m()) -> m()
  , mark(d()) -> a__d()
  , mark(A()) -> a__A()
  , mark(a()) -> a__a()
  , mark(b()) -> a__b()
  , mark(c()) -> a__c()
  , mark(k()) -> a__k()
  , mark(z(X1, X2)) -> a__z(mark(X1), X2)
  , mark(f(X)) -> a__f(mark(X))
  , mark(h(X1, X2)) -> a__h(mark(X1), mark(X2))
  , mark(g(X1, X2, X3)) -> a__g(mark(X1), mark(X2), mark(X3))
  , a__z(X1, X2) -> z(X1, X2)
  , a__z(e(), X) -> mark(X) }
Obligation:
  runtime complexity
Answer:
  MAYBE

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 processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
      2) '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
      
   
   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.
      
   

3) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed
   due to the following reason:
   
   We add the following weak dependency pairs:
   
   Strict DPs:
     { a__a^#() -> c_1(a__c^#())
     , a__a^#() -> c_2(a__d^#())
     , a__a^#() -> c_3()
     , a__c^#() -> c_4()
     , a__c^#() -> c_5()
     , a__c^#() -> c_6()
     , a__d^#() -> c_13()
     , a__d^#() -> c_14()
     , a__b^#() -> c_7(a__c^#())
     , a__b^#() -> c_8(a__d^#())
     , a__b^#() -> c_9()
     , a__k^#() -> c_10()
     , a__k^#() -> c_11()
     , a__k^#() -> c_12()
     , a__A^#() -> c_15(a__h^#(a__f(a__a()), a__f(a__b())))
     , a__A^#() -> c_16()
     , a__h^#(X, X) -> c_17(a__g^#(mark(X), mark(X), a__f(a__k())))
     , a__h^#(X1, X2) -> c_18(X1, X2)
     , a__g^#(X1, X2, X3) -> c_21(X1, X2, X3)
     , a__g^#(d(), X, X) -> c_22(a__A^#())
     , a__f^#(X) -> c_19(a__z^#(mark(X), X))
     , a__f^#(X) -> c_20(X)
     , a__z^#(X1, X2) -> c_36(X1, X2)
     , a__z^#(e(), X) -> c_37(mark^#(X))
     , mark^#(e()) -> c_23()
     , mark^#(l()) -> c_24()
     , mark^#(m()) -> c_25()
     , mark^#(d()) -> c_26(a__d^#())
     , mark^#(A()) -> c_27(a__A^#())
     , mark^#(a()) -> c_28(a__a^#())
     , mark^#(b()) -> c_29(a__b^#())
     , mark^#(c()) -> c_30(a__c^#())
     , mark^#(k()) -> c_31(a__k^#())
     , mark^#(z(X1, X2)) -> c_32(a__z^#(mark(X1), X2))
     , mark^#(f(X)) -> c_33(a__f^#(mark(X)))
     , mark^#(h(X1, X2)) -> c_34(a__h^#(mark(X1), mark(X2)))
     , mark^#(g(X1, X2, X3)) ->
       c_35(a__g^#(mark(X1), mark(X2), mark(X3))) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { a__a^#() -> c_1(a__c^#())
     , a__a^#() -> c_2(a__d^#())
     , a__a^#() -> c_3()
     , a__c^#() -> c_4()
     , a__c^#() -> c_5()
     , a__c^#() -> c_6()
     , a__d^#() -> c_13()
     , a__d^#() -> c_14()
     , a__b^#() -> c_7(a__c^#())
     , a__b^#() -> c_8(a__d^#())
     , a__b^#() -> c_9()
     , a__k^#() -> c_10()
     , a__k^#() -> c_11()
     , a__k^#() -> c_12()
     , a__A^#() -> c_15(a__h^#(a__f(a__a()), a__f(a__b())))
     , a__A^#() -> c_16()
     , a__h^#(X, X) -> c_17(a__g^#(mark(X), mark(X), a__f(a__k())))
     , a__h^#(X1, X2) -> c_18(X1, X2)
     , a__g^#(X1, X2, X3) -> c_21(X1, X2, X3)
     , a__g^#(d(), X, X) -> c_22(a__A^#())
     , a__f^#(X) -> c_19(a__z^#(mark(X), X))
     , a__f^#(X) -> c_20(X)
     , a__z^#(X1, X2) -> c_36(X1, X2)
     , a__z^#(e(), X) -> c_37(mark^#(X))
     , mark^#(e()) -> c_23()
     , mark^#(l()) -> c_24()
     , mark^#(m()) -> c_25()
     , mark^#(d()) -> c_26(a__d^#())
     , mark^#(A()) -> c_27(a__A^#())
     , mark^#(a()) -> c_28(a__a^#())
     , mark^#(b()) -> c_29(a__b^#())
     , mark^#(c()) -> c_30(a__c^#())
     , mark^#(k()) -> c_31(a__k^#())
     , mark^#(z(X1, X2)) -> c_32(a__z^#(mark(X1), X2))
     , mark^#(f(X)) -> c_33(a__f^#(mark(X)))
     , mark^#(h(X1, X2)) -> c_34(a__h^#(mark(X1), mark(X2)))
     , mark^#(g(X1, X2, X3)) ->
       c_35(a__g^#(mark(X1), mark(X2), mark(X3))) }
   Strict Trs:
     { a__a() -> a__c()
     , a__a() -> a__d()
     , a__a() -> a()
     , a__c() -> e()
     , a__c() -> l()
     , a__c() -> c()
     , a__b() -> a__c()
     , a__b() -> a__d()
     , a__b() -> b()
     , a__k() -> l()
     , a__k() -> m()
     , a__k() -> k()
     , a__d() -> m()
     , a__d() -> d()
     , a__A() -> a__h(a__f(a__a()), a__f(a__b()))
     , a__A() -> A()
     , a__h(X, X) -> a__g(mark(X), mark(X), a__f(a__k()))
     , a__h(X1, X2) -> h(X1, X2)
     , a__f(X) -> a__z(mark(X), X)
     , a__f(X) -> f(X)
     , a__g(X1, X2, X3) -> g(X1, X2, X3)
     , a__g(d(), X, X) -> a__A()
     , mark(e()) -> e()
     , mark(l()) -> l()
     , mark(m()) -> m()
     , mark(d()) -> a__d()
     , mark(A()) -> a__A()
     , mark(a()) -> a__a()
     , mark(b()) -> a__b()
     , mark(c()) -> a__c()
     , mark(k()) -> a__k()
     , mark(z(X1, X2)) -> a__z(mark(X1), X2)
     , mark(f(X)) -> a__f(mark(X))
     , mark(h(X1, X2)) -> a__h(mark(X1), mark(X2))
     , mark(g(X1, X2, X3)) -> a__g(mark(X1), mark(X2), mark(X3))
     , a__z(X1, X2) -> z(X1, X2)
     , a__z(e(), X) -> mark(X) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   We estimate the number of application of
   {3,4,5,6,7,8,11,12,13,14,16,25,26,27} by applications of
   Pre({3,4,5,6,7,8,11,12,13,14,16,25,26,27}) =
   {1,2,9,10,18,19,20,22,23,24,28,29,30,31,32,33}. Here rules are
   labeled as follows:
   
     DPs:
       { 1: a__a^#() -> c_1(a__c^#())
       , 2: a__a^#() -> c_2(a__d^#())
       , 3: a__a^#() -> c_3()
       , 4: a__c^#() -> c_4()
       , 5: a__c^#() -> c_5()
       , 6: a__c^#() -> c_6()
       , 7: a__d^#() -> c_13()
       , 8: a__d^#() -> c_14()
       , 9: a__b^#() -> c_7(a__c^#())
       , 10: a__b^#() -> c_8(a__d^#())
       , 11: a__b^#() -> c_9()
       , 12: a__k^#() -> c_10()
       , 13: a__k^#() -> c_11()
       , 14: a__k^#() -> c_12()
       , 15: a__A^#() -> c_15(a__h^#(a__f(a__a()), a__f(a__b())))
       , 16: a__A^#() -> c_16()
       , 17: a__h^#(X, X) -> c_17(a__g^#(mark(X), mark(X), a__f(a__k())))
       , 18: a__h^#(X1, X2) -> c_18(X1, X2)
       , 19: a__g^#(X1, X2, X3) -> c_21(X1, X2, X3)
       , 20: a__g^#(d(), X, X) -> c_22(a__A^#())
       , 21: a__f^#(X) -> c_19(a__z^#(mark(X), X))
       , 22: a__f^#(X) -> c_20(X)
       , 23: a__z^#(X1, X2) -> c_36(X1, X2)
       , 24: a__z^#(e(), X) -> c_37(mark^#(X))
       , 25: mark^#(e()) -> c_23()
       , 26: mark^#(l()) -> c_24()
       , 27: mark^#(m()) -> c_25()
       , 28: mark^#(d()) -> c_26(a__d^#())
       , 29: mark^#(A()) -> c_27(a__A^#())
       , 30: mark^#(a()) -> c_28(a__a^#())
       , 31: mark^#(b()) -> c_29(a__b^#())
       , 32: mark^#(c()) -> c_30(a__c^#())
       , 33: mark^#(k()) -> c_31(a__k^#())
       , 34: mark^#(z(X1, X2)) -> c_32(a__z^#(mark(X1), X2))
       , 35: mark^#(f(X)) -> c_33(a__f^#(mark(X)))
       , 36: mark^#(h(X1, X2)) -> c_34(a__h^#(mark(X1), mark(X2)))
       , 37: mark^#(g(X1, X2, X3)) ->
             c_35(a__g^#(mark(X1), mark(X2), mark(X3))) }
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { a__a^#() -> c_1(a__c^#())
     , a__a^#() -> c_2(a__d^#())
     , a__b^#() -> c_7(a__c^#())
     , a__b^#() -> c_8(a__d^#())
     , a__A^#() -> c_15(a__h^#(a__f(a__a()), a__f(a__b())))
     , a__h^#(X, X) -> c_17(a__g^#(mark(X), mark(X), a__f(a__k())))
     , a__h^#(X1, X2) -> c_18(X1, X2)
     , a__g^#(X1, X2, X3) -> c_21(X1, X2, X3)
     , a__g^#(d(), X, X) -> c_22(a__A^#())
     , a__f^#(X) -> c_19(a__z^#(mark(X), X))
     , a__f^#(X) -> c_20(X)
     , a__z^#(X1, X2) -> c_36(X1, X2)
     , a__z^#(e(), X) -> c_37(mark^#(X))
     , mark^#(d()) -> c_26(a__d^#())
     , mark^#(A()) -> c_27(a__A^#())
     , mark^#(a()) -> c_28(a__a^#())
     , mark^#(b()) -> c_29(a__b^#())
     , mark^#(c()) -> c_30(a__c^#())
     , mark^#(k()) -> c_31(a__k^#())
     , mark^#(z(X1, X2)) -> c_32(a__z^#(mark(X1), X2))
     , mark^#(f(X)) -> c_33(a__f^#(mark(X)))
     , mark^#(h(X1, X2)) -> c_34(a__h^#(mark(X1), mark(X2)))
     , mark^#(g(X1, X2, X3)) ->
       c_35(a__g^#(mark(X1), mark(X2), mark(X3))) }
   Strict Trs:
     { a__a() -> a__c()
     , a__a() -> a__d()
     , a__a() -> a()
     , a__c() -> e()
     , a__c() -> l()
     , a__c() -> c()
     , a__b() -> a__c()
     , a__b() -> a__d()
     , a__b() -> b()
     , a__k() -> l()
     , a__k() -> m()
     , a__k() -> k()
     , a__d() -> m()
     , a__d() -> d()
     , a__A() -> a__h(a__f(a__a()), a__f(a__b()))
     , a__A() -> A()
     , a__h(X, X) -> a__g(mark(X), mark(X), a__f(a__k()))
     , a__h(X1, X2) -> h(X1, X2)
     , a__f(X) -> a__z(mark(X), X)
     , a__f(X) -> f(X)
     , a__g(X1, X2, X3) -> g(X1, X2, X3)
     , a__g(d(), X, X) -> a__A()
     , mark(e()) -> e()
     , mark(l()) -> l()
     , mark(m()) -> m()
     , mark(d()) -> a__d()
     , mark(A()) -> a__A()
     , mark(a()) -> a__a()
     , mark(b()) -> a__b()
     , mark(c()) -> a__c()
     , mark(k()) -> a__k()
     , mark(z(X1, X2)) -> a__z(mark(X1), X2)
     , mark(f(X)) -> a__f(mark(X))
     , mark(h(X1, X2)) -> a__h(mark(X1), mark(X2))
     , mark(g(X1, X2, X3)) -> a__g(mark(X1), mark(X2), mark(X3))
     , a__z(X1, X2) -> z(X1, X2)
     , a__z(e(), X) -> mark(X) }
   Weak DPs:
     { a__a^#() -> c_3()
     , a__c^#() -> c_4()
     , a__c^#() -> c_5()
     , a__c^#() -> c_6()
     , a__d^#() -> c_13()
     , a__d^#() -> c_14()
     , a__b^#() -> c_9()
     , a__k^#() -> c_10()
     , a__k^#() -> c_11()
     , a__k^#() -> c_12()
     , a__A^#() -> c_16()
     , mark^#(e()) -> c_23()
     , mark^#(l()) -> c_24()
     , mark^#(m()) -> c_25() }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   We estimate the number of application of {1,2,3,4,14,18,19} by
   applications of Pre({1,2,3,4,14,18,19}) = {7,8,11,12,13,16,17}.
   Here rules are labeled as follows:
   
     DPs:
       { 1: a__a^#() -> c_1(a__c^#())
       , 2: a__a^#() -> c_2(a__d^#())
       , 3: a__b^#() -> c_7(a__c^#())
       , 4: a__b^#() -> c_8(a__d^#())
       , 5: a__A^#() -> c_15(a__h^#(a__f(a__a()), a__f(a__b())))
       , 6: a__h^#(X, X) -> c_17(a__g^#(mark(X), mark(X), a__f(a__k())))
       , 7: a__h^#(X1, X2) -> c_18(X1, X2)
       , 8: a__g^#(X1, X2, X3) -> c_21(X1, X2, X3)
       , 9: a__g^#(d(), X, X) -> c_22(a__A^#())
       , 10: a__f^#(X) -> c_19(a__z^#(mark(X), X))
       , 11: a__f^#(X) -> c_20(X)
       , 12: a__z^#(X1, X2) -> c_36(X1, X2)
       , 13: a__z^#(e(), X) -> c_37(mark^#(X))
       , 14: mark^#(d()) -> c_26(a__d^#())
       , 15: mark^#(A()) -> c_27(a__A^#())
       , 16: mark^#(a()) -> c_28(a__a^#())
       , 17: mark^#(b()) -> c_29(a__b^#())
       , 18: mark^#(c()) -> c_30(a__c^#())
       , 19: mark^#(k()) -> c_31(a__k^#())
       , 20: mark^#(z(X1, X2)) -> c_32(a__z^#(mark(X1), X2))
       , 21: mark^#(f(X)) -> c_33(a__f^#(mark(X)))
       , 22: mark^#(h(X1, X2)) -> c_34(a__h^#(mark(X1), mark(X2)))
       , 23: mark^#(g(X1, X2, X3)) ->
             c_35(a__g^#(mark(X1), mark(X2), mark(X3)))
       , 24: a__a^#() -> c_3()
       , 25: a__c^#() -> c_4()
       , 26: a__c^#() -> c_5()
       , 27: a__c^#() -> c_6()
       , 28: a__d^#() -> c_13()
       , 29: a__d^#() -> c_14()
       , 30: a__b^#() -> c_9()
       , 31: a__k^#() -> c_10()
       , 32: a__k^#() -> c_11()
       , 33: a__k^#() -> c_12()
       , 34: a__A^#() -> c_16()
       , 35: mark^#(e()) -> c_23()
       , 36: mark^#(l()) -> c_24()
       , 37: mark^#(m()) -> c_25() }
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { a__A^#() -> c_15(a__h^#(a__f(a__a()), a__f(a__b())))
     , a__h^#(X, X) -> c_17(a__g^#(mark(X), mark(X), a__f(a__k())))
     , a__h^#(X1, X2) -> c_18(X1, X2)
     , a__g^#(X1, X2, X3) -> c_21(X1, X2, X3)
     , a__g^#(d(), X, X) -> c_22(a__A^#())
     , a__f^#(X) -> c_19(a__z^#(mark(X), X))
     , a__f^#(X) -> c_20(X)
     , a__z^#(X1, X2) -> c_36(X1, X2)
     , a__z^#(e(), X) -> c_37(mark^#(X))
     , mark^#(A()) -> c_27(a__A^#())
     , mark^#(a()) -> c_28(a__a^#())
     , mark^#(b()) -> c_29(a__b^#())
     , mark^#(z(X1, X2)) -> c_32(a__z^#(mark(X1), X2))
     , mark^#(f(X)) -> c_33(a__f^#(mark(X)))
     , mark^#(h(X1, X2)) -> c_34(a__h^#(mark(X1), mark(X2)))
     , mark^#(g(X1, X2, X3)) ->
       c_35(a__g^#(mark(X1), mark(X2), mark(X3))) }
   Strict Trs:
     { a__a() -> a__c()
     , a__a() -> a__d()
     , a__a() -> a()
     , a__c() -> e()
     , a__c() -> l()
     , a__c() -> c()
     , a__b() -> a__c()
     , a__b() -> a__d()
     , a__b() -> b()
     , a__k() -> l()
     , a__k() -> m()
     , a__k() -> k()
     , a__d() -> m()
     , a__d() -> d()
     , a__A() -> a__h(a__f(a__a()), a__f(a__b()))
     , a__A() -> A()
     , a__h(X, X) -> a__g(mark(X), mark(X), a__f(a__k()))
     , a__h(X1, X2) -> h(X1, X2)
     , a__f(X) -> a__z(mark(X), X)
     , a__f(X) -> f(X)
     , a__g(X1, X2, X3) -> g(X1, X2, X3)
     , a__g(d(), X, X) -> a__A()
     , mark(e()) -> e()
     , mark(l()) -> l()
     , mark(m()) -> m()
     , mark(d()) -> a__d()
     , mark(A()) -> a__A()
     , mark(a()) -> a__a()
     , mark(b()) -> a__b()
     , mark(c()) -> a__c()
     , mark(k()) -> a__k()
     , mark(z(X1, X2)) -> a__z(mark(X1), X2)
     , mark(f(X)) -> a__f(mark(X))
     , mark(h(X1, X2)) -> a__h(mark(X1), mark(X2))
     , mark(g(X1, X2, X3)) -> a__g(mark(X1), mark(X2), mark(X3))
     , a__z(X1, X2) -> z(X1, X2)
     , a__z(e(), X) -> mark(X) }
   Weak DPs:
     { a__a^#() -> c_1(a__c^#())
     , a__a^#() -> c_2(a__d^#())
     , a__a^#() -> c_3()
     , a__c^#() -> c_4()
     , a__c^#() -> c_5()
     , a__c^#() -> c_6()
     , a__d^#() -> c_13()
     , a__d^#() -> c_14()
     , a__b^#() -> c_7(a__c^#())
     , a__b^#() -> c_8(a__d^#())
     , a__b^#() -> c_9()
     , a__k^#() -> c_10()
     , a__k^#() -> c_11()
     , a__k^#() -> c_12()
     , a__A^#() -> c_16()
     , mark^#(e()) -> c_23()
     , mark^#(l()) -> c_24()
     , mark^#(m()) -> c_25()
     , mark^#(d()) -> c_26(a__d^#())
     , mark^#(c()) -> c_30(a__c^#())
     , mark^#(k()) -> c_31(a__k^#()) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   We estimate the number of application of {11,12} by applications of
   Pre({11,12}) = {3,4,7,8,9}. Here rules are labeled as follows:
   
     DPs:
       { 1: a__A^#() -> c_15(a__h^#(a__f(a__a()), a__f(a__b())))
       , 2: a__h^#(X, X) -> c_17(a__g^#(mark(X), mark(X), a__f(a__k())))
       , 3: a__h^#(X1, X2) -> c_18(X1, X2)
       , 4: a__g^#(X1, X2, X3) -> c_21(X1, X2, X3)
       , 5: a__g^#(d(), X, X) -> c_22(a__A^#())
       , 6: a__f^#(X) -> c_19(a__z^#(mark(X), X))
       , 7: a__f^#(X) -> c_20(X)
       , 8: a__z^#(X1, X2) -> c_36(X1, X2)
       , 9: a__z^#(e(), X) -> c_37(mark^#(X))
       , 10: mark^#(A()) -> c_27(a__A^#())
       , 11: mark^#(a()) -> c_28(a__a^#())
       , 12: mark^#(b()) -> c_29(a__b^#())
       , 13: mark^#(z(X1, X2)) -> c_32(a__z^#(mark(X1), X2))
       , 14: mark^#(f(X)) -> c_33(a__f^#(mark(X)))
       , 15: mark^#(h(X1, X2)) -> c_34(a__h^#(mark(X1), mark(X2)))
       , 16: mark^#(g(X1, X2, X3)) ->
             c_35(a__g^#(mark(X1), mark(X2), mark(X3)))
       , 17: a__a^#() -> c_1(a__c^#())
       , 18: a__a^#() -> c_2(a__d^#())
       , 19: a__a^#() -> c_3()
       , 20: a__c^#() -> c_4()
       , 21: a__c^#() -> c_5()
       , 22: a__c^#() -> c_6()
       , 23: a__d^#() -> c_13()
       , 24: a__d^#() -> c_14()
       , 25: a__b^#() -> c_7(a__c^#())
       , 26: a__b^#() -> c_8(a__d^#())
       , 27: a__b^#() -> c_9()
       , 28: a__k^#() -> c_10()
       , 29: a__k^#() -> c_11()
       , 30: a__k^#() -> c_12()
       , 31: a__A^#() -> c_16()
       , 32: mark^#(e()) -> c_23()
       , 33: mark^#(l()) -> c_24()
       , 34: mark^#(m()) -> c_25()
       , 35: mark^#(d()) -> c_26(a__d^#())
       , 36: mark^#(c()) -> c_30(a__c^#())
       , 37: mark^#(k()) -> c_31(a__k^#()) }
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { a__A^#() -> c_15(a__h^#(a__f(a__a()), a__f(a__b())))
     , a__h^#(X, X) -> c_17(a__g^#(mark(X), mark(X), a__f(a__k())))
     , a__h^#(X1, X2) -> c_18(X1, X2)
     , a__g^#(X1, X2, X3) -> c_21(X1, X2, X3)
     , a__g^#(d(), X, X) -> c_22(a__A^#())
     , a__f^#(X) -> c_19(a__z^#(mark(X), X))
     , a__f^#(X) -> c_20(X)
     , a__z^#(X1, X2) -> c_36(X1, X2)
     , a__z^#(e(), X) -> c_37(mark^#(X))
     , mark^#(A()) -> c_27(a__A^#())
     , mark^#(z(X1, X2)) -> c_32(a__z^#(mark(X1), X2))
     , mark^#(f(X)) -> c_33(a__f^#(mark(X)))
     , mark^#(h(X1, X2)) -> c_34(a__h^#(mark(X1), mark(X2)))
     , mark^#(g(X1, X2, X3)) ->
       c_35(a__g^#(mark(X1), mark(X2), mark(X3))) }
   Strict Trs:
     { a__a() -> a__c()
     , a__a() -> a__d()
     , a__a() -> a()
     , a__c() -> e()
     , a__c() -> l()
     , a__c() -> c()
     , a__b() -> a__c()
     , a__b() -> a__d()
     , a__b() -> b()
     , a__k() -> l()
     , a__k() -> m()
     , a__k() -> k()
     , a__d() -> m()
     , a__d() -> d()
     , a__A() -> a__h(a__f(a__a()), a__f(a__b()))
     , a__A() -> A()
     , a__h(X, X) -> a__g(mark(X), mark(X), a__f(a__k()))
     , a__h(X1, X2) -> h(X1, X2)
     , a__f(X) -> a__z(mark(X), X)
     , a__f(X) -> f(X)
     , a__g(X1, X2, X3) -> g(X1, X2, X3)
     , a__g(d(), X, X) -> a__A()
     , mark(e()) -> e()
     , mark(l()) -> l()
     , mark(m()) -> m()
     , mark(d()) -> a__d()
     , mark(A()) -> a__A()
     , mark(a()) -> a__a()
     , mark(b()) -> a__b()
     , mark(c()) -> a__c()
     , mark(k()) -> a__k()
     , mark(z(X1, X2)) -> a__z(mark(X1), X2)
     , mark(f(X)) -> a__f(mark(X))
     , mark(h(X1, X2)) -> a__h(mark(X1), mark(X2))
     , mark(g(X1, X2, X3)) -> a__g(mark(X1), mark(X2), mark(X3))
     , a__z(X1, X2) -> z(X1, X2)
     , a__z(e(), X) -> mark(X) }
   Weak DPs:
     { a__a^#() -> c_1(a__c^#())
     , a__a^#() -> c_2(a__d^#())
     , a__a^#() -> c_3()
     , a__c^#() -> c_4()
     , a__c^#() -> c_5()
     , a__c^#() -> c_6()
     , a__d^#() -> c_13()
     , a__d^#() -> c_14()
     , a__b^#() -> c_7(a__c^#())
     , a__b^#() -> c_8(a__d^#())
     , a__b^#() -> c_9()
     , a__k^#() -> c_10()
     , a__k^#() -> c_11()
     , a__k^#() -> c_12()
     , a__A^#() -> c_16()
     , mark^#(e()) -> c_23()
     , mark^#(l()) -> c_24()
     , mark^#(m()) -> c_25()
     , mark^#(d()) -> c_26(a__d^#())
     , mark^#(a()) -> c_28(a__a^#())
     , mark^#(b()) -> c_29(a__b^#())
     , mark^#(c()) -> c_30(a__c^#())
     , mark^#(k()) -> c_31(a__k^#()) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..