NO * Step 1: UnreachableRules NO + Considered Problem: Rules: 0. f9(A,B,C,D) -> f14(A,0,E,D) [0 >= A] (?,1) 1. f14(A,B,C,D) -> f14(A,B,-1 + C,D) [C >= 1] (?,1) 2. f22(A,B,C,D) -> f22(A,B,C,D) True (?,1) 3. f24(A,B,C,D) -> f27(A,B,C,D) True (?,1) 4. f14(A,B,C,D) -> f9(E,B,C,0) [0 >= C] (?,1) 5. f9(A,B,C,D) -> f22(A,B,C,D) [A >= 1] (?,1) 6. f0(A,B,C,D) -> f9(E,0,C,0) True (1,1) Signature: {(f0,4);(f14,4);(f22,4);(f24,4);(f27,4);(f9,4)} Flow Graph: [0->{1,4},1->{1,4},2->{2},3->{},4->{0,5},5->{2},6->{0,5}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [3] * Step 2: FromIts NO + Considered Problem: Rules: 0. f9(A,B,C,D) -> f14(A,0,E,D) [0 >= A] (?,1) 1. f14(A,B,C,D) -> f14(A,B,-1 + C,D) [C >= 1] (?,1) 2. f22(A,B,C,D) -> f22(A,B,C,D) True (?,1) 4. f14(A,B,C,D) -> f9(E,B,C,0) [0 >= C] (?,1) 5. f9(A,B,C,D) -> f22(A,B,C,D) [A >= 1] (?,1) 6. f0(A,B,C,D) -> f9(E,0,C,0) True (1,1) Signature: {(f0,4);(f14,4);(f22,4);(f24,4);(f27,4);(f9,4)} Flow Graph: [0->{1,4},1->{1,4},2->{2},4->{0,5},5->{2},6->{0,5}] + Applied Processor: FromIts + Details: () * Step 3: CloseWith NO + Considered Problem: Rules: f9(A,B,C,D) -> f14(A,0,E,D) [0 >= A] f14(A,B,C,D) -> f14(A,B,-1 + C,D) [C >= 1] f22(A,B,C,D) -> f22(A,B,C,D) True f14(A,B,C,D) -> f9(E,B,C,0) [0 >= C] f9(A,B,C,D) -> f22(A,B,C,D) [A >= 1] f0(A,B,C,D) -> f9(E,0,C,0) True Signature: {(f0,4);(f14,4);(f22,4);(f24,4);(f27,4);(f9,4)} Rule Graph: [0->{1,4},1->{1,4},2->{2},4->{0,5},5->{2},6->{0,5}] + Applied Processor: CloseWith False + Details: () NO