Name | MagicHexagon/ MagicHexagon-07-m011_c18.xml |
MD5SUM | cb154bca5bef3b2160515065825e7dfd |
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 | 169 |
Number of constraints | 46 |
Number of domains | 1 |
Minimum domain size | 127 |
Maximum domain size | 127 |
Distribution of domain sizes | [{"size":127,"count":127}] |
Minimum variable degree | 0 |
Maximum variable degree | 9 |
Distribution of variable degrees | [{"degree":0,"count":42},{"degree":4,"count":121},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 127 |
Distribution of constraint arities | [{"arity":2,"count":6},{"arity":7,"count":6},{"arity":8,"count":6},{"arity":9,"count":6},{"arity":10,"count":6},{"arity":11,"count":6},{"arity":12,"count":6},{"arity":13,"count":3},{"arity":127,"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":39}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
scop order+glucose-syrup (2018-07-07) (complete) | 4296955 | ? (MO) | 57.5809 | 51.8092 |
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297690 | ? (TO) | 19339.4 | 2520.12 |
scop order+glucose-syrup (2018-07-31) (complete) | 4307139 | ? (TO) | 19716.2 | 2521.16 |
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291277 | ? (TO) | 19925.5 | 2520.35 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4309046 | ? (TO) | 19937.2 | 2520.33 |
scop both+glucose-syrup (2018-07-31) (complete) | 4307375 | ? (TO) | 20029 | 2520.16 |
scop both+glucose-syrup (2018-07-07) (complete) | 4297191 | ? (TO) | 20038.4 | 2520.18 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: