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

NO