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

NO