Name | MagicHexagon/ MagicHexagon-06-0010_c18.xml |
MD5SUM | a4a3304b5e9aae9c2bcc59fc5ef6ae6f |
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 | 121 |
Number of constraints | 40 |
Number of domains | 1 |
Minimum domain size | 91 |
Maximum domain size | 91 |
Distribution of domain sizes | [{"size":91,"count":91}] |
Minimum variable degree | 0 |
Maximum variable degree | 9 |
Distribution of variable degrees | [{"degree":0,"count":30},{"degree":4,"count":85},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 91 |
Distribution of constraint arities | [{"arity":2,"count":6},{"arity":6,"count":6},{"arity":7,"count":6},{"arity":8,"count":6},{"arity":9,"count":6},{"arity":10,"count":6},{"arity":11,"count":3},{"arity":91,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 6 |
Distribution of constraint types | [{"type":"intension","count":6},{"type":"allDifferent","count":1},{"type":"sum","count":33}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
scop order+glucose-syrup (2018-07-07) (complete) | 4296952 | ? (MO) | 23.5695 | 17.6406 |
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291274 | ? (TO) | 19939.7 | 2520.39 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4309043 | ? (TO) | 19949.9 | 2520.32 |
scop order+glucose-syrup (2018-07-31) (complete) | 4307136 | ? (TO) | 19968.4 | 2520.42 |
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297687 | ? (TO) | 19994.5 | 2520.12 |
scop both+glucose-syrup (2018-07-31) (complete) | 4307372 | ? (TO) | 20055.6 | 2520.11 |
scop both+glucose-syrup (2018-07-07) (complete) | 4297188 | ? (TO) | 20063.4 | 2520.12 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: