YES * Step 1: UnsatPaths YES + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f23(1,1,10,M,N,0,G,H,I,J,K,L) True (1,1) 1. f23(A,B,C,D,E,F,G,H,I,J,K,L) -> f23(A,B,C,D,E,1 + F,G,H,I,J,K,L) [C >= 1 + F] (?,1) 2. f29(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,0,I,J,K,L) [C >= 1 + F] (?,1) 3. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,1,1 + H,1,J,K,L) [0 >= 1 + G && C >= 1 + H] (?,1) 4. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,1,1 + H,1,J,K,L) [G >= 1 && C >= 1 + H] (?,1) 5. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,1,1 + H,1,J,K,L) [C >= 1 + H && G = 0] (?,1) 6. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,1 + H,0,J,K,L) [M >= 1 + N && C >= 1 + H && G = 0] (?,1) 7. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,1 + H,0,J,K,L) [C >= 1 + H && G = 0] (?,1) 8. f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(1,B,C,D,E,1 + F,G,H,I,1,K,L) [0 >= 1 + G] (?,1) 9. f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(1,B,C,D,E,1 + F,G,H,I,1,K,L) [G >= 1] (?,1) 10. f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(0,B,C,D,E,1 + F,0,H,I,0,K,L) [G = 0] (?,1) 11. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f55(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + B && C >= 2 + F] (?,1) 12. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f55(A,B,C,D,E,F,G,H,I,J,K,L) [B >= 1 && C >= 2 + F] (?,1) 13. f55(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,1,C,D,E,1 + F,G,H,I,J,1,L) [M >= 1 + N] (?,1) 14. f55(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,0,C,D,E,1 + F,G,H,I,J,0,L) True (?,1) 15. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,0,C,D,E,1 + F,G,H,I,J,0,L) [C >= 2 + F && B = 0] (?,1) 16. f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,B,C,D,E,F,G,H,I,J,K,0) [0 >= 1 + B] (?,1) 17. f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,B,C,D,E,F,G,H,I,J,K,0) [B >= 1] (?,1) 18. f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,0,C,D,E,F,G,H,I,J,K,1) [B = 0] (?,1) 19. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f63(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && 1 + F >= C] (?,1) 20. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f63(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 1 && 1 + F >= C] (?,1) 21. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(0,B,C,D,E,F,G,H,I,J,K,1) [1 + F >= C && A = 0] (?,1) 22. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f44(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && H >= C] (?,1) 23. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f44(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 1 && H >= C] (?,1) 24. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(0,B,C,D,E,1 + F,G,H,I,0,K,L) [H >= C && A = 0] (?,1) 25. f29(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,B,C,D,E,0,G,H,I,J,K,L) [F >= C] (?,1) 26. f23(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(A,B,C,D,E,0,G,H,I,J,K,L) [F >= C] (?,1) Signature: {(f0,12);(f23,12);(f29,12);(f33,12);(f44,12);(f52,12);(f55,12);(f63,12);(f71,12)} Flow Graph: [0->{1,26},1->{1,26},2->{3,4,5,6,7,22,23,24},3->{3,4,5,6,7,22,23,24},4->{3,4,5,6,7,22,23,24},5->{3,4,5,6,7 ,22,23,24},6->{3,4,5,6,7,22,23,24},7->{3,4,5,6,7,22,23,24},8->{2,25},9->{2,25},10->{2,25},11->{13,14} ,12->{13,14},13->{11,12,15,19,20,21},14->{11,12,15,19,20,21},15->{11,12,15,19,20,21},16->{},17->{},18->{} ,19->{16,17,18},20->{16,17,18},21->{},22->{8,9,10},23->{8,9,10},24->{2,25},25->{11,12,15,19,20,21},26->{2 ,25}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,26) ,(2,3) ,(2,4) ,(3,3) ,(3,5) ,(3,6) ,(3,7) ,(4,3) ,(4,5) ,(4,6) ,(4,7) ,(5,3) ,(5,5) ,(5,6) ,(5,7) ,(6,3) ,(6,4) ,(7,3) ,(7,4) ,(13,11) ,(13,15) ,(14,11) ,(14,12) ,(15,11) ,(15,12)] * Step 2: UnreachableRules YES + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f23(1,1,10,M,N,0,G,H,I,J,K,L) True (1,1) 1. f23(A,B,C,D,E,F,G,H,I,J,K,L) -> f23(A,B,C,D,E,1 + F,G,H,I,J,K,L) [C >= 1 + F] (?,1) 2. f29(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,0,I,J,K,L) [C >= 1 + F] (?,1) 3. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,1,1 + H,1,J,K,L) [0 >= 1 + G && C >= 1 + H] (?,1) 4. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,1,1 + H,1,J,K,L) [G >= 1 && C >= 1 + H] (?,1) 5. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,1,1 + H,1,J,K,L) [C >= 1 + H && G = 0] (?,1) 6. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,1 + H,0,J,K,L) [M >= 1 + N && C >= 1 + H && G = 0] (?,1) 7. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,1 + H,0,J,K,L) [C >= 1 + H && G = 0] (?,1) 8. f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(1,B,C,D,E,1 + F,G,H,I,1,K,L) [0 >= 1 + G] (?,1) 9. f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(1,B,C,D,E,1 + F,G,H,I,1,K,L) [G >= 1] (?,1) 10. f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(0,B,C,D,E,1 + F,0,H,I,0,K,L) [G = 0] (?,1) 11. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f55(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + B && C >= 2 + F] (?,1) 12. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f55(A,B,C,D,E,F,G,H,I,J,K,L) [B >= 1 && C >= 2 + F] (?,1) 13. f55(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,1,C,D,E,1 + F,G,H,I,J,1,L) [M >= 1 + N] (?,1) 14. f55(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,0,C,D,E,1 + F,G,H,I,J,0,L) True (?,1) 15. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,0,C,D,E,1 + F,G,H,I,J,0,L) [C >= 2 + F && B = 0] (?,1) 16. f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,B,C,D,E,F,G,H,I,J,K,0) [0 >= 1 + B] (?,1) 17. f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,B,C,D,E,F,G,H,I,J,K,0) [B >= 1] (?,1) 18. f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,0,C,D,E,F,G,H,I,J,K,1) [B = 0] (?,1) 19. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f63(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && 1 + F >= C] (?,1) 20. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f63(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 1 && 1 + F >= C] (?,1) 21. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(0,B,C,D,E,F,G,H,I,J,K,1) [1 + F >= C && A = 0] (?,1) 22. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f44(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && H >= C] (?,1) 23. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f44(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 1 && H >= C] (?,1) 24. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(0,B,C,D,E,1 + F,G,H,I,0,K,L) [H >= C && A = 0] (?,1) 25. f29(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,B,C,D,E,0,G,H,I,J,K,L) [F >= C] (?,1) 26. f23(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(A,B,C,D,E,0,G,H,I,J,K,L) [F >= C] (?,1) Signature: {(f0,12);(f23,12);(f29,12);(f33,12);(f44,12);(f52,12);(f55,12);(f63,12);(f71,12)} Flow Graph: [0->{1},1->{1,26},2->{5,6,7,22,23,24},3->{4,22,23,24},4->{4,22,23,24},5->{4,22,23,24},6->{5,6,7,22,23,24} ,7->{5,6,7,22,23,24},8->{2,25},9->{2,25},10->{2,25},11->{13,14},12->{13,14},13->{12,19,20,21},14->{15,19,20 ,21},15->{15,19,20,21},16->{},17->{},18->{},19->{16,17,18},20->{16,17,18},21->{},22->{8,9,10},23->{8,9,10} ,24->{2,25},25->{11,12,15,19,20,21},26->{2,25}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [3] * Step 3: FromIts YES + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f23(1,1,10,M,N,0,G,H,I,J,K,L) True (1,1) 1. f23(A,B,C,D,E,F,G,H,I,J,K,L) -> f23(A,B,C,D,E,1 + F,G,H,I,J,K,L) [C >= 1 + F] (?,1) 2. f29(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,0,I,J,K,L) [C >= 1 + F] (?,1) 4. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,1,1 + H,1,J,K,L) [G >= 1 && C >= 1 + H] (?,1) 5. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,1,1 + H,1,J,K,L) [C >= 1 + H && G = 0] (?,1) 6. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,1 + H,0,J,K,L) [M >= 1 + N && C >= 1 + H && G = 0] (?,1) 7. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,1 + H,0,J,K,L) [C >= 1 + H && G = 0] (?,1) 8. f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(1,B,C,D,E,1 + F,G,H,I,1,K,L) [0 >= 1 + G] (?,1) 9. f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(1,B,C,D,E,1 + F,G,H,I,1,K,L) [G >= 1] (?,1) 10. f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(0,B,C,D,E,1 + F,0,H,I,0,K,L) [G = 0] (?,1) 11. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f55(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + B && C >= 2 + F] (?,1) 12. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f55(A,B,C,D,E,F,G,H,I,J,K,L) [B >= 1 && C >= 2 + F] (?,1) 13. f55(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,1,C,D,E,1 + F,G,H,I,J,1,L) [M >= 1 + N] (?,1) 14. f55(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,0,C,D,E,1 + F,G,H,I,J,0,L) True (?,1) 15. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,0,C,D,E,1 + F,G,H,I,J,0,L) [C >= 2 + F && B = 0] (?,1) 16. f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,B,C,D,E,F,G,H,I,J,K,0) [0 >= 1 + B] (?,1) 17. f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,B,C,D,E,F,G,H,I,J,K,0) [B >= 1] (?,1) 18. f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,0,C,D,E,F,G,H,I,J,K,1) [B = 0] (?,1) 19. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f63(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && 1 + F >= C] (?,1) 20. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f63(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 1 && 1 + F >= C] (?,1) 21. f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(0,B,C,D,E,F,G,H,I,J,K,1) [1 + F >= C && A = 0] (?,1) 22. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f44(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && H >= C] (?,1) 23. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f44(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 1 && H >= C] (?,1) 24. f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(0,B,C,D,E,1 + F,G,H,I,0,K,L) [H >= C && A = 0] (?,1) 25. f29(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,B,C,D,E,0,G,H,I,J,K,L) [F >= C] (?,1) 26. f23(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(A,B,C,D,E,0,G,H,I,J,K,L) [F >= C] (?,1) Signature: {(f0,12);(f23,12);(f29,12);(f33,12);(f44,12);(f52,12);(f55,12);(f63,12);(f71,12)} Flow Graph: [0->{1},1->{1,26},2->{5,6,7,22,23,24},4->{4,22,23,24},5->{4,22,23,24},6->{5,6,7,22,23,24},7->{5,6,7,22,23 ,24},8->{2,25},9->{2,25},10->{2,25},11->{13,14},12->{13,14},13->{12,19,20,21},14->{15,19,20,21},15->{15,19 ,20,21},16->{},17->{},18->{},19->{16,17,18},20->{16,17,18},21->{},22->{8,9,10},23->{8,9,10},24->{2,25} ,25->{11,12,15,19,20,21},26->{2,25}] + Applied Processor: FromIts + Details: () * Step 4: Decompose YES + Considered Problem: Rules: f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f23(1,1,10,M,N,0,G,H,I,J,K,L) True f23(A,B,C,D,E,F,G,H,I,J,K,L) -> f23(A,B,C,D,E,1 + F,G,H,I,J,K,L) [C >= 1 + F] f29(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,0,I,J,K,L) [C >= 1 + F] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,1,1 + H,1,J,K,L) [G >= 1 && C >= 1 + H] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,1,1 + H,1,J,K,L) [C >= 1 + H && G = 0] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,1 + H,0,J,K,L) [M >= 1 + N && C >= 1 + H && G = 0] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,1 + H,0,J,K,L) [C >= 1 + H && G = 0] f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(1,B,C,D,E,1 + F,G,H,I,1,K,L) [0 >= 1 + G] f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(1,B,C,D,E,1 + F,G,H,I,1,K,L) [G >= 1] f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(0,B,C,D,E,1 + F,0,H,I,0,K,L) [G = 0] f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f55(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + B && C >= 2 + F] f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f55(A,B,C,D,E,F,G,H,I,J,K,L) [B >= 1 && C >= 2 + F] f55(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,1,C,D,E,1 + F,G,H,I,J,1,L) [M >= 1 + N] f55(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,0,C,D,E,1 + F,G,H,I,J,0,L) True f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,0,C,D,E,1 + F,G,H,I,J,0,L) [C >= 2 + F && B = 0] f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,B,C,D,E,F,G,H,I,J,K,0) [0 >= 1 + B] f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,B,C,D,E,F,G,H,I,J,K,0) [B >= 1] f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,0,C,D,E,F,G,H,I,J,K,1) [B = 0] f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f63(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && 1 + F >= C] f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f63(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 1 && 1 + F >= C] f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(0,B,C,D,E,F,G,H,I,J,K,1) [1 + F >= C && A = 0] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f44(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && H >= C] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f44(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 1 && H >= C] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(0,B,C,D,E,1 + F,G,H,I,0,K,L) [H >= C && A = 0] f29(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,B,C,D,E,0,G,H,I,J,K,L) [F >= C] f23(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(A,B,C,D,E,0,G,H,I,J,K,L) [F >= C] Signature: {(f0,12);(f23,12);(f29,12);(f33,12);(f44,12);(f52,12);(f55,12);(f63,12);(f71,12)} Rule Graph: [0->{1},1->{1,26},2->{5,6,7,22,23,24},4->{4,22,23,24},5->{4,22,23,24},6->{5,6,7,22,23,24},7->{5,6,7,22,23 ,24},8->{2,25},9->{2,25},10->{2,25},11->{13,14},12->{13,14},13->{12,19,20,21},14->{15,19,20,21},15->{15,19 ,20,21},16->{},17->{},18->{},19->{16,17,18},20->{16,17,18},21->{},22->{8,9,10},23->{8,9,10},24->{2,25} ,25->{11,12,15,19,20,21},26->{2,25}] + Applied Processor: Decompose NoGreedy + Details: We construct a looptree: P: [0,1,2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26] | +- p:[1] c: [1] | +- p:[2,8,22,4,5,6,7,23,9,10,24] c: [2,8,9,10,22,23,24] | | | +- p:[6,7] c: [7] | | | | | `- p:[6] c: [6] | | | `- p:[4] c: [4] | +- p:[13,12] c: [12,13] | `- p:[15] c: [15] * Step 5: CloseWith YES + Considered Problem: (Rules: f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f23(1,1,10,M,N,0,G,H,I,J,K,L) True f23(A,B,C,D,E,F,G,H,I,J,K,L) -> f23(A,B,C,D,E,1 + F,G,H,I,J,K,L) [C >= 1 + F] f29(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,0,I,J,K,L) [C >= 1 + F] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,1,1 + H,1,J,K,L) [G >= 1 && C >= 1 + H] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,1,1 + H,1,J,K,L) [C >= 1 + H && G = 0] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,1 + H,0,J,K,L) [M >= 1 + N && C >= 1 + H && G = 0] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f33(A,B,C,D,E,F,0,1 + H,0,J,K,L) [C >= 1 + H && G = 0] f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(1,B,C,D,E,1 + F,G,H,I,1,K,L) [0 >= 1 + G] f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(1,B,C,D,E,1 + F,G,H,I,1,K,L) [G >= 1] f44(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(0,B,C,D,E,1 + F,0,H,I,0,K,L) [G = 0] f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f55(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + B && C >= 2 + F] f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f55(A,B,C,D,E,F,G,H,I,J,K,L) [B >= 1 && C >= 2 + F] f55(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,1,C,D,E,1 + F,G,H,I,J,1,L) [M >= 1 + N] f55(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,0,C,D,E,1 + F,G,H,I,J,0,L) True f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,0,C,D,E,1 + F,G,H,I,J,0,L) [C >= 2 + F && B = 0] f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,B,C,D,E,F,G,H,I,J,K,0) [0 >= 1 + B] f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,B,C,D,E,F,G,H,I,J,K,0) [B >= 1] f63(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(A,0,C,D,E,F,G,H,I,J,K,1) [B = 0] f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f63(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && 1 + F >= C] f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f63(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 1 && 1 + F >= C] f52(A,B,C,D,E,F,G,H,I,J,K,L) -> f71(0,B,C,D,E,F,G,H,I,J,K,1) [1 + F >= C && A = 0] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f44(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && H >= C] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f44(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 1 && H >= C] f33(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(0,B,C,D,E,1 + F,G,H,I,0,K,L) [H >= C && A = 0] f29(A,B,C,D,E,F,G,H,I,J,K,L) -> f52(A,B,C,D,E,0,G,H,I,J,K,L) [F >= C] f23(A,B,C,D,E,F,G,H,I,J,K,L) -> f29(A,B,C,D,E,0,G,H,I,J,K,L) [F >= C] Signature: {(f0,12);(f23,12);(f29,12);(f33,12);(f44,12);(f52,12);(f55,12);(f63,12);(f71,12)} Rule Graph: [0->{1},1->{1,26},2->{5,6,7,22,23,24},4->{4,22,23,24},5->{4,22,23,24},6->{5,6,7,22,23,24},7->{5,6,7,22,23 ,24},8->{2,25},9->{2,25},10->{2,25},11->{13,14},12->{13,14},13->{12,19,20,21},14->{15,19,20,21},15->{15,19 ,20,21},16->{},17->{},18->{},19->{16,17,18},20->{16,17,18},21->{},22->{8,9,10},23->{8,9,10},24->{2,25} ,25->{11,12,15,19,20,21},26->{2,25}] ,We construct a looptree: P: [0,1,2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26] | +- p:[1] c: [1] | +- p:[2,8,22,4,5,6,7,23,9,10,24] c: [2,8,9,10,22,23,24] | | | +- p:[6,7] c: [7] | | | | | `- p:[6] c: [6] | | | `- p:[4] c: [4] | +- p:[13,12] c: [12,13] | `- p:[15] c: [15]) + Applied Processor: CloseWith True + Details: () YES