| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-david.xml |
| MD5SUM | 8881d200d983e9a0f6a660f33978a65e |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 10 |
| Best CPU time to get the best result obtained on this benchmark | 8.31459 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 87 |
| Number of constraints | 406 |
| Number of domains | 1 |
| Minimum domain size | 87 |
| Maximum domain size | 87 |
| Distribution of domain sizes | [{"size":87,"count":87}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 83 |
| Distribution of variable degrees | [{"degree":2,"count":10},{"degree":3,"count":5},{"degree":4,"count":7},{"degree":5,"count":5},{"degree":6,"count":6},{"degree":7,"count":10},{"degree":8,"count":4},{"degree":9,"count":5},{"degree":10,"count":9},{"degree":11,"count":1},{"degree":12,"count":4},{"degree":13,"count":2},{"degree":15,"count":3},{"degree":16,"count":2},{"degree":17,"count":4},{"degree":18,"count":2},{"degree":19,"count":1},{"degree":20,"count":1},{"degree":22,"count":1},{"degree":29,"count":1},{"degree":31,"count":1},{"degree":32,"count":1},{"degree":36,"count":1},{"degree":83,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":406}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 406 |
| Distribution of constraint types | [{"type":"intension","count":406}] |
| 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: 10<instantiation cost = '10'> <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] </list> <values> 2 2 2 6 1 1 7 10 2 1 4 2 3 9 3 5 2 1 1 1 5 1 4 2 1 1 4 1 7 2 2 10 6 3 6 1 7 1 1 1 1 3 6 1 6 8 2 10 2 3 10 4 7 3 9 1 3 4 9 2 1 1 2 1 1 4 1 3 6 1 5 3 9 7 1 7 10 2 3 3 8 1 0 10 0 1 5 </values> </instantiation>