NO
* Step 1: UnsatPaths NO
    + Considered Problem:
        Rules:
          0. f9(A,B,C,D)  -> f15(A,0,E,D) [0 >= A && E >= 1] (?,1)
          1. f15(A,B,C,D) -> f15(A,B,C,D) [C >= 1]           (?,1)
          2. f23(A,B,C,D) -> f23(A,B,C,D) True               (?,1)
          3. f25(A,B,C,D) -> f28(A,B,C,D) True               (?,1)
          4. f15(A,B,C,D) -> f9(E,B,C,0)  [0 >= C]           (?,1)
          5. f9(A,B,C,D)  -> f23(A,B,C,D) [A >= 1]           (?,1)
          6. f0(A,B,C,D)  -> f9(E,0,C,0)  True               (1,1)
        Signature:
          {(f0,4);(f15,4);(f23,4);(f25,4);(f28,4);(f9,4)}
        Flow Graph:
          [0->{1,4},1->{1,4},2->{2},3->{},4->{0,5},5->{2},6->{0,5}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,4),(1,4)]
* Step 2: UnreachableRules NO
    + Considered Problem:
        Rules:
          0. f9(A,B,C,D)  -> f15(A,0,E,D) [0 >= A && E >= 1] (?,1)
          1. f15(A,B,C,D) -> f15(A,B,C,D) [C >= 1]           (?,1)
          2. f23(A,B,C,D) -> f23(A,B,C,D) True               (?,1)
          3. f25(A,B,C,D) -> f28(A,B,C,D) True               (?,1)
          4. f15(A,B,C,D) -> f9(E,B,C,0)  [0 >= C]           (?,1)
          5. f9(A,B,C,D)  -> f23(A,B,C,D) [A >= 1]           (?,1)
          6. f0(A,B,C,D)  -> f9(E,0,C,0)  True               (1,1)
        Signature:
          {(f0,4);(f15,4);(f23,4);(f25,4);(f28,4);(f9,4)}
        Flow Graph:
          [0->{1},1->{1},2->{2},3->{},4->{0,5},5->{2},6->{0,5}]
        
    + Applied Processor:
        UnreachableRules
    + Details:
        Following transitions are not reachable from the starting states and are revomed: [3,4]
* Step 3: FromIts NO
    + Considered Problem:
        Rules:
          0. f9(A,B,C,D)  -> f15(A,0,E,D) [0 >= A && E >= 1] (?,1)
          1. f15(A,B,C,D) -> f15(A,B,C,D) [C >= 1]           (?,1)
          2. f23(A,B,C,D) -> f23(A,B,C,D) True               (?,1)
          5. f9(A,B,C,D)  -> f23(A,B,C,D) [A >= 1]           (?,1)
          6. f0(A,B,C,D)  -> f9(E,0,C,0)  True               (1,1)
        Signature:
          {(f0,4);(f15,4);(f23,4);(f25,4);(f28,4);(f9,4)}
        Flow Graph:
          [0->{1},1->{1},2->{2},5->{2},6->{0,5}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: CloseWith NO
    + Considered Problem:
        Rules:
          f9(A,B,C,D)  -> f15(A,0,E,D)  [0 >= A && E >= 1]
          f15(A,B,C,D) -> f15(A,B,C,D)  [C >= 1]
          f23(A,B,C,D) -> f23(A,B,C,D)  True
          f9(A,B,C,D)  -> f23(A,B,C,D)  [A >= 1]
          f0(A,B,C,D)  -> f9(E,0,C,0)   True
        Signature:
          {(f0,4);(f15,4);(f23,4);(f25,4);(f28,4);(f9,4)}
        Rule Graph:
          [0->{1},1->{1},2->{2},5->{2},6->{0,5}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO