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