YES
* Step 1: FromIts YES
    + Considered Problem:
        Rules:
          0.  evalrealselectstart(A,B,C)    -> evalrealselectentryin(A,B,C)   True         (1,1)
          1.  evalrealselectentryin(A,B,C)  -> evalrealselectbb6in(0,B,C)     True         (?,1)
          2.  evalrealselectbb6in(A,B,C)    -> evalrealselectbbin(A,B,C)      [B >= 2 + A] (?,1)
          3.  evalrealselectbb6in(A,B,C)    -> evalrealselectreturnin(A,B,C)  [1 + A >= B] (?,1)
          4.  evalrealselectbbin(A,B,C)     -> evalrealselectbb4in(A,B,1 + A) True         (?,1)
          5.  evalrealselectbb4in(A,B,C)    -> evalrealselectbb1in(A,B,C)     [B >= 1 + C] (?,1)
          6.  evalrealselectbb4in(A,B,C)    -> evalrealselectbb5in(A,B,C)     [C >= B]     (?,1)
          7.  evalrealselectbb1in(A,B,C)    -> evalrealselectbb4in(A,B,1 + C) [D >= 1 + E] (?,1)
          8.  evalrealselectbb1in(A,B,C)    -> evalrealselectbb4in(A,B,1 + C) [E >= D]     (?,1)
          9.  evalrealselectbb5in(A,B,C)    -> evalrealselectbb6in(1 + A,B,C) True         (?,1)
          10. evalrealselectreturnin(A,B,C) -> evalrealselectstop(A,B,C)      True         (?,1)
        Signature:
          {(evalrealselectbb1in,3)
          ;(evalrealselectbb4in,3)
          ;(evalrealselectbb5in,3)
          ;(evalrealselectbb6in,3)
          ;(evalrealselectbbin,3)
          ;(evalrealselectentryin,3)
          ;(evalrealselectreturnin,3)
          ;(evalrealselectstart,3)
          ;(evalrealselectstop,3)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4},3->{10},4->{5,6},5->{7,8},6->{9},7->{5,6},8->{5,6},9->{2,3},10->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: Decompose YES
    + Considered Problem:
        Rules:
          evalrealselectstart(A,B,C)    -> evalrealselectentryin(A,B,C)    True
          evalrealselectentryin(A,B,C)  -> evalrealselectbb6in(0,B,C)      True
          evalrealselectbb6in(A,B,C)    -> evalrealselectbbin(A,B,C)       [B >= 2 + A]
          evalrealselectbb6in(A,B,C)    -> evalrealselectreturnin(A,B,C)   [1 + A >= B]
          evalrealselectbbin(A,B,C)     -> evalrealselectbb4in(A,B,1 + A)  True
          evalrealselectbb4in(A,B,C)    -> evalrealselectbb1in(A,B,C)      [B >= 1 + C]
          evalrealselectbb4in(A,B,C)    -> evalrealselectbb5in(A,B,C)      [C >= B]
          evalrealselectbb1in(A,B,C)    -> evalrealselectbb4in(A,B,1 + C)  [D >= 1 + E]
          evalrealselectbb1in(A,B,C)    -> evalrealselectbb4in(A,B,1 + C)  [E >= D]
          evalrealselectbb5in(A,B,C)    -> evalrealselectbb6in(1 + A,B,C)  True
          evalrealselectreturnin(A,B,C) -> evalrealselectstop(A,B,C)       True
        Signature:
          {(evalrealselectbb1in,3)
          ;(evalrealselectbb4in,3)
          ;(evalrealselectbb5in,3)
          ;(evalrealselectbb6in,3)
          ;(evalrealselectbbin,3)
          ;(evalrealselectentryin,3)
          ;(evalrealselectreturnin,3)
          ;(evalrealselectstart,3)
          ;(evalrealselectstop,3)}
        Rule Graph:
          [0->{1},1->{2,3},2->{4},3->{10},4->{5,6},5->{7,8},6->{9},7->{5,6},8->{5,6},9->{2,3},10->{}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8,9,10]
          |
          `- p:[2,9,6,4,7,5,8] c: [2,4,6,9]
             |
             `- p:[5,7,8] c: [5,7,8]
* Step 3: CloseWith YES
    + Considered Problem:
        (Rules:
          evalrealselectstart(A,B,C)    -> evalrealselectentryin(A,B,C)    True
          evalrealselectentryin(A,B,C)  -> evalrealselectbb6in(0,B,C)      True
          evalrealselectbb6in(A,B,C)    -> evalrealselectbbin(A,B,C)       [B >= 2 + A]
          evalrealselectbb6in(A,B,C)    -> evalrealselectreturnin(A,B,C)   [1 + A >= B]
          evalrealselectbbin(A,B,C)     -> evalrealselectbb4in(A,B,1 + A)  True
          evalrealselectbb4in(A,B,C)    -> evalrealselectbb1in(A,B,C)      [B >= 1 + C]
          evalrealselectbb4in(A,B,C)    -> evalrealselectbb5in(A,B,C)      [C >= B]
          evalrealselectbb1in(A,B,C)    -> evalrealselectbb4in(A,B,1 + C)  [D >= 1 + E]
          evalrealselectbb1in(A,B,C)    -> evalrealselectbb4in(A,B,1 + C)  [E >= D]
          evalrealselectbb5in(A,B,C)    -> evalrealselectbb6in(1 + A,B,C)  True
          evalrealselectreturnin(A,B,C) -> evalrealselectstop(A,B,C)       True
        Signature:
          {(evalrealselectbb1in,3)
          ;(evalrealselectbb4in,3)
          ;(evalrealselectbb5in,3)
          ;(evalrealselectbb6in,3)
          ;(evalrealselectbbin,3)
          ;(evalrealselectentryin,3)
          ;(evalrealselectreturnin,3)
          ;(evalrealselectstart,3)
          ;(evalrealselectstop,3)}
        Rule Graph:
          [0->{1},1->{2,3},2->{4},3->{10},4->{5,6},5->{7,8},6->{9},7->{5,6},8->{5,6},9->{2,3},10->{}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8,9,10]
          |
          `- p:[2,9,6,4,7,5,8] c: [2,4,6,9]
             |
             `- p:[5,7,8] c: [5,7,8])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES