MAYBE
* Step 1: ArgumentFilter MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,B,C,D,E,F,G,H,I,J,K)   -> f2(A,C,C,L,M,N,G,H,I,J,K) [-1 + G >= 0 && -2 + A + G >= 0 && -1 + A >= 0 && A >= 1] (?,1)
          1. f300(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,N,P,Q,F,G,L,M,O,R) [0 >= G]                                                  (1,1)
          2. f300(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,N,N,P,Q,R,G,L,M,O,K) [A >= 1 && G >= 1]                                        (1,1)
          3. f300(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,N,N,P,Q,R,G,L,M,O,S) [0 >= A && G >= 1]                                        (1,1)
        Signature:
          {(f1,11);(f2,11);(f300,11)}
        Flow Graph:
          [0->{0},1->{},2->{0},3->{}]
        
    + Applied Processor:
        ArgumentFilter [1,2,3,4,5,7,8,9,10]
    + Details:
        We remove following argument positions: [1,2,3,4,5,7,8,9,10].
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,G)   -> f2(A,G) [-1 + G >= 0 && -2 + A + G >= 0 && -1 + A >= 0 && A >= 1] (?,1)
          1. f300(A,G) -> f1(A,G) [0 >= G]                                                  (1,1)
          2. f300(A,G) -> f2(A,G) [A >= 1 && G >= 1]                                        (1,1)
          3. f300(A,G) -> f1(A,G) [0 >= A && G >= 1]                                        (1,1)
        Signature:
          {(f1,11);(f2,11);(f300,11)}
        Flow Graph:
          [0->{0},1->{},2->{0},3->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f2(A,G)   -> f2(A,G)  [-1 + G >= 0 && -2 + A + G >= 0 && -1 + A >= 0 && A >= 1]
          f300(A,G) -> f1(A,G)  [0 >= G]
          f300(A,G) -> f2(A,G)  [A >= 1 && G >= 1]
          f300(A,G) -> f1(A,G)  [0 >= A && G >= 1]
        Signature:
          {(f1,11);(f2,11);(f300,11)}
        Rule Graph:
          [0->{0},1->{},2->{0},3->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: Failure MAYBE
  + Considered Problem:
      Rules:
        f2(A,G)   -> f2(A,G)         [-1 + G >= 0 && -2 + A + G >= 0 && -1 + A >= 0 && A >= 1]
        f300(A,G) -> f1(A,G)         [0 >= G]
        f300(A,G) -> f2(A,G)         [A >= 1 && G >= 1]
        f300(A,G) -> f1(A,G)         [0 >= A && G >= 1]
        f1(A,G)   -> exitus616(A,G)  True
        f2(A,G)   -> exitus616(A,G)  True
        f1(A,G)   -> exitus616(A,G)  True
      Signature:
        {(exitus616,2);(f1,11);(f2,11);(f300,11)}
      Rule Graph:
        [0->{0,5},1->{6},2->{0},3->{4}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6]
        |
        `- p:[0] c: []
MAYBE