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

NO