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