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

NO