| Name | Frb/ frb-35-17-1_c18.xml |
| MD5SUM | 938558367576662423373d61b63119a7 |
| 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 | 2.36005 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 35 |
| Number of constraints | 346 |
| Number of domains | 1 |
| Minimum domain size | 17 |
| Maximum domain size | 17 |
| Distribution of domain sizes | [{"size":17,"count":35}] |
| Minimum variable degree | 12 |
| Maximum variable degree | 28 |
| Distribution of variable degrees | [{"degree":12,"count":3},{"degree":13,"count":3},{"degree":14,"count":1},{"degree":15,"count":1},{"degree":16,"count":1},{"degree":17,"count":1},{"degree":18,"count":3},{"degree":19,"count":2},{"degree":20,"count":2},{"degree":21,"count":4},{"degree":22,"count":3},{"degree":23,"count":4},{"degree":24,"count":1},{"degree":25,"count":3},{"degree":26,"count":1},{"degree":28,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":346}] |
| Number of extensional constraints | 346 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":346}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco 1.12 (complete) | 4300295 | SAT | 2.36005 | 2.36228 |
| NACRE 1.0.4 (complete) | 4300298 | SAT | 2.72641 | 2.73305 |
| miniBTD 2018.07.27_3 (complete) | 4301132 | SAT | 7.11843 | 7.12086 |
| miniBTD_12 2018.07.27_12 (complete) | 4300956 | SAT | 12.001 | 12.0029 |
| minimacht 2018.07.27 (complete) | 4300780 | SAT | 12.7779 | 12.7793 |
| GG's minicp 2018-04-29 (complete) | 4300296 | SAT | 25.3266 | 23.2167 |
| MiniCPFever 2018-04-29 (complete) | 4300297 | SAT | 44.4757 | 42.2087 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300300 | SAT | 70.7127 | 68.0396 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300301 | SAT | 101.775 | 98.82 |
| slowpoke 2018-04-29 (incomplete) | 4300299 | SAT | 175.82 | 173.151 |
| The dodo solver 2018-04-29 (complete) | 4300302 | SAT (TO) | 2520.02 | 2491.72 |
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] </list> <values>4 4 1 10 15 3 7 15 2 7 9 1 6 11 0 1 1 14 10 9 15 15 6 5 3 9 6 6 6 7 2 10 12 5 14 </values> </instantiation>