| Name | CrosswordDesign/ CrosswordDesign-07-4-rom_c18.xml |
| MD5SUM | b03b025d4dc3e1307d2e111dd352b63c |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 55 |
| Best CPU time to get the best result obtained on this benchmark | 2520.01 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 217 |
| Number of constraints | 56 |
| Number of domains | 5 |
| Minimum domain size | 2 |
| Maximum domain size | 41345 |
| Distribution of domain sizes | [{"size":2,"count":14},{"size":8,"count":98},{"size":27,"count":49},{"size":41345,"count":56}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":1,"count":70},{"degree":2,"count":98},{"degree":8,"count":49}] |
| Minimum constraint arity | 10 |
| Maximum constraint arity | 11 |
| Distribution of constraint arities | [{"arity":10,"count":14},{"arity":11,"count":42}] |
| Number of extensional constraints | 56 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":56}] |
| Optimization problem | YES |
| Type of objective | max SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 60<instantiation cost="60"> <list> 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] r[5][0] r[5][1] r[5][2] r[5][3] r[6][0] r[6][1] r[6][2] r[6][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] c[5][0] c[5][1] c[5][2] c[5][3] c[6][0] c[6][1] c[6][2] c[6][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] pr[5][0] pr[5][1] pr[5][2] pr[5][3] pr[6][0] pr[6][1] pr[6][2] pr[6][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] pc[5][0] pc[5][1] pc[5][2] pc[5][3] pc[6][0] pc[6][1] pc[6][2] pc[6][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] br[5][0] br[5][1] br[5][2] br[5][3] br[6][0] br[6][1] br[6][2] br[6][3] 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] bc[5][0] bc[5][1] bc[5][2] bc[5][3] bc[6][0] bc[6][1] bc[6][2] bc[6][3] x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] </list> <values> 38715 -1 -1 -1 30431 17259 26038 -1 11562 5221 -1 -1 7460 24586 38998 -1 16583 -1 -1 -1 11562 19234 25247 -1 27345 -1 -1 -1 38715 -1 -1 -1 30431 17259 26038 -1 11562 5221 -1 -1 7460 24586 38998 -1 16583 -1 -1 -1 11562 19234 25247 -1 27345 -1 -1 -1 0 -1 -1 -1 0 3 6 -1 0 2 -1 -1 0 4 6 -1 0 -1 -1 -1 0 2 4 -1 1 -1 -1 -1 0 -1 -1 -1 0 3 6 -1 0 2 -1 -1 0 4 6 -1 0 -1 -1 -1 0 2 4 -1 1 -1 -1 -1 6 0 0 0 0 0 0 0 0 5 0 0 3 0 0 0 7 0 0 0 0 0 3 0 6 0 0 0 6 0 0 0 0 0 0 0 0 5 0 0 3 0 0 0 7 0 0 0 0 0 3 0 6 0 0 0 20 17 4 2 7 4 26 17 2 26 8 4 26 15 4 26 1 20 17 10 4 2 8 20 26 14 26 21 7 4 17 14 3 14 19 4 26 10 26 14 12 14 26 15 4 21 19 14 21 </values> </instantiation>