YES
* Step 1: UnsatPaths YES
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G,H)  -> f15(10,35,285,I,I,0,G,H)      True                   (1,1)
          1. f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1)          [A >= 1 + F]           (?,1)
          2. f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H)      [E >= 1 + H]           (?,1)
          3. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H)      [E >= B]               (?,1)
          4. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H)  [B >= 1 + E]           (?,1)
          5. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H)          [H >= E && I >= 1 + J] (?,1)
          6. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H)          [H >= E]               (?,1)
          7. f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H) [H >= E]               (?,1)
          8. f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H)          [F >= A]               (?,1)
        Signature:
          {(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)}
        Flow Graph:
          [0->{1,8},1->{2,5,6,7},2->{2,5,6,7},3->{1,8},4->{1,8},5->{3,4},6->{3,4},7->{1,8},8->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,8)]
* Step 2: FromIts YES
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G,H)  -> f15(10,35,285,I,I,0,G,H)      True                   (1,1)
          1. f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1)          [A >= 1 + F]           (?,1)
          2. f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H)      [E >= 1 + H]           (?,1)
          3. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H)      [E >= B]               (?,1)
          4. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H)  [B >= 1 + E]           (?,1)
          5. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H)          [H >= E && I >= 1 + J] (?,1)
          6. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H)          [H >= E]               (?,1)
          7. f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H) [H >= E]               (?,1)
          8. f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H)          [F >= A]               (?,1)
        Signature:
          {(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)}
        Flow Graph:
          [0->{1},1->{2,5,6,7},2->{2,5,6,7},3->{1,8},4->{1,8},5->{3,4},6->{3,4},7->{1,8},8->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Decompose YES
    + Considered Problem:
        Rules:
          f0(A,B,C,D,E,F,G,H)  -> f15(10,35,285,I,I,0,G,H)       True
          f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1)           [A >= 1 + F]
          f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H)       [E >= 1 + H]
          f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H)       [E >= B]
          f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H)   [B >= 1 + E]
          f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H)           [H >= E && I >= 1 + J]
          f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H)           [H >= E]
          f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H)  [H >= E]
          f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H)           [F >= A]
        Signature:
          {(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)}
        Rule Graph:
          [0->{1},1->{2,5,6,7},2->{2,5,6,7},3->{1,8},4->{1,8},5->{3,4},6->{3,4},7->{1,8},8->{}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8]
          |
          `- p:[1,3,5,2,6,4,7] c: [1,3,4,5,6,7]
             |
             `- p:[2] c: [2]
* Step 4: CloseWith YES
    + Considered Problem:
        (Rules:
          f0(A,B,C,D,E,F,G,H)  -> f15(10,35,285,I,I,0,G,H)       True
          f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1)           [A >= 1 + F]
          f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H)       [E >= 1 + H]
          f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H)       [E >= B]
          f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H)   [B >= 1 + E]
          f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H)           [H >= E && I >= 1 + J]
          f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H)           [H >= E]
          f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H)  [H >= E]
          f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H)           [F >= A]
        Signature:
          {(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)}
        Rule Graph:
          [0->{1},1->{2,5,6,7},2->{2,5,6,7},3->{1,8},4->{1,8},5->{3,4},6->{3,4},7->{1,8},8->{}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8]
          |
          `- p:[1,3,5,2,6,4,7] c: [1,3,4,5,6,7]
             |
             `- p:[2] c: [2])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES