YES * Step 1: UnsatRules YES + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q,P) [A = B && C = D && E = F && G = H && I = J && K = L && M = N && O = P] (?,1) 1. lbl121(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl123(A,B,C,D,E,F,A,H,I,J,K,L,M,N,O,P) [G >= 2*A (?,1) && 1 + 2*A >= G && 1 + 2*O >= L && O >= G && E >= 0 && G >= 1 && L >= 1 + E && K = L && I = L && 1 + M = L] 2. lbl123(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> stop(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) [E >= 0 && 1 + 2*O >= L && O >= 1 && L >= 1 + E && O >= 0 && G = 0 && K = L && I = L && 1 + M = L && A = 0] (?,1) 3. lbl123(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl121(Q,B,C,D,E,F,G,H,0,J,K,L,M,N,O,P) [A >= 1 (?,1) && 0 >= L && A >= 0 && E >= 0 && 1 + 2*O >= L && O >= 1 && L >= 1 + E && O >= 2*A && K = L && I = L && 1 + M = L && G = A] 4. lbl123(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,0,F,G,H,0,J,K,L,M,N,O,P) [L >= 1 (?,1) && A >= 1 && A >= 0 && E >= 0 && 1 + 2*O >= L && O >= 1 && L >= 1 + E && O >= 2*A && K = L && I = L && 1 + M = L && G = A] 5. lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl101(A,B,C,D,E + -1*G,F,G,H,I,J,K,L,M,N,O,P) [E >= G && I >= E + G && O >= G && L >= 1 + I && G >= 1 && 1 + 2*O >= L && E >= 0 && K = L] (?,1) 6. lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl53(A,B,C,D,E,F,G,H,1 + I,J,K,L,I,N,O,P) [I >= E + G && O >= G && L >= 1 + I && G >= 1 && 1 + 2*O >= L && E >= 0 && K = L] (?,1) 7. lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl101(A,B,C,D,E + -1*G,F,G,H,I,J,K,L,M,N,O,P) [E >= G && 1 + 2*O >= L && O >= G && G >= 1 && E >= 0 && L >= 1 + E && I = E && K = L] (?,1) 8. lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl53(A,B,C,D,E,F,G,H,1 + I,J,K,L,I,N,O,P) [1 + 2*O >= L && O >= G && G >= 1 && E >= 0 && L >= 1 + E && I = E && K = L] (?,1) 9. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl121(Q,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) [L >= 1 + E && G >= 1 && E >= 0 && O >= G && 1 + 2*O >= L && I = L && K = L && 1 + M = L] (?,1) 10. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,I,F,G,H,I,J,K,L,M,N,O,P) [L >= 2 + M && L >= 1 + M && M >= E && G >= 1 && E >= 0 && O >= G && 1 + 2*O >= L && I = 1 + M && K = L] (?,1) 11. lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> stop(A,B,C,D,E,F,O,H,I,J,K,L,M,N,O,P) [L >= 2*O && 0 >= O && 1 + 2*O >= L && M = N && A = B && C = D && E = F && G = H && I = J && K = L] (?,1) 12. lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,0,F,O,H,0,J,K,L,M,N,O,P) [L >= 2*O && O >= 1 && 1 + 2*O >= L && M = N && A = B && C = D && E = F && G = H && I = J && K = L] (?,1) 13. start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> start(B,B,D,D,F,F,H,H,J,J,L,L,N,N,P,P) True (1,1) Signature: {(lbl101,16);(lbl121,16);(lbl123,16);(lbl21,16);(lbl53,16);(lbl71,16);(start,16);(start0,16);(stop,16)} Flow Graph: [0->{11,12},1->{2,3,4},2->{},3->{1},4->{7,8},5->{5,6},6->{9,10},7->{5,6},8->{9,10},9->{1},10->{7,8},11->{} ,12->{7,8},13->{0}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [3] * Step 2: UnsatPaths YES + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q,P) [A = B && C = D && E = F && G = H && I = J && K = L && M = N && O = P] (?,1) 1. lbl121(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl123(A,B,C,D,E,F,A,H,I,J,K,L,M,N,O,P) [G >= 2*A (?,1) && 1 + 2*A >= G && 1 + 2*O >= L && O >= G && E >= 0 && G >= 1 && L >= 1 + E && K = L && I = L && 1 + M = L] 2. lbl123(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> stop(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) [E >= 0 && 1 + 2*O >= L && O >= 1 && L >= 1 + E && O >= 0 && G = 0 && K = L && I = L && 1 + M = L && A = 0] (?,1) 4. lbl123(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,0,F,G,H,0,J,K,L,M,N,O,P) [L >= 1 (?,1) && A >= 1 && A >= 0 && E >= 0 && 1 + 2*O >= L && O >= 1 && L >= 1 + E && O >= 2*A && K = L && I = L && 1 + M = L && G = A] 5. lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl101(A,B,C,D,E + -1*G,F,G,H,I,J,K,L,M,N,O,P) [E >= G && I >= E + G && O >= G && L >= 1 + I && G >= 1 && 1 + 2*O >= L && E >= 0 && K = L] (?,1) 6. lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl53(A,B,C,D,E,F,G,H,1 + I,J,K,L,I,N,O,P) [I >= E + G && O >= G && L >= 1 + I && G >= 1 && 1 + 2*O >= L && E >= 0 && K = L] (?,1) 7. lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl101(A,B,C,D,E + -1*G,F,G,H,I,J,K,L,M,N,O,P) [E >= G && 1 + 2*O >= L && O >= G && G >= 1 && E >= 0 && L >= 1 + E && I = E && K = L] (?,1) 8. lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl53(A,B,C,D,E,F,G,H,1 + I,J,K,L,I,N,O,P) [1 + 2*O >= L && O >= G && G >= 1 && E >= 0 && L >= 1 + E && I = E && K = L] (?,1) 9. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl121(Q,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) [L >= 1 + E && G >= 1 && E >= 0 && O >= G && 1 + 2*O >= L && I = L && K = L && 1 + M = L] (?,1) 10. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,I,F,G,H,I,J,K,L,M,N,O,P) [L >= 2 + M && L >= 1 + M && M >= E && G >= 1 && E >= 0 && O >= G && 1 + 2*O >= L && I = 1 + M && K = L] (?,1) 11. lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> stop(A,B,C,D,E,F,O,H,I,J,K,L,M,N,O,P) [L >= 2*O && 0 >= O && 1 + 2*O >= L && M = N && A = B && C = D && E = F && G = H && I = J && K = L] (?,1) 12. lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,0,F,O,H,0,J,K,L,M,N,O,P) [L >= 2*O && O >= 1 && 1 + 2*O >= L && M = N && A = B && C = D && E = F && G = H && I = J && K = L] (?,1) 13. start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> start(B,B,D,D,F,F,H,H,J,J,L,L,N,N,P,P) True (1,1) Signature: {(lbl101,16);(lbl121,16);(lbl123,16);(lbl21,16);(lbl53,16);(lbl71,16);(start,16);(start0,16);(stop,16)} Flow Graph: [0->{11,12},1->{2,4},2->{},4->{7,8},5->{5,6},6->{9,10},7->{5,6},8->{9,10},9->{1},10->{7,8},11->{},12->{7 ,8},13->{0}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(4,7),(12,7)] * Step 3: FromIts YES + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q,P) [A = B && C = D && E = F && G = H && I = J && K = L && M = N && O = P] (?,1) 1. lbl121(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl123(A,B,C,D,E,F,A,H,I,J,K,L,M,N,O,P) [G >= 2*A (?,1) && 1 + 2*A >= G && 1 + 2*O >= L && O >= G && E >= 0 && G >= 1 && L >= 1 + E && K = L && I = L && 1 + M = L] 2. lbl123(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> stop(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) [E >= 0 && 1 + 2*O >= L && O >= 1 && L >= 1 + E && O >= 0 && G = 0 && K = L && I = L && 1 + M = L && A = 0] (?,1) 4. lbl123(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,0,F,G,H,0,J,K,L,M,N,O,P) [L >= 1 (?,1) && A >= 1 && A >= 0 && E >= 0 && 1 + 2*O >= L && O >= 1 && L >= 1 + E && O >= 2*A && K = L && I = L && 1 + M = L && G = A] 5. lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl101(A,B,C,D,E + -1*G,F,G,H,I,J,K,L,M,N,O,P) [E >= G && I >= E + G && O >= G && L >= 1 + I && G >= 1 && 1 + 2*O >= L && E >= 0 && K = L] (?,1) 6. lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl53(A,B,C,D,E,F,G,H,1 + I,J,K,L,I,N,O,P) [I >= E + G && O >= G && L >= 1 + I && G >= 1 && 1 + 2*O >= L && E >= 0 && K = L] (?,1) 7. lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl101(A,B,C,D,E + -1*G,F,G,H,I,J,K,L,M,N,O,P) [E >= G && 1 + 2*O >= L && O >= G && G >= 1 && E >= 0 && L >= 1 + E && I = E && K = L] (?,1) 8. lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl53(A,B,C,D,E,F,G,H,1 + I,J,K,L,I,N,O,P) [1 + 2*O >= L && O >= G && G >= 1 && E >= 0 && L >= 1 + E && I = E && K = L] (?,1) 9. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl121(Q,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) [L >= 1 + E && G >= 1 && E >= 0 && O >= G && 1 + 2*O >= L && I = L && K = L && 1 + M = L] (?,1) 10. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,I,F,G,H,I,J,K,L,M,N,O,P) [L >= 2 + M && L >= 1 + M && M >= E && G >= 1 && E >= 0 && O >= G && 1 + 2*O >= L && I = 1 + M && K = L] (?,1) 11. lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> stop(A,B,C,D,E,F,O,H,I,J,K,L,M,N,O,P) [L >= 2*O && 0 >= O && 1 + 2*O >= L && M = N && A = B && C = D && E = F && G = H && I = J && K = L] (?,1) 12. lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,0,F,O,H,0,J,K,L,M,N,O,P) [L >= 2*O && O >= 1 && 1 + 2*O >= L && M = N && A = B && C = D && E = F && G = H && I = J && K = L] (?,1) 13. start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> start(B,B,D,D,F,F,H,H,J,J,L,L,N,N,P,P) True (1,1) Signature: {(lbl101,16);(lbl121,16);(lbl123,16);(lbl21,16);(lbl53,16);(lbl71,16);(start,16);(start0,16);(stop,16)} Flow Graph: [0->{11,12},1->{2,4},2->{},4->{8},5->{5,6},6->{9,10},7->{5,6},8->{9,10},9->{1},10->{7,8},11->{},12->{8} ,13->{0}] + Applied Processor: FromIts + Details: () * Step 4: Decompose YES + Considered Problem: Rules: start(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q,P) [A = B && C = D && E = F && G = H && I = J && K = L && M = N && O = P] lbl121(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl123(A,B,C,D,E,F,A,H,I,J,K,L,M,N,O,P) [G >= 2*A && 1 + 2*A >= G && 1 + 2*O >= L && O >= G && E >= 0 && G >= 1 && L >= 1 + E && K = L && I = L && 1 + M = L] lbl123(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> stop(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) [E >= 0 && 1 + 2*O >= L && O >= 1 && L >= 1 + E && O >= 0 && G = 0 && K = L && I = L && 1 + M = L && A = 0] lbl123(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,0,F,G,H,0,J,K,L,M,N,O,P) [L >= 1 && A >= 1 && A >= 0 && E >= 0 && 1 + 2*O >= L && O >= 1 && L >= 1 + E && O >= 2*A && K = L && I = L && 1 + M = L && G = A] lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl101(A,B,C,D,E + -1*G,F,G,H,I,J,K,L,M,N,O,P) [E >= G && I >= E + G && O >= G && L >= 1 + I && G >= 1 && 1 + 2*O >= L && E >= 0 && K = L] lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl53(A,B,C,D,E,F,G,H,1 + I,J,K,L,I,N,O,P) [I >= E + G && O >= G && L >= 1 + I && G >= 1 && 1 + 2*O >= L && E >= 0 && K = L] lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl101(A,B,C,D,E + -1*G,F,G,H,I,J,K,L,M,N,O,P) [E >= G && 1 + 2*O >= L && O >= G && G >= 1 && E >= 0 && L >= 1 + E && I = E && K = L] lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl53(A,B,C,D,E,F,G,H,1 + I,J,K,L,I,N,O,P) [1 + 2*O >= L && O >= G && G >= 1 && E >= 0 && L >= 1 + E && I = E && K = L] lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl121(Q,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) [L >= 1 + E && G >= 1 && E >= 0 && O >= G && 1 + 2*O >= L && I = L && K = L && 1 + M = L] lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,I,F,G,H,I,J,K,L,M,N,O,P) [L >= 2 + M && L >= 1 + M && M >= E && G >= 1 && E >= 0 && O >= G && 1 + 2*O >= L && I = 1 + M && K = L] lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> stop(A,B,C,D,E,F,O,H,I,J,K,L,M,N,O,P) [L >= 2*O && 0 >= O && 1 + 2*O >= L && M = N && A = B && C = D && E = F && G = H && I = J && K = L] lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,0,F,O,H,0,J,K,L,M,N,O,P) [L >= 2*O && O >= 1 && 1 + 2*O >= L && M = N && A = B && C = D && E = F && G = H && I = J && K = L] start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> start(B,B,D,D,F,F,H,H,J,J,L,L,N,N,P,P) True Signature: {(lbl101,16);(lbl121,16);(lbl123,16);(lbl21,16);(lbl53,16);(lbl71,16);(start,16);(start0,16);(stop,16)} Rule Graph: [0->{11,12},1->{2,4},2->{},4->{8},5->{5,6},6->{9,10},7->{5,6},8->{9,10},9->{1},10->{7,8},11->{},12->{8} ,13->{0}] + Applied Processor: Decompose NoGreedy + Details: We construct a looptree: P: [0,1,2,4,5,6,7,8,9,10,11,12,13] | `- p:[8,4,1,9,6,5,7,10] c: [1,4,9] | `- p:[5,7,10,6,8] c: [6,7,8,10] | `- p:[5] c: [5] * Step 5: CloseWith YES + Considered Problem: (Rules: start(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q,P) [A = B && C = D && E = F && G = H && I = J && K = L && M = N && O = P] lbl121(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl123(A,B,C,D,E,F,A,H,I,J,K,L,M,N,O,P) [G >= 2*A && 1 + 2*A >= G && 1 + 2*O >= L && O >= G && E >= 0 && G >= 1 && L >= 1 + E && K = L && I = L && 1 + M = L] lbl123(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> stop(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) [E >= 0 && 1 + 2*O >= L && O >= 1 && L >= 1 + E && O >= 0 && G = 0 && K = L && I = L && 1 + M = L && A = 0] lbl123(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,0,F,G,H,0,J,K,L,M,N,O,P) [L >= 1 && A >= 1 && A >= 0 && E >= 0 && 1 + 2*O >= L && O >= 1 && L >= 1 + E && O >= 2*A && K = L && I = L && 1 + M = L && G = A] lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl101(A,B,C,D,E + -1*G,F,G,H,I,J,K,L,M,N,O,P) [E >= G && I >= E + G && O >= G && L >= 1 + I && G >= 1 && 1 + 2*O >= L && E >= 0 && K = L] lbl101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl53(A,B,C,D,E,F,G,H,1 + I,J,K,L,I,N,O,P) [I >= E + G && O >= G && L >= 1 + I && G >= 1 && 1 + 2*O >= L && E >= 0 && K = L] lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl101(A,B,C,D,E + -1*G,F,G,H,I,J,K,L,M,N,O,P) [E >= G && 1 + 2*O >= L && O >= G && G >= 1 && E >= 0 && L >= 1 + E && I = E && K = L] lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl53(A,B,C,D,E,F,G,H,1 + I,J,K,L,I,N,O,P) [1 + 2*O >= L && O >= G && G >= 1 && E >= 0 && L >= 1 + E && I = E && K = L] lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl121(Q,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) [L >= 1 + E && G >= 1 && E >= 0 && O >= G && 1 + 2*O >= L && I = L && K = L && 1 + M = L] lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,I,F,G,H,I,J,K,L,M,N,O,P) [L >= 2 + M && L >= 1 + M && M >= E && G >= 1 && E >= 0 && O >= G && 1 + 2*O >= L && I = 1 + M && K = L] lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> stop(A,B,C,D,E,F,O,H,I,J,K,L,M,N,O,P) [L >= 2*O && 0 >= O && 1 + 2*O >= L && M = N && A = B && C = D && E = F && G = H && I = J && K = L] lbl21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> lbl71(A,B,Q,D,0,F,O,H,0,J,K,L,M,N,O,P) [L >= 2*O && O >= 1 && 1 + 2*O >= L && M = N && A = B && C = D && E = F && G = H && I = J && K = L] start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) -> start(B,B,D,D,F,F,H,H,J,J,L,L,N,N,P,P) True Signature: {(lbl101,16);(lbl121,16);(lbl123,16);(lbl21,16);(lbl53,16);(lbl71,16);(start,16);(start0,16);(stop,16)} Rule Graph: [0->{11,12},1->{2,4},2->{},4->{8},5->{5,6},6->{9,10},7->{5,6},8->{9,10},9->{1},10->{7,8},11->{},12->{8} ,13->{0}] ,We construct a looptree: P: [0,1,2,4,5,6,7,8,9,10,11,12,13] | `- p:[8,4,1,9,6,5,7,10] c: [1,4,9] | `- p:[5,7,10,6,8] c: [6,7,8,10] | `- p:[5] c: [5]) + Applied Processor: CloseWith True + Details: () YES