YES
* Step 1: UnsatPaths YES
    + Considered Problem:
        Rules:
          0. f18(A,B,C,D,E,F) -> f18(A,1 + B,C,D,E,F) [A >= 1 + B] (?,1)
          1. f24(A,B,C,D,E,F) -> f24(A,1 + B,C,D,E,F) [A >= 1 + B] (?,1)
          2. f31(A,B,C,D,E,F) -> f31(A,1 + B,C,D,E,F) [A >= 1 + B] (?,1)
          3. f31(A,B,C,D,E,F) -> f39(A,B,C,D,E,F)     [B >= A]     (?,1)
          4. f24(A,B,C,D,E,F) -> f31(A,0,C,D,E,F)     [B >= A]     (?,1)
          5. f18(A,B,C,D,E,F) -> f24(A,0,C,D,E,F)     [B >= A]     (?,1)
          6. f0(A,B,C,D,E,F)  -> f18(10,0,10,G,10,H)  True         (1,1)
        Signature:
          {(f0,6);(f18,6);(f24,6);(f31,6);(f39,6)}
        Flow Graph:
          [0->{0,5},1->{1,4},2->{2,3},3->{},4->{2,3},5->{1,4},6->{0,5}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(6,5)]
* Step 2: FromIts YES
    + Considered Problem:
        Rules:
          0. f18(A,B,C,D,E,F) -> f18(A,1 + B,C,D,E,F) [A >= 1 + B] (?,1)
          1. f24(A,B,C,D,E,F) -> f24(A,1 + B,C,D,E,F) [A >= 1 + B] (?,1)
          2. f31(A,B,C,D,E,F) -> f31(A,1 + B,C,D,E,F) [A >= 1 + B] (?,1)
          3. f31(A,B,C,D,E,F) -> f39(A,B,C,D,E,F)     [B >= A]     (?,1)
          4. f24(A,B,C,D,E,F) -> f31(A,0,C,D,E,F)     [B >= A]     (?,1)
          5. f18(A,B,C,D,E,F) -> f24(A,0,C,D,E,F)     [B >= A]     (?,1)
          6. f0(A,B,C,D,E,F)  -> f18(10,0,10,G,10,H)  True         (1,1)
        Signature:
          {(f0,6);(f18,6);(f24,6);(f31,6);(f39,6)}
        Flow Graph:
          [0->{0,5},1->{1,4},2->{2,3},3->{},4->{2,3},5->{1,4},6->{0}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Decompose YES
    + Considered Problem:
        Rules:
          f18(A,B,C,D,E,F) -> f18(A,1 + B,C,D,E,F)  [A >= 1 + B]
          f24(A,B,C,D,E,F) -> f24(A,1 + B,C,D,E,F)  [A >= 1 + B]
          f31(A,B,C,D,E,F) -> f31(A,1 + B,C,D,E,F)  [A >= 1 + B]
          f31(A,B,C,D,E,F) -> f39(A,B,C,D,E,F)      [B >= A]
          f24(A,B,C,D,E,F) -> f31(A,0,C,D,E,F)      [B >= A]
          f18(A,B,C,D,E,F) -> f24(A,0,C,D,E,F)      [B >= A]
          f0(A,B,C,D,E,F)  -> f18(10,0,10,G,10,H)   True
        Signature:
          {(f0,6);(f18,6);(f24,6);(f31,6);(f39,6)}
        Rule Graph:
          [0->{0,5},1->{1,4},2->{2,3},3->{},4->{2,3},5->{1,4},6->{0}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5,6]
          |
          +- p:[0] c: [0]
          |
          +- p:[1] c: [1]
          |
          `- p:[2] c: [2]
* Step 4: CloseWith YES
    + Considered Problem:
        (Rules:
          f18(A,B,C,D,E,F) -> f18(A,1 + B,C,D,E,F)  [A >= 1 + B]
          f24(A,B,C,D,E,F) -> f24(A,1 + B,C,D,E,F)  [A >= 1 + B]
          f31(A,B,C,D,E,F) -> f31(A,1 + B,C,D,E,F)  [A >= 1 + B]
          f31(A,B,C,D,E,F) -> f39(A,B,C,D,E,F)      [B >= A]
          f24(A,B,C,D,E,F) -> f31(A,0,C,D,E,F)      [B >= A]
          f18(A,B,C,D,E,F) -> f24(A,0,C,D,E,F)      [B >= A]
          f0(A,B,C,D,E,F)  -> f18(10,0,10,G,10,H)   True
        Signature:
          {(f0,6);(f18,6);(f24,6);(f31,6);(f39,6)}
        Rule Graph:
          [0->{0,5},1->{1,4},2->{2,3},3->{},4->{2,3},5->{1,4},6->{0}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5,6]
          |
          +- p:[0] c: [0]
          |
          +- p:[1] c: [1]
          |
          `- p:[2] c: [2])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES