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

YES