| Name | Tal/ Tal-05_c18.xml |
| MD5SUM | 0bfba4554f8c52d47ef9f831901bb64c |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 16 |
| Best CPU time to get the best result obtained on this benchmark | 25.4336 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 526 |
| Number of constraints | 364 |
| Number of domains | 11 |
| Minimum domain size | 1 |
| Maximum domain size | 42 |
| Distribution of domain sizes | [{"size":1,"count":84},{"size":2,"count":4},{"size":3,"count":5},{"size":4,"count":6},{"size":5,"count":7},{"size":6,"count":52},{"size":7,"count":9},{"size":8,"count":10},{"size":10,"count":36},{"size":42,"count":79}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":0,"count":234},{"degree":1,"count":84},{"degree":2,"count":58},{"degree":3,"count":9},{"degree":4,"count":10},{"degree":5,"count":32},{"degree":6,"count":19},{"degree":7,"count":13},{"degree":8,"count":13},{"degree":9,"count":19},{"degree":10,"count":18},{"degree":11,"count":8},{"degree":12,"count":5},{"degree":13,"count":3},{"degree":14,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 11 |
| Distribution of constraint arities | [{"arity":1,"count":109},{"arity":2,"count":115},{"arity":3,"count":38},{"arity":4,"count":11},{"arity":5,"count":18},{"arity":6,"count":17},{"arity":7,"count":16},{"arity":8,"count":15},{"arity":9,"count":13},{"arity":10,"count":10},{"arity":11,"count":2}] |
| Number of extensional constraints | 64 |
| Number of intensional constraints | 286 |
| Distribution of constraint types | [{"type":"extension","count":64},{"type":"intension","count":286},{"type":"count","count":14}] |
| 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: 16<instantiation id='sol12' type='solution' cost='16'> <list> c[][] l[][] a[][] i[][] cnt[] </list> <values> 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 27 35 38 22 15 13 26 28 27 10 0 22 15 13 4 28 27 10 22 15 13 4 28 0 4 10 4 0 0 5 0 * 4 10 4 5 0 0 0 * 6 0 0 0 0 0 * * 6 0 0 0 0 0 * * 6 0 0 0 0 * * * 6 0 0 0 0 * * * 6 0 0 0 * * * * 6 0 0 0 * * * * 6 0 0 * * * * * 6 0 0 * * * * * 6 0 * * * * * * 6 0 * * * * * * 6 * * * * * * * * * * * * * * * 1 2 0 1 1 1 1 1 * * * * * * * * 1 1 3 0 0 2 0 * * * * * * * * * 4 0 0 0 0 0 * * * * * * * * * * 1 0 0 0 0 * * * * * * * * * * * 1 0 0 0 * * * * * * * * * * * * 1 0 0 * * * * * * * * * * * * * 1 0 * * * * * * * * * * * * * * 1 * * * * * * * * * * * * * * * * * * * * * * * 0 1 3 4 5 6 7 7 * * * * * * * * 0 1 2 5 6 6 6 * * * * * * * * * 0 5 5 5 5 5 * * * * * * * * * * 0 4 4 4 4 * * * * * * * * * * * 0 3 3 3 * * * * * * * * * * * * 0 2 2 * * * * * * * * * * * * * 0 1 * * * * * * * * * * * * * * 1 1 3 3 5 5 4 4 3 3 2 2 1 1 </values> </instantiation>