| Name | CrosswordDesign/ CrosswordDesign-08-4-rom_c18.xml |
| MD5SUM | d2036c1580b702d26a2ba71e1295e02d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 56 |
| Best CPU time to get the best result obtained on this benchmark | 252.402 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 256 |
| Number of constraints | 64 |
| Number of domains | 5 |
| Minimum domain size | 2 |
| Maximum domain size | 62899 |
| Distribution of domain sizes | [{"size":2,"count":16},{"size":9,"count":112},{"size":27,"count":64},{"size":62899,"count":64}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":1,"count":80},{"degree":2,"count":112},{"degree":8,"count":64}] |
| Minimum constraint arity | 11 |
| Maximum constraint arity | 12 |
| Distribution of constraint arities | [{"arity":11,"count":16},{"arity":12,"count":48}] |
| Number of extensional constraints | 64 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":64}] |
| Optimization problem | YES |
| Type of objective | max SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Concrete 3.9.2-SuperNG (complete) | 4302650 | SAT (TO) | 56 | 252.402 | 229.619 |
| Concrete 3.9.2 (complete) | 4302300 | SAT (TO) | 47 | 252.303 | 229.321 |
| cosoco 1.12 (complete) | 4301701 | SAT (TO) | 4 | 252.032 | 252.014 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312136 | ? | 64.425 | 21.6882 | |
| OscaR - Hybrid 2018-08-14 (complete) | 4310276 | ? | 66.0341 | 22.1501 | |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309926 | ? | 70.6921 | 23.5583 | |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301699 | ? | 225.113 | 186.401 | |
| Mistral-2.0 2018-08-01 (complete) | 4312599 | ? (NS) | 16.3493 | 16.3738 | |
| Sat4j-CSP 2018-07-11 (complete) | 4301700 | ? (TO) | 252.298 | 227.147 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 56<instantiation cost="56"> <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] r[7][0] r[7][1] r[7][2] r[7][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] c[7][0] c[7][1] c[7][2] c[7][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] pr[7][0] pr[7][1] pr[7][2] pr[7][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] pc[7][0] pc[7][1] pc[7][2] pc[7][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] br[7][0] br[7][1] br[7][2] br[7][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] bc[7][0] bc[7][1] bc[7][2] bc[7][3] x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] </list> <values> 45828 -1 -1 -1 0 17785 54929 -1 12830 30290 -1 -1 37606 29639 -1 -1 61046 3 -1 -1 25723 23351 -1 -1 58555 37085 29482 -1 3590 -1 -1 -1 45828 -1 -1 -1 0 37640 62770 -1 10083 62394 48619 -1 38016 30279 -1 -1 60224 18415 -1 -1 26147 25723 -1 -1 54929 37103 -1 -1 3982 35730 59527 -1 0 -1 -1 -1 0 2 7 -1 0 4 -1 -1 0 3 -1 -1 0 5 -1 -1 0 2 -1 -1 0 3 6 -1 0 -1 -1 -1 0 -1 -1 -1 0 2 6 -1 0 4 7 -1 0 3 -1 -1 0 5 -1 -1 0 7 -1 -1 0 2 -1 -1 0 5 7 -1 8 0 0 0 0 4 0 0 0 4 0 0 0 5 0 0 4 0 0 0 0 6 0 0 0 0 0 0 8 0 0 0 8 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 6 0 0 0 0 0 0 17 0 2 14 21 8 19 0 0 26 4 3 4 11 26 19 2 14 17 26 11 4 13 0 14 1 26 11 0 6 14 18 21 8 25 4 26 0 1 26 8 26 6 12 4 11 8 13 19 25 26 13 14 26 11 26 0 17 18 4 13 8 4 21 </values> </instantiation>