NO
* Step 1: UnsatRules NO
    + 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:
        UnsatRules
    + Details:
        Following transitions have unsatisfiable constraints and are removed:  [2,3]
* Step 2: UnsatPaths NO
    + 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)
        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 3: FromIts NO
    + 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)
        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:
        FromIts
    + Details:
        ()
* Step 4: CloseWith NO
    + Considered Problem:
        Rules:
          f0(A,B,C,D,E) -> f2(A,F,C,D,E)        [0 >= A]
          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]
          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]
          f0(A,B,C,D,E) -> f0(F,B,C,H,F)        [2*F >= 1 && G >= 1 && A = 2*F]
          f1(A,B,C,D,E) -> f0(A,B,C,D,E)        True
        Signature:
          {(f0,5);(f1,5);(f2,5)}
        Rule Graph:
          [0->{},1->{1,4,5},4->{1,4,5},5->{1,4,5},6->{0,1,4,5}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO