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

YES