Name | CrosswordDesign/ CrosswordDesign-06-4-rom_c18.xml |
MD5SUM | 68fe1d73007454e14d4d429fadb25a11 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 52 |
Best CPU time to get the best result obtained on this benchmark | 252.043 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 180 |
Number of constraints | 48 |
Number of domains | 5 |
Minimum domain size | 2 |
Maximum domain size | 22859 |
Distribution of domain sizes | [{"size":2,"count":12},{"size":7,"count":84},{"size":27,"count":36},{"size":22859,"count":48}] |
Minimum variable degree | 1 |
Maximum variable degree | 8 |
Distribution of variable degrees | [{"degree":1,"count":60},{"degree":2,"count":84},{"degree":8,"count":36}] |
Minimum constraint arity | 9 |
Maximum constraint arity | 10 |
Distribution of constraint arities | [{"arity":9,"count":12},{"arity":10,"count":36}] |
Number of extensional constraints | 48 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":48}] |
Optimization problem | YES |
Type of objective | max SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301729 | SAT (TO) | 52 | 252.043 | 240.229 |
cosoco 1.12 (complete) | 4301731 | SAT (TO) | 46 | 252.006 | 252.011 |
Concrete 3.9.2 (complete) | 4302298 | SAT (TO) | 44 | 252.129 | 238.763 |
Concrete 3.9.2-SuperNG (complete) | 4302648 | SAT (TO) | 44 | 252.132 | 237.96 |
OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312134 | SAT (TO) | 42 | 252.055 | 239.549 |
OscaR - Hybrid 2018-08-14 (complete) | 4310274 | SAT (TO) | 41 | 252.134 | 234.361 |
OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309924 | SAT (TO) | 40 | 252.051 | 239.146 |
Mistral-2.0 2018-08-01 (complete) | 4312609 | ? (MO) | 28.272 | 28.2841 | |
Sat4j-CSP 2018-07-11 (complete) | 4301730 | ? (TO) | 260.179 | 228.946 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 52<instantiation> <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] 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] 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] 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] 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] 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] x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] </list> <values>1715 -1 -1 -1 955 12834 -1 -1 11419 13405 -1 -1 2182 -1 -1 -1 13474 21011 -1 -1 861 -1 -1 -1 1715 -1 -1 -1 955 12834 -1 -1 11419 13405 -1 -1 2182 -1 -1 -1 13474 21011 -1 -1 861 -1 -1 -1 0 -1 -1 -1 0 5 -1 -1 0 3 -1 -1 0 -1 -1 -1 0 2 -1 -1 0 -1 -1 -1 0 -1 -1 -1 0 5 -1 -1 0 3 -1 -1 0 -1 -1 -1 0 2 -1 -1 0 -1 -1 -1 6 0 0 0 4 0 0 0 0 0 0 0 6 0 0 0 0 4 0 0 6 0 0 0 6 0 0 0 4 0 0 0 0 0 0 0 6 0 0 0 0 4 0 0 6 0 0 0 1 0 11 1 14 0 0 13 25 8 26 13 11 25 26 13 20 3 1 8 13 3 4 17 14 26 20 4 11 4 0 13 3 17 4 4 </values> </instantiation>