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

NO