2019 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
GraphColoring/GraphColoring-m1-mono/
GraphColoring-5-fullins-4.xml

Jump to solvers results

General information on the benchmark

NameGraphColoring/GraphColoring-m1-mono/
GraphColoring-5-fullins-4.xml
MD5SUM9a110b3288dcdd83da8fcc132ac433c6
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark8
Best CPU time to get the best result obtained on this benchmark75.1369
Satisfiable
(Un)Satisfiability was proved
Number of variables1085
Number of constraints11395
Number of domains1
Minimum domain size1085
Maximum domain size1085
Distribution of domain sizes[{"size":1085,"count":1085}]
Minimum variable degree7
Maximum variable degree161
Distribution of variable degrees[{"degree":7,"count":4},{"degree":8,"count":22},{"degree":9,"count":16},{"degree":10,"count":80},{"degree":11,"count":22},{"degree":12,"count":110},{"degree":13,"count":19},{"degree":14,"count":60},{"degree":15,"count":60},{"degree":16,"count":300},{"degree":19,"count":7},{"degree":20,"count":35},{"degree":21,"count":7},{"degree":22,"count":35},{"degree":30,"count":7},{"degree":33,"count":7},{"degree":34,"count":35},{"degree":35,"count":35},{"degree":36,"count":175},{"degree":55,"count":7},{"degree":56,"count":35},{"degree":161,"count":7}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":11395}]
Number of extensional constraints0
Number of intensional constraints11395
Distribution of constraint types[{"type":"intension","count":11395}]
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)4395488OPT8 75.1369 75.1451
AbsCon 2019-07-23 (complete)4391108OPT8 87.7873 82.6714
cosoco 2.0 (complete)4397668OPT8 133.489 133.518
cosoco 2.0 (complete)4408928OPT8 139.089 139.104
cosoco 2 (complete)4390208OPT8 147.813 147.831
choco-solver 2019-09-16 (complete)4400368OPT8 271.812 69.3091
choco-solver 2019-06-14 (complete)4394108OPT8 293.348 75.5381
choco-solver 2019-09-20 (complete)4403968OPT8 310.465 79.3163
choco-solver 2019-09-24 parallel (complete)4407268OPT8 499.002 65.0773
choco-solver 2019-09-20 parallel (complete)4404868OPT8 587.592 76.1542
choco-solver 2019-06-14 parallel (complete)4394408OPT8 863.564 111.245
choco-solver 2019-09-16 parallel (complete)4400068OPT8 924.097 118.331
choco-solver 2019-09-24 (complete)4406368OPT8 1665.45 1657.64
Concrete 3.10 (complete)4392008OPT8 1948.92 1900.52
cosoco 2.0 parallel (complete)4409828SAT (TO)8 1995.18 252.085
cosoco 2.O parallel (complete)4398568SAT (TO)8 1995.2 252.075
Concrete 3.12.2 (complete)4401268SAT (TO)8 2400.08 2345.64
Concrete 3.12.3 (complete)4403068SAT (TO)8 2400.1 2348.84
Concrete 3.12.2 (complete)4396388SAT (TO)980 2400.08 2361.24

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