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