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