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