Name | ColouredQueens/ ColouredQueens-14_c18.xml |
MD5SUM | eb742fbc5fe115028f4ee34ab4b949cf |
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 | 196 |
Number of constraints | 78 |
Number of domains | 1 |
Minimum domain size | 14 |
Maximum domain size | 14 |
Distribution of domain sizes | [{"size":14,"count":196}] |
Minimum variable degree | 3 |
Maximum variable degree | 4 |
Distribution of variable degrees | [{"degree":3,"count":4},{"degree":4,"count":192}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 14 |
Distribution of constraint arities | [{"arity":2,"count":4},{"arity":3,"count":4},{"arity":4,"count":4},{"arity":5,"count":4},{"arity":6,"count":4},{"arity":7,"count":4},{"arity":8,"count":4},{"arity":9,"count":4},{"arity":10,"count":4},{"arity":11,"count":4},{"arity":12,"count":4},{"arity":13,"count":4},{"arity":14,"count":30}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"allDifferent","count":78}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291243 | ? (TO) | 19925.1 | 2520.34 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4309012 | ? (TO) | 19940.6 | 2520.44 |
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297656 | ? (TO) | 20070.5 | 2520.1 |
scop both+glucose-syrup (2018-07-31) (complete) | 4307341 | ? (TO) | 20075.2 | 2520.12 |
scop order+glucose-syrup (2018-07-31) (complete) | 4307105 | ? (TO) | 20076.2 | 2520.11 |
scop both+glucose-syrup (2018-07-07) (complete) | 4297157 | ? (TO) | 20083.9 | 2520.08 |
scop order+glucose-syrup (2018-07-07) (complete) | 4296921 | ? (TO) | 20084.3 | 2520.08 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: