NO * Step 1: UnsatPaths NO + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f10(1,1,H,0,2,1,G) [H >= 0] (1,1) 1. f10(A,B,C,D,E,F,G) -> f21(A,-1 + B,C,D,E,F,0) [F >= 1 && E >= F && B >= 1 && 0 >= C] (?,1) 2. f10(A,B,C,D,E,F,G) -> f21(1 + A,1 + A,H,D,E,F,I) [I >= 0 && 1 >= I && H >= 0 && F >= 1 && E >= F && 0 >= B && 0 >= C] (?,1) 3. f10(A,B,C,D,E,F,G) -> f21(A,B,-1 + C,D,E,F,H) [H >= 0 && 1 >= H && F >= 1 && C >= 1 && E >= F] (?,1) 4. f21(A,B,C,D,E,F,G) -> f10(A,B,C,D,E,-1 + F,G) [1 + E >= A && 0 >= G] (?,1) 5. f21(A,B,C,D,E,F,G) -> f10(A,B,C,D,E,1 + F,G) [1 + E >= A && G >= 1] (?,1) 6. f10(A,B,C,D,E,F,G) -> f32(A,B,C,D,E,F,G) [0 >= F && E >= F] (?,1) 7. f10(A,B,C,D,E,F,G) -> f32(A,B,C,D,E,F,G) [F >= 1 + E] (?,1) Signature: {(f0,7);(f10,7);(f21,7);(f32,7)} Flow Graph: [0->{1,2,3,6,7},1->{4,5},2->{4,5},3->{4,5},4->{1,2,3,6,7},5->{1,2,3,6,7},6->{},7->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,2),(0,6),(0,7),(1,5)] * Step 2: FromIts NO + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f10(1,1,H,0,2,1,G) [H >= 0] (1,1) 1. f10(A,B,C,D,E,F,G) -> f21(A,-1 + B,C,D,E,F,0) [F >= 1 && E >= F && B >= 1 && 0 >= C] (?,1) 2. f10(A,B,C,D,E,F,G) -> f21(1 + A,1 + A,H,D,E,F,I) [I >= 0 && 1 >= I && H >= 0 && F >= 1 && E >= F && 0 >= B && 0 >= C] (?,1) 3. f10(A,B,C,D,E,F,G) -> f21(A,B,-1 + C,D,E,F,H) [H >= 0 && 1 >= H && F >= 1 && C >= 1 && E >= F] (?,1) 4. f21(A,B,C,D,E,F,G) -> f10(A,B,C,D,E,-1 + F,G) [1 + E >= A && 0 >= G] (?,1) 5. f21(A,B,C,D,E,F,G) -> f10(A,B,C,D,E,1 + F,G) [1 + E >= A && G >= 1] (?,1) 6. f10(A,B,C,D,E,F,G) -> f32(A,B,C,D,E,F,G) [0 >= F && E >= F] (?,1) 7. f10(A,B,C,D,E,F,G) -> f32(A,B,C,D,E,F,G) [F >= 1 + E] (?,1) Signature: {(f0,7);(f10,7);(f21,7);(f32,7)} Flow Graph: [0->{1,3},1->{4},2->{4,5},3->{4,5},4->{1,2,3,6,7},5->{1,2,3,6,7},6->{},7->{}] + Applied Processor: FromIts + Details: () * Step 3: CloseWith NO + Considered Problem: Rules: f0(A,B,C,D,E,F,G) -> f10(1,1,H,0,2,1,G) [H >= 0] f10(A,B,C,D,E,F,G) -> f21(A,-1 + B,C,D,E,F,0) [F >= 1 && E >= F && B >= 1 && 0 >= C] f10(A,B,C,D,E,F,G) -> f21(1 + A,1 + A,H,D,E,F,I) [I >= 0 && 1 >= I && H >= 0 && F >= 1 && E >= F && 0 >= B && 0 >= C] f10(A,B,C,D,E,F,G) -> f21(A,B,-1 + C,D,E,F,H) [H >= 0 && 1 >= H && F >= 1 && C >= 1 && E >= F] f21(A,B,C,D,E,F,G) -> f10(A,B,C,D,E,-1 + F,G) [1 + E >= A && 0 >= G] f21(A,B,C,D,E,F,G) -> f10(A,B,C,D,E,1 + F,G) [1 + E >= A && G >= 1] f10(A,B,C,D,E,F,G) -> f32(A,B,C,D,E,F,G) [0 >= F && E >= F] f10(A,B,C,D,E,F,G) -> f32(A,B,C,D,E,F,G) [F >= 1 + E] Signature: {(f0,7);(f10,7);(f21,7);(f32,7)} Rule Graph: [0->{1,3},1->{4},2->{4,5},3->{4,5},4->{1,2,3,6,7},5->{1,2,3,6,7},6->{},7->{}] + Applied Processor: CloseWith False + Details: () NO