Name | MagicHexagon/MagicHexagon-m1-s1/ MagicHexagon-11-m018.xml |
MD5SUM | b5a9a76cf66b8bb787e8dcd8982cd647 |
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 | 441 |
Number of constraints | 70 |
Number of domains | 1 |
Minimum domain size | 331 |
Maximum domain size | 331 |
Distribution of domain sizes | [{"size":331,"count":331}] |
Minimum variable degree | 0 |
Maximum variable degree | 9 |
Distribution of variable degrees | [{"degree":0,"count":110},{"degree":4,"count":325},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 331 |
Distribution of constraint arities | [{"arity":2,"count":6},{"arity":11,"count":6},{"arity":12,"count":6},{"arity":13,"count":6},{"arity":14,"count":6},{"arity":15,"count":6},{"arity":16,"count":6},{"arity":17,"count":6},{"arity":18,"count":6},{"arity":19,"count":6},{"arity":20,"count":6},{"arity":21,"count":3},{"arity":331,"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":63}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
miniBTD 19.06.16 (complete) | 4391934 | ? | 2400.03 | 2400.05 |
cosoco 2.0 (complete) | 4408674 | ? (TO) | 2400.01 | 2400.3 |
NACRE 1.0.5-Hybrid (complete) | 4391534 | ? (TO) | 2400.03 | 2400.3 |
(reference) PicatSAT 2019-09-12 (complete) | 4407733 | ? (TO) | 2400.07 | 2400.21 |
cosoco 2.0 (complete) | 4397414 | ? (TO) | 2400.07 | 2400.11 |
NACRE 1.0.5 (complete) | 4391734 | ? (TO) | 2400.07 | 2400.01 |
cosoco 2 (complete) | 4390134 | ? (TO) | 2400.07 | 2400.11 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: