NO * Step 1: UnsatPaths NO + Considered Problem: Rules: 0. f6(A,B,C) -> f9(A,D,C) [0 >= 1 + A] (?,1) 1. f6(A,B,C) -> f9(A,D,C) [A >= 1] (?,1) 2. f6(A,B,C) -> f17(0,B,C) [A = 0] (?,1) 3. f17(A,B,C) -> f24(A,B,C) [0 >= C] (?,1) 4. f17(A,B,C) -> f24(A,B,C) [C >= 2] (?,1) 5. f17(A,B,C) -> f24(A,B,0) [C = 1] (?,1) 6. f9(A,B,C) -> f17(A,0,1) [B = 0] (?,1) 7. f9(A,B,C) -> f6(D,B,C) [0 >= 1 + B] (?,1) 8. f9(A,B,C) -> f6(D,B,C) [B >= 1] (?,1) 9. f0(A,B,C) -> f6(D,B,0) True (1,1) Signature: {(f0,3);(f17,3);(f24,3);(f6,3);(f9,3)} Flow Graph: [0->{6,7,8},1->{6,7,8},2->{3,4,5},3->{},4->{},5->{},6->{3,4,5},7->{0,1,2},8->{0,1,2},9->{0,1,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(6,3),(6,4)] * Step 2: FromIts NO + Considered Problem: Rules: 0. f6(A,B,C) -> f9(A,D,C) [0 >= 1 + A] (?,1) 1. f6(A,B,C) -> f9(A,D,C) [A >= 1] (?,1) 2. f6(A,B,C) -> f17(0,B,C) [A = 0] (?,1) 3. f17(A,B,C) -> f24(A,B,C) [0 >= C] (?,1) 4. f17(A,B,C) -> f24(A,B,C) [C >= 2] (?,1) 5. f17(A,B,C) -> f24(A,B,0) [C = 1] (?,1) 6. f9(A,B,C) -> f17(A,0,1) [B = 0] (?,1) 7. f9(A,B,C) -> f6(D,B,C) [0 >= 1 + B] (?,1) 8. f9(A,B,C) -> f6(D,B,C) [B >= 1] (?,1) 9. f0(A,B,C) -> f6(D,B,0) True (1,1) Signature: {(f0,3);(f17,3);(f24,3);(f6,3);(f9,3)} Flow Graph: [0->{6,7,8},1->{6,7,8},2->{3,4,5},3->{},4->{},5->{},6->{5},7->{0,1,2},8->{0,1,2},9->{0,1,2}] + Applied Processor: FromIts + Details: () * Step 3: CloseWith NO + Considered Problem: Rules: f6(A,B,C) -> f9(A,D,C) [0 >= 1 + A] f6(A,B,C) -> f9(A,D,C) [A >= 1] f6(A,B,C) -> f17(0,B,C) [A = 0] f17(A,B,C) -> f24(A,B,C) [0 >= C] f17(A,B,C) -> f24(A,B,C) [C >= 2] f17(A,B,C) -> f24(A,B,0) [C = 1] f9(A,B,C) -> f17(A,0,1) [B = 0] f9(A,B,C) -> f6(D,B,C) [0 >= 1 + B] f9(A,B,C) -> f6(D,B,C) [B >= 1] f0(A,B,C) -> f6(D,B,0) True Signature: {(f0,3);(f17,3);(f24,3);(f6,3);(f9,3)} Rule Graph: [0->{6,7,8},1->{6,7,8},2->{3,4,5},3->{},4->{},5->{},6->{5},7->{0,1,2},8->{0,1,2},9->{0,1,2}] + Applied Processor: CloseWith False + Details: () NO