MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E) -> f2(A,F,C,D,E)       [0 >= A]                                                                       (?,1)
          1. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G) [A >= 1 && A >= 1 + 2*G && 3*A >= 3*F && 3*F >= 3*A && F >= 1 + 2*G && F >= 1] (?,1)
          2. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G) [A >= 1 && A >= 1 + 2*G && 3*A >= 3*F && 3*F >= 3*A && 2*G >= 1 + F && F >= 1] (?,1)
          3. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G) [A >= 1 && 2*G >= 1 + A && 3*A >= 3*F && 3*F >= 3*A && F >= 1 + 2*G && F >= 1] (?,1)
          4. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G) [A >= 1 && 2*G >= 1 + A && 3*A >= 3*F && 3*F >= 3*A && 2*G >= 1 + F && F >= 1] (?,1)
          5. f0(A,B,C,D,E) -> f0(F,B,C,H,F)       [2*F >= 1 && G >= 1 && A = 2*F]                                                (?,1)
          6. f1(A,B,C,D,E) -> f0(A,B,C,D,E)       True                                                                           (1,1)
        Signature:
          {(f0,5);(f1,5);(f2,5)}
        Flow Graph:
          [0->{},1->{0,1,2,3,4,5},2->{0,1,2,3,4,5},3->{0,1,2,3,4,5},4->{0,1,2,3,4,5},5->{0,1,2,3,4,5},6->{0,1,2,3,4
          ,5}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatRules MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E) -> f2(A,F,C,D,E)       [0 >= A]                                                                       (1,1)
          1. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G) [A >= 1 && A >= 1 + 2*G && 3*A >= 3*F && 3*F >= 3*A && F >= 1 + 2*G && F >= 1] (?,1)
          2. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G) [A >= 1 && A >= 1 + 2*G && 3*A >= 3*F && 3*F >= 3*A && 2*G >= 1 + F && F >= 1] (?,1)
          3. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G) [A >= 1 && 2*G >= 1 + A && 3*A >= 3*F && 3*F >= 3*A && F >= 1 + 2*G && F >= 1] (?,1)
          4. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G) [A >= 1 && 2*G >= 1 + A && 3*A >= 3*F && 3*F >= 3*A && 2*G >= 1 + F && F >= 1] (?,1)
          5. f0(A,B,C,D,E) -> f0(F,B,C,H,F)       [2*F >= 1 && G >= 1 && A = 2*F]                                                (?,1)
          6. f1(A,B,C,D,E) -> f0(A,B,C,D,E)       True                                                                           (1,1)
        Signature:
          {(f0,5);(f1,5);(f2,5)}
        Flow Graph:
          [0->{},1->{0,1,2,3,4,5},2->{0,1,2,3,4,5},3->{0,1,2,3,4,5},4->{0,1,2,3,4,5},5->{0,1,2,3,4,5},6->{0,1,2,3,4
          ,5}]
        
    + Applied Processor:
        UnsatRules
    + Details:
        Following transitions have unsatisfiable constraints and are removed:  [2,3]
* Step 3: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E) -> f2(A,F,C,D,E)       [0 >= A]                                                                       (1,1)
          1. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G) [A >= 1 && A >= 1 + 2*G && 3*A >= 3*F && 3*F >= 3*A && F >= 1 + 2*G && F >= 1] (?,1)
          4. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G) [A >= 1 && 2*G >= 1 + A && 3*A >= 3*F && 3*F >= 3*A && 2*G >= 1 + F && F >= 1] (?,1)
          5. f0(A,B,C,D,E) -> f0(F,B,C,H,F)       [2*F >= 1 && G >= 1 && A = 2*F]                                                (?,1)
          6. f1(A,B,C,D,E) -> f0(A,B,C,D,E)       True                                                                           (1,1)
        Signature:
          {(f0,5);(f1,5);(f2,5)}
        Flow Graph:
          [0->{},1->{0,1,4,5},4->{0,1,4,5},5->{0,1,4,5},6->{0,1,4,5}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,0),(4,0),(5,0)]
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E) -> f2(A,F,C,D,E)       [0 >= A]                                                                       (1,1)
          1. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G) [A >= 1 && A >= 1 + 2*G && 3*A >= 3*F && 3*F >= 3*A && F >= 1 + 2*G && F >= 1] (?,1)
          4. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G) [A >= 1 && 2*G >= 1 + A && 3*A >= 3*F && 3*F >= 3*A && 2*G >= 1 + F && F >= 1] (?,1)
          5. f0(A,B,C,D,E) -> f0(F,B,C,H,F)       [2*F >= 1 && G >= 1 && A = 2*F]                                                (?,1)
          6. f1(A,B,C,D,E) -> f0(A,B,C,D,E)       True                                                                           (1,1)
        Signature:
          {(f0,5);(f1,5);(f2,5)}
        Flow Graph:
          [0->{},1->{1,4,5},4->{1,4,5},5->{1,4,5},6->{0,1,4,5}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E) -> f2(A,F,C,D,E)        [0 >= A]                                                                       (?,1)
          1. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G)  [A >= 1 && A >= 1 + 2*G && 3*A >= 3*F && 3*F >= 3*A && F >= 1 + 2*G && F >= 1] (?,1)
          4. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G)  [A >= 1 && 2*G >= 1 + A && 3*A >= 3*F && 3*F >= 3*A && 2*G >= 1 + F && F >= 1] (?,1)
          5. f0(A,B,C,D,E) -> f0(F,B,C,H,F)        [2*F >= 1 && G >= 1 && A = 2*F]                                                (?,1)
          6. f1(A,B,C,D,E) -> f0(A,B,C,D,E)        True                                                                           (1,1)
          7. f0(A,B,C,D,E) -> exitus616(A,B,C,D,E) True                                                                           (?,1)
        Signature:
          {(exitus616,5);(f0,5);(f1,5);(f2,5)}
        Flow Graph:
          [0->{},1->{0,1,4,5,7},4->{0,1,4,5,7},5->{0,1,4,5,7},6->{0,1,4,5,7},7->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,0),(4,0),(5,0)]
* Step 6: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f0(A,B,C,D,E) -> f2(A,F,C,D,E)        [0 >= A]                                                                       (?,1)
        1. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G)  [A >= 1 && A >= 1 + 2*G && 3*A >= 3*F && 3*F >= 3*A && F >= 1 + 2*G && F >= 1] (?,1)
        4. f0(A,B,C,D,E) -> f0(1 + 3*A,B,F,H,G)  [A >= 1 && 2*G >= 1 + A && 3*A >= 3*F && 3*F >= 3*A && 2*G >= 1 + F && F >= 1] (?,1)
        5. f0(A,B,C,D,E) -> f0(F,B,C,H,F)        [2*F >= 1 && G >= 1 && A = 2*F]                                                (?,1)
        6. f1(A,B,C,D,E) -> f0(A,B,C,D,E)        True                                                                           (1,1)
        7. f0(A,B,C,D,E) -> exitus616(A,B,C,D,E) True                                                                           (?,1)
      Signature:
        {(exitus616,5);(f0,5);(f1,5);(f2,5)}
      Flow Graph:
        [0->{},1->{1,4,5,7},4->{1,4,5,7},5->{1,4,5,7},6->{0,1,4,5,7},7->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,4,5,6,7]
        |
        `- p:[1,4,5] c: []
MAYBE