NO
* Step 1: Looptree NO
    + Considered Problem:
        Rules:
          0. f0(A,B,C) -> f4(D,1 + D,B) True                                      (1,1)
          1. f4(A,B,C) -> f4(D,1 + D,B) [1 + A + -1*B >= 0 && -1 + -1*A + B >= 0] (?,1)
        Signature:
          {(f0,3);(f4,3)}
        Flow Graph:
          [0->{1},1->{1}]
        
    + Applied Processor:
        Looptree
    + Details:
        We construct a looptree:
          P: [0,1]
          |
          `- p:[1] c: []

NO