YES * Step 1: UnsatPaths YES + Considered Problem: Rules: 0. f69(A,B,C,D,E,F,G,H,I,J,K) -> f71(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && 0 >= 1 + L] (?,1) 1. f69(A,B,C,D,E,F,G,H,I,J,K) -> f71(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0] (?,1) 2. f0(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,B,C,D,E,F,G,H,I,J,K) True (1,1) 3. f12(A,B,C,D,E,F,G,H,I,J,K) -> f15(A,B,0,D,E,F,G,H,I,J,K) [A >= B] (?,1) 4. f15(A,B,C,D,E,F,G,H,I,J,K) -> f15(A,B,C,1 + D,L,L,G,H,I,J,K) [A + -1*B >= 0 && C >= L && A >= D] (?,1) 5. f15(A,B,C,D,E,F,G,H,I,J,K) -> f15(A,B,L,1 + D,L,L,G,H,I,J,K) [A + -1*B >= 0 && L >= 1 + C && A >= D] (?,1) 6. f28(A,B,C,D,E,F,G,H,I,J,K) -> f30(A,B,C,D,E,F,G,H,I,J,K) [-1 + -1*A + B >= 0 && A >= D] (?,1) 7. f59(A,B,C,D,E,F,G,H,I,J,K) -> f59(A,B,C,D,E,F,G,1 + H,L,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && A >= H] (?,1) 8. f71(A,B,C,D,E,F,G,H,I,J,K) -> f73(A,B,C,D,E,F,G,H,L,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && A >= 1 + D] (?,1) 9. f71(A,B,C,D,E,F,G,H,I,J,K) -> f28(A,B,C,1 + A,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && A = D] (?,1) 10. f73(A,B,C,D,E,F,G,H,I,J,K) -> f28(A,B,C,1 + D,E,F,G,H,I,J,K) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A] (?,1) 11. f59(A,B,C,D,E,F,G,H,I,J,K) -> f69(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && H >= 1 + A] (?,1) 12. f42(A,B,C,D,E,F,G,H,I,J,K) -> f59(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 (?,1) && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A && K >= 1 + D] 13. f42(A,B,C,D,E,F,G,H,I,J,K) -> f59(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 (?,1) && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A && D >= 1 + K] 14. f42(A,B,C,D,E,F,G,H,I,J,K) -> f69(A,B,C,D,E,F,G,H,I,J,D) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A && D = K] (?,1) 15. f30(A,B,C,D,E,F,G,H,I,J,K) -> f42(A,B,0,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1 + -1*A + B >= 0 && B >= D] (?,1) 16. f28(A,B,C,D,E,F,G,H,I,J,K) -> f82(A,B,C,D,E,F,G,H,I,J,K) [-1 + -1*A + B >= 0 && D >= 1 + A] (?,1) 17. f15(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,1 + B,C,D,E,F,G,H,I,J,K) [A + -1*B >= 0 && 0 >= 1 + C && D >= 1 + A] (?,1) 18. f15(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,1 + B,C,D,E,F,G,H,I,J,K) [A + -1*B >= 0 && C >= 1 && D >= 1 + A] (?,1) 19. f15(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,1 + B,0,D,E,F,G,H,I,J,K) [A + -1*B >= 0 && D >= 1 + A && C = 0] (?,1) 20. f12(A,B,C,D,E,F,G,H,I,J,K) -> f28(A,B,C,D,E,F,G,H,I,J,K) [B >= 1 + A] (?,1) Signature: {(f0,11);(f12,11);(f15,11);(f28,11);(f30,11);(f42,11);(f59,11);(f69,11);(f71,11);(f73,11);(f82,11)} Flow Graph: [0->{8,9},1->{8,9},2->{3,20},3->{4,5,17,18,19},4->{4,5,17,18,19},5->{4,5,17,18,19},6->{15},7->{7,11} ,8->{10},9->{6,16},10->{6,16},11->{0,1},12->{7,11},13->{7,11},14->{0,1},15->{12,13,14},16->{},17->{3,20} ,18->{3,20},19->{3,20},20->{6,16}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(3,17),(3,18),(9,6),(10,16)] * Step 2: FromIts YES + Considered Problem: Rules: 0. f69(A,B,C,D,E,F,G,H,I,J,K) -> f71(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && 0 >= 1 + L] (?,1) 1. f69(A,B,C,D,E,F,G,H,I,J,K) -> f71(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0] (?,1) 2. f0(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,B,C,D,E,F,G,H,I,J,K) True (1,1) 3. f12(A,B,C,D,E,F,G,H,I,J,K) -> f15(A,B,0,D,E,F,G,H,I,J,K) [A >= B] (?,1) 4. f15(A,B,C,D,E,F,G,H,I,J,K) -> f15(A,B,C,1 + D,L,L,G,H,I,J,K) [A + -1*B >= 0 && C >= L && A >= D] (?,1) 5. f15(A,B,C,D,E,F,G,H,I,J,K) -> f15(A,B,L,1 + D,L,L,G,H,I,J,K) [A + -1*B >= 0 && L >= 1 + C && A >= D] (?,1) 6. f28(A,B,C,D,E,F,G,H,I,J,K) -> f30(A,B,C,D,E,F,G,H,I,J,K) [-1 + -1*A + B >= 0 && A >= D] (?,1) 7. f59(A,B,C,D,E,F,G,H,I,J,K) -> f59(A,B,C,D,E,F,G,1 + H,L,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && A >= H] (?,1) 8. f71(A,B,C,D,E,F,G,H,I,J,K) -> f73(A,B,C,D,E,F,G,H,L,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && A >= 1 + D] (?,1) 9. f71(A,B,C,D,E,F,G,H,I,J,K) -> f28(A,B,C,1 + A,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && A = D] (?,1) 10. f73(A,B,C,D,E,F,G,H,I,J,K) -> f28(A,B,C,1 + D,E,F,G,H,I,J,K) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A] (?,1) 11. f59(A,B,C,D,E,F,G,H,I,J,K) -> f69(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && H >= 1 + A] (?,1) 12. f42(A,B,C,D,E,F,G,H,I,J,K) -> f59(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 (?,1) && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A && K >= 1 + D] 13. f42(A,B,C,D,E,F,G,H,I,J,K) -> f59(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 (?,1) && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A && D >= 1 + K] 14. f42(A,B,C,D,E,F,G,H,I,J,K) -> f69(A,B,C,D,E,F,G,H,I,J,D) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A && D = K] (?,1) 15. f30(A,B,C,D,E,F,G,H,I,J,K) -> f42(A,B,0,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1 + -1*A + B >= 0 && B >= D] (?,1) 16. f28(A,B,C,D,E,F,G,H,I,J,K) -> f82(A,B,C,D,E,F,G,H,I,J,K) [-1 + -1*A + B >= 0 && D >= 1 + A] (?,1) 17. f15(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,1 + B,C,D,E,F,G,H,I,J,K) [A + -1*B >= 0 && 0 >= 1 + C && D >= 1 + A] (?,1) 18. f15(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,1 + B,C,D,E,F,G,H,I,J,K) [A + -1*B >= 0 && C >= 1 && D >= 1 + A] (?,1) 19. f15(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,1 + B,0,D,E,F,G,H,I,J,K) [A + -1*B >= 0 && D >= 1 + A && C = 0] (?,1) 20. f12(A,B,C,D,E,F,G,H,I,J,K) -> f28(A,B,C,D,E,F,G,H,I,J,K) [B >= 1 + A] (?,1) Signature: {(f0,11);(f12,11);(f15,11);(f28,11);(f30,11);(f42,11);(f59,11);(f69,11);(f71,11);(f73,11);(f82,11)} Flow Graph: [0->{8,9},1->{8,9},2->{3,20},3->{4,5,19},4->{4,5,17,18,19},5->{4,5,17,18,19},6->{15},7->{7,11},8->{10} ,9->{16},10->{6},11->{0,1},12->{7,11},13->{7,11},14->{0,1},15->{12,13,14},16->{},17->{3,20},18->{3,20} ,19->{3,20},20->{6,16}] + Applied Processor: FromIts + Details: () * Step 3: Decompose YES + Considered Problem: Rules: f69(A,B,C,D,E,F,G,H,I,J,K) -> f71(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && 0 >= 1 + L] f69(A,B,C,D,E,F,G,H,I,J,K) -> f71(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0] f0(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,B,C,D,E,F,G,H,I,J,K) True f12(A,B,C,D,E,F,G,H,I,J,K) -> f15(A,B,0,D,E,F,G,H,I,J,K) [A >= B] f15(A,B,C,D,E,F,G,H,I,J,K) -> f15(A,B,C,1 + D,L,L,G,H,I,J,K) [A + -1*B >= 0 && C >= L && A >= D] f15(A,B,C,D,E,F,G,H,I,J,K) -> f15(A,B,L,1 + D,L,L,G,H,I,J,K) [A + -1*B >= 0 && L >= 1 + C && A >= D] f28(A,B,C,D,E,F,G,H,I,J,K) -> f30(A,B,C,D,E,F,G,H,I,J,K) [-1 + -1*A + B >= 0 && A >= D] f59(A,B,C,D,E,F,G,H,I,J,K) -> f59(A,B,C,D,E,F,G,1 + H,L,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && A >= H] f71(A,B,C,D,E,F,G,H,I,J,K) -> f73(A,B,C,D,E,F,G,H,L,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && A >= 1 + D] f71(A,B,C,D,E,F,G,H,I,J,K) -> f28(A,B,C,1 + A,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && A = D] f73(A,B,C,D,E,F,G,H,I,J,K) -> f28(A,B,C,1 + D,E,F,G,H,I,J,K) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A] f59(A,B,C,D,E,F,G,H,I,J,K) -> f69(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && H >= 1 + A] f42(A,B,C,D,E,F,G,H,I,J,K) -> f59(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A && K >= 1 + D] f42(A,B,C,D,E,F,G,H,I,J,K) -> f59(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A && D >= 1 + K] f42(A,B,C,D,E,F,G,H,I,J,K) -> f69(A,B,C,D,E,F,G,H,I,J,D) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A && D = K] f30(A,B,C,D,E,F,G,H,I,J,K) -> f42(A,B,0,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1 + -1*A + B >= 0 && B >= D] f28(A,B,C,D,E,F,G,H,I,J,K) -> f82(A,B,C,D,E,F,G,H,I,J,K) [-1 + -1*A + B >= 0 && D >= 1 + A] f15(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,1 + B,C,D,E,F,G,H,I,J,K) [A + -1*B >= 0 && 0 >= 1 + C && D >= 1 + A] f15(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,1 + B,C,D,E,F,G,H,I,J,K) [A + -1*B >= 0 && C >= 1 && D >= 1 + A] f15(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,1 + B,0,D,E,F,G,H,I,J,K) [A + -1*B >= 0 && D >= 1 + A && C = 0] f12(A,B,C,D,E,F,G,H,I,J,K) -> f28(A,B,C,D,E,F,G,H,I,J,K) [B >= 1 + A] Signature: {(f0,11);(f12,11);(f15,11);(f28,11);(f30,11);(f42,11);(f59,11);(f69,11);(f71,11);(f73,11);(f82,11)} Rule Graph: [0->{8,9},1->{8,9},2->{3,20},3->{4,5,19},4->{4,5,17,18,19},5->{4,5,17,18,19},6->{15},7->{7,11},8->{10} ,9->{16},10->{6},11->{0,1},12->{7,11},13->{7,11},14->{0,1},15->{12,13,14},16->{},17->{3,20},18->{3,20} ,19->{3,20},20->{6,16}] + Applied Processor: Decompose NoGreedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20] | +- p:[3,17,4,5,18,19] c: [19] | | | `- p:[3,17,4,5,18] c: [18] | | | `- p:[3,17,4,5] c: [3,17] | | | `- p:[4,5] c: [5] | | | `- p:[4] c: [4] | `- p:[0,11,7,12,15,6,10,8,1,14,13] c: [0,1,6,8,10,11,12,13,14,15] | `- p:[7] c: [7] * Step 4: CloseWith YES + Considered Problem: (Rules: f69(A,B,C,D,E,F,G,H,I,J,K) -> f71(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && 0 >= 1 + L] f69(A,B,C,D,E,F,G,H,I,J,K) -> f71(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0] f0(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,B,C,D,E,F,G,H,I,J,K) True f12(A,B,C,D,E,F,G,H,I,J,K) -> f15(A,B,0,D,E,F,G,H,I,J,K) [A >= B] f15(A,B,C,D,E,F,G,H,I,J,K) -> f15(A,B,C,1 + D,L,L,G,H,I,J,K) [A + -1*B >= 0 && C >= L && A >= D] f15(A,B,C,D,E,F,G,H,I,J,K) -> f15(A,B,L,1 + D,L,L,G,H,I,J,K) [A + -1*B >= 0 && L >= 1 + C && A >= D] f28(A,B,C,D,E,F,G,H,I,J,K) -> f30(A,B,C,D,E,F,G,H,I,J,K) [-1 + -1*A + B >= 0 && A >= D] f59(A,B,C,D,E,F,G,H,I,J,K) -> f59(A,B,C,D,E,F,G,1 + H,L,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && A >= H] f71(A,B,C,D,E,F,G,H,I,J,K) -> f73(A,B,C,D,E,F,G,H,L,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && A >= 1 + D] f71(A,B,C,D,E,F,G,H,I,J,K) -> f28(A,B,C,1 + A,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && A = D] f73(A,B,C,D,E,F,G,H,I,J,K) -> f28(A,B,C,1 + D,E,F,G,H,I,J,K) [-2 + B + -1*D >= 0 && -1 + A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A] f59(A,B,C,D,E,F,G,H,I,J,K) -> f69(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && H >= 1 + A] f42(A,B,C,D,E,F,G,H,I,J,K) -> f59(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A && K >= 1 + D] f42(A,B,C,D,E,F,G,H,I,J,K) -> f59(A,B,C,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A && D >= 1 + K] f42(A,B,C,D,E,F,G,H,I,J,K) -> f69(A,B,C,D,E,F,G,H,I,J,D) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1*C >= 0 && C >= 0 && -1 + -1*A + B >= 0 && B >= 1 + A && D = K] f30(A,B,C,D,E,F,G,H,I,J,K) -> f42(A,B,0,D,E,F,G,H,I,J,K) [-1 + B + -1*D >= 0 && A + -1*D >= 0 && -1 + -1*A + B >= 0 && B >= D] f28(A,B,C,D,E,F,G,H,I,J,K) -> f82(A,B,C,D,E,F,G,H,I,J,K) [-1 + -1*A + B >= 0 && D >= 1 + A] f15(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,1 + B,C,D,E,F,G,H,I,J,K) [A + -1*B >= 0 && 0 >= 1 + C && D >= 1 + A] f15(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,1 + B,C,D,E,F,G,H,I,J,K) [A + -1*B >= 0 && C >= 1 && D >= 1 + A] f15(A,B,C,D,E,F,G,H,I,J,K) -> f12(A,1 + B,0,D,E,F,G,H,I,J,K) [A + -1*B >= 0 && D >= 1 + A && C = 0] f12(A,B,C,D,E,F,G,H,I,J,K) -> f28(A,B,C,D,E,F,G,H,I,J,K) [B >= 1 + A] Signature: {(f0,11);(f12,11);(f15,11);(f28,11);(f30,11);(f42,11);(f59,11);(f69,11);(f71,11);(f73,11);(f82,11)} Rule Graph: [0->{8,9},1->{8,9},2->{3,20},3->{4,5,19},4->{4,5,17,18,19},5->{4,5,17,18,19},6->{15},7->{7,11},8->{10} ,9->{16},10->{6},11->{0,1},12->{7,11},13->{7,11},14->{0,1},15->{12,13,14},16->{},17->{3,20},18->{3,20} ,19->{3,20},20->{6,16}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20] | +- p:[3,17,4,5,18,19] c: [19] | | | `- p:[3,17,4,5,18] c: [18] | | | `- p:[3,17,4,5] c: [3,17] | | | `- p:[4,5] c: [5] | | | `- p:[4] c: [4] | `- p:[0,11,7,12,15,6,10,8,1,14,13] c: [0,1,6,8,10,11,12,13,14,15] | `- p:[7] c: [7]) + Applied Processor: CloseWith True + Details: () YES