| Name | CrosswordDesign/ CrosswordDesign-05-4-rom_c18.xml |
| MD5SUM | 1b32d92326af8dd624b5ed4fc8860100 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 38 |
| Best CPU time to get the best result obtained on this benchmark | 24.0774 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 145 |
| Number of constraints | 40 |
| Number of domains | 5 |
| Minimum domain size | 2 |
| Maximum domain size | 10397 |
| Distribution of domain sizes | [{"size":2,"count":10},{"size":6,"count":70},{"size":27,"count":25},{"size":10397,"count":40}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":1,"count":50},{"degree":2,"count":70},{"degree":8,"count":25}] |
| Minimum constraint arity | 8 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":8,"count":10},{"arity":9,"count":30}] |
| Number of extensional constraints | 40 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":40}] |
| Optimization problem | YES |
| Type of objective | max SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4299223 | OPT | 38 | 24.0774 | 24.0777 |
| GG's minicp 2018-04-29 (complete) | 4299224 | OPT | 38 | 103.596 | 58.5317 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299227 | OPT | 38 | 255.716 | 249.627 |
| slowpoke 2018-04-29 (incomplete) | 4299226 | SAT (TO) | 38 | 2520.08 | 2514.13 |
| MiniCPFever 2018-04-29 (complete) | 4299225 | SAT (TO) | 25 | 2520.05 | 2500.33 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299228 | SAT | 19 | 303.972 | 300.861 |
| The dodo solver 2018-04-29 (complete) | 4299229 | SAT (TO) | 19 | 2520.09 | 2515.32 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 38<instantiation type='solution' cost='38'> <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] bc[3][0] bc[3][1] bc[3][2] bc[3][3] bc[4][0] bc[4][1] bc[4][2] bc[4][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] br[3][0] br[3][1] br[3][2] br[3][3] br[4][0] br[4][1] br[4][2] br[4][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] c[3][0] c[3][1] c[3][2] c[3][3] c[4][0] c[4][1] c[4][2] c[4][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] pc[3][0] pc[3][1] pc[3][2] pc[3][3] pc[4][0] pc[4][1] pc[4][2] pc[4][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] pr[3][0] pr[3][1] pr[3][2] pr[3][3] pr[4][0] pr[4][1] pr[4][2] pr[4][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] r[3][0] r[3][1] r[3][2] r[3][3] r[4][0] r[4][1] r[4][2] r[4][3] x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] </list> <values>4 0 0 0 3 0 0 0 5 0 0 0 0 3 0 0 4 0 0 0 4 0 0 0 3 0 0 0 5 0 0 0 0 3 0 0 4 0 0 0 8452 -1 -1 -1 6146 7744 -1 -1 9110 -1 -1 -1 6114 4194 -1 -1 8452 -1 -1 -1 0 -1 -1 -1 0 4 -1 -1 0 -1 -1 -1 0 2 -1 -1 1 -1 -1 -1 0 -1 -1 -1 0 4 -1 -1 0 -1 -1 -1 0 2 -1 -1 1 -1 -1 -1 8452 -1 -1 -1 6146 7744 -1 -1 9110 -1 -1 -1 6114 4194 -1 -1 8452 -1 -1 -1 18 14 19 14 26 14 1 8 26 18 19 8 11 7 14 14 26 7 20 19 26 18 14 19 14 </values> </instantiation>