MAYBE
* Step 1: ArgumentFilter MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E)  -> f9(F,F,F,0,E)     True                                    (1,1)
          1. f9(A,B,C,D,E)  -> f9(A,B,C,1 + D,F) [D >= 0 && C >= 1 + D]                  (?,1)
          2. f24(A,B,C,D,E) -> f24(A,B,C,D,E)    [D >= 0 && -1*C + D >= 0 && 0 >= 1 + F] (?,1)
          3. f24(A,B,C,D,E) -> f24(A,B,C,D,E)    [D >= 0 && -1*C + D >= 0]               (?,1)
          4. f37(A,B,C,D,E) -> f37(A,B,C,D,E)    [D >= 0 && -1*C + D >= 0 && F >= 1 + G] (?,1)
          5. f37(A,B,C,D,E) -> f37(A,B,C,D,E)    [D >= 0 && -1*C + D >= 0]               (?,1)
          6. f37(A,B,C,D,E) -> f48(A,B,C,D,E)    [D >= 0 && -1*C + D >= 0]               (?,1)
          7. f24(A,B,C,D,E) -> f37(A,B,C,D,E)    [D >= 0 && -1*C + D >= 0]               (?,1)
          8. f9(A,B,C,D,E)  -> f24(A,B,C,D,E)    [D >= 0 && D >= C]                      (?,1)
        Signature:
          {(f0,5);(f24,5);(f37,5);(f48,5);(f9,5)}
        Flow Graph:
          [0->{1,8},1->{1,8},2->{2,3,7},3->{2,3,7},4->{4,5,6},5->{4,5,6},6->{},7->{4,5,6},8->{2,3,7}]
        
    + Applied Processor:
        ArgumentFilter [0,1,4]
    + Details:
        We remove following argument positions: [0,1,4].
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f0(C,D)  -> f9(F,0)     True                                    (1,1)
          1. f9(C,D)  -> f9(C,1 + D) [D >= 0 && C >= 1 + D]                  (?,1)
          2. f24(C,D) -> f24(C,D)    [D >= 0 && -1*C + D >= 0 && 0 >= 1 + F] (?,1)
          3. f24(C,D) -> f24(C,D)    [D >= 0 && -1*C + D >= 0]               (?,1)
          4. f37(C,D) -> f37(C,D)    [D >= 0 && -1*C + D >= 0 && F >= 1 + G] (?,1)
          5. f37(C,D) -> f37(C,D)    [D >= 0 && -1*C + D >= 0]               (?,1)
          6. f37(C,D) -> f48(C,D)    [D >= 0 && -1*C + D >= 0]               (?,1)
          7. f24(C,D) -> f37(C,D)    [D >= 0 && -1*C + D >= 0]               (?,1)
          8. f9(C,D)  -> f24(C,D)    [D >= 0 && D >= C]                      (?,1)
        Signature:
          {(f0,5);(f24,5);(f37,5);(f48,5);(f9,5)}
        Flow Graph:
          [0->{1,8},1->{1,8},2->{2,3,7},3->{2,3,7},4->{4,5,6},5->{4,5,6},6->{},7->{4,5,6},8->{2,3,7}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f0(C,D)  -> f9(F,0)      True
          f9(C,D)  -> f9(C,1 + D)  [D >= 0 && C >= 1 + D]
          f24(C,D) -> f24(C,D)     [D >= 0 && -1*C + D >= 0 && 0 >= 1 + F]
          f24(C,D) -> f24(C,D)     [D >= 0 && -1*C + D >= 0]
          f37(C,D) -> f37(C,D)     [D >= 0 && -1*C + D >= 0 && F >= 1 + G]
          f37(C,D) -> f37(C,D)     [D >= 0 && -1*C + D >= 0]
          f37(C,D) -> f48(C,D)     [D >= 0 && -1*C + D >= 0]
          f24(C,D) -> f37(C,D)     [D >= 0 && -1*C + D >= 0]
          f9(C,D)  -> f24(C,D)     [D >= 0 && D >= C]
        Signature:
          {(f0,5);(f24,5);(f37,5);(f48,5);(f9,5)}
        Rule Graph:
          [0->{1,8},1->{1,8},2->{2,3,7},3->{2,3,7},4->{4,5,6},5->{4,5,6},6->{},7->{4,5,6},8->{2,3,7}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: Failure MAYBE
  + Considered Problem:
      Rules:
        f0(C,D)  -> f9(F,0)         True
        f9(C,D)  -> f9(C,1 + D)     [D >= 0 && C >= 1 + D]
        f24(C,D) -> f24(C,D)        [D >= 0 && -1*C + D >= 0 && 0 >= 1 + F]
        f24(C,D) -> f24(C,D)        [D >= 0 && -1*C + D >= 0]
        f37(C,D) -> f37(C,D)        [D >= 0 && -1*C + D >= 0 && F >= 1 + G]
        f37(C,D) -> f37(C,D)        [D >= 0 && -1*C + D >= 0]
        f37(C,D) -> f48(C,D)        [D >= 0 && -1*C + D >= 0]
        f24(C,D) -> f37(C,D)        [D >= 0 && -1*C + D >= 0]
        f9(C,D)  -> f24(C,D)        [D >= 0 && D >= C]
        f48(C,D) -> exitus616(C,D)  True
      Signature:
        {(exitus616,2);(f0,5);(f24,5);(f37,5);(f48,5);(f9,5)}
      Rule Graph:
        [0->{1,8},1->{1,8},2->{2,3,7},3->{2,3,7},4->{4,5,6},5->{4,5,6},6->{9},7->{4,5,6},8->{2,3,7}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9]
        |
        +- p:[1] c: [1]
        |
        +- p:[2,3] c: []
        |
        `- p:[4,5] c: []
MAYBE