| Name | CrosswordDesign/ CrosswordDesign-04-4-rom_c18.xml |
| MD5SUM | d6990cbd029e878cdbe38f84d450c608 |
| 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.39825 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 112 |
| Number of constraints | 32 |
| Number of domains | 5 |
| Minimum domain size | 2 |
| Maximum domain size | 3835 |
| Distribution of domain sizes | [{"size":2,"count":8},{"size":5,"count":56},{"size":27,"count":16},{"size":3835,"count":32}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":1,"count":40},{"degree":2,"count":56},{"degree":8,"count":16}] |
| Minimum constraint arity | 7 |
| Maximum constraint arity | 8 |
| Distribution of constraint arities | [{"arity":7,"count":8},{"arity":8,"count":24}] |
| Number of extensional constraints | 32 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":32}] |
| Optimization problem | YES |
| Type of objective | max SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4299181 | OPT | 24 | 0.39825 | 0.399473 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299185 | OPT | 24 | 4.38845 | 2.76709 |
| GG's minicp 2018-04-29 (complete) | 4299182 | OPT | 24 | 6.1131 | 2.35363 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299186 | SAT | 24 | 303.243 | 300.573 |
| The dodo solver 2018-04-29 (complete) | 4299187 | SAT (TO) | 24 | 2520.04 | 2516.22 |
| slowpoke 2018-04-29 (incomplete) | 4299184 | SAT (TO) | 24 | 2520.06 | 2516.13 |
| MiniCPFever 2018-04-29 (complete) | 4299183 | SAT (TO) | 22 | 2520.12 | 2487.22 |
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='solution' cost='24'> <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] 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] 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] 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] 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] 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] x[0][0] x[0][1] x[0][2] x[0][3] x[1][0] x[1][1] x[1][2] x[1][3] x[2][0] x[2][1] x[2][2] x[2][3] x[3][0] x[3][1] x[3][2] x[3][3] </list> <values>4 0 0 0 0 0 0 0 4 0 0 0 4 0 0 0 4 0 0 0 0 0 0 0 4 0 0 0 4 0 0 0 605 -1 -1 -1 1512 -1 -1 -1 196 -1 -1 -1 832 -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 0 -1 -1 -1 0 -1 -1 -1 605 -1 -1 -1 1512 -1 -1 -1 196 -1 -1 -1 832 -1 -1 -1 2 8 0 3 8 4 18 8 0 18 8 0 3 8 0 18 </values> </instantiation>