MAYBE
* Step 1: ArgumentFilter MAYBE
    + Considered Problem:
        Rules:
          0. f1(A,B,C,D,E) -> f0(A,B,C,D,E)       True                                                                           (1,1)
          1. f0(A,B,C,D,E) -> f0(F,B,C,H,F)       [2*F >= 1 && G >= 1 && A = 2*F]                                                (?,1)
          2. 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)
          3. 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) -> f2(A,F,C,D,E)       [0 >= A]                                                                       (?,1)
        Signature:
          {(f0,5);(f1,5);(f2,5)}
        Flow Graph:
          [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3,4},4->{}]
        
    + Applied Processor:
        ArgumentFilter [1,2,3,4]
    + Details:
        We remove following argument positions: [1,2,3,4].
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f1(A) -> f0(A)       True                                                                           (1,1)
          1. f0(A) -> f0(F)       [2*F >= 1 && G >= 1 && A = 2*F]                                                (?,1)
          2. f0(A) -> f0(1 + 3*A) [A >= 1 && 2*G >= 1 + A && 3*A >= 3*F && 3*F >= 3*A && 2*G >= 1 + F && F >= 1] (?,1)
          3. f0(A) -> f0(1 + 3*A) [A >= 1 && A >= 1 + 2*G && 3*A >= 3*F && 3*F >= 3*A && F >= 1 + 2*G && F >= 1] (?,1)
          4. f0(A) -> f2(A)       [0 >= A]                                                                       (?,1)
        Signature:
          {(f0,5);(f1,5);(f2,5)}
        Flow Graph:
          [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3,4},4->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,4),(2,4),(3,4)]
* Step 3: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f1(A) -> f0(A)       True                                                                           (1,1)
          1. f0(A) -> f0(F)       [2*F >= 1 && G >= 1 && A = 2*F]                                                (?,1)
          2. f0(A) -> f0(1 + 3*A) [A >= 1 && 2*G >= 1 + A && 3*A >= 3*F && 3*F >= 3*A && 2*G >= 1 + F && F >= 1] (?,1)
          3. f0(A) -> f0(1 + 3*A) [A >= 1 && A >= 1 + 2*G && 3*A >= 3*F && 3*F >= 3*A && F >= 1 + 2*G && F >= 1] (?,1)
          4. f0(A) -> f2(A)       [0 >= A]                                                                       (?,1)
        Signature:
          {(f0,5);(f1,5);(f2,5)}
        Flow Graph:
          [0->{1,2,3,4},1->{1,2,3},2->{1,2,3},3->{1,2,3},4->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f1(A) -> f0(A)        True
          f0(A) -> f0(F)        [2*F >= 1 && G >= 1 && A = 2*F]
          f0(A) -> f0(1 + 3*A)  [A >= 1 && 2*G >= 1 + A && 3*A >= 3*F && 3*F >= 3*A && 2*G >= 1 + F && F >= 1]
          f0(A) -> f0(1 + 3*A)  [A >= 1 && A >= 1 + 2*G && 3*A >= 3*F && 3*F >= 3*A && F >= 1 + 2*G && F >= 1]
          f0(A) -> f2(A)        [0 >= A]
        Signature:
          {(f0,5);(f1,5);(f2,5)}
        Rule Graph:
          [0->{1,2,3,4},1->{1,2,3},2->{1,2,3},3->{1,2,3},4->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        f1(A) -> f0(A)         True
        f0(A) -> f0(F)         [2*F >= 1 && G >= 1 && A = 2*F]
        f0(A) -> f0(1 + 3*A)   [A >= 1 && 2*G >= 1 + A && 3*A >= 3*F && 3*F >= 3*A && 2*G >= 1 + F && F >= 1]
        f0(A) -> f0(1 + 3*A)   [A >= 1 && A >= 1 + 2*G && 3*A >= 3*F && 3*F >= 3*A && F >= 1 + 2*G && F >= 1]
        f0(A) -> f2(A)         [0 >= A]
        f2(A) -> exitus616(A)  True
        f0(A) -> exitus616(A)  True
        f0(A) -> exitus616(A)  True
        f0(A) -> exitus616(A)  True
      Signature:
        {(exitus616,1);(f0,5);(f1,5);(f2,5)}
      Rule Graph:
        [0->{1,2,3,4},1->{1,2,3,6},2->{1,2,3,7},3->{1,2,3,8},4->{5}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8]
        |
        `- p:[1,2,3] c: []
MAYBE