YES
* Step 1: FromIts YES
    + Considered Problem:
        Rules:
          0. evalexministart(A,B,C)    -> evalexminientryin(A,B,C)        True                 (1,1)
          1. evalexminientryin(A,B,C)  -> evalexminibb1in(B,A,C)          True                 (?,1)
          2. evalexminibb1in(A,B,C)    -> evalexminibbin(A,B,C)           [100 >= B && A >= C] (?,1)
          3. evalexminibb1in(A,B,C)    -> evalexminireturnin(A,B,C)       [B >= 101]           (?,1)
          4. evalexminibb1in(A,B,C)    -> evalexminireturnin(A,B,C)       [C >= 1 + A]         (?,1)
          5. evalexminibbin(A,B,C)     -> evalexminibb1in(-1 + A,C,1 + B) True                 (?,1)
          6. evalexminireturnin(A,B,C) -> evalexministop(A,B,C)           True                 (?,1)
        Signature:
          {(evalexminibb1in,3)
          ;(evalexminibbin,3)
          ;(evalexminientryin,3)
          ;(evalexminireturnin,3)
          ;(evalexministart,3)
          ;(evalexministop,3)}
        Flow Graph:
          [0->{1},1->{2,3,4},2->{5},3->{6},4->{6},5->{2,3,4},6->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: Decompose YES
    + Considered Problem:
        Rules:
          evalexministart(A,B,C)    -> evalexminientryin(A,B,C)         True
          evalexminientryin(A,B,C)  -> evalexminibb1in(B,A,C)           True
          evalexminibb1in(A,B,C)    -> evalexminibbin(A,B,C)            [100 >= B && A >= C]
          evalexminibb1in(A,B,C)    -> evalexminireturnin(A,B,C)        [B >= 101]
          evalexminibb1in(A,B,C)    -> evalexminireturnin(A,B,C)        [C >= 1 + A]
          evalexminibbin(A,B,C)     -> evalexminibb1in(-1 + A,C,1 + B)  True
          evalexminireturnin(A,B,C) -> evalexministop(A,B,C)            True
        Signature:
          {(evalexminibb1in,3)
          ;(evalexminibbin,3)
          ;(evalexminientryin,3)
          ;(evalexminireturnin,3)
          ;(evalexministart,3)
          ;(evalexministop,3)}
        Rule Graph:
          [0->{1},1->{2,3,4},2->{5},3->{6},4->{6},5->{2,3,4},6->{}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5,6]
          |
          `- p:[2,5] c: [2,5]
* Step 3: CloseWith YES
    + Considered Problem:
        (Rules:
          evalexministart(A,B,C)    -> evalexminientryin(A,B,C)         True
          evalexminientryin(A,B,C)  -> evalexminibb1in(B,A,C)           True
          evalexminibb1in(A,B,C)    -> evalexminibbin(A,B,C)            [100 >= B && A >= C]
          evalexminibb1in(A,B,C)    -> evalexminireturnin(A,B,C)        [B >= 101]
          evalexminibb1in(A,B,C)    -> evalexminireturnin(A,B,C)        [C >= 1 + A]
          evalexminibbin(A,B,C)     -> evalexminibb1in(-1 + A,C,1 + B)  True
          evalexminireturnin(A,B,C) -> evalexministop(A,B,C)            True
        Signature:
          {(evalexminibb1in,3)
          ;(evalexminibbin,3)
          ;(evalexminientryin,3)
          ;(evalexminireturnin,3)
          ;(evalexministart,3)
          ;(evalexministop,3)}
        Rule Graph:
          [0->{1},1->{2,3,4},2->{5},3->{6},4->{6},5->{2,3,4},6->{}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5,6]
          |
          `- p:[2,5] c: [2,5])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES