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