MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0.  f0(A,B,C,D,E,F)  -> f12(G,G,G,0,E,F)     True         (1,1)
          1.  f12(A,B,C,D,E,F) -> f12(A,B,C,1 + D,G,F) [C >= 1 + D] (?,1)
          2.  f27(A,B,C,D,E,F) -> f27(A,B,C,D,E,G)     [0 >= 1 + H] (?,1)
          3.  f27(A,B,C,D,E,F) -> f27(A,B,C,D,E,G)     True         (?,1)
          4.  f42(A,B,C,D,E,F) -> f42(A,B,C,D,E,F)     [G >= 1 + H] (?,1)
          5.  f42(A,B,C,D,E,F) -> f42(A,B,C,D,E,F)     True         (?,1)
          6.  f55(A,B,C,D,E,F) -> f55(A,B,C,D,E,F)     [G >= 1 + H] (?,1)
          7.  f55(A,B,C,D,E,F) -> f55(A,B,C,D,E,F)     True         (?,1)
          8.  f55(A,B,C,D,E,F) -> f66(A,B,C,D,E,F)     True         (?,1)
          9.  f42(A,B,C,D,E,F) -> f55(A,B,C,D,E,F)     True         (?,1)
          10. f27(A,B,C,D,E,F) -> f42(A,B,C,D,E,F)     True         (?,1)
          11. f12(A,B,C,D,E,F) -> f27(A,B,C,D,E,F)     [D >= C]     (?,1)
        Signature:
          {(f0,6);(f12,6);(f27,6);(f42,6);(f55,6);(f66,6)}
        Flow Graph:
          [0->{1,11},1->{1,11},2->{2,3,10},3->{2,3,10},4->{4,5,9},5->{4,5,9},6->{6,7,8},7->{6,7,8},8->{},9->{6,7,8}
          ,10->{4,5,9},11->{2,3,10}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0.  f0(A,B,C,D,E,F)  -> f12(G,G,G,0,E,F)     True         (1,1)
          1.  f12(A,B,C,D,E,F) -> f12(A,B,C,1 + D,G,F) [C >= 1 + D] (?,1)
          2.  f27(A,B,C,D,E,F) -> f27(A,B,C,D,E,G)     [0 >= 1 + H] (?,1)
          3.  f27(A,B,C,D,E,F) -> f27(A,B,C,D,E,G)     True         (?,1)
          4.  f42(A,B,C,D,E,F) -> f42(A,B,C,D,E,F)     [G >= 1 + H] (?,1)
          5.  f42(A,B,C,D,E,F) -> f42(A,B,C,D,E,F)     True         (?,1)
          6.  f55(A,B,C,D,E,F) -> f55(A,B,C,D,E,F)     [G >= 1 + H] (?,1)
          7.  f55(A,B,C,D,E,F) -> f55(A,B,C,D,E,F)     True         (?,1)
          8.  f55(A,B,C,D,E,F) -> f66(A,B,C,D,E,F)     True         (1,1)
          9.  f42(A,B,C,D,E,F) -> f55(A,B,C,D,E,F)     True         (1,1)
          10. f27(A,B,C,D,E,F) -> f42(A,B,C,D,E,F)     True         (1,1)
          11. f12(A,B,C,D,E,F) -> f27(A,B,C,D,E,F)     [D >= C]     (1,1)
        Signature:
          {(f0,6);(f12,6);(f27,6);(f42,6);(f55,6);(f66,6)}
        Flow Graph:
          [0->{1,11},1->{1,11},2->{2,3,10},3->{2,3,10},4->{4,5,9},5->{4,5,9},6->{6,7,8},7->{6,7,8},8->{},9->{6,7,8}
          ,10->{4,5,9},11->{2,3,10}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        0.  f0(A,B,C,D,E,F)  -> f12(G,G,G,0,E,F)       True         (1,1)
        1.  f12(A,B,C,D,E,F) -> f12(A,B,C,1 + D,G,F)   [C >= 1 + D] (?,1)
        2.  f27(A,B,C,D,E,F) -> f27(A,B,C,D,E,G)       [0 >= 1 + H] (?,1)
        3.  f27(A,B,C,D,E,F) -> f27(A,B,C,D,E,G)       True         (?,1)
        4.  f42(A,B,C,D,E,F) -> f42(A,B,C,D,E,F)       [G >= 1 + H] (?,1)
        5.  f42(A,B,C,D,E,F) -> f42(A,B,C,D,E,F)       True         (?,1)
        6.  f55(A,B,C,D,E,F) -> f55(A,B,C,D,E,F)       [G >= 1 + H] (?,1)
        7.  f55(A,B,C,D,E,F) -> f55(A,B,C,D,E,F)       True         (?,1)
        8.  f55(A,B,C,D,E,F) -> f66(A,B,C,D,E,F)       True         (?,1)
        9.  f42(A,B,C,D,E,F) -> f55(A,B,C,D,E,F)       True         (?,1)
        10. f27(A,B,C,D,E,F) -> f42(A,B,C,D,E,F)       True         (?,1)
        11. f12(A,B,C,D,E,F) -> f27(A,B,C,D,E,F)       [D >= C]     (?,1)
        12. f55(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True         (?,1)
      Signature:
        {(exitus616,6);(f0,6);(f12,6);(f27,6);(f42,6);(f55,6);(f66,6)}
      Flow Graph:
        [0->{1,11},1->{1,11},2->{2,3,10},3->{2,3,10},4->{4,5,9},5->{4,5,9},6->{6,7,8,12},7->{6,7,8,12},8->{},9->{6
        ,7,8,12},10->{4,5,9},11->{2,3,10},12->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9,10,11,12]
        |
        +- p:[1] c: [1]
        |
        +- p:[2,3] c: []
        |
        +- p:[4,5] c: []
        |
        `- p:[6,7] c: []
MAYBE