*** 1 Progress [(O(1),O(n^1))]  ***
    Considered Problem:
      Strict DP Rules:
        
      Strict TRS Rules:
        minus(f(x,y)) -> f(minus(y),minus(x))
        minus(h(x)) -> h(minus(x))
        minus(minus(x)) -> x
      Weak DP Rules:
        
      Weak TRS Rules:
        
      Signature:
        {minus/1} / {f/2,h/1}
      Obligation:
        Full
        basic terms: {minus}/{f,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) -> 2
        f_1(3,4) -> 1
        f_1(4,4) -> 3
        f_1(4,4) -> 4
        h_0(2) -> 2
        h_1(4) -> 1
        h_1(4) -> 3
        h_1(4) -> 4
        minus_0(2) -> 1
        minus_1(2) -> 3
        minus_1(2) -> 4
*** 1.1 Progress [(O(1),O(1))]  ***
    Considered Problem:
      Strict DP Rules:
        
      Strict TRS Rules:
        
      Weak DP Rules:
        
      Weak TRS Rules:
        minus(f(x,y)) -> f(minus(y),minus(x))
        minus(h(x)) -> h(minus(x))
        minus(minus(x)) -> x
      Signature:
        {minus/1} / {f/2,h/1}
      Obligation:
        Full
        basic terms: {minus}/{f,h}
    Applied Processor:
      EmptyProcessor
    Proof:
      The problem is already closed. The intended complexity is O(1).