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