| Name | CrosswordDesign/ CrosswordDesign-03-4-rom_c18.xml |
| MD5SUM | 72d3aa8b8ce65786440ef6159c4b95ee |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 12 |
| Best CPU time to get the best result obtained on this benchmark | 0.052776 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 81 |
| Number of constraints | 24 |
| Number of domains | 5 |
| Minimum domain size | 2 |
| Maximum domain size | 1359 |
| Distribution of domain sizes | [{"size":2,"count":6},{"size":4,"count":42},{"size":27,"count":9},{"size":1359,"count":24}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":1,"count":30},{"degree":2,"count":42},{"degree":8,"count":9}] |
| Minimum constraint arity | 6 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":6,"count":6},{"arity":7,"count":18}] |
| Number of extensional constraints | 24 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":24}] |
| Optimization problem | YES |
| Type of objective | max SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4299209 | OPT | 12 | 0.052776 | 0.054384 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299213 | OPT | 12 | 1.61972 | 0.693776 |
| GG's minicp 2018-04-29 (complete) | 4299210 | OPT | 12 | 1.65934 | 0.642113 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299214 | SAT | 12 | 302.584 | 300.448 |
| MiniCPFever 2018-04-29 (complete) | 4299211 | SAT (TO) | 12 | 2520.04 | 2479.72 |
| The dodo solver 2018-04-29 (complete) | 4299215 | SAT (TO) | 12 | 2520.05 | 2517.13 |
| slowpoke 2018-04-29 (incomplete) | 4299212 | SAT (TO) | 12 | 2520.11 | 2516.82 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 12<instantiation type='solution' cost='12'> <list>bc[0][0] bc[0][1] bc[0][2] bc[0][3] bc[1][0] bc[1][1] bc[1][2] bc[1][3] bc[2][0] bc[2][1] bc[2][2] bc[2][3] br[0][0] br[0][1] br[0][2] br[0][3] br[1][0] br[1][1] br[1][2] br[1][3] br[2][0] br[2][1] br[2][2] br[2][3] c[0][0] c[0][1] c[0][2] c[0][3] c[1][0] c[1][1] c[1][2] c[1][3] c[2][0] c[2][1] c[2][2] c[2][3] pc[0][0] pc[0][1] pc[0][2] pc[0][3] pc[1][0] pc[1][1] pc[1][2] pc[1][3] pc[2][0] pc[2][1] pc[2][2] pc[2][3] pr[0][0] pr[0][1] pr[0][2] pr[0][3] pr[1][0] pr[1][1] pr[1][2] pr[1][3] pr[2][0] pr[2][1] pr[2][2] pr[2][3] r[0][0] r[0][1] r[0][2] r[0][3] r[1][0] r[1][1] r[1][2] r[1][3] r[2][0] r[2][1] r[2][2] r[2][3] x[0][0] x[0][1] x[0][2] x[1][0] x[1][1] x[1][2] x[2][0] x[2][1] x[2][2] </list> <values>3 0 0 0 0 0 0 0 3 0 0 0 3 0 0 0 0 0 0 0 3 0 0 0 454 -1 -1 -1 1151 -1 -1 -1 177 -1 -1 -1 0 -1 -1 -1 0 -1 -1 -1 0 -1 -1 -1 0 -1 -1 -1 0 -1 -1 -1 0 -1 -1 -1 454 -1 -1 -1 1151 -1 -1 -1 177 -1 -1 -1 7 20 2 20 13 8 2 8 20 </values> </instantiation>