YES
* Step 1: FromIts YES
    + Considered Problem:
        Rules:
          0. start(A) -> a(A)      [A >= 1]  (1,1)
          1. start(A) -> a(100)    [A = 100] (1,1)
          2. a(A)     -> a(-1 + A) [A >= 1]  (?,1)
        Signature:
          {(a,1);(start,1)}
        Flow Graph:
          [0->{2},1->{2},2->{2}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: Decompose YES
    + Considered Problem:
        Rules:
          start(A) -> a(A)       [A >= 1]
          start(A) -> a(100)     [A = 100]
          a(A)     -> a(-1 + A)  [A >= 1]
        Signature:
          {(a,1);(start,1)}
        Rule Graph:
          [0->{2},1->{2},2->{2}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1,2]
          |
          `- p:[2] c: [2]
* Step 3: CloseWith YES
    + Considered Problem:
        (Rules:
          start(A) -> a(A)       [A >= 1]
          start(A) -> a(100)     [A = 100]
          a(A)     -> a(-1 + A)  [A >= 1]
        Signature:
          {(a,1);(start,1)}
        Rule Graph:
          [0->{2},1->{2},2->{2}]
        ,We construct a looptree:
          P: [0,1,2]
          |
          `- p:[2] c: [2])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES