Name | Frb/ frb-53-24-3-mgd_c18.xml |
MD5SUM | 2687d075c2954ad7539e74b041f9986e |
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 | 786.161 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 53 |
Number of constraints | 470 |
Number of domains | 1 |
Minimum domain size | 24 |
Maximum domain size | 24 |
Distribution of domain sizes | [{"size":24,"count":53}] |
Minimum variable degree | 11 |
Maximum variable degree | 26 |
Distribution of variable degrees | [{"degree":11,"count":1},{"degree":13,"count":2},{"degree":14,"count":5},{"degree":15,"count":4},{"degree":16,"count":6},{"degree":17,"count":7},{"degree":18,"count":12},{"degree":19,"count":4},{"degree":20,"count":3},{"degree":21,"count":2},{"degree":22,"count":3},{"degree":23,"count":1},{"degree":24,"count":1},{"degree":25,"count":1},{"degree":26,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 2 |
Distribution of constraint arities | [{"arity":2,"count":470}] |
Number of extensional constraints | 470 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":470}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
scop both+glucose-syrup (2018-07-31) (complete) | 4307474 | SAT | 786.161 | 104.697 |
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291376 | ? (TO) | 19999 | 2520.42 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4309145 | ? (TO) | 20004.6 | 2520.37 |
scop order+glucose-syrup (2018-07-31) (complete) | 4307238 | ? (TO) | 20052.8 | 2520.08 |
scop both+glucose-syrup (2018-07-07) (complete) | 4297290 | ? (TO) | 20060 | 2520.09 |
scop order+glucose-syrup (2018-07-07) (complete) | 4297054 | ? (TO) | 20060.6 | 2520.09 |
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297789 | ? (TO) | 20089.2 | 2520.13 |
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] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52]</list> <values>18 15 2 9 22 6 7 6 5 15 20 20 16 1 11 6 14 22 1 14 21 8 8 0 3 19 14 16 8 4 13 10 23 11 21 21 15 2 17 17 16 11 3 22 14 23 6 22 4 1 8 11 8</values> </instantiation>