| Name | Frb/ frb-40-19-1-mgd_c18.xml |
| MD5SUM | 1b3b260246d4f65c593765dc4af9b313 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 5.21821 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 321 |
| Number of domains | 1 |
| Minimum domain size | 19 |
| Maximum domain size | 19 |
| Distribution of domain sizes | [{"size":19,"count":40}] |
| Minimum variable degree | 10 |
| Maximum variable degree | 25 |
| Distribution of variable degrees | [{"degree":10,"count":2},{"degree":11,"count":3},{"degree":12,"count":3},{"degree":13,"count":4},{"degree":14,"count":3},{"degree":15,"count":6},{"degree":16,"count":2},{"degree":17,"count":4},{"degree":18,"count":3},{"degree":19,"count":2},{"degree":20,"count":1},{"degree":21,"count":1},{"degree":22,"count":4},{"degree":23,"count":1},{"degree":25,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":321}] |
| Number of extensional constraints | 321 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":321}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco 1.12 (complete) | 4300375 | SAT | 5.21821 | 5.2205 |
| NACRE 1.0.4 (complete) | 4300378 | SAT | 9.36715 | 9.37434 |
| miniBTD 2018.07.27_3 (complete) | 4301133 | SAT | 26.6757 | 26.6748 |
| miniBTD_12 2018.07.27_12 (complete) | 4300957 | SAT | 49.8847 | 49.8883 |
| minimacht 2018.07.27 (complete) | 4300781 | SAT | 69.511 | 69.5259 |
| GG's minicp 2018-04-29 (complete) | 4300376 | SAT | 135.655 | 131.75 |
| MiniCPFever 2018-04-29 (complete) | 4300377 | SAT | 229.597 | 223.077 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300380 | SAT | 421.009 | 414.211 |
| slowpoke 2018-04-29 (incomplete) | 4300379 | SAT | 507.914 | 504.183 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300381 | SAT | 1239.61 | 1221.23 |
| The dodo solver 2018-04-29 (complete) | 4300382 | ? (TO) | 2520.11 | 2491.71 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type='solution'> <list>x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] </list> <values>5 4 1 11 17 3 8 17 2 7 10 2 7 12 0 1 1 16 12 10 17 16 7 6 3 10 6 7 6 8 2 11 14 6 15 4 18 4 12 17 </values> </instantiation>