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 | 21.3342 |
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 |
---|---|---|---|---|
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291369 | SAT | 21.3342 | 5.23793 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4309138 | SAT | 31.6386 | 9.13215 |
scop order+glucose-syrup (2018-07-07) (complete) | 4297047 | SAT | 31.7263 | 6.74123 |
scop both+glucose-syrup (2018-07-07) (complete) | 4297283 | SAT | 34.1546 | 7.33702 |
scop order+glucose-syrup (2018-07-31) (complete) | 4307231 | SAT | 37.082 | 8.32455 |
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297782 | SAT | 45.3326 | 6.47521 |
scop both+glucose-syrup (2018-07-31) (complete) | 4307467 | SAT | 47.313 | 9.53805 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <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> 18 4 12 11 17 5 11 17 2 5 14 2 7 12 7 2 1 16 10 6 17 7 7 6 3 10 6 14 6 8 2 11 14 6 15 3 18 4 12 17 </values> </instantiation>