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