YES
* Step 1: TrivialSCCs YES
    + Considered Problem:
        Rules:
          0. f0(A) -> f5(0)     True                             (1,1)
          1. f5(A) -> f5(1 + A) [A >= 0 && 1 >= A]               (?,1)
          2. f5(A) -> f13(A)    [A >= 0 && A >= 2 && 0 >= 1 + B] (?,1)
          3. f5(A) -> f13(A)    [A >= 0 && A >= 2]               (?,1)
        Signature:
          {(f0,1);(f13,1);(f5,1)}
        Flow Graph:
          [0->{1,2,3},1->{1,2,3},2->{},3->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths YES
    + Considered Problem:
        Rules:
          0. f0(A) -> f5(0)     True                             (1,1)
          1. f5(A) -> f5(1 + A) [A >= 0 && 1 >= A]               (?,1)
          2. f5(A) -> f13(A)    [A >= 0 && A >= 2 && 0 >= 1 + B] (1,1)
          3. f5(A) -> f13(A)    [A >= 0 && A >= 2]               (1,1)
        Signature:
          {(f0,1);(f13,1);(f5,1)}
        Flow Graph:
          [0->{1,2,3},1->{1,2,3},2->{},3->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,2),(0,3)]
* Step 3: Looptree YES
    + Considered Problem:
        Rules:
          0. f0(A) -> f5(0)     True                             (1,1)
          1. f5(A) -> f5(1 + A) [A >= 0 && 1 >= A]               (?,1)
          2. f5(A) -> f13(A)    [A >= 0 && A >= 2 && 0 >= 1 + B] (1,1)
          3. f5(A) -> f13(A)    [A >= 0 && A >= 2]               (1,1)
        Signature:
          {(f0,1);(f13,1);(f5,1)}
        Flow Graph:
          [0->{1},1->{1,2,3},2->{},3->{}]
        
    + Applied Processor:
        Looptree
    + Details:
        We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[1] c: [1]

YES