YES * Step 1: UnsatPaths YES + Considered Problem: Rules: 0. f30(A,B,C,D,E,F,G,H,I,J) -> f31(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + A] (?,1) 1. f30(A,B,C,D,E,F,G,H,I,J) -> f31(A,B,C,D,E,F,G,H,I,J) [A >= 1] (?,1) 2. f36(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + A] (?,1) 3. f36(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,G,H,I,J) [A >= 1] (?,1) 4. f37(A,B,C,D,E,F,G,H,I,J) -> f38(A,B,C,D,E,F,G,H,I,J) [B + K >= 1 + C + L] (?,1) 5. f37(A,B,C,D,E,F,G,H,I,J) -> f38(A,B,C,D,E,F,G,H,I,J) [C + K >= 1 + B + L] (?,1) 6. f0(A,B,C,D,E,F,G,H,I,J) -> f10(1,B,0,9,1,K,G,H,I,J) True (1,1) 7. f10(A,B,C,D,E,F,G,H,I,J) -> f10(A,B,1 + C,D,E,F,G,H,I,J) [D >= 1 + C] (?,1) 8. f16(A,B,C,D,E,F,G,H,I,J) -> f19(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + E && D >= 1 + C] (?,1) 9. f16(A,B,C,D,E,F,G,H,I,J) -> f19(A,B,C,D,E,F,G,H,I,J) [E >= 1 && D >= 1 + C] (?,1) 10. f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,1,F,1,H,I,J) [D >= 1 + K] (?,1) 11. f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) True (?,1) 12. f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) [0 >= 1 + K] (?,1) 13. f16(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) [D >= 1 + C && E = 0] (?,1) 14. f27(A,B,C,D,E,F,G,H,I,J) -> f30(A,B,C,D,E,F,G,H,I,J) [D >= 1 + B && B >= 1 + C] (?,1) 15. f27(A,B,C,D,E,F,G,H,I,J) -> f30(A,B,C,D,E,F,G,H,I,J) [C >= 1 + B && D >= 1 + B] (?,1) 16. f31(A,B,C,D,E,F,G,H,I,J) -> f36(1,B,C,D,E,F,G,1,I,J) [K >= 1 + L] (?,1) 17. f31(A,B,C,D,E,F,G,H,I,J) -> f36(1,B,C,D,E,F,G,1,I,J) True (?,1) 18. f31(A,B,C,D,E,F,G,H,I,J) -> f36(0,B,C,D,E,F,G,0,I,J) True (?,1) 19. f30(A,B,C,D,E,F,G,H,I,J) -> f36(0,B,C,D,E,F,G,0,I,J) [A = 0] (?,1) 20. f27(A,B,C,D,E,F,G,H,I,J) -> f27(A,1 + C,C,D,E,F,G,H,I,J) [D >= 1 + B && C = B] (?,1) 21. f38(A,B,C,D,E,F,G,H,I,J) -> f27(1,1 + B,C,D,E,F,G,H,1,J) [B + K >= 1 + C + L] (?,1) 22. f38(A,B,C,D,E,F,G,H,I,J) -> f27(1,1 + B,C,D,E,F,G,H,1,J) [C + K >= 1 + B + L] (?,1) 23. f38(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) True (?,1) 24. f37(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) True (?,1) 25. f36(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) [A = 0] (?,1) 26. f49(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,E,F,G,H,I,0) [0 >= 1 + A] (?,1) 27. f49(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,E,F,G,H,I,0) [A >= 1] (?,1) 28. f49(A,B,C,D,E,F,G,H,I,J) -> f56(0,B,C,D,E,F,G,H,I,1) [A = 0] (?,1) 29. f27(A,B,C,D,E,F,G,H,I,J) -> f16(A,B,1 + C,D,E,F,G,H,I,J) [B >= D] (?,1) 30. f16(A,B,C,D,E,F,G,H,I,J) -> f49(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + E && C >= D] (?,1) 31. f16(A,B,C,D,E,F,G,H,I,J) -> f49(A,B,C,D,E,F,G,H,I,J) [E >= 1 && C >= D] (?,1) 32. f16(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,0,F,G,H,I,1) [C >= D && E = 0] (?,1) 33. f10(A,B,C,D,E,F,G,H,I,J) -> f16(A,B,0,D,E,F,G,H,I,J) [C >= D] (?,1) Signature: {(f0,10) ;(f10,10) ;(f16,10) ;(f19,10) ;(f27,10) ;(f30,10) ;(f31,10) ;(f36,10) ;(f37,10) ;(f38,10) ;(f49,10) ;(f56,10)} Flow Graph: [0->{16,17,18},1->{16,17,18},2->{4,5,24},3->{4,5,24},4->{21,22,23},5->{21,22,23},6->{7,33},7->{7,33} ,8->{10,11,12},9->{10,11,12},10->{14,15,20,29},11->{14,15,20,29},12->{14,15,20,29},13->{14,15,20,29},14->{0 ,1,19},15->{0,1,19},16->{2,3,25},17->{2,3,25},18->{2,3,25},19->{2,3,25},20->{14,15,20,29},21->{14,15,20,29} ,22->{14,15,20,29},23->{14,15,20,29},24->{14,15,20,29},25->{14,15,20,29},26->{},27->{},28->{},29->{8,9,13,30 ,31,32},30->{26,27,28},31->{26,27,28},32->{},33->{8,9,13,30,31,32}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(6,33) ,(16,2) ,(16,25) ,(17,2) ,(17,25) ,(18,2) ,(18,3) ,(19,2) ,(19,3) ,(20,15) ,(20,20)] * Step 2: UnreachableRules YES + Considered Problem: Rules: 0. f30(A,B,C,D,E,F,G,H,I,J) -> f31(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + A] (?,1) 1. f30(A,B,C,D,E,F,G,H,I,J) -> f31(A,B,C,D,E,F,G,H,I,J) [A >= 1] (?,1) 2. f36(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + A] (?,1) 3. f36(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,G,H,I,J) [A >= 1] (?,1) 4. f37(A,B,C,D,E,F,G,H,I,J) -> f38(A,B,C,D,E,F,G,H,I,J) [B + K >= 1 + C + L] (?,1) 5. f37(A,B,C,D,E,F,G,H,I,J) -> f38(A,B,C,D,E,F,G,H,I,J) [C + K >= 1 + B + L] (?,1) 6. f0(A,B,C,D,E,F,G,H,I,J) -> f10(1,B,0,9,1,K,G,H,I,J) True (1,1) 7. f10(A,B,C,D,E,F,G,H,I,J) -> f10(A,B,1 + C,D,E,F,G,H,I,J) [D >= 1 + C] (?,1) 8. f16(A,B,C,D,E,F,G,H,I,J) -> f19(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + E && D >= 1 + C] (?,1) 9. f16(A,B,C,D,E,F,G,H,I,J) -> f19(A,B,C,D,E,F,G,H,I,J) [E >= 1 && D >= 1 + C] (?,1) 10. f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,1,F,1,H,I,J) [D >= 1 + K] (?,1) 11. f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) True (?,1) 12. f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) [0 >= 1 + K] (?,1) 13. f16(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) [D >= 1 + C && E = 0] (?,1) 14. f27(A,B,C,D,E,F,G,H,I,J) -> f30(A,B,C,D,E,F,G,H,I,J) [D >= 1 + B && B >= 1 + C] (?,1) 15. f27(A,B,C,D,E,F,G,H,I,J) -> f30(A,B,C,D,E,F,G,H,I,J) [C >= 1 + B && D >= 1 + B] (?,1) 16. f31(A,B,C,D,E,F,G,H,I,J) -> f36(1,B,C,D,E,F,G,1,I,J) [K >= 1 + L] (?,1) 17. f31(A,B,C,D,E,F,G,H,I,J) -> f36(1,B,C,D,E,F,G,1,I,J) True (?,1) 18. f31(A,B,C,D,E,F,G,H,I,J) -> f36(0,B,C,D,E,F,G,0,I,J) True (?,1) 19. f30(A,B,C,D,E,F,G,H,I,J) -> f36(0,B,C,D,E,F,G,0,I,J) [A = 0] (?,1) 20. f27(A,B,C,D,E,F,G,H,I,J) -> f27(A,1 + C,C,D,E,F,G,H,I,J) [D >= 1 + B && C = B] (?,1) 21. f38(A,B,C,D,E,F,G,H,I,J) -> f27(1,1 + B,C,D,E,F,G,H,1,J) [B + K >= 1 + C + L] (?,1) 22. f38(A,B,C,D,E,F,G,H,I,J) -> f27(1,1 + B,C,D,E,F,G,H,1,J) [C + K >= 1 + B + L] (?,1) 23. f38(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) True (?,1) 24. f37(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) True (?,1) 25. f36(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) [A = 0] (?,1) 26. f49(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,E,F,G,H,I,0) [0 >= 1 + A] (?,1) 27. f49(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,E,F,G,H,I,0) [A >= 1] (?,1) 28. f49(A,B,C,D,E,F,G,H,I,J) -> f56(0,B,C,D,E,F,G,H,I,1) [A = 0] (?,1) 29. f27(A,B,C,D,E,F,G,H,I,J) -> f16(A,B,1 + C,D,E,F,G,H,I,J) [B >= D] (?,1) 30. f16(A,B,C,D,E,F,G,H,I,J) -> f49(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + E && C >= D] (?,1) 31. f16(A,B,C,D,E,F,G,H,I,J) -> f49(A,B,C,D,E,F,G,H,I,J) [E >= 1 && C >= D] (?,1) 32. f16(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,0,F,G,H,I,1) [C >= D && E = 0] (?,1) 33. f10(A,B,C,D,E,F,G,H,I,J) -> f16(A,B,0,D,E,F,G,H,I,J) [C >= D] (?,1) Signature: {(f0,10) ;(f10,10) ;(f16,10) ;(f19,10) ;(f27,10) ;(f30,10) ;(f31,10) ;(f36,10) ;(f37,10) ;(f38,10) ;(f49,10) ;(f56,10)} Flow Graph: [0->{16,17,18},1->{16,17,18},2->{4,5,24},3->{4,5,24},4->{21,22,23},5->{21,22,23},6->{7},7->{7,33},8->{10 ,11,12},9->{10,11,12},10->{14,15,20,29},11->{14,15,20,29},12->{14,15,20,29},13->{14,15,20,29},14->{0,1,19} ,15->{0,1,19},16->{3},17->{3},18->{25},19->{25},20->{14,29},21->{14,15,20,29},22->{14,15,20,29},23->{14,15 ,20,29},24->{14,15,20,29},25->{14,15,20,29},26->{},27->{},28->{},29->{8,9,13,30,31,32},30->{26,27,28} ,31->{26,27,28},32->{},33->{8,9,13,30,31,32}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [2] * Step 3: FromIts YES + Considered Problem: Rules: 0. f30(A,B,C,D,E,F,G,H,I,J) -> f31(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + A] (?,1) 1. f30(A,B,C,D,E,F,G,H,I,J) -> f31(A,B,C,D,E,F,G,H,I,J) [A >= 1] (?,1) 3. f36(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,G,H,I,J) [A >= 1] (?,1) 4. f37(A,B,C,D,E,F,G,H,I,J) -> f38(A,B,C,D,E,F,G,H,I,J) [B + K >= 1 + C + L] (?,1) 5. f37(A,B,C,D,E,F,G,H,I,J) -> f38(A,B,C,D,E,F,G,H,I,J) [C + K >= 1 + B + L] (?,1) 6. f0(A,B,C,D,E,F,G,H,I,J) -> f10(1,B,0,9,1,K,G,H,I,J) True (1,1) 7. f10(A,B,C,D,E,F,G,H,I,J) -> f10(A,B,1 + C,D,E,F,G,H,I,J) [D >= 1 + C] (?,1) 8. f16(A,B,C,D,E,F,G,H,I,J) -> f19(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + E && D >= 1 + C] (?,1) 9. f16(A,B,C,D,E,F,G,H,I,J) -> f19(A,B,C,D,E,F,G,H,I,J) [E >= 1 && D >= 1 + C] (?,1) 10. f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,1,F,1,H,I,J) [D >= 1 + K] (?,1) 11. f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) True (?,1) 12. f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) [0 >= 1 + K] (?,1) 13. f16(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) [D >= 1 + C && E = 0] (?,1) 14. f27(A,B,C,D,E,F,G,H,I,J) -> f30(A,B,C,D,E,F,G,H,I,J) [D >= 1 + B && B >= 1 + C] (?,1) 15. f27(A,B,C,D,E,F,G,H,I,J) -> f30(A,B,C,D,E,F,G,H,I,J) [C >= 1 + B && D >= 1 + B] (?,1) 16. f31(A,B,C,D,E,F,G,H,I,J) -> f36(1,B,C,D,E,F,G,1,I,J) [K >= 1 + L] (?,1) 17. f31(A,B,C,D,E,F,G,H,I,J) -> f36(1,B,C,D,E,F,G,1,I,J) True (?,1) 18. f31(A,B,C,D,E,F,G,H,I,J) -> f36(0,B,C,D,E,F,G,0,I,J) True (?,1) 19. f30(A,B,C,D,E,F,G,H,I,J) -> f36(0,B,C,D,E,F,G,0,I,J) [A = 0] (?,1) 20. f27(A,B,C,D,E,F,G,H,I,J) -> f27(A,1 + C,C,D,E,F,G,H,I,J) [D >= 1 + B && C = B] (?,1) 21. f38(A,B,C,D,E,F,G,H,I,J) -> f27(1,1 + B,C,D,E,F,G,H,1,J) [B + K >= 1 + C + L] (?,1) 22. f38(A,B,C,D,E,F,G,H,I,J) -> f27(1,1 + B,C,D,E,F,G,H,1,J) [C + K >= 1 + B + L] (?,1) 23. f38(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) True (?,1) 24. f37(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) True (?,1) 25. f36(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) [A = 0] (?,1) 26. f49(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,E,F,G,H,I,0) [0 >= 1 + A] (?,1) 27. f49(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,E,F,G,H,I,0) [A >= 1] (?,1) 28. f49(A,B,C,D,E,F,G,H,I,J) -> f56(0,B,C,D,E,F,G,H,I,1) [A = 0] (?,1) 29. f27(A,B,C,D,E,F,G,H,I,J) -> f16(A,B,1 + C,D,E,F,G,H,I,J) [B >= D] (?,1) 30. f16(A,B,C,D,E,F,G,H,I,J) -> f49(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + E && C >= D] (?,1) 31. f16(A,B,C,D,E,F,G,H,I,J) -> f49(A,B,C,D,E,F,G,H,I,J) [E >= 1 && C >= D] (?,1) 32. f16(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,0,F,G,H,I,1) [C >= D && E = 0] (?,1) 33. f10(A,B,C,D,E,F,G,H,I,J) -> f16(A,B,0,D,E,F,G,H,I,J) [C >= D] (?,1) Signature: {(f0,10) ;(f10,10) ;(f16,10) ;(f19,10) ;(f27,10) ;(f30,10) ;(f31,10) ;(f36,10) ;(f37,10) ;(f38,10) ;(f49,10) ;(f56,10)} Flow Graph: [0->{16,17,18},1->{16,17,18},3->{4,5,24},4->{21,22,23},5->{21,22,23},6->{7},7->{7,33},8->{10,11,12},9->{10 ,11,12},10->{14,15,20,29},11->{14,15,20,29},12->{14,15,20,29},13->{14,15,20,29},14->{0,1,19},15->{0,1,19} ,16->{3},17->{3},18->{25},19->{25},20->{14,29},21->{14,15,20,29},22->{14,15,20,29},23->{14,15,20,29},24->{14 ,15,20,29},25->{14,15,20,29},26->{},27->{},28->{},29->{8,9,13,30,31,32},30->{26,27,28},31->{26,27,28},32->{} ,33->{8,9,13,30,31,32}] + Applied Processor: FromIts + Details: () * Step 4: Decompose YES + Considered Problem: Rules: f30(A,B,C,D,E,F,G,H,I,J) -> f31(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + A] f30(A,B,C,D,E,F,G,H,I,J) -> f31(A,B,C,D,E,F,G,H,I,J) [A >= 1] f36(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,G,H,I,J) [A >= 1] f37(A,B,C,D,E,F,G,H,I,J) -> f38(A,B,C,D,E,F,G,H,I,J) [B + K >= 1 + C + L] f37(A,B,C,D,E,F,G,H,I,J) -> f38(A,B,C,D,E,F,G,H,I,J) [C + K >= 1 + B + L] f0(A,B,C,D,E,F,G,H,I,J) -> f10(1,B,0,9,1,K,G,H,I,J) True f10(A,B,C,D,E,F,G,H,I,J) -> f10(A,B,1 + C,D,E,F,G,H,I,J) [D >= 1 + C] f16(A,B,C,D,E,F,G,H,I,J) -> f19(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + E && D >= 1 + C] f16(A,B,C,D,E,F,G,H,I,J) -> f19(A,B,C,D,E,F,G,H,I,J) [E >= 1 && D >= 1 + C] f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,1,F,1,H,I,J) [D >= 1 + K] f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) True f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) [0 >= 1 + K] f16(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) [D >= 1 + C && E = 0] f27(A,B,C,D,E,F,G,H,I,J) -> f30(A,B,C,D,E,F,G,H,I,J) [D >= 1 + B && B >= 1 + C] f27(A,B,C,D,E,F,G,H,I,J) -> f30(A,B,C,D,E,F,G,H,I,J) [C >= 1 + B && D >= 1 + B] f31(A,B,C,D,E,F,G,H,I,J) -> f36(1,B,C,D,E,F,G,1,I,J) [K >= 1 + L] f31(A,B,C,D,E,F,G,H,I,J) -> f36(1,B,C,D,E,F,G,1,I,J) True f31(A,B,C,D,E,F,G,H,I,J) -> f36(0,B,C,D,E,F,G,0,I,J) True f30(A,B,C,D,E,F,G,H,I,J) -> f36(0,B,C,D,E,F,G,0,I,J) [A = 0] f27(A,B,C,D,E,F,G,H,I,J) -> f27(A,1 + C,C,D,E,F,G,H,I,J) [D >= 1 + B && C = B] f38(A,B,C,D,E,F,G,H,I,J) -> f27(1,1 + B,C,D,E,F,G,H,1,J) [B + K >= 1 + C + L] f38(A,B,C,D,E,F,G,H,I,J) -> f27(1,1 + B,C,D,E,F,G,H,1,J) [C + K >= 1 + B + L] f38(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) True f37(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) True f36(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) [A = 0] f49(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,E,F,G,H,I,0) [0 >= 1 + A] f49(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,E,F,G,H,I,0) [A >= 1] f49(A,B,C,D,E,F,G,H,I,J) -> f56(0,B,C,D,E,F,G,H,I,1) [A = 0] f27(A,B,C,D,E,F,G,H,I,J) -> f16(A,B,1 + C,D,E,F,G,H,I,J) [B >= D] f16(A,B,C,D,E,F,G,H,I,J) -> f49(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + E && C >= D] f16(A,B,C,D,E,F,G,H,I,J) -> f49(A,B,C,D,E,F,G,H,I,J) [E >= 1 && C >= D] f16(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,0,F,G,H,I,1) [C >= D && E = 0] f10(A,B,C,D,E,F,G,H,I,J) -> f16(A,B,0,D,E,F,G,H,I,J) [C >= D] Signature: {(f0,10) ;(f10,10) ;(f16,10) ;(f19,10) ;(f27,10) ;(f30,10) ;(f31,10) ;(f36,10) ;(f37,10) ;(f38,10) ;(f49,10) ;(f56,10)} Rule Graph: [0->{16,17,18},1->{16,17,18},3->{4,5,24},4->{21,22,23},5->{21,22,23},6->{7},7->{7,33},8->{10,11,12},9->{10 ,11,12},10->{14,15,20,29},11->{14,15,20,29},12->{14,15,20,29},13->{14,15,20,29},14->{0,1,19},15->{0,1,19} ,16->{3},17->{3},18->{25},19->{25},20->{14,29},21->{14,15,20,29},22->{14,15,20,29},23->{14,15,20,29},24->{14 ,15,20,29},25->{14,15,20,29},26->{},27->{},28->{},29->{8,9,13,30,31,32},30->{26,27,28},31->{26,27,28},32->{} ,33->{8,9,13,30,31,32}] + Applied Processor: Decompose NoGreedy + Details: We construct a looptree: P: [0,1,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33] | +- p:[7] c: [7] | `- p:[0,14,10,8,29,11,9,12,13,20,21,4,3,16,1,15,22,5,23,24,25,18,19,17] c: [13] | `- p:[0,14,10,8,29,11,9,12,20,21,4,3,16,1,15,22,5,23,24,25,18,19,17] c: [9] | `- p:[0,14,10,8,29,11,12,20,21,4,3,16,1,15,22,5,23,24,25,18,19,17] c: [8,10,11,12,29] | `- p:[0,14,20,21,4,3,16,1,15,22,5,23,24,25,18,19,17] c: [20] | `- p:[0,14,21,4,3,16,1,15,22,5,23,24,25,18,19,17] c: [15] | `- p:[0,14,21,4,3,16,1,17,5,22,23,24,25,18,19] c: [0,1,3,4,5,14,16,17,18,19,21,22,23,24,25] * Step 5: CloseWith YES + Considered Problem: (Rules: f30(A,B,C,D,E,F,G,H,I,J) -> f31(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + A] f30(A,B,C,D,E,F,G,H,I,J) -> f31(A,B,C,D,E,F,G,H,I,J) [A >= 1] f36(A,B,C,D,E,F,G,H,I,J) -> f37(A,B,C,D,E,F,G,H,I,J) [A >= 1] f37(A,B,C,D,E,F,G,H,I,J) -> f38(A,B,C,D,E,F,G,H,I,J) [B + K >= 1 + C + L] f37(A,B,C,D,E,F,G,H,I,J) -> f38(A,B,C,D,E,F,G,H,I,J) [C + K >= 1 + B + L] f0(A,B,C,D,E,F,G,H,I,J) -> f10(1,B,0,9,1,K,G,H,I,J) True f10(A,B,C,D,E,F,G,H,I,J) -> f10(A,B,1 + C,D,E,F,G,H,I,J) [D >= 1 + C] f16(A,B,C,D,E,F,G,H,I,J) -> f19(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + E && D >= 1 + C] f16(A,B,C,D,E,F,G,H,I,J) -> f19(A,B,C,D,E,F,G,H,I,J) [E >= 1 && D >= 1 + C] f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,1,F,1,H,I,J) [D >= 1 + K] f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) True f19(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) [0 >= 1 + K] f16(A,B,C,D,E,F,G,H,I,J) -> f27(A,0,C,D,0,F,0,H,I,J) [D >= 1 + C && E = 0] f27(A,B,C,D,E,F,G,H,I,J) -> f30(A,B,C,D,E,F,G,H,I,J) [D >= 1 + B && B >= 1 + C] f27(A,B,C,D,E,F,G,H,I,J) -> f30(A,B,C,D,E,F,G,H,I,J) [C >= 1 + B && D >= 1 + B] f31(A,B,C,D,E,F,G,H,I,J) -> f36(1,B,C,D,E,F,G,1,I,J) [K >= 1 + L] f31(A,B,C,D,E,F,G,H,I,J) -> f36(1,B,C,D,E,F,G,1,I,J) True f31(A,B,C,D,E,F,G,H,I,J) -> f36(0,B,C,D,E,F,G,0,I,J) True f30(A,B,C,D,E,F,G,H,I,J) -> f36(0,B,C,D,E,F,G,0,I,J) [A = 0] f27(A,B,C,D,E,F,G,H,I,J) -> f27(A,1 + C,C,D,E,F,G,H,I,J) [D >= 1 + B && C = B] f38(A,B,C,D,E,F,G,H,I,J) -> f27(1,1 + B,C,D,E,F,G,H,1,J) [B + K >= 1 + C + L] f38(A,B,C,D,E,F,G,H,I,J) -> f27(1,1 + B,C,D,E,F,G,H,1,J) [C + K >= 1 + B + L] f38(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) True f37(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) True f36(A,B,C,D,E,F,G,H,I,J) -> f27(0,1 + B,C,D,E,F,G,H,0,J) [A = 0] f49(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,E,F,G,H,I,0) [0 >= 1 + A] f49(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,E,F,G,H,I,0) [A >= 1] f49(A,B,C,D,E,F,G,H,I,J) -> f56(0,B,C,D,E,F,G,H,I,1) [A = 0] f27(A,B,C,D,E,F,G,H,I,J) -> f16(A,B,1 + C,D,E,F,G,H,I,J) [B >= D] f16(A,B,C,D,E,F,G,H,I,J) -> f49(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + E && C >= D] f16(A,B,C,D,E,F,G,H,I,J) -> f49(A,B,C,D,E,F,G,H,I,J) [E >= 1 && C >= D] f16(A,B,C,D,E,F,G,H,I,J) -> f56(A,B,C,D,0,F,G,H,I,1) [C >= D && E = 0] f10(A,B,C,D,E,F,G,H,I,J) -> f16(A,B,0,D,E,F,G,H,I,J) [C >= D] Signature: {(f0,10) ;(f10,10) ;(f16,10) ;(f19,10) ;(f27,10) ;(f30,10) ;(f31,10) ;(f36,10) ;(f37,10) ;(f38,10) ;(f49,10) ;(f56,10)} Rule Graph: [0->{16,17,18},1->{16,17,18},3->{4,5,24},4->{21,22,23},5->{21,22,23},6->{7},7->{7,33},8->{10,11,12},9->{10 ,11,12},10->{14,15,20,29},11->{14,15,20,29},12->{14,15,20,29},13->{14,15,20,29},14->{0,1,19},15->{0,1,19} ,16->{3},17->{3},18->{25},19->{25},20->{14,29},21->{14,15,20,29},22->{14,15,20,29},23->{14,15,20,29},24->{14 ,15,20,29},25->{14,15,20,29},26->{},27->{},28->{},29->{8,9,13,30,31,32},30->{26,27,28},31->{26,27,28},32->{} ,33->{8,9,13,30,31,32}] ,We construct a looptree: P: [0,1,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33] | +- p:[7] c: [7] | `- p:[0,14,10,8,29,11,9,12,13,20,21,4,3,16,1,15,22,5,23,24,25,18,19,17] c: [13] | `- p:[0,14,10,8,29,11,9,12,20,21,4,3,16,1,15,22,5,23,24,25,18,19,17] c: [9] | `- p:[0,14,10,8,29,11,12,20,21,4,3,16,1,15,22,5,23,24,25,18,19,17] c: [8,10,11,12,29] | `- p:[0,14,20,21,4,3,16,1,15,22,5,23,24,25,18,19,17] c: [20] | `- p:[0,14,21,4,3,16,1,15,22,5,23,24,25,18,19,17] c: [15] | `- p:[0,14,21,4,3,16,1,17,5,22,23,24,25,18,19] c: [0,1,3,4,5,14,16,17,18,19,21,22,23,24,25]) + Applied Processor: CloseWith True + Details: () YES