* Step 1: DependencyPairs WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            a(b(x)) -> a(c(b(x)))
        - Signature:
            {a/1} / {b/1,c/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a} and constructors {b,c}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          a#(b(x)) -> c_1(a#(c(b(x))))
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 2: UsableRules WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            a#(b(x)) -> c_1(a#(c(b(x))))
        - Weak TRS:
            a(b(x)) -> a(c(b(x)))
        - Signature:
            {a/1,a#/1} / {b/1,c/1,c_1/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a#} and constructors {b,c}
    + Applied Processor:
        UsableRules
    + Details:
        We replace rewrite rules by usable rules:
          a#(b(x)) -> c_1(a#(c(b(x))))
* Step 3: Trivial WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            a#(b(x)) -> c_1(a#(c(b(x))))
        - Signature:
            {a/1,a#/1} / {b/1,c/1,c_1/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a#} and constructors {b,c}
    + Applied Processor:
        Trivial
    + Details:
        Consider the dependency graph
          1:S:a#(b(x)) -> c_1(a#(c(b(x))))
             
          
        The dependency graph contains no loops, we remove all dependency pairs.
* Step 4: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        
        - Signature:
            {a/1,a#/1} / {b/1,c/1,c_1/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a#} and constructors {b,c}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(1))