MAYBE
* Step 1: InnermostRuleRemoval MAYBE
    + Considered Problem:
        - Strict TRS:
            f(h(x)) -> f(i(x))
            f(i(x)) -> a()
            i(x) -> h(x)
        - Signature:
            {f/1,i/1} / {a/0,h/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,i} and constructors {a,h}
    + Applied Processor:
        InnermostRuleRemoval
    + Details:
        Arguments of following rules are not normal-forms.
          f(i(x)) -> a()
        All above mentioned rules can be savely removed.
* Step 2: DependencyPairs MAYBE
    + Considered Problem:
        - Strict TRS:
            f(h(x)) -> f(i(x))
            i(x) -> h(x)
        - Signature:
            {f/1,i/1} / {a/0,h/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,i} and constructors {a,h}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          f#(h(x)) -> c_1(f#(i(x)),i#(x))
          i#(x) -> c_2()
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 3: UsableRules MAYBE
    + Considered Problem:
        - Strict DPs:
            f#(h(x)) -> c_1(f#(i(x)),i#(x))
            i#(x) -> c_2()
        - Weak TRS:
            f(h(x)) -> f(i(x))
            i(x) -> h(x)
        - Signature:
            {f/1,i/1,f#/1,i#/1} / {a/0,h/1,c_1/2,c_2/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#,i#} and constructors {a,h}
    + Applied Processor:
        UsableRules
    + Details:
        We replace rewrite rules by usable rules:
          i(x) -> h(x)
          f#(h(x)) -> c_1(f#(i(x)),i#(x))
          i#(x) -> c_2()
* Step 4: PredecessorEstimation MAYBE
    + Considered Problem:
        - Strict DPs:
            f#(h(x)) -> c_1(f#(i(x)),i#(x))
            i#(x) -> c_2()
        - Weak TRS:
            i(x) -> h(x)
        - Signature:
            {f/1,i/1,f#/1,i#/1} / {a/0,h/1,c_1/2,c_2/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#,i#} and constructors {a,h}
    + Applied Processor:
        PredecessorEstimation {onSelection = all simple predecessor estimation selector}
    + Details:
        We estimate the number of application of
          {2}
        by application of
          Pre({2}) = {1}.
        Here rules are labelled as follows:
          1: f#(h(x)) -> c_1(f#(i(x)),i#(x))
          2: i#(x) -> c_2()
* Step 5: RemoveWeakSuffixes MAYBE
    + Considered Problem:
        - Strict DPs:
            f#(h(x)) -> c_1(f#(i(x)),i#(x))
        - Weak DPs:
            i#(x) -> c_2()
        - Weak TRS:
            i(x) -> h(x)
        - Signature:
            {f/1,i/1,f#/1,i#/1} / {a/0,h/1,c_1/2,c_2/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#,i#} and constructors {a,h}
    + Applied Processor:
        RemoveWeakSuffixes
    + Details:
        Consider the dependency graph
          1:S:f#(h(x)) -> c_1(f#(i(x)),i#(x))
             -->_2 i#(x) -> c_2():2
             -->_1 f#(h(x)) -> c_1(f#(i(x)),i#(x)):1
          
          2:W:i#(x) -> c_2()
             
          
        The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed.
          2: i#(x) -> c_2()
* Step 6: SimplifyRHS MAYBE
    + Considered Problem:
        - Strict DPs:
            f#(h(x)) -> c_1(f#(i(x)),i#(x))
        - Weak TRS:
            i(x) -> h(x)
        - Signature:
            {f/1,i/1,f#/1,i#/1} / {a/0,h/1,c_1/2,c_2/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#,i#} and constructors {a,h}
    + Applied Processor:
        SimplifyRHS
    + Details:
        Consider the dependency graph
          1:S:f#(h(x)) -> c_1(f#(i(x)),i#(x))
             -->_1 f#(h(x)) -> c_1(f#(i(x)),i#(x)):1
          
        Due to missing edges in the depndency graph, the right-hand sides of following rules could be simplified:
          f#(h(x)) -> c_1(f#(i(x)))
* Step 7: Failure MAYBE
  + Considered Problem:
      - Strict DPs:
          f#(h(x)) -> c_1(f#(i(x)))
      - Weak TRS:
          i(x) -> h(x)
      - Signature:
          {f/1,i/1,f#/1,i#/1} / {a/0,h/1,c_1/1,c_2/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {f#,i#} and constructors {a,h}
  + Applied Processor:
      EmptyProcessor
  + Details:
      The problem is still open.
MAYBE