YES
* Step 1: FromIts YES
    + Considered Problem:
        Rules:
          0. f(A,B,C) -> g(1,1,C)              True          (1,1)
          1. g(A,B,C) -> g(A + B,A + B,-1 + C) [-1 + C >= 0] (?,1)
          2. g(A,B,C) -> h(A,B,C)              [0 >= C]      (?,1)
          3. h(A,B,C) -> h(A,-1 + B,C)         [-1 + B >= 0] (?,1)
        Signature:
          {(f,3);(g,3);(h,3)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{3},3->{3}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: Decompose YES
    + Considered Problem:
        Rules:
          f(A,B,C) -> g(1,1,C)               True
          g(A,B,C) -> g(A + B,A + B,-1 + C)  [-1 + C >= 0]
          g(A,B,C) -> h(A,B,C)               [0 >= C]
          h(A,B,C) -> h(A,-1 + B,C)          [-1 + B >= 0]
        Signature:
          {(f,3);(g,3);(h,3)}
        Rule Graph:
          [0->{1,2},1->{1,2},2->{3},3->{3}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3]
          |
          +- p:[1] c: [1]
          |
          `- p:[3] c: [3]
* Step 3: CloseWith YES
    + Considered Problem:
        (Rules:
          f(A,B,C) -> g(1,1,C)               True
          g(A,B,C) -> g(A + B,A + B,-1 + C)  [-1 + C >= 0]
          g(A,B,C) -> h(A,B,C)               [0 >= C]
          h(A,B,C) -> h(A,-1 + B,C)          [-1 + B >= 0]
        Signature:
          {(f,3);(g,3);(h,3)}
        Rule Graph:
          [0->{1,2},1->{1,2},2->{3},3->{3}]
        ,We construct a looptree:
          P: [0,1,2,3]
          |
          +- p:[1] c: [1]
          |
          `- p:[3] c: [3])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES