YES
* Step 1: FromIts YES
    + Considered Problem:
        Rules:
          0.  evalfstart(A,B,C)    -> evalfentryin(A,B,C)   True         (1,1)
          1.  evalfentryin(A,B,C)  -> evalfbb5in(0,B,C)     True         (?,1)
          2.  evalfbb5in(A,B,C)    -> evalfreturnin(A,B,C)  [A >= B]     (?,1)
          3.  evalfbb5in(A,B,C)    -> evalfbb6in(A,B,C)     [B >= 1 + A] (?,1)
          4.  evalfbb6in(A,B,C)    -> evalfbb2in(A,B,A)     [0 >= 1 + D] (?,1)
          5.  evalfbb6in(A,B,C)    -> evalfbb2in(A,B,A)     [D >= 1]     (?,1)
          6.  evalfbb6in(A,B,C)    -> evalfreturnin(A,B,C)  True         (?,1)
          7.  evalfbb2in(A,B,C)    -> evalfbb4in(A,B,C)     [C >= B]     (?,1)
          8.  evalfbb2in(A,B,C)    -> evalfbb3in(A,B,C)     [B >= 1 + C] (?,1)
          9.  evalfbb3in(A,B,C)    -> evalfbb1in(A,B,C)     [0 >= 1 + D] (?,1)
          10. evalfbb3in(A,B,C)    -> evalfbb1in(A,B,C)     [D >= 1]     (?,1)
          11. evalfbb3in(A,B,C)    -> evalfbb4in(A,B,C)     True         (?,1)
          12. evalfbb1in(A,B,C)    -> evalfbb2in(A,B,1 + C) True         (?,1)
          13. evalfbb4in(A,B,C)    -> evalfbb5in(1 + C,B,C) True         (?,1)
          14. evalfreturnin(A,B,C) -> evalfstop(A,B,C)      True         (?,1)
        Signature:
          {(evalfbb1in,3)
          ;(evalfbb2in,3)
          ;(evalfbb3in,3)
          ;(evalfbb4in,3)
          ;(evalfbb5in,3)
          ;(evalfbb6in,3)
          ;(evalfentryin,3)
          ;(evalfreturnin,3)
          ;(evalfstart,3)
          ;(evalfstop,3)}
        Flow Graph:
          [0->{1},1->{2,3},2->{14},3->{4,5,6},4->{7,8},5->{7,8},6->{14},7->{13},8->{9,10,11},9->{12},10->{12}
          ,11->{13},12->{7,8},13->{2,3},14->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: Decompose YES
    + Considered Problem:
        Rules:
          evalfstart(A,B,C)    -> evalfentryin(A,B,C)    True
          evalfentryin(A,B,C)  -> evalfbb5in(0,B,C)      True
          evalfbb5in(A,B,C)    -> evalfreturnin(A,B,C)   [A >= B]
          evalfbb5in(A,B,C)    -> evalfbb6in(A,B,C)      [B >= 1 + A]
          evalfbb6in(A,B,C)    -> evalfbb2in(A,B,A)      [0 >= 1 + D]
          evalfbb6in(A,B,C)    -> evalfbb2in(A,B,A)      [D >= 1]
          evalfbb6in(A,B,C)    -> evalfreturnin(A,B,C)   True
          evalfbb2in(A,B,C)    -> evalfbb4in(A,B,C)      [C >= B]
          evalfbb2in(A,B,C)    -> evalfbb3in(A,B,C)      [B >= 1 + C]
          evalfbb3in(A,B,C)    -> evalfbb1in(A,B,C)      [0 >= 1 + D]
          evalfbb3in(A,B,C)    -> evalfbb1in(A,B,C)      [D >= 1]
          evalfbb3in(A,B,C)    -> evalfbb4in(A,B,C)      True
          evalfbb1in(A,B,C)    -> evalfbb2in(A,B,1 + C)  True
          evalfbb4in(A,B,C)    -> evalfbb5in(1 + C,B,C)  True
          evalfreturnin(A,B,C) -> evalfstop(A,B,C)       True
        Signature:
          {(evalfbb1in,3)
          ;(evalfbb2in,3)
          ;(evalfbb3in,3)
          ;(evalfbb4in,3)
          ;(evalfbb5in,3)
          ;(evalfbb6in,3)
          ;(evalfentryin,3)
          ;(evalfreturnin,3)
          ;(evalfstart,3)
          ;(evalfstop,3)}
        Rule Graph:
          [0->{1},1->{2,3},2->{14},3->{4,5,6},4->{7,8},5->{7,8},6->{14},7->{13},8->{9,10,11},9->{12},10->{12}
          ,11->{13},12->{7,8},13->{2,3},14->{}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14]
          |
          `- p:[3,13,7,4,5,12,9,8,10,11] c: [8,9,10,11,12]
             |
             `- p:[3,13,7,4,5] c: [3,4,5,7,13]
* Step 3: CloseWith YES
    + Considered Problem:
        (Rules:
          evalfstart(A,B,C)    -> evalfentryin(A,B,C)    True
          evalfentryin(A,B,C)  -> evalfbb5in(0,B,C)      True
          evalfbb5in(A,B,C)    -> evalfreturnin(A,B,C)   [A >= B]
          evalfbb5in(A,B,C)    -> evalfbb6in(A,B,C)      [B >= 1 + A]
          evalfbb6in(A,B,C)    -> evalfbb2in(A,B,A)      [0 >= 1 + D]
          evalfbb6in(A,B,C)    -> evalfbb2in(A,B,A)      [D >= 1]
          evalfbb6in(A,B,C)    -> evalfreturnin(A,B,C)   True
          evalfbb2in(A,B,C)    -> evalfbb4in(A,B,C)      [C >= B]
          evalfbb2in(A,B,C)    -> evalfbb3in(A,B,C)      [B >= 1 + C]
          evalfbb3in(A,B,C)    -> evalfbb1in(A,B,C)      [0 >= 1 + D]
          evalfbb3in(A,B,C)    -> evalfbb1in(A,B,C)      [D >= 1]
          evalfbb3in(A,B,C)    -> evalfbb4in(A,B,C)      True
          evalfbb1in(A,B,C)    -> evalfbb2in(A,B,1 + C)  True
          evalfbb4in(A,B,C)    -> evalfbb5in(1 + C,B,C)  True
          evalfreturnin(A,B,C) -> evalfstop(A,B,C)       True
        Signature:
          {(evalfbb1in,3)
          ;(evalfbb2in,3)
          ;(evalfbb3in,3)
          ;(evalfbb4in,3)
          ;(evalfbb5in,3)
          ;(evalfbb6in,3)
          ;(evalfentryin,3)
          ;(evalfreturnin,3)
          ;(evalfstart,3)
          ;(evalfstop,3)}
        Rule Graph:
          [0->{1},1->{2,3},2->{14},3->{4,5,6},4->{7,8},5->{7,8},6->{14},7->{13},8->{9,10,11},9->{12},10->{12}
          ,11->{13},12->{7,8},13->{2,3},14->{}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14]
          |
          `- p:[3,13,7,4,5,12,9,8,10,11] c: [8,9,10,11,12]
             |
             `- p:[3,13,7,4,5] c: [3,4,5,7,13])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES