| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-zeroin-i-1.xml |
| MD5SUM | bac8a2bd88d13c89c2cced4f7584e960 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 48 |
| Best CPU time to get the best result obtained on this benchmark | 18.8373 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 211 |
| Number of constraints | 4100 |
| Number of domains | 1 |
| Minimum domain size | 211 |
| Maximum domain size | 211 |
| Distribution of domain sizes | [{"size":211,"count":211}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 112 |
| Distribution of variable degrees | [{"degree":1,"count":85},{"degree":29,"count":1},{"degree":30,"count":1},{"degree":31,"count":1},{"degree":32,"count":1},{"degree":33,"count":3},{"degree":34,"count":1},{"degree":35,"count":1},{"degree":36,"count":1},{"degree":37,"count":1},{"degree":38,"count":7},{"degree":39,"count":1},{"degree":40,"count":1},{"degree":41,"count":1},{"degree":42,"count":4},{"degree":43,"count":3},{"degree":44,"count":2},{"degree":45,"count":11},{"degree":47,"count":6},{"degree":48,"count":7},{"degree":49,"count":5},{"degree":50,"count":3},{"degree":51,"count":2},{"degree":52,"count":1},{"degree":53,"count":1},"...",{"degree":68,"count":1}, {"degree":72,"count":1}, {"degree":75,"count":1}, {"degree":85,"count":1}, {"degree":87,"count":1}, {"degree":89,"count":1}, {"degree":90,"count":1}, {"degree":92,"count":1}, {"degree":95,"count":1}, {"degree":97,"count":2}, {"degree":98,"count":1}, {"degree":99,"count":1}, {"degree":100,"count":1}, {"degree":101,"count":5}, {"degree":102,"count":2}, {"degree":103,"count":1}, {"degree":104,"count":6}, {"degree":105,"count":1}, {"degree":106,"count":1}, {"degree":107,"count":1}, {"degree":108,"count":2}, {"degree":109,"count":1}, {"degree":110,"count":11}, {"degree":111,"count":1}, {"degree":112,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":4100}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 4100 |
| Distribution of constraint types | [{"type":"intension","count":4100}] |
| 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: 48<instantiation cost = '48'> <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] </list> <values> 32 24 26 34 33 25 20 16 15 14 29 23 31 30 27 28 14 19 21 28 13 27 22 18 17 26 15 16 23 25 24 20 43 0 0 17 0 0 0 0 19 0 21 0 35 0 18 42 0 0 36 0 0 18 0 45 42 0 37 38 37 38 0 1 2 3 11 5 7 9 0 1 2 3 4 5 6 7 8 8 13 0 10 12 0 6 12 10 0 11 0 9 0 0 17 0 17 0 0 0 0 0 4 0 0 22 0 0 0 0 0 0 38 37 0 0 0 0 0 0 37 0 0 41 0 39 0 0 39 0 0 40 0 37 37 0 0 0 0 39 48 44 0 0 36 36 0 0 38 0 0 0 0 0 0 0 0 0 44 45 44 44 45 42 0 43 0 0 0 0 0 43 0 45 44 44 46 48 44 44 35 35 35 35 0 0 0 0 0 45 43 0 46 0 42 0 47 47 48 47 46 45 45 0 0 43 43 42 0 0 37 </values> </instantiation>