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