| Name | SumColoring/ SumColoring-1-fullins-3_c18.xml |
| MD5SUM | 7c95366121fdff59751822ead1677482 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 24 |
| Best CPU time to get the best result obtained on this benchmark | 0.517133 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 100 |
| Number of domains | 1 |
| Minimum domain size | 30 |
| Maximum domain size | 30 |
| Distribution of domain sizes | [{"size":30,"count":30}] |
| Minimum variable degree | 5 |
| Maximum variable degree | 12 |
| Distribution of variable degrees | [{"degree":5,"count":4},{"degree":6,"count":6},{"degree":7,"count":7},{"degree":8,"count":4},{"degree":9,"count":3},{"degree":10,"count":3},{"degree":12,"count":3}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":100}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 100 |
| Distribution of constraint types | [{"type":"intension","count":100}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 24<instantiation type="optimum" cost="24"> <list> c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[20] c[21] c[22] c[23] c[24] c[25] c[26] c[27] c[28] c[29] </list> <values> 2 0 2 3 0 0 2 0 3 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 1 0 2 </values> </instantiation>