YES
* Step 1: FromIts YES
    + Considered Problem:
        Rules:
          0. start(A,B,C,D,E,F,G,H)  -> stop(A,B,C,D,E,F,G,H)           [A >= 101 && B = C && D = E && F = A && G = H]           (?,1)
          1. start(A,B,C,D,E,F,G,H)  -> stop(A,B,C,D,E,F,G,H)           [E >= 1 + C && B = C && D = E && F = A && G = H]         (?,1)
          2. start(A,B,C,D,E,F,G,H)  -> lbl72(A,-1 + B,C,1 + F,E,D,F,H) [C >= E && 100 >= A && B = C && D = E && F = A && G = H] (?,1)
          3. lbl72(A,B,C,D,E,F,G,H)  -> stop(A,B,C,D,E,F,G,H)           [F >= 101                                                (?,1)
                                                                         && 100 >= A                                                  
                                                                         && 101 + B + F >= A + C + E                                  
                                                                         && 1 + B >= F                                                
                                                                         && C >= 1 + B                                                
                                                                         && C >= E                                                    
                                                                         && 1 + B + F + G = A + C + E                                 
                                                                         && B + D + F = A + C + E]                                    
          4. lbl72(A,B,C,D,E,F,G,H)  -> stop(A,B,C,D,E,F,G,H)           [A + C + E >= 1 + 2*B + F                                (?,1)
                                                                         && 100 >= A                                                  
                                                                         && 101 + B + F >= A + C + E                                  
                                                                         && 1 + B >= F                                                
                                                                         && C >= 1 + B                                                
                                                                         && C >= E                                                    
                                                                         && 1 + B + F + G = A + C + E                                 
                                                                         && B + D + F = A + C + E]                                    
          5. lbl72(A,B,C,D,E,F,G,H)  -> lbl72(A,-1 + B,C,1 + F,E,D,F,H) [2*B + F >= A + C + E                                    (?,1)
                                                                         && 100 >= F                                                  
                                                                         && 100 >= A                                                  
                                                                         && 101 + B + F >= A + C + E                                  
                                                                         && 1 + B >= F                                                
                                                                         && C >= 1 + B                                                
                                                                         && C >= E                                                    
                                                                         && 1 + B + F + G = A + C + E                                 
                                                                         && B + D + F = A + C + E]                                    
          6. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,A,H,H)          True                                                     (1,1)
        Signature:
          {(lbl72,8);(start,8);(start0,8);(stop,8)}
        Flow Graph:
          [0->{},1->{},2->{3,4,5},3->{},4->{},5->{3,4,5},6->{0,1,2}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: Decompose YES
    + Considered Problem:
        Rules:
          start(A,B,C,D,E,F,G,H)  -> stop(A,B,C,D,E,F,G,H)            [A >= 101 && B = C && D = E && F = A && G = H]
          start(A,B,C,D,E,F,G,H)  -> stop(A,B,C,D,E,F,G,H)            [E >= 1 + C && B = C && D = E && F = A && G = H]
          start(A,B,C,D,E,F,G,H)  -> lbl72(A,-1 + B,C,1 + F,E,D,F,H)  [C >= E
                                                                       && 100 >= A
                                                                       && B = C
                                                                       && D = E
                                                                       && F = A
                                                                       && G = H]
          lbl72(A,B,C,D,E,F,G,H)  -> stop(A,B,C,D,E,F,G,H)            [F >= 101
                                                                       && 100 >= A
                                                                       && 101 + B + F >= A + C + E
                                                                       && 1 + B >= F
                                                                       && C >= 1 + B
                                                                       && C >= E
                                                                       && 1 + B + F + G = A + C + E
                                                                       && B + D + F = A + C + E]
          lbl72(A,B,C,D,E,F,G,H)  -> stop(A,B,C,D,E,F,G,H)            [A + C + E >= 1 + 2*B + F
                                                                       && 100 >= A
                                                                       && 101 + B + F >= A + C + E
                                                                       && 1 + B >= F
                                                                       && C >= 1 + B
                                                                       && C >= E
                                                                       && 1 + B + F + G = A + C + E
                                                                       && B + D + F = A + C + E]
          lbl72(A,B,C,D,E,F,G,H)  -> lbl72(A,-1 + B,C,1 + F,E,D,F,H)  [2*B + F >= A + C + E
                                                                       && 100 >= F
                                                                       && 100 >= A
                                                                       && 101 + B + F >= A + C + E
                                                                       && 1 + B >= F
                                                                       && C >= 1 + B
                                                                       && C >= E
                                                                       && 1 + B + F + G = A + C + E
                                                                       && B + D + F = A + C + E]
          start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,A,H,H)           True
        Signature:
          {(lbl72,8);(start,8);(start0,8);(stop,8)}
        Rule Graph:
          [0->{},1->{},2->{3,4,5},3->{},4->{},5->{3,4,5},6->{0,1,2}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5,6]
          |
          `- p:[5] c: [5]
* Step 3: CloseWith YES
    + Considered Problem:
        (Rules:
          start(A,B,C,D,E,F,G,H)  -> stop(A,B,C,D,E,F,G,H)            [A >= 101 && B = C && D = E && F = A && G = H]
          start(A,B,C,D,E,F,G,H)  -> stop(A,B,C,D,E,F,G,H)            [E >= 1 + C && B = C && D = E && F = A && G = H]
          start(A,B,C,D,E,F,G,H)  -> lbl72(A,-1 + B,C,1 + F,E,D,F,H)  [C >= E
                                                                       && 100 >= A
                                                                       && B = C
                                                                       && D = E
                                                                       && F = A
                                                                       && G = H]
          lbl72(A,B,C,D,E,F,G,H)  -> stop(A,B,C,D,E,F,G,H)            [F >= 101
                                                                       && 100 >= A
                                                                       && 101 + B + F >= A + C + E
                                                                       && 1 + B >= F
                                                                       && C >= 1 + B
                                                                       && C >= E
                                                                       && 1 + B + F + G = A + C + E
                                                                       && B + D + F = A + C + E]
          lbl72(A,B,C,D,E,F,G,H)  -> stop(A,B,C,D,E,F,G,H)            [A + C + E >= 1 + 2*B + F
                                                                       && 100 >= A
                                                                       && 101 + B + F >= A + C + E
                                                                       && 1 + B >= F
                                                                       && C >= 1 + B
                                                                       && C >= E
                                                                       && 1 + B + F + G = A + C + E
                                                                       && B + D + F = A + C + E]
          lbl72(A,B,C,D,E,F,G,H)  -> lbl72(A,-1 + B,C,1 + F,E,D,F,H)  [2*B + F >= A + C + E
                                                                       && 100 >= F
                                                                       && 100 >= A
                                                                       && 101 + B + F >= A + C + E
                                                                       && 1 + B >= F
                                                                       && C >= 1 + B
                                                                       && C >= E
                                                                       && 1 + B + F + G = A + C + E
                                                                       && B + D + F = A + C + E]
          start0(A,B,C,D,E,F,G,H) -> start(A,C,C,E,E,A,H,H)           True
        Signature:
          {(lbl72,8);(start,8);(start0,8);(stop,8)}
        Rule Graph:
          [0->{},1->{},2->{3,4,5},3->{},4->{},5->{3,4,5},6->{0,1,2}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5,6]
          |
          `- p:[5] c: [5])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES