NO
* Step 1: UnsatRules NO
    + Considered Problem:
        Rules:
          0. f2(A,B)   -> f1(C,D)      [0 >= 1 + C && A = 14] (?,1)
          1. f2(A,B)   -> f2(C,B)      [C >= 0 && A = 14]     (?,1)
          2. f2(A,B)   -> f1(-1 + A,C) [A >= 15 && 0 >= A]    (?,1)
          3. f2(A,B)   -> f1(-1 + A,C) [13 >= A && 0 >= A]    (?,1)
          4. f2(A,B)   -> f2(-1 + A,B) [A >= 15 && A >= 1]    (?,1)
          5. f2(A,B)   -> f2(-1 + A,B) [13 >= A && A >= 1]    (?,1)
          6. f300(A,B) -> f2(A,B)      True                   (1,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{},1->{0,1,2,3,4,5},2->{},3->{},4->{0,1,2,3,4,5},5->{0,1,2,3,4,5},6->{0,1,2,3,4,5}]
        
    + Applied Processor:
        UnsatRules
    + Details:
        Following transitions have unsatisfiable constraints and are removed:  [2]
* Step 2: UnsatPaths NO
    + Considered Problem:
        Rules:
          0. f2(A,B)   -> f1(C,D)      [0 >= 1 + C && A = 14] (?,1)
          1. f2(A,B)   -> f2(C,B)      [C >= 0 && A = 14]     (?,1)
          3. f2(A,B)   -> f1(-1 + A,C) [13 >= A && 0 >= A]    (?,1)
          4. f2(A,B)   -> f2(-1 + A,B) [A >= 15 && A >= 1]    (?,1)
          5. f2(A,B)   -> f2(-1 + A,B) [13 >= A && A >= 1]    (?,1)
          6. f300(A,B) -> f2(A,B)      True                   (1,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{},1->{0,1,3,4,5},3->{},4->{0,1,3,4,5},5->{0,1,3,4,5},6->{0,1,3,4,5}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(4,3),(4,5),(5,0),(5,1),(5,4)]
* Step 3: FromIts NO
    + Considered Problem:
        Rules:
          0. f2(A,B)   -> f1(C,D)      [0 >= 1 + C && A = 14] (?,1)
          1. f2(A,B)   -> f2(C,B)      [C >= 0 && A = 14]     (?,1)
          3. f2(A,B)   -> f1(-1 + A,C) [13 >= A && 0 >= A]    (?,1)
          4. f2(A,B)   -> f2(-1 + A,B) [A >= 15 && A >= 1]    (?,1)
          5. f2(A,B)   -> f2(-1 + A,B) [13 >= A && A >= 1]    (?,1)
          6. f300(A,B) -> f2(A,B)      True                   (1,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{},1->{0,1,3,4,5},3->{},4->{0,1,4},5->{3,5},6->{0,1,3,4,5}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: CloseWith NO
    + Considered Problem:
        Rules:
          f2(A,B)   -> f1(C,D)       [0 >= 1 + C && A = 14]
          f2(A,B)   -> f2(C,B)       [C >= 0 && A = 14]
          f2(A,B)   -> f1(-1 + A,C)  [13 >= A && 0 >= A]
          f2(A,B)   -> f2(-1 + A,B)  [A >= 15 && A >= 1]
          f2(A,B)   -> f2(-1 + A,B)  [13 >= A && A >= 1]
          f300(A,B) -> f2(A,B)       True
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Rule Graph:
          [0->{},1->{0,1,3,4,5},3->{},4->{0,1,4},5->{3,5},6->{0,1,3,4,5}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO