MAYBE
* Step 1: DependencyPairs MAYBE
    + Considered Problem:
        - Strict TRS:
            f(x,a(b(y))) -> f(c(d(x)),y)
            f(c(x),y) -> f(x,a(y))
            f(d(x),y) -> f(x,b(y))
        - Signature:
            {f/2} / {a/1,b/1,c/1,d/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {a,b,c,d}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          f#(x,a(b(y))) -> c_1(f#(c(d(x)),y))
          f#(c(x),y) -> c_2(f#(x,a(y)))
          f#(d(x),y) -> c_3(f#(x,b(y)))
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 2: UsableRules MAYBE
    + Considered Problem:
        - Strict DPs:
            f#(x,a(b(y))) -> c_1(f#(c(d(x)),y))
            f#(c(x),y) -> c_2(f#(x,a(y)))
            f#(d(x),y) -> c_3(f#(x,b(y)))
        - Weak TRS:
            f(x,a(b(y))) -> f(c(d(x)),y)
            f(c(x),y) -> f(x,a(y))
            f(d(x),y) -> f(x,b(y))
        - Signature:
            {f/2,f#/2} / {a/1,b/1,c/1,d/1,c_1/1,c_2/1,c_3/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#} and constructors {a,b,c,d}
    + Applied Processor:
        UsableRules
    + Details:
        We replace rewrite rules by usable rules:
          f#(x,a(b(y))) -> c_1(f#(c(d(x)),y))
          f#(c(x),y) -> c_2(f#(x,a(y)))
          f#(d(x),y) -> c_3(f#(x,b(y)))
* Step 3: Failure MAYBE
  + Considered Problem:
      - Strict DPs:
          f#(x,a(b(y))) -> c_1(f#(c(d(x)),y))
          f#(c(x),y) -> c_2(f#(x,a(y)))
          f#(d(x),y) -> c_3(f#(x,b(y)))
      - Signature:
          {f/2,f#/2} / {a/1,b/1,c/1,d/1,c_1/1,c_2/1,c_3/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {f#} and constructors {a,b,c,d}
  + Applied Processor:
      EmptyProcessor
  + Details:
      The problem is still open.
MAYBE