2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
GraphColoring/GraphColoring-m1-mono/
GraphColoring-myciel5.xml

Jump to solvers results

General information on the benchmark

NameGraphColoring/GraphColoring-m1-mono/
GraphColoring-myciel5.xml
MD5SUMa954d880863fe6e02d270e9cafb0ae96
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark5
Best CPU time to get the best result obtained on this benchmark19.5376
Satisfiable
(Un)Satisfiability was proved
Number of variables47
Number of constraints236
Number of domains1
Minimum domain size47
Maximum domain size47
Distribution of domain sizes[{"size":47,"count":47}]
Minimum variable degree6
Maximum variable degree24
Distribution of variable degrees[{"degree":6,"count":5},{"degree":7,"count":5},{"degree":8,"count":6},{"degree":9,"count":5},{"degree":10,"count":5},{"degree":11,"count":5},{"degree":12,"count":1},{"degree":13,"count":7},{"degree":17,"count":5},{"degree":21,"count":1},{"degree":23,"count":1},{"degree":24,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":236}]
Number of extensional constraints0
Number of intensional constraints236
Distribution of constraint types[{"type":"intension","count":236}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4395222OPT5 19.5376 19.5436
AbsCon 2019-07-23 (complete)4390842OPT5 29.4244 27.8126
choco-solver 2019-06-14 (complete)4393242OPT5 42.2763 10.9675
choco-solver 2019-09-20 (complete)4403702OPT5 44.9857 11.6666
choco-solver 2019-09-16 (complete)4399202OPT5 53.5933 14.1433
choco-solver 2019-09-24 (complete)4406102OPT5 82.8913 80.2489
choco-solver 2019-09-24 parallel (complete)4407002OPT5 86.1965 11.5343
choco-solver 2019-06-14 parallel (complete)4393842OPT5 96.5388 12.803
choco-solver 2019-09-16 parallel (complete)4399802OPT5 105.159 13.9698
choco-solver 2019-09-20 parallel (complete)4404602OPT5 106.608 14.0786
Concrete 3.12.2 (complete)4401002OPT5 301.061 289.745
Concrete 3.12.3 (complete)4402802OPT5 302.947 293.438
Concrete 3.10 (complete)4387004OPT5 340.013 326.386
cosoco 2.0 (complete)4397022OPT5 634.914 635.028
cosoco 2.0 (complete)4408282OPT5 638.305 638.356
cosoco 2 (complete)4389742OPT5 728.663 728.615
Concrete 3.12.2 (complete)4396122OPT5 1257.94 1232.68
cosoco 2.O parallel (complete)4398302OPT5 3323.72 416.199
cosoco 2.0 parallel (complete)4409562OPT5 4115.96 515.403

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: 5
Solution found:
<instantiation> <list> x[]  </list> <values> 3 5 0 0 5 1 1 1 1 1 0 2 2 2 2 2 2 2 2 2 2 2 0 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 0  
</values> </instantiation>