*** 1 Progress [(O(1),O(n^1))]  ***
    Considered Problem:
      Strict DP Rules:
        
      Strict TRS Rules:
        f(x,g(x)) -> x
        f(x,h(y)) -> f(h(x),y)
      Weak DP Rules:
        
      Weak TRS Rules:
        
      Signature:
        {f/2} / {g/1,h/1}
      Obligation:
        Innermost
        basic terms: {f}/{g,h}
    Applied Processor:
      Bounds {initialAutomaton = minimal, enrichment = match}
    Proof:
      The problem is match-bounded by 1.
      The enriched problem is compatible with follwoing automaton.
        f_0(2,2) -> 1
        f_1(3,2) -> 1
        g_0(2) -> 1
        g_0(2) -> 2
        h_0(2) -> 1
        h_0(2) -> 2
        h_1(2) -> 1
        h_1(2) -> 3
        h_1(3) -> 1
        h_1(3) -> 3
        2 -> 1
        3 -> 1
*** 1.1 Progress [(O(1),O(1))]  ***
    Considered Problem:
      Strict DP Rules:
        
      Strict TRS Rules:
        
      Weak DP Rules:
        
      Weak TRS Rules:
        f(x,g(x)) -> x
        f(x,h(y)) -> f(h(x),y)
      Signature:
        {f/2} / {g/1,h/1}
      Obligation:
        Innermost
        basic terms: {f}/{g,h}
    Applied Processor:
      EmptyProcessor
    Proof:
      The problem is already closed. The intended complexity is O(1).