| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-school1.xml |
| MD5SUM | 9dec5151d217f705456bb861c341cf0d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 13 |
| Best CPU time to get the best result obtained on this benchmark | 79.6827 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 385 |
| Number of constraints | 19095 |
| Number of domains | 1 |
| Minimum domain size | 385 |
| Maximum domain size | 385 |
| Distribution of domain sizes | [{"size":385,"count":385}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 283 |
| Distribution of variable degrees | [{"degree":2,"count":8},{"degree":3,"count":2},{"degree":4,"count":3},{"degree":5,"count":2},{"degree":6,"count":1},{"degree":8,"count":1},{"degree":9,"count":4},{"degree":10,"count":1},{"degree":12,"count":1},{"degree":13,"count":4},{"degree":14,"count":1},{"degree":15,"count":1},{"degree":16,"count":1},{"degree":19,"count":1},{"degree":20,"count":2},{"degree":22,"count":1},{"degree":24,"count":3},{"degree":25,"count":5},{"degree":26,"count":2},{"degree":27,"count":1},{"degree":29,"count":2},{"degree":32,"count":1},{"degree":33,"count":2},{"degree":35,"count":2},{"degree":39,"count":1},"...",{"degree":150,"count":2}, {"degree":154,"count":3}, {"degree":155,"count":1}, {"degree":156,"count":2}, {"degree":160,"count":2}, {"degree":161,"count":3}, {"degree":163,"count":1}, {"degree":164,"count":1}, {"degree":167,"count":1}, {"degree":168,"count":1}, {"degree":172,"count":1}, {"degree":175,"count":1}, {"degree":177,"count":1}, {"degree":230,"count":2}, {"degree":246,"count":1}, {"degree":247,"count":1}, {"degree":252,"count":1}, {"degree":257,"count":1}, {"degree":260,"count":1}, {"degree":263,"count":1}, {"degree":265,"count":1}, {"degree":269,"count":2}, {"degree":271,"count":1}, {"degree":273,"count":1}, {"degree":283,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":19095}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 19095 |
| Distribution of constraint types | [{"type":"intension","count":19095}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 13<instantiation cost = '13'> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89] x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] x[100] x[101] x[102] x[103] x[104] x[105] x[106] x[107] x[108] x[109] x[110] x[111] x[112] x[113] x[114] x[115] x[116] x[117] x[118] x[119] x[120] x[121] x[122] x[123] x[124] x[125] x[126] x[127] x[128] x[129] x[130] x[131] x[132] x[133] x[134] x[135] x[136] x[137] x[138] x[139] x[140] x[141] x[142] x[143] x[144] x[145] x[146] x[147] x[148] x[149] x[150] x[151] x[152] x[153] x[154] x[155] x[156] x[157] x[158] x[159] x[160] x[161] x[162] x[163] x[164] x[165] x[166] x[167] x[168] x[169] x[170] x[171] x[172] x[173] x[174] x[175] x[176] x[177] x[178] x[179] x[180] x[181] x[182] x[183] x[184] x[185] x[186] x[187] x[188] x[189] x[190] x[191] x[192] x[193] x[194] x[195] x[196] x[197] x[198] x[199] x[200] x[201] x[202] x[203] x[204] x[205] x[206] x[207] x[208] x[209] x[210] x[211] x[212] x[213] x[214] x[215] x[216] x[217] x[218] x[219] x[220] x[221] x[222] x[223] x[224] x[225] x[226] x[227] x[228] x[229] x[230] x[231] x[232] x[233] x[234] x[235] x[236] x[237] x[238] x[239] x[240] x[241] x[242] x[243] x[244] x[245] x[246] x[247] x[248] x[249] x[250] x[251] x[252] x[253] x[254] x[255] x[256] x[257] x[258] x[259] x[260] x[261] x[262] x[263] x[264] x[265] x[266] x[267] x[268] x[269] x[270] x[271] x[272] x[273] x[274] x[275] x[276] x[277] x[278] x[279] x[280] x[281] x[282] x[283] x[284] x[285] x[286] x[287] x[288] x[289] x[290] x[291] x[292] x[293] x[294] x[295] x[296] x[297] x[298] x[299] x[300] x[301] x[302] x[303] x[304] x[305] x[306] x[307] x[308] x[309] x[310] x[311] x[312] x[313] x[314] x[315] x[316] x[317] x[318] x[319] x[320] x[321] x[322] x[323] x[324] x[325] x[326] x[327] x[328] x[329] x[330] x[331] x[332] x[333] x[334] x[335] x[336] x[337] x[338] x[339] x[340] x[341] x[342] x[343] x[344] x[345] x[346] x[347] x[348] x[349] x[350] x[351] x[352] x[353] x[354] x[355] x[356] x[357] x[358] x[359] x[360] x[361] x[362] x[363] x[364] x[365] x[366] x[367] x[368] x[369] x[370] x[371] x[372] x[373] x[374] x[375] x[376] x[377] x[378] x[379] x[380] x[381] x[382] x[383] x[384] </list> <values> 11 0 9 6 3 0 10 11 7 2 1 13 12 4 11 5 7 9 2 5 7 12 10 6 3 11 12 9 4 11 7 5 10 13 9 2 6 5 7 2 3 1 13 3 3 10 4 11 3 9 4 11 5 7 1 8 11 2 1 12 6 5 7 10 8 0 13 4 11 13 4 10 8 0 2 1 12 6 5 2 1 12 6 5 2 10 13 4 10 8 0 13 4 10 8 0 6 5 8 7 2 1 12 1 11 3 9 1 12 8 0 10 2 6 13 6 13 6 13 9 2 1 6 0 8 13 11 3 7 5 4 5 4 5 4 0 1 0 4 4 7 4 3 10 8 9 2 7 1 13 5 0 1 5 7 7 13 4 11 8 3 0 1 12 13 2 9 11 6 5 7 4 11 3 10 5 9 10 8 6 1 13 0 8 2 12 4 1 4 13 10 7 2 1 0 9 11 9 9 3 10 3 5 2 1 10 8 4 11 3 10 1 12 11 8 5 6 1 12 6 0 13 4 6 5 12 8 2 11 0 2 10 12 0 11 0 11 7 11 7 0 1 7 9 2 12 13 4 11 0 6 5 7 3 8 9 1 12 3 8 0 4 11 5 7 9 13 12 4 11 13 3 8 0 6 5 6 3 8 0 6 5 7 1 0 9 1 12 13 4 2 4 5 9 12 1 11 3 8 6 7 9 2 11 0 7 12 4 4 3 10 8 1 0 0 1 8 13 11 3 10 1 9 2 6 0 9 6 0 13 9 3 10 8 3 10 8 5 9 6 2 1 12 2 1 12 9 2 1 3 0 10 2 1 12 13 4 10 8 0 6 5 7 9 2 1 13 4 11 3 10 8 6 5 7 12 12 11 2 13 4 12 1 0 0 </values> </instantiation>