MAYBE
* Step 1: ArgumentFilter MAYBE
    + Considered Problem:
        Rules:
          0. f300(A,B,C,D) -> f1(A,B,C,E)       [A >= B]                   (?,1)
          1. f300(A,B,C,D) -> f300(A,B,0,D)     [B >= 1 + A]               (?,1)
          2. f300(A,B,C,D) -> f300(1 + A,B,E,D) [0 >= 1 + E && B >= 1 + A] (?,1)
          3. f300(A,B,C,D) -> f300(1 + A,B,E,D) [E >= 1 && B >= 1 + A]     (?,1)
          4. f2(A,B,C,D)   -> f300(A,B,C,D)     True                       (1,1)
        Signature:
          {(f1,4);(f2,4);(f300,4)}
        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 [2,3]
    + Details:
        We remove following argument positions: [2,3].
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f300(A,B) -> f1(A,B)       [A >= B]                   (?,1)
          1. f300(A,B) -> f300(A,B)     [B >= 1 + A]               (?,1)
          2. f300(A,B) -> f300(1 + A,B) [0 >= 1 + E && B >= 1 + A] (?,1)
          3. f300(A,B) -> f300(1 + A,B) [E >= 1 && B >= 1 + A]     (?,1)
          4. f2(A,B)   -> f300(A,B)     True                       (1,1)
        Signature:
          {(f1,4);(f2,4);(f300,4)}
        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. f300(A,B) -> f1(A,B)       [A >= B]                   (?,1)
          1. f300(A,B) -> f300(A,B)     [B >= 1 + A]               (?,1)
          2. f300(A,B) -> f300(1 + A,B) [0 >= 1 + E && B >= 1 + A] (?,1)
          3. f300(A,B) -> f300(1 + A,B) [E >= 1 && B >= 1 + A]     (?,1)
          4. f2(A,B)   -> f300(A,B)     True                       (1,1)
        Signature:
          {(f1,4);(f2,4);(f300,4)}
        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:
          f300(A,B) -> f1(A,B)        [A >= B]
          f300(A,B) -> f300(A,B)      [B >= 1 + A]
          f300(A,B) -> f300(1 + A,B)  [0 >= 1 + E && B >= 1 + A]
          f300(A,B) -> f300(1 + A,B)  [E >= 1 && B >= 1 + A]
          f2(A,B)   -> f300(A,B)      True
        Signature:
          {(f1,4);(f2,4);(f300,4)}
        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:
        f300(A,B) -> f1(A,B)         [A >= B]
        f300(A,B) -> f300(A,B)       [B >= 1 + A]
        f300(A,B) -> f300(1 + A,B)   [0 >= 1 + E && B >= 1 + A]
        f300(A,B) -> f300(1 + A,B)   [E >= 1 && B >= 1 + A]
        f2(A,B)   -> f300(A,B)       True
        f1(A,B)   -> exitus616(A,B)  True
      Signature:
        {(exitus616,2);(f1,4);(f2,4);(f300,4)}
      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