YES * Step 1: UnsatPaths YES + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f15(50,5,0,D,E,F,G,H,I,J,K,L,M) True (1,1) 1. f15(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,0,0,F,G,H,I,J,K,L,M) [B >= C] (?,1) 2. f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,D + N,1 + E,F,G,H,I,J,K,L,M) [B >= E && E >= 1 + C] (?,1) 3. f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,D + N,1 + E,F,G,H,I,J,K,L,M) [C >= 1 + E && B >= E] (?,1) 4. f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,D + N,1 + C,F,G,H,I,J,K,L,M) [B >= E && C = E] (?,1) 5. f33(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f36(A,B,C,D,E,F,G,1 + G,I,J,K,L,M) [F >= 1 + G] (?,1) 6. f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f41(A,B,C,D,E,F,G,H,N,0,K,L,M) [0 >= 1 + G && F >= H] (?,1) 7. f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f41(A,B,C,D,E,F,G,H,N,0,K,L,M) [G >= 1 && F >= H] (?,1) 8. f41(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f41(A,B,C,D,E,F,G,H,N,1 + J,K,L,M) [G >= 1 + J] (?,1) 9. f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f36(A,B,C,D,E,F,0,1 + H,N,J,K,L,M) [F >= H && G = 0] (?,1) 10. f50(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f54(A,B,C,D,E,F,G,H,N,0,K,L,M) [F >= H] (?,1) 11. f54(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f54(A,B,C,D,E,F,G,H,N,1 + J,K,L,M) [G >= J] (?,1) 12. f66(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f70(A,B,C,D,E,F,G,0,N,J,K,L,M) [F >= G] (?,1) 13. f70(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f70(A,B,C,D,E,F,G,1 + H,N,J,K,L,M) [G >= 1 + H] (?,1) 14. f80(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f84(A,B,C,D,E,F,G,1 + G,N,J,K,L,M) [G >= 0] (?,1) 15. f84(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f84(A,B,C,D,E,F,G,1 + H,N,J,K,L,M) [F >= H] (?,1) 16. f84(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f80(A,B,C,D,E,F,-1 + G,H,I,J,K,L,M) [H >= 1 + F] (?,1) 17. f80(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f96(A,B,C,D,E,F,G,H,I,J,0,0,M) [0 >= 1 + G] (?,1) 18. f70(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f66(A,B,C,D,E,F,1 + G,H,I,J,K,L,M) [H >= G] (?,1) 19. f66(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f80(A,B,C,D,E,F,-1 + F,H,I,J,K,L,M) [G >= 1 + F] (?,1) 20. f54(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f50(A,B,C,D,E,F,G,1 + H,I,J,K,L,M) [J >= 1 + G] (?,1) 21. f50(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f33(A,B,C,D,E,F,1 + G,H,I,J,K,L,M) [H >= 1 + F] (?,1) 22. f41(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f36(A,B,C,D,E,F,G,1 + H,I,J,K,L,M) [J >= G] (?,1) 23. f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f50(A,B,C,D,E,F,G,1 + G,I,J,K,L,M) [H >= 1 + F] (?,1) 24. f33(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f66(A,B,C,D,E,F,1,H,I,J,K,L,M) [G >= F] (?,1) 25. f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f15(A,B,1 + C,D,E,F,G,H,I,J,K,L,M) [E >= 1 + B] (?,1) 26. f15(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f33(A,B,C,D,E,B,0,H,I,J,K,L,A) [C >= 1 + B] (?,1) Signature: {(f0,13) ;(f15,13) ;(f19,13) ;(f33,13) ;(f36,13) ;(f41,13) ;(f50,13) ;(f54,13) ;(f66,13) ;(f70,13) ;(f80,13) ;(f84,13) ;(f96,13)} Flow Graph: [0->{1,26},1->{2,3,4,25},2->{2,3,4,25},3->{2,3,4,25},4->{2,3,4,25},5->{6,7,9,23},6->{8,22},7->{8,22},8->{8 ,22},9->{6,7,9,23},10->{11,20},11->{11,20},12->{13,18},13->{13,18},14->{15,16},15->{15,16},16->{14,17} ,17->{},18->{12,19},19->{14,17},20->{10,21},21->{5,24},22->{6,7,9,23},23->{10,21},24->{12,19},25->{1,26} ,26->{5,24}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,26) ,(2,3) ,(2,4) ,(3,2) ,(4,3) ,(4,4) ,(5,23) ,(6,8) ,(7,22) ,(9,6) ,(9,7)] * Step 2: FromIts YES + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f15(50,5,0,D,E,F,G,H,I,J,K,L,M) True (1,1) 1. f15(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,0,0,F,G,H,I,J,K,L,M) [B >= C] (?,1) 2. f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,D + N,1 + E,F,G,H,I,J,K,L,M) [B >= E && E >= 1 + C] (?,1) 3. f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,D + N,1 + E,F,G,H,I,J,K,L,M) [C >= 1 + E && B >= E] (?,1) 4. f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,D + N,1 + C,F,G,H,I,J,K,L,M) [B >= E && C = E] (?,1) 5. f33(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f36(A,B,C,D,E,F,G,1 + G,I,J,K,L,M) [F >= 1 + G] (?,1) 6. f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f41(A,B,C,D,E,F,G,H,N,0,K,L,M) [0 >= 1 + G && F >= H] (?,1) 7. f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f41(A,B,C,D,E,F,G,H,N,0,K,L,M) [G >= 1 && F >= H] (?,1) 8. f41(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f41(A,B,C,D,E,F,G,H,N,1 + J,K,L,M) [G >= 1 + J] (?,1) 9. f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f36(A,B,C,D,E,F,0,1 + H,N,J,K,L,M) [F >= H && G = 0] (?,1) 10. f50(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f54(A,B,C,D,E,F,G,H,N,0,K,L,M) [F >= H] (?,1) 11. f54(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f54(A,B,C,D,E,F,G,H,N,1 + J,K,L,M) [G >= J] (?,1) 12. f66(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f70(A,B,C,D,E,F,G,0,N,J,K,L,M) [F >= G] (?,1) 13. f70(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f70(A,B,C,D,E,F,G,1 + H,N,J,K,L,M) [G >= 1 + H] (?,1) 14. f80(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f84(A,B,C,D,E,F,G,1 + G,N,J,K,L,M) [G >= 0] (?,1) 15. f84(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f84(A,B,C,D,E,F,G,1 + H,N,J,K,L,M) [F >= H] (?,1) 16. f84(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f80(A,B,C,D,E,F,-1 + G,H,I,J,K,L,M) [H >= 1 + F] (?,1) 17. f80(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f96(A,B,C,D,E,F,G,H,I,J,0,0,M) [0 >= 1 + G] (?,1) 18. f70(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f66(A,B,C,D,E,F,1 + G,H,I,J,K,L,M) [H >= G] (?,1) 19. f66(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f80(A,B,C,D,E,F,-1 + F,H,I,J,K,L,M) [G >= 1 + F] (?,1) 20. f54(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f50(A,B,C,D,E,F,G,1 + H,I,J,K,L,M) [J >= 1 + G] (?,1) 21. f50(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f33(A,B,C,D,E,F,1 + G,H,I,J,K,L,M) [H >= 1 + F] (?,1) 22. f41(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f36(A,B,C,D,E,F,G,1 + H,I,J,K,L,M) [J >= G] (?,1) 23. f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f50(A,B,C,D,E,F,G,1 + G,I,J,K,L,M) [H >= 1 + F] (?,1) 24. f33(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f66(A,B,C,D,E,F,1,H,I,J,K,L,M) [G >= F] (?,1) 25. f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f15(A,B,1 + C,D,E,F,G,H,I,J,K,L,M) [E >= 1 + B] (?,1) 26. f15(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f33(A,B,C,D,E,B,0,H,I,J,K,L,A) [C >= 1 + B] (?,1) Signature: {(f0,13) ;(f15,13) ;(f19,13) ;(f33,13) ;(f36,13) ;(f41,13) ;(f50,13) ;(f54,13) ;(f66,13) ;(f70,13) ;(f80,13) ;(f84,13) ;(f96,13)} Flow Graph: [0->{1},1->{2,3,4,25},2->{2,25},3->{3,4,25},4->{2,25},5->{6,7,9},6->{22},7->{8},8->{8,22},9->{9,23} ,10->{11,20},11->{11,20},12->{13,18},13->{13,18},14->{15,16},15->{15,16},16->{14,17},17->{},18->{12,19} ,19->{14,17},20->{10,21},21->{5,24},22->{6,7,9,23},23->{10,21},24->{12,19},25->{1,26},26->{5,24}] + Applied Processor: FromIts + Details: () * Step 3: Decompose YES + Considered Problem: Rules: f0(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f15(50,5,0,D,E,F,G,H,I,J,K,L,M) True f15(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,0,0,F,G,H,I,J,K,L,M) [B >= C] f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,D + N,1 + E,F,G,H,I,J,K,L,M) [B >= E && E >= 1 + C] f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,D + N,1 + E,F,G,H,I,J,K,L,M) [C >= 1 + E && B >= E] f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,D + N,1 + C,F,G,H,I,J,K,L,M) [B >= E && C = E] f33(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f36(A,B,C,D,E,F,G,1 + G,I,J,K,L,M) [F >= 1 + G] f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f41(A,B,C,D,E,F,G,H,N,0,K,L,M) [0 >= 1 + G && F >= H] f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f41(A,B,C,D,E,F,G,H,N,0,K,L,M) [G >= 1 && F >= H] f41(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f41(A,B,C,D,E,F,G,H,N,1 + J,K,L,M) [G >= 1 + J] f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f36(A,B,C,D,E,F,0,1 + H,N,J,K,L,M) [F >= H && G = 0] f50(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f54(A,B,C,D,E,F,G,H,N,0,K,L,M) [F >= H] f54(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f54(A,B,C,D,E,F,G,H,N,1 + J,K,L,M) [G >= J] f66(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f70(A,B,C,D,E,F,G,0,N,J,K,L,M) [F >= G] f70(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f70(A,B,C,D,E,F,G,1 + H,N,J,K,L,M) [G >= 1 + H] f80(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f84(A,B,C,D,E,F,G,1 + G,N,J,K,L,M) [G >= 0] f84(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f84(A,B,C,D,E,F,G,1 + H,N,J,K,L,M) [F >= H] f84(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f80(A,B,C,D,E,F,-1 + G,H,I,J,K,L,M) [H >= 1 + F] f80(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f96(A,B,C,D,E,F,G,H,I,J,0,0,M) [0 >= 1 + G] f70(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f66(A,B,C,D,E,F,1 + G,H,I,J,K,L,M) [H >= G] f66(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f80(A,B,C,D,E,F,-1 + F,H,I,J,K,L,M) [G >= 1 + F] f54(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f50(A,B,C,D,E,F,G,1 + H,I,J,K,L,M) [J >= 1 + G] f50(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f33(A,B,C,D,E,F,1 + G,H,I,J,K,L,M) [H >= 1 + F] f41(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f36(A,B,C,D,E,F,G,1 + H,I,J,K,L,M) [J >= G] f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f50(A,B,C,D,E,F,G,1 + G,I,J,K,L,M) [H >= 1 + F] f33(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f66(A,B,C,D,E,F,1,H,I,J,K,L,M) [G >= F] f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f15(A,B,1 + C,D,E,F,G,H,I,J,K,L,M) [E >= 1 + B] f15(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f33(A,B,C,D,E,B,0,H,I,J,K,L,A) [C >= 1 + B] Signature: {(f0,13) ;(f15,13) ;(f19,13) ;(f33,13) ;(f36,13) ;(f41,13) ;(f50,13) ;(f54,13) ;(f66,13) ;(f70,13) ;(f80,13) ;(f84,13) ;(f96,13)} Rule Graph: [0->{1},1->{2,3,4,25},2->{2,25},3->{3,4,25},4->{2,25},5->{6,7,9},6->{22},7->{8},8->{8,22},9->{9,23} ,10->{11,20},11->{11,20},12->{13,18},13->{13,18},14->{15,16},15->{15,16},16->{14,17},17->{},18->{12,19} ,19->{14,17},20->{10,21},21->{5,24},22->{6,7,9,23},23->{10,21},24->{12,19},25->{1,26},26->{5,24}] + 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,21,22,23,24,25,26] | +- p:[1,25,2,4,3] c: [1,25] | | | +- p:[3] c: [3] | | | `- p:[2] c: [2] | +- p:[5,21,20,10,23,9,22,6,8,7,11] c: [5,21] | | | +- p:[6,22,8,7] c: [6,7,22] | | | | | `- p:[8] c: [8] | | | +- p:[9] c: [9] | | | `- p:[10,20,11] c: [10,20] | | | `- p:[11] c: [11] | +- p:[12,18,13] c: [12,18] | | | `- p:[13] c: [13] | `- p:[14,16,15] c: [14,16] | `- p:[15] c: [15] * Step 4: CloseWith YES + Considered Problem: (Rules: f0(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f15(50,5,0,D,E,F,G,H,I,J,K,L,M) True f15(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,0,0,F,G,H,I,J,K,L,M) [B >= C] f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,D + N,1 + E,F,G,H,I,J,K,L,M) [B >= E && E >= 1 + C] f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,D + N,1 + E,F,G,H,I,J,K,L,M) [C >= 1 + E && B >= E] f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f19(A,B,C,D + N,1 + C,F,G,H,I,J,K,L,M) [B >= E && C = E] f33(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f36(A,B,C,D,E,F,G,1 + G,I,J,K,L,M) [F >= 1 + G] f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f41(A,B,C,D,E,F,G,H,N,0,K,L,M) [0 >= 1 + G && F >= H] f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f41(A,B,C,D,E,F,G,H,N,0,K,L,M) [G >= 1 && F >= H] f41(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f41(A,B,C,D,E,F,G,H,N,1 + J,K,L,M) [G >= 1 + J] f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f36(A,B,C,D,E,F,0,1 + H,N,J,K,L,M) [F >= H && G = 0] f50(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f54(A,B,C,D,E,F,G,H,N,0,K,L,M) [F >= H] f54(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f54(A,B,C,D,E,F,G,H,N,1 + J,K,L,M) [G >= J] f66(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f70(A,B,C,D,E,F,G,0,N,J,K,L,M) [F >= G] f70(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f70(A,B,C,D,E,F,G,1 + H,N,J,K,L,M) [G >= 1 + H] f80(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f84(A,B,C,D,E,F,G,1 + G,N,J,K,L,M) [G >= 0] f84(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f84(A,B,C,D,E,F,G,1 + H,N,J,K,L,M) [F >= H] f84(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f80(A,B,C,D,E,F,-1 + G,H,I,J,K,L,M) [H >= 1 + F] f80(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f96(A,B,C,D,E,F,G,H,I,J,0,0,M) [0 >= 1 + G] f70(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f66(A,B,C,D,E,F,1 + G,H,I,J,K,L,M) [H >= G] f66(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f80(A,B,C,D,E,F,-1 + F,H,I,J,K,L,M) [G >= 1 + F] f54(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f50(A,B,C,D,E,F,G,1 + H,I,J,K,L,M) [J >= 1 + G] f50(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f33(A,B,C,D,E,F,1 + G,H,I,J,K,L,M) [H >= 1 + F] f41(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f36(A,B,C,D,E,F,G,1 + H,I,J,K,L,M) [J >= G] f36(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f50(A,B,C,D,E,F,G,1 + G,I,J,K,L,M) [H >= 1 + F] f33(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f66(A,B,C,D,E,F,1,H,I,J,K,L,M) [G >= F] f19(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f15(A,B,1 + C,D,E,F,G,H,I,J,K,L,M) [E >= 1 + B] f15(A,B,C,D,E,F,G,H,I,J,K,L,M) -> f33(A,B,C,D,E,B,0,H,I,J,K,L,A) [C >= 1 + B] Signature: {(f0,13) ;(f15,13) ;(f19,13) ;(f33,13) ;(f36,13) ;(f41,13) ;(f50,13) ;(f54,13) ;(f66,13) ;(f70,13) ;(f80,13) ;(f84,13) ;(f96,13)} Rule Graph: [0->{1},1->{2,3,4,25},2->{2,25},3->{3,4,25},4->{2,25},5->{6,7,9},6->{22},7->{8},8->{8,22},9->{9,23} ,10->{11,20},11->{11,20},12->{13,18},13->{13,18},14->{15,16},15->{15,16},16->{14,17},17->{},18->{12,19} ,19->{14,17},20->{10,21},21->{5,24},22->{6,7,9,23},23->{10,21},24->{12,19},25->{1,26},26->{5,24}] ,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,21,22,23,24,25,26] | +- p:[1,25,2,4,3] c: [1,25] | | | +- p:[3] c: [3] | | | `- p:[2] c: [2] | +- p:[5,21,20,10,23,9,22,6,8,7,11] c: [5,21] | | | +- p:[6,22,8,7] c: [6,7,22] | | | | | `- p:[8] c: [8] | | | +- p:[9] c: [9] | | | `- p:[10,20,11] c: [10,20] | | | `- p:[11] c: [11] | +- p:[12,18,13] c: [12,18] | | | `- p:[13] c: [13] | `- p:[14,16,15] c: [14,16] | `- p:[15] c: [15]) + Applied Processor: CloseWith True + Details: () YES