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

NO