NO
* Step 1: UnreachableRules NO
    + Considered Problem:
        Rules:
          0. f7(A,B)  -> f7(C,B)  [0 >= 1 + A] (?,1)
          1. f7(A,B)  -> f7(C,B)  [A >= 1]     (?,1)
          2. f13(A,B) -> f13(A,B) True         (?,1)
          3. f15(A,B) -> f17(A,B) True         (?,1)
          4. f7(A,B)  -> f13(0,1) [A = 0]      (?,1)
          5. f0(A,B)  -> f7(C,1)  True         (1,1)
        Signature:
          {(f0,2);(f13,2);(f15,2);(f17,2);(f7,2)}
        Flow Graph:
          [0->{0,1,4},1->{0,1,4},2->{2},3->{},4->{2},5->{0,1,4}]
        
    + Applied Processor:
        UnreachableRules
    + Details:
        Following transitions are not reachable from the starting states and are revomed: [3]
* Step 2: FromIts NO
    + Considered Problem:
        Rules:
          0. f7(A,B)  -> f7(C,B)  [0 >= 1 + A] (?,1)
          1. f7(A,B)  -> f7(C,B)  [A >= 1]     (?,1)
          2. f13(A,B) -> f13(A,B) True         (?,1)
          4. f7(A,B)  -> f13(0,1) [A = 0]      (?,1)
          5. f0(A,B)  -> f7(C,1)  True         (1,1)
        Signature:
          {(f0,2);(f13,2);(f15,2);(f17,2);(f7,2)}
        Flow Graph:
          [0->{0,1,4},1->{0,1,4},2->{2},4->{2},5->{0,1,4}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: CloseWith NO
    + Considered Problem:
        Rules:
          f7(A,B)  -> f7(C,B)   [0 >= 1 + A]
          f7(A,B)  -> f7(C,B)   [A >= 1]
          f13(A,B) -> f13(A,B)  True
          f7(A,B)  -> f13(0,1)  [A = 0]
          f0(A,B)  -> f7(C,1)   True
        Signature:
          {(f0,2);(f13,2);(f15,2);(f17,2);(f7,2)}
        Rule Graph:
          [0->{0,1,4},1->{0,1,4},2->{2},4->{2},5->{0,1,4}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO