NO
* Step 1: UnsatPaths NO
    + Considered Problem:
        Rules:
          0. f2(A,B) -> f300(-1 + A,C) [A >= 2] (?,1)
          1. f2(A,B) -> f2(-1 + A,B)   [1 >= A] (?,1)
          2. f3(A,B) -> f2(A,B)        True     (1,1)
        Signature:
          {(f2,2);(f3,2);(f300,2)}
        Flow Graph:
          [0->{},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,0)]
* Step 2: FromIts NO
    + Considered Problem:
        Rules:
          0. f2(A,B) -> f300(-1 + A,C) [A >= 2] (?,1)
          1. f2(A,B) -> f2(-1 + A,B)   [1 >= A] (?,1)
          2. f3(A,B) -> f2(A,B)        True     (1,1)
        Signature:
          {(f2,2);(f3,2);(f300,2)}
        Flow Graph:
          [0->{},1->{1},2->{0,1}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: CloseWith NO
    + Considered Problem:
        Rules:
          f2(A,B) -> f300(-1 + A,C)  [A >= 2]
          f2(A,B) -> f2(-1 + A,B)    [1 >= A]
          f3(A,B) -> f2(A,B)         True
        Signature:
          {(f2,2);(f3,2);(f300,2)}
        Rule Graph:
          [0->{},1->{1},2->{0,1}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO