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