2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmark
CrosswordDesign/
CrosswordDesign-09-4-rom_c18.xml

Jump to solvers results

General information on the benchmark

NameCrosswordDesign/
CrosswordDesign-09-4-rom_c18.xml
MD5SUM687e226d0bfa9953b2ddd48681aeb13c
Bench CategoryCOP (optimization 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 variables297
Number of constraints72
Number of domains5
Minimum domain size2
Maximum domain size84486
Distribution of domain sizes[{"size":2,"count":18},{"size":10,"count":126},{"size":27,"count":81},{"size":84486,"count":72}]
Minimum variable degree1
Maximum variable degree8
Distribution of variable degrees[{"degree":1,"count":90},{"degree":2,"count":126},{"degree":8,"count":81}]
Minimum constraint arity12
Maximum constraint arity13
Distribution of constraint arities[{"arity":12,"count":18},{"arity":13,"count":54}]
Number of extensional constraints72
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":72}]
Optimization problemYES
Type of objectivemax SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312137? 71.1767 24.3363
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309927? 76.2342 25.8015
OscaR - Hybrid 2018-08-14 (complete)4310277? 80.97 27.4783
Mistral-2.0 2018-08-01 (complete)4312600? (NS) 1.85465 1.85605
cosoco 1.12 (complete)4301704? (TO) 251.989 252.011
Choco-solver 4.0.7b seq (e747e1e) (complete)4301702? (TO) 252.081 234.665
Sat4j-CSP 2018-07-11 (complete)4301703? (TO) 252.393 209.851
Concrete 3.9.2 (complete)4302301? (TO) 253.159 205.625
Concrete 3.9.2-SuperNG (complete)4302651? (TO) 254.078 213.736

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function:
Solution found: