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