NO
* Step 1: UnsatRules NO
    + Considered Problem:
        Rules:
          0. f2(A,B,C,D)   -> f300(A,B,C,D)           True                                           (1,1)
          1. f300(A,B,C,D) -> f300(-1 + B,-1 + B,E,D) [A >= 1 && B >= 1 && E >= 1 && A + B >= 1]     (?,1)
          2. f300(A,B,C,D) -> f300(-1 + B,-1 + B,E,D) [A >= 1 && B >= 1 && 0 >= 1 + E && A + B >= 1] (?,1)
          3. f300(A,B,C,D) -> f300(-1 + A,-2 + A,0,D) [A >= 1 && A + B >= 1 && B >= 1]               (?,1)
          4. f300(A,B,C,D) -> f1(A,B,C,E)             [A >= 1 && 0 >= A + B && B >= 1]               (?,1)
          5. f300(A,B,C,D) -> f1(A,B,C,E)             [B >= 1 && 0 >= A]                             (?,1)
          6. f300(A,B,C,D) -> f1(A,B,C,E)             [0 >= B]                                       (?,1)
        Signature:
          {(f1,4);(f2,4);(f300,4)}
        Flow Graph:
          [0->{1,2,3,4,5,6},1->{1,2,3,4,5,6},2->{1,2,3,4,5,6},3->{1,2,3,4,5,6},4->{},5->{},6->{}]
        
    + Applied Processor:
        UnsatRules
    + Details:
        Following transitions have unsatisfiable constraints and are removed:  [4]
* Step 2: UnsatPaths NO
    + Considered Problem:
        Rules:
          0. f2(A,B,C,D)   -> f300(A,B,C,D)           True                                           (1,1)
          1. f300(A,B,C,D) -> f300(-1 + B,-1 + B,E,D) [A >= 1 && B >= 1 && E >= 1 && A + B >= 1]     (?,1)
          2. f300(A,B,C,D) -> f300(-1 + B,-1 + B,E,D) [A >= 1 && B >= 1 && 0 >= 1 + E && A + B >= 1] (?,1)
          3. f300(A,B,C,D) -> f300(-1 + A,-2 + A,0,D) [A >= 1 && A + B >= 1 && B >= 1]               (?,1)
          5. f300(A,B,C,D) -> f1(A,B,C,E)             [B >= 1 && 0 >= A]                             (?,1)
          6. f300(A,B,C,D) -> f1(A,B,C,E)             [0 >= B]                                       (?,1)
        Signature:
          {(f1,4);(f2,4);(f300,4)}
        Flow Graph:
          [0->{1,2,3,5,6},1->{1,2,3,5,6},2->{1,2,3,5,6},3->{1,2,3,5,6},5->{},6->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,5),(2,5),(3,5)]
* Step 3: FromIts NO
    + Considered Problem:
        Rules:
          0. f2(A,B,C,D)   -> f300(A,B,C,D)           True                                           (1,1)
          1. f300(A,B,C,D) -> f300(-1 + B,-1 + B,E,D) [A >= 1 && B >= 1 && E >= 1 && A + B >= 1]     (?,1)
          2. f300(A,B,C,D) -> f300(-1 + B,-1 + B,E,D) [A >= 1 && B >= 1 && 0 >= 1 + E && A + B >= 1] (?,1)
          3. f300(A,B,C,D) -> f300(-1 + A,-2 + A,0,D) [A >= 1 && A + B >= 1 && B >= 1]               (?,1)
          5. f300(A,B,C,D) -> f1(A,B,C,E)             [B >= 1 && 0 >= A]                             (?,1)
          6. f300(A,B,C,D) -> f1(A,B,C,E)             [0 >= B]                                       (?,1)
        Signature:
          {(f1,4);(f2,4);(f300,4)}
        Flow Graph:
          [0->{1,2,3,5,6},1->{1,2,3,6},2->{1,2,3,6},3->{1,2,3,6},5->{},6->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: CloseWith NO
    + Considered Problem:
        Rules:
          f2(A,B,C,D)   -> f300(A,B,C,D)            True
          f300(A,B,C,D) -> f300(-1 + B,-1 + B,E,D)  [A >= 1 && B >= 1 && E >= 1 && A + B >= 1]
          f300(A,B,C,D) -> f300(-1 + B,-1 + B,E,D)  [A >= 1 && B >= 1 && 0 >= 1 + E && A + B >= 1]
          f300(A,B,C,D) -> f300(-1 + A,-2 + A,0,D)  [A >= 1 && A + B >= 1 && B >= 1]
          f300(A,B,C,D) -> f1(A,B,C,E)              [B >= 1 && 0 >= A]
          f300(A,B,C,D) -> f1(A,B,C,E)              [0 >= B]
        Signature:
          {(f1,4);(f2,4);(f300,4)}
        Rule Graph:
          [0->{1,2,3,5,6},1->{1,2,3,6},2->{1,2,3,6},3->{1,2,3,6},5->{},6->{}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO