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

YES