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