YES
* Step 1: FromIts YES
    + Considered Problem:
        Rules:
          0.  f0(A,B,C,D,E,F,G,H,I,J)  -> f17(0,K,L,0,E,F,G,H,I,J)      True         (1,1)
          1.  f17(A,B,C,D,E,F,G,H,I,J) -> f17(A,B,C,1 + D,E,F,G,H,I,J)  [E >= 1 + D] (?,1)
          2.  f27(A,B,C,D,E,F,G,H,I,J) -> f27(A,B,C,D,E,-1 + F,G,H,I,J) [F >= 0]     (?,1)
          3.  f37(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,1 + G,H,I,J)  [E >= 1 + G] (?,1)
          4.  f45(A,B,C,D,E,F,G,H,I,J) -> f45(1 + A,B,C,D,E,F,G,H,I,J)  [E >= 1 + A] (?,1)
          5.  f55(A,B,C,D,E,F,G,H,I,J) -> f55(A,B,C,D,E,F,G,1 + H,I,J)  [E >= 1 + H] (?,1)
          6.  f65(A,B,C,D,E,F,G,H,I,J) -> f65(A,B,C,D,E,F,G,H,-1 + I,J) [I >= 0]     (?,1)
          7.  f75(A,B,C,D,E,F,G,H,I,J) -> f75(A,B,C,D,E,F,G,H,I,1 + J)  [E >= 1 + J] (?,1)
          8.  f83(A,B,C,D,E,F,G,H,I,J) -> f83(-1 + A,B,C,D,E,F,G,H,I,J) [A >= 0]     (?,1)
          9.  f83(A,B,C,D,E,F,G,H,I,J) -> f93(A,B,C,D,E,F,G,H,I,J)      [0 >= 1 + A] (?,1)
          10. f75(A,B,C,D,E,F,G,H,I,J) -> f83(-1 + E,B,C,D,E,F,G,H,I,J) [J >= E]     (?,1)
          11. f65(A,B,C,D,E,F,G,H,I,J) -> f75(A,B,C,D,E,F,G,H,I,0)      [0 >= 1 + I] (?,1)
          12. f55(A,B,C,D,E,F,G,H,I,J) -> f65(A,B,C,D,E,F,G,H,-1 + E,J) [H >= E]     (?,1)
          13. f45(A,B,C,D,E,F,G,H,I,J) -> f55(A,B,C,D,E,F,G,0,I,J)      [A >= E]     (?,1)
          14. f37(A,B,C,D,E,F,G,H,I,J) -> f45(0,B,C,D,E,F,G,H,I,J)      [G >= E]     (?,1)
          15. f27(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,0,H,I,J)      [0 >= 1 + F] (?,1)
          16. f17(A,B,C,D,E,F,G,H,I,J) -> f27(A,B,C,D,E,-1 + E,G,H,I,J) [D >= E]     (?,1)
        Signature:
          {(f0,10);(f17,10);(f27,10);(f37,10);(f45,10);(f55,10);(f65,10);(f75,10);(f83,10);(f93,10)}
        Flow Graph:
          [0->{1,16},1->{1,16},2->{2,15},3->{3,14},4->{4,13},5->{5,12},6->{6,11},7->{7,10},8->{8,9},9->{},10->{8,9}
          ,11->{7,10},12->{6,11},13->{5,12},14->{4,13},15->{3,14},16->{2,15}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: Decompose YES
    + Considered Problem:
        Rules:
          f0(A,B,C,D,E,F,G,H,I,J)  -> f17(0,K,L,0,E,F,G,H,I,J)       True
          f17(A,B,C,D,E,F,G,H,I,J) -> f17(A,B,C,1 + D,E,F,G,H,I,J)   [E >= 1 + D]
          f27(A,B,C,D,E,F,G,H,I,J) -> f27(A,B,C,D,E,-1 + F,G,H,I,J)  [F >= 0]
          f37(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,1 + G,H,I,J)   [E >= 1 + G]
          f45(A,B,C,D,E,F,G,H,I,J) -> f45(1 + A,B,C,D,E,F,G,H,I,J)   [E >= 1 + A]
          f55(A,B,C,D,E,F,G,H,I,J) -> f55(A,B,C,D,E,F,G,1 + H,I,J)   [E >= 1 + H]
          f65(A,B,C,D,E,F,G,H,I,J) -> f65(A,B,C,D,E,F,G,H,-1 + I,J)  [I >= 0]
          f75(A,B,C,D,E,F,G,H,I,J) -> f75(A,B,C,D,E,F,G,H,I,1 + J)   [E >= 1 + J]
          f83(A,B,C,D,E,F,G,H,I,J) -> f83(-1 + A,B,C,D,E,F,G,H,I,J)  [A >= 0]
          f83(A,B,C,D,E,F,G,H,I,J) -> f93(A,B,C,D,E,F,G,H,I,J)       [0 >= 1 + A]
          f75(A,B,C,D,E,F,G,H,I,J) -> f83(-1 + E,B,C,D,E,F,G,H,I,J)  [J >= E]
          f65(A,B,C,D,E,F,G,H,I,J) -> f75(A,B,C,D,E,F,G,H,I,0)       [0 >= 1 + I]
          f55(A,B,C,D,E,F,G,H,I,J) -> f65(A,B,C,D,E,F,G,H,-1 + E,J)  [H >= E]
          f45(A,B,C,D,E,F,G,H,I,J) -> f55(A,B,C,D,E,F,G,0,I,J)       [A >= E]
          f37(A,B,C,D,E,F,G,H,I,J) -> f45(0,B,C,D,E,F,G,H,I,J)       [G >= E]
          f27(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,0,H,I,J)       [0 >= 1 + F]
          f17(A,B,C,D,E,F,G,H,I,J) -> f27(A,B,C,D,E,-1 + E,G,H,I,J)  [D >= E]
        Signature:
          {(f0,10);(f17,10);(f27,10);(f37,10);(f45,10);(f55,10);(f65,10);(f75,10);(f83,10);(f93,10)}
        Rule Graph:
          [0->{1,16},1->{1,16},2->{2,15},3->{3,14},4->{4,13},5->{5,12},6->{6,11},7->{7,10},8->{8,9},9->{},10->{8,9}
          ,11->{7,10},12->{6,11},13->{5,12},14->{4,13},15->{3,14},16->{2,15}]
    + 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]
          |
          +- p:[1] c: [1]
          |
          +- p:[2] c: [2]
          |
          +- p:[3] c: [3]
          |
          +- p:[4] c: [4]
          |
          +- p:[5] c: [5]
          |
          +- p:[6] c: [6]
          |
          +- p:[7] c: [7]
          |
          `- p:[8] c: [8]
* Step 3: CloseWith YES
    + Considered Problem:
        (Rules:
          f0(A,B,C,D,E,F,G,H,I,J)  -> f17(0,K,L,0,E,F,G,H,I,J)       True
          f17(A,B,C,D,E,F,G,H,I,J) -> f17(A,B,C,1 + D,E,F,G,H,I,J)   [E >= 1 + D]
          f27(A,B,C,D,E,F,G,H,I,J) -> f27(A,B,C,D,E,-1 + F,G,H,I,J)  [F >= 0]
          f37(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,1 + G,H,I,J)   [E >= 1 + G]
          f45(A,B,C,D,E,F,G,H,I,J) -> f45(1 + A,B,C,D,E,F,G,H,I,J)   [E >= 1 + A]
          f55(A,B,C,D,E,F,G,H,I,J) -> f55(A,B,C,D,E,F,G,1 + H,I,J)   [E >= 1 + H]
          f65(A,B,C,D,E,F,G,H,I,J) -> f65(A,B,C,D,E,F,G,H,-1 + I,J)  [I >= 0]
          f75(A,B,C,D,E,F,G,H,I,J) -> f75(A,B,C,D,E,F,G,H,I,1 + J)   [E >= 1 + J]
          f83(A,B,C,D,E,F,G,H,I,J) -> f83(-1 + A,B,C,D,E,F,G,H,I,J)  [A >= 0]
          f83(A,B,C,D,E,F,G,H,I,J) -> f93(A,B,C,D,E,F,G,H,I,J)       [0 >= 1 + A]
          f75(A,B,C,D,E,F,G,H,I,J) -> f83(-1 + E,B,C,D,E,F,G,H,I,J)  [J >= E]
          f65(A,B,C,D,E,F,G,H,I,J) -> f75(A,B,C,D,E,F,G,H,I,0)       [0 >= 1 + I]
          f55(A,B,C,D,E,F,G,H,I,J) -> f65(A,B,C,D,E,F,G,H,-1 + E,J)  [H >= E]
          f45(A,B,C,D,E,F,G,H,I,J) -> f55(A,B,C,D,E,F,G,0,I,J)       [A >= E]
          f37(A,B,C,D,E,F,G,H,I,J) -> f45(0,B,C,D,E,F,G,H,I,J)       [G >= E]
          f27(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,0,H,I,J)       [0 >= 1 + F]
          f17(A,B,C,D,E,F,G,H,I,J) -> f27(A,B,C,D,E,-1 + E,G,H,I,J)  [D >= E]
        Signature:
          {(f0,10);(f17,10);(f27,10);(f37,10);(f45,10);(f55,10);(f65,10);(f75,10);(f83,10);(f93,10)}
        Rule Graph:
          [0->{1,16},1->{1,16},2->{2,15},3->{3,14},4->{4,13},5->{5,12},6->{6,11},7->{7,10},8->{8,9},9->{},10->{8,9}
          ,11->{7,10},12->{6,11},13->{5,12},14->{4,13},15->{3,14},16->{2,15}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]
          |
          +- p:[1] c: [1]
          |
          +- p:[2] c: [2]
          |
          +- p:[3] c: [3]
          |
          +- p:[4] c: [4]
          |
          +- p:[5] c: [5]
          |
          +- p:[6] c: [6]
          |
          +- p:[7] c: [7]
          |
          `- p:[8] c: [8])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES