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