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