Name | Frb/ frb-53-24-1-mgd_c18.xml |
MD5SUM | e77860b1077c007311080ac2a4bc32f8 |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 53 |
Number of constraints | 475 |
Number of domains | 1 |
Minimum domain size | 24 |
Maximum domain size | 24 |
Distribution of domain sizes | [{"size":24,"count":53}] |
Minimum variable degree | 12 |
Maximum variable degree | 25 |
Distribution of variable degrees | [{"degree":12,"count":3},{"degree":13,"count":3},{"degree":14,"count":3},{"degree":15,"count":6},{"degree":16,"count":3},{"degree":17,"count":7},{"degree":18,"count":3},{"degree":19,"count":10},{"degree":20,"count":3},{"degree":21,"count":4},{"degree":22,"count":1},{"degree":23,"count":3},{"degree":24,"count":3},{"degree":25,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 2 |
Distribution of constraint arities | [{"arity":2,"count":475}] |
Number of extensional constraints | 475 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":475}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291374 | ? (TO) | 20003.5 | 2520.49 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4309143 | ? (TO) | 20029.9 | 2520.46 |
scop order+glucose-syrup (2018-07-31) (complete) | 4307236 | ? (TO) | 20052.5 | 2520.07 |
scop both+glucose-syrup (2018-07-31) (complete) | 4307472 | ? (TO) | 20054.4 | 2520.07 |
scop both+glucose-syrup (2018-07-07) (complete) | 4297288 | ? (TO) | 20060.5 | 2520.08 |
scop order+glucose-syrup (2018-07-07) (complete) | 4297052 | ? (TO) | 20060.7 | 2520.09 |
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297787 | ? (TO) | 20089.5 | 2520.14 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: