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