MAYBE
* Step 1: ArgumentFilter MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B)  -> f9(C,B)       True                      (1,1)
          1. f9(A,B)  -> f20(A,B)      [A >= 6]                  (?,1)
          2. f9(A,B)  -> f20(A,0)      [5 >= A]                  (?,1)
          3. f9(A,B)  -> f12(A,C)      [5 >= A && C >= 1]        (?,1)
          4. f9(A,B)  -> f12(A,C)      [5 >= A && 0 >= 1 + C]    (?,1)
          5. f20(A,B) -> f20(-1 + A,B) [A >= 3]                  (?,1)
          6. f20(A,B) -> f9(A,B)       [2 >= A]                  (?,1)
          7. f12(A,B) -> f9(1 + A,B)   [5 + -1*A >= 0 && 5 >= A] (?,1)
        Signature:
          {(f0,2);(f12,2);(f20,2);(f9,2)}
        Flow Graph:
          [0->{1,2,3,4},1->{5,6},2->{5,6},3->{7},4->{7},5->{5,6},6->{1,2,3,4},7->{1,2,3,4}]
        
    + Applied Processor:
        ArgumentFilter [1]
    + Details:
        We remove following argument positions: [1].
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A)  -> f9(C)       True                      (1,1)
          1. f9(A)  -> f20(A)      [A >= 6]                  (?,1)
          2. f9(A)  -> f20(A)      [5 >= A]                  (?,1)
          3. f9(A)  -> f12(A)      [5 >= A && C >= 1]        (?,1)
          4. f9(A)  -> f12(A)      [5 >= A && 0 >= 1 + C]    (?,1)
          5. f20(A) -> f20(-1 + A) [A >= 3]                  (?,1)
          6. f20(A) -> f9(A)       [2 >= A]                  (?,1)
          7. f12(A) -> f9(1 + A)   [5 + -1*A >= 0 && 5 >= A] (?,1)
        Signature:
          {(f0,2);(f12,2);(f20,2);(f9,2)}
        Flow Graph:
          [0->{1,2,3,4},1->{5,6},2->{5,6},3->{7},4->{7},5->{5,6},6->{1,2,3,4},7->{1,2,3,4}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,6),(6,1)]
* Step 3: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f0(A)  -> f9(C)       True                      (1,1)
          1. f9(A)  -> f20(A)      [A >= 6]                  (?,1)
          2. f9(A)  -> f20(A)      [5 >= A]                  (?,1)
          3. f9(A)  -> f12(A)      [5 >= A && C >= 1]        (?,1)
          4. f9(A)  -> f12(A)      [5 >= A && 0 >= 1 + C]    (?,1)
          5. f20(A) -> f20(-1 + A) [A >= 3]                  (?,1)
          6. f20(A) -> f9(A)       [2 >= A]                  (?,1)
          7. f12(A) -> f9(1 + A)   [5 + -1*A >= 0 && 5 >= A] (?,1)
        Signature:
          {(f0,2);(f12,2);(f20,2);(f9,2)}
        Flow Graph:
          [0->{1,2,3,4},1->{5},2->{5,6},3->{7},4->{7},5->{5,6},6->{2,3,4},7->{1,2,3,4}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f0(A)  -> f9(C)        True
          f9(A)  -> f20(A)       [A >= 6]
          f9(A)  -> f20(A)       [5 >= A]
          f9(A)  -> f12(A)       [5 >= A && C >= 1]
          f9(A)  -> f12(A)       [5 >= A && 0 >= 1 + C]
          f20(A) -> f20(-1 + A)  [A >= 3]
          f20(A) -> f9(A)        [2 >= A]
          f12(A) -> f9(1 + A)    [5 + -1*A >= 0 && 5 >= A]
        Signature:
          {(f0,2);(f12,2);(f20,2);(f9,2)}
        Rule Graph:
          [0->{1,2,3,4},1->{5},2->{5,6},3->{7},4->{7},5->{5,6},6->{2,3,4},7->{1,2,3,4}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        f0(A)  -> f9(C)         True
        f9(A)  -> f20(A)        [A >= 6]
        f9(A)  -> f20(A)        [5 >= A]
        f9(A)  -> f12(A)        [5 >= A && C >= 1]
        f9(A)  -> f12(A)        [5 >= A && 0 >= 1 + C]
        f20(A) -> f20(-1 + A)   [A >= 3]
        f20(A) -> f9(A)         [2 >= A]
        f12(A) -> f9(1 + A)     [5 + -1*A >= 0 && 5 >= A]
        f20(A) -> exitus616(A)  True
        f9(A)  -> exitus616(A)  True
        f12(A) -> exitus616(A)  True
        f9(A)  -> exitus616(A)  True
        f20(A) -> exitus616(A)  True
        f20(A) -> exitus616(A)  True
        f12(A) -> exitus616(A)  True
      Signature:
        {(exitus616,1);(f0,2);(f12,2);(f20,2);(f9,2)}
      Rule Graph:
        [0->{1,2,3,4},1->{5,8},2->{5,6,12},3->{7,10},4->{7,14},5->{5,6,13},6->{2,3,4,11},7->{1,2,3,4,9}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14]
        |
        `- p:[1,7,3,6,2,5,4] c: []
MAYBE