NO * Step 1: Looptree NO + Considered Problem: Rules: 0. start(A,B,C) -> eval(A,B,C) True (1,1) 1. eval(A,B,C) -> eval(A,B + C,-1 + C) [A >= 0 && B^3 >= C] (?,1) 2. eval(A,B,C) -> eval(-1 + A,B,-1 + C) [A >= 0 && B^3 >= C] (?,1) Signature: {(eval,3);(start,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: [2] | `- p:[1] c: [] NO