| Name | QuadraticAssignment/QuadraticAssignment-m1-s1/ QuadraticAssignment-esc16d.xml |
| MD5SUM | 797dd3ed6ca3fcac5df6221abf320949 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 8 |
| Best CPU time to get the best result obtained on this benchmark | 23.7815 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 272 |
| Number of constraints | 22 |
| Number of domains | 2 |
| Minimum domain size | 4 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":4,"count":21},{"size":16,"count":16}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 7 |
| Distribution of variable degrees | [{"degree":0,"count":235},{"degree":1,"count":2},{"degree":2,"count":22},{"degree":3,"count":6},{"degree":4,"count":2},{"degree":5,"count":3},{"degree":6,"count":1},{"degree":7,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":3,"count":21},{"arity":16,"count":1}] |
| Number of extensional constraints | 21 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":21},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| (reference) PicatSAT 2019-09-12 (complete) | 4407581 | OPT | 8 | 23.7815 | 23.7839 |
| cosoco 2.0 (complete) | 4408705 | OPT | 8 | 143.08 | 143.077 |
| cosoco 2 (complete) | 4394697 | OPT | 8 | 143.145 | 143.14 |
| cosoco 2.0 (complete) | 4397445 | OPT | 8 | 164.121 | 164.107 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 8<instantiation> <list> d[][] x[] </list> <values> 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 2 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 1 0 0 1 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 1 0 1 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 1 2 14 9 11 6 0 3 8 7 5 12 15 13 10 4 </values> </instantiation>