MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0.  f11(A,B,C) -> f14(A,B,C)      [A >= 6]           (?,1)
          1.  f11(A,B,C) -> f14(A,B,C)      [5 >= A && 0 >= B] (?,1)
          2.  f14(A,B,C) -> f11(1 + A,D,C)  [A >= 6]           (?,1)
          3.  f26(A,B,C) -> f27(A,B,C)      True               (?,1)
          4.  f27(A,B,C) -> f27(A,B,C)      True               (?,1)
          5.  f29(A,B,C) -> f32(A,B,C)      True               (?,1)
          6.  f20(A,B,C) -> f20(-1 + A,B,C) [A >= 3]           (?,1)
          7.  f20(A,B,C) -> f11(A,D,C)      [2 >= A]           (?,1)
          8.  f14(A,B,C) -> f11(1 + A,D,C)  [5 >= A]           (?,1)
          9.  f11(A,B,C) -> f20(A,B,C)      [5 >= A && B >= 1] (?,1)
          10. f0(A,B,C)  -> f11(D,E,D)      True               (1,1)
        Signature:
          {(f0,3);(f11,3);(f14,3);(f20,3);(f26,3);(f27,3);(f29,3);(f32,3)}
        Flow Graph:
          [0->{2,8},1->{2,8},2->{0,1,9},3->{4},4->{4},5->{},6->{6,7},7->{0,1,9},8->{0,1,9},9->{6,7},10->{0,1,9}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0.  f11(A,B,C) -> f14(A,B,C)      [A >= 6]           (?,1)
          1.  f11(A,B,C) -> f14(A,B,C)      [5 >= A && 0 >= B] (?,1)
          2.  f14(A,B,C) -> f11(1 + A,D,C)  [A >= 6]           (?,1)
          3.  f26(A,B,C) -> f27(A,B,C)      True               (1,1)
          4.  f27(A,B,C) -> f27(A,B,C)      True               (?,1)
          5.  f29(A,B,C) -> f32(A,B,C)      True               (1,1)
          6.  f20(A,B,C) -> f20(-1 + A,B,C) [A >= 3]           (?,1)
          7.  f20(A,B,C) -> f11(A,D,C)      [2 >= A]           (?,1)
          8.  f14(A,B,C) -> f11(1 + A,D,C)  [5 >= A]           (?,1)
          9.  f11(A,B,C) -> f20(A,B,C)      [5 >= A && B >= 1] (?,1)
          10. f0(A,B,C)  -> f11(D,E,D)      True               (1,1)
        Signature:
          {(f0,3);(f11,3);(f14,3);(f20,3);(f26,3);(f27,3);(f29,3);(f32,3)}
        Flow Graph:
          [0->{2,8},1->{2,8},2->{0,1,9},3->{4},4->{4},5->{},6->{6,7},7->{0,1,9},8->{0,1,9},9->{6,7},10->{0,1,9}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,8),(1,2),(2,1),(2,9),(7,0)]
* Step 3: UnreachableRules MAYBE
    + Considered Problem:
        Rules:
          0.  f11(A,B,C) -> f14(A,B,C)      [A >= 6]           (?,1)
          1.  f11(A,B,C) -> f14(A,B,C)      [5 >= A && 0 >= B] (?,1)
          2.  f14(A,B,C) -> f11(1 + A,D,C)  [A >= 6]           (?,1)
          3.  f26(A,B,C) -> f27(A,B,C)      True               (1,1)
          4.  f27(A,B,C) -> f27(A,B,C)      True               (?,1)
          5.  f29(A,B,C) -> f32(A,B,C)      True               (1,1)
          6.  f20(A,B,C) -> f20(-1 + A,B,C) [A >= 3]           (?,1)
          7.  f20(A,B,C) -> f11(A,D,C)      [2 >= A]           (?,1)
          8.  f14(A,B,C) -> f11(1 + A,D,C)  [5 >= A]           (?,1)
          9.  f11(A,B,C) -> f20(A,B,C)      [5 >= A && B >= 1] (?,1)
          10. f0(A,B,C)  -> f11(D,E,D)      True               (1,1)
        Signature:
          {(f0,3);(f11,3);(f14,3);(f20,3);(f26,3);(f27,3);(f29,3);(f32,3)}
        Flow Graph:
          [0->{2},1->{8},2->{0},3->{4},4->{4},5->{},6->{6,7},7->{1,9},8->{0,1,9},9->{6,7},10->{0,1,9}]
        
    + Applied Processor:
        UnreachableRules
    + Details:
        Following transitions are not reachable from the starting states and are revomed: [3,4,5]
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0.  f11(A,B,C) -> f14(A,B,C)      [A >= 6]           (?,1)
          1.  f11(A,B,C) -> f14(A,B,C)      [5 >= A && 0 >= B] (?,1)
          2.  f14(A,B,C) -> f11(1 + A,D,C)  [A >= 6]           (?,1)
          6.  f20(A,B,C) -> f20(-1 + A,B,C) [A >= 3]           (?,1)
          7.  f20(A,B,C) -> f11(A,D,C)      [2 >= A]           (?,1)
          8.  f14(A,B,C) -> f11(1 + A,D,C)  [5 >= A]           (?,1)
          9.  f11(A,B,C) -> f20(A,B,C)      [5 >= A && B >= 1] (?,1)
          10. f0(A,B,C)  -> f11(D,E,D)      True               (1,1)
        Signature:
          {(f0,3);(f11,3);(f14,3);(f20,3);(f26,3);(f27,3);(f29,3);(f32,3)}
        Flow Graph:
          [0->{2},1->{8},2->{0},6->{6,7},7->{1,9},8->{0,1,9},9->{6,7},10->{0,1,9}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0.  f11(A,B,C) -> f14(A,B,C)       [A >= 6]           (?,1)
          1.  f11(A,B,C) -> f14(A,B,C)       [5 >= A && 0 >= B] (?,1)
          2.  f14(A,B,C) -> f11(1 + A,D,C)   [A >= 6]           (?,1)
          6.  f20(A,B,C) -> f20(-1 + A,B,C)  [A >= 3]           (?,1)
          7.  f20(A,B,C) -> f11(A,D,C)       [2 >= A]           (?,1)
          8.  f14(A,B,C) -> f11(1 + A,D,C)   [5 >= A]           (?,1)
          9.  f11(A,B,C) -> f20(A,B,C)       [5 >= A && B >= 1] (?,1)
          10. f0(A,B,C)  -> f11(D,E,D)       True               (1,1)
          11. f11(A,B,C) -> exitus616(A,B,C) True               (?,1)
          12. f14(A,B,C) -> exitus616(A,B,C) True               (?,1)
        Signature:
          {(exitus616,3);(f0,3);(f11,3);(f14,3);(f20,3);(f26,3);(f27,3);(f29,3);(f32,3)}
        Flow Graph:
          [0->{2,8,12},1->{2,8,12},2->{0,1,9,11},6->{6,7},7->{0,1,9,11},8->{0,1,9,11},9->{6,7},10->{0,1,9,11},11->{}
          ,12->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,8),(1,2),(2,1),(2,9),(7,0)]
* Step 6: Failure MAYBE
  + Considered Problem:
      Rules:
        0.  f11(A,B,C) -> f14(A,B,C)       [A >= 6]           (?,1)
        1.  f11(A,B,C) -> f14(A,B,C)       [5 >= A && 0 >= B] (?,1)
        2.  f14(A,B,C) -> f11(1 + A,D,C)   [A >= 6]           (?,1)
        6.  f20(A,B,C) -> f20(-1 + A,B,C)  [A >= 3]           (?,1)
        7.  f20(A,B,C) -> f11(A,D,C)       [2 >= A]           (?,1)
        8.  f14(A,B,C) -> f11(1 + A,D,C)   [5 >= A]           (?,1)
        9.  f11(A,B,C) -> f20(A,B,C)       [5 >= A && B >= 1] (?,1)
        10. f0(A,B,C)  -> f11(D,E,D)       True               (1,1)
        11. f11(A,B,C) -> exitus616(A,B,C) True               (?,1)
        12. f14(A,B,C) -> exitus616(A,B,C) True               (?,1)
      Signature:
        {(exitus616,3);(f0,3);(f11,3);(f14,3);(f20,3);(f26,3);(f27,3);(f29,3);(f32,3)}
      Flow Graph:
        [0->{2,12},1->{8,12},2->{0,11},6->{6,7},7->{1,9,11},8->{0,1,9,11},9->{6,7},10->{0,1,9,11},11->{},12->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,6,7,8,9,10,11,12]
        |
        +- p:[1,7,6,9,8] c: []
        |
        `- p:[0,2] c: []
MAYBE