MAYBE
* Step 1: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f4(A,B,C,D,E,F,G) -> f4(A + B,B,C,D,E,F,G) [A >= 0]     (?,1)
          1. f4(A,B,C,D,E,F,G) -> f6(A,B,0,0,0,0,0)     [0 >= 1 + A] (?,1)
          2. f5(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,G)     [0 >= 1 + B] (1,1)
          3. f5(A,B,C,D,E,F,G) -> f6(A,B,0,0,0,0,0)     [B >= 0]     (1,1)
        Signature:
          {(f4,7);(f5,7);(f6,7)}
        Flow Graph:
          [0->{0,1},1->{},2->{0,1},3->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f4(A,B,C,D,E,F,G) -> f4(A + B,B,C,D,E,F,G)  [A >= 0]
          f4(A,B,C,D,E,F,G) -> f6(A,B,0,0,0,0,0)      [0 >= 1 + A]
          f5(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,G)      [0 >= 1 + B]
          f5(A,B,C,D,E,F,G) -> f6(A,B,0,0,0,0,0)      [B >= 0]
        Signature:
          {(f4,7);(f5,7);(f6,7)}
        Rule Graph:
          [0->{0,1},1->{},2->{0,1},3->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        f4(A,B,C,D,E,F,G) -> f4(A + B,B,C,D,E,F,G)     [A >= 0]
        f4(A,B,C,D,E,F,G) -> f6(A,B,0,0,0,0,0)         [0 >= 1 + A]
        f5(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,G)         [0 >= 1 + B]
        f5(A,B,C,D,E,F,G) -> f6(A,B,0,0,0,0,0)         [B >= 0]
        f6(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G)  True
        f6(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G)  True
      Signature:
        {(exitus616,7);(f4,7);(f5,7);(f6,7)}
      Rule Graph:
        [0->{0,1},1->{5},2->{0,1},3->{4}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5]
        |
        `- p:[0] c: []
MAYBE