MAYBE
* Step 1: TrivialSCCs 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:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: AddSinks 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,1)
          7. f24(A,B,C,D,E) -> f37(A,B,C,D,E)    [D >= 0 && -1*C + D >= 0]               (1,1)
          8. f9(A,B,C,D,E)  -> f24(A,B,C,D,E)    [D >= 0 && D >= C]                      (1,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:
        AddSinks
    + Details:
        ()
* Step 3: Failure 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)
        9. f37(A,B,C,D,E) -> exitus616(A,B,C,D,E) True                                    (?,1)
      Signature:
        {(exitus616,5);(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,9},5->{4,5,6,9},6->{},7->{4,5,6,9},8->{2,3,7},9->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + 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