YES
* Step 1: TrivialSCCs YES
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G) -> f5(0,B,C,D,E,F,G)       True                 (1,1)
          1. f5(A,B,C,D,E,F,G) -> f5(1 + A,B,C,D,E,F,G)   [A >= 0 && 99 >= A]  (?,1)
          2. f5(A,B,C,D,E,F,G) -> f13(A,B,C,-2 + A,E,F,G) [A >= 0 && A >= 100] (?,1)
        Signature:
          {(f0,7);(f13,7);(f5,7)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths YES
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G) -> f5(0,B,C,D,E,F,G)       True                 (1,1)
          1. f5(A,B,C,D,E,F,G) -> f5(1 + A,B,C,D,E,F,G)   [A >= 0 && 99 >= A]  (?,1)
          2. f5(A,B,C,D,E,F,G) -> f13(A,B,C,-2 + A,E,F,G) [A >= 0 && A >= 100] (1,1)
        Signature:
          {(f0,7);(f13,7);(f5,7)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,2)]
* Step 3: Looptree YES
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G) -> f5(0,B,C,D,E,F,G)       True                 (1,1)
          1. f5(A,B,C,D,E,F,G) -> f5(1 + A,B,C,D,E,F,G)   [A >= 0 && 99 >= A]  (?,1)
          2. f5(A,B,C,D,E,F,G) -> f13(A,B,C,-2 + A,E,F,G) [A >= 0 && A >= 100] (1,1)
        Signature:
          {(f0,7);(f13,7);(f5,7)}
        Flow Graph:
          [0->{1},1->{1,2},2->{}]
        
    + Applied Processor:
        Looptree
    + Details:
        We construct a looptree:
          P: [0,1,2]
          |
          `- p:[1] c: [1]

YES