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

YES