MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C)  -> f11(D,E,D)      True                                                          (1,1)
          1. f11(A,B,C) -> f20(A,B,C)      [5 >= A && B >= 1]                                            (?,1)
          2. f11(A,B,C) -> f14(A,B,C)      [5 >= A && 0 >= B]                                            (?,1)
          3. f11(A,B,C) -> f14(A,B,C)      [A >= 6]                                                      (?,1)
          4. f20(A,B,C) -> f11(A,D,C)      [-1 + B >= 0 && 4 + -1*A + B >= 0 && 5 + -1*A >= 0 && 2 >= A] (?,1)
          5. f20(A,B,C) -> f20(-1 + A,B,C) [-1 + B >= 0 && 4 + -1*A + B >= 0 && 5 + -1*A >= 0 && A >= 3] (?,1)
          6. f14(A,B,C) -> f11(1 + A,D,C)  [5 >= A]                                                      (?,1)
          7. f14(A,B,C) -> f11(1 + A,D,C)  [A >= 6]                                                      (?,1)
        Signature:
          {(f0,3);(f11,3);(f14,3);(f20,3)}
        Flow Graph:
          [0->{1,2,3},1->{4,5},2->{6,7},3->{6,7},4->{1,2,3},5->{4,5},6->{1,2,3},7->{1,2,3}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(2,7),(3,6),(4,3),(7,1),(7,2)]
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C)  -> f11(D,E,D)      True                                                          (1,1)
          1. f11(A,B,C) -> f20(A,B,C)      [5 >= A && B >= 1]                                            (?,1)
          2. f11(A,B,C) -> f14(A,B,C)      [5 >= A && 0 >= B]                                            (?,1)
          3. f11(A,B,C) -> f14(A,B,C)      [A >= 6]                                                      (?,1)
          4. f20(A,B,C) -> f11(A,D,C)      [-1 + B >= 0 && 4 + -1*A + B >= 0 && 5 + -1*A >= 0 && 2 >= A] (?,1)
          5. f20(A,B,C) -> f20(-1 + A,B,C) [-1 + B >= 0 && 4 + -1*A + B >= 0 && 5 + -1*A >= 0 && A >= 3] (?,1)
          6. f14(A,B,C) -> f11(1 + A,D,C)  [5 >= A]                                                      (?,1)
          7. f14(A,B,C) -> f11(1 + A,D,C)  [A >= 6]                                                      (?,1)
        Signature:
          {(f0,3);(f11,3);(f14,3);(f20,3)}
        Flow Graph:
          [0->{1,2,3},1->{4,5},2->{6},3->{7},4->{1,2},5->{4,5},6->{1,2,3},7->{3}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C)  -> f11(D,E,D)       True                                                          (1,1)
          1. f11(A,B,C) -> f20(A,B,C)       [5 >= A && B >= 1]                                            (?,1)
          2. f11(A,B,C) -> f14(A,B,C)       [5 >= A && 0 >= B]                                            (?,1)
          3. f11(A,B,C) -> f14(A,B,C)       [A >= 6]                                                      (?,1)
          4. f20(A,B,C) -> f11(A,D,C)       [-1 + B >= 0 && 4 + -1*A + B >= 0 && 5 + -1*A >= 0 && 2 >= A] (?,1)
          5. f20(A,B,C) -> f20(-1 + A,B,C)  [-1 + B >= 0 && 4 + -1*A + B >= 0 && 5 + -1*A >= 0 && A >= 3] (?,1)
          6. f14(A,B,C) -> f11(1 + A,D,C)   [5 >= A]                                                      (?,1)
          7. f14(A,B,C) -> f11(1 + A,D,C)   [A >= 6]                                                      (?,1)
          8. f11(A,B,C) -> exitus616(A,B,C) True                                                          (?,1)
          9. f14(A,B,C) -> exitus616(A,B,C) True                                                          (?,1)
        Signature:
          {(exitus616,3);(f0,3);(f11,3);(f14,3);(f20,3)}
        Flow Graph:
          [0->{1,2,3,8},1->{4,5},2->{6,7,9},3->{6,7,9},4->{1,2,3,8},5->{4,5},6->{1,2,3,8},7->{1,2,3,8},8->{},9->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(2,7),(3,6),(4,3),(7,1),(7,2)]
* Step 4: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f0(A,B,C)  -> f11(D,E,D)       True                                                          (1,1)
        1. f11(A,B,C) -> f20(A,B,C)       [5 >= A && B >= 1]                                            (?,1)
        2. f11(A,B,C) -> f14(A,B,C)       [5 >= A && 0 >= B]                                            (?,1)
        3. f11(A,B,C) -> f14(A,B,C)       [A >= 6]                                                      (?,1)
        4. f20(A,B,C) -> f11(A,D,C)       [-1 + B >= 0 && 4 + -1*A + B >= 0 && 5 + -1*A >= 0 && 2 >= A] (?,1)
        5. f20(A,B,C) -> f20(-1 + A,B,C)  [-1 + B >= 0 && 4 + -1*A + B >= 0 && 5 + -1*A >= 0 && A >= 3] (?,1)
        6. f14(A,B,C) -> f11(1 + A,D,C)   [5 >= A]                                                      (?,1)
        7. f14(A,B,C) -> f11(1 + A,D,C)   [A >= 6]                                                      (?,1)
        8. f11(A,B,C) -> exitus616(A,B,C) True                                                          (?,1)
        9. f14(A,B,C) -> exitus616(A,B,C) True                                                          (?,1)
      Signature:
        {(exitus616,3);(f0,3);(f11,3);(f14,3);(f20,3)}
      Flow Graph:
        [0->{1,2,3,8},1->{4,5},2->{6,9},3->{7,9},4->{1,2,8},5->{4,5},6->{1,2,3,8},7->{3,8},8->{},9->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9]
        |
        +- p:[1,4,5,6,2] c: []
        |
        `- p:[3,7] c: []
MAYBE