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-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.4372
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)4395188OPT8 75.4372 75.4497
AbsCon 2019-07-23 (complete)4390808OPT8 101.042 95.9897
cosoco 2.0 (complete)4396988OPT8 126.821 126.835
cosoco 2.0 (complete)4408248OPT8 132.341 132.345
cosoco 2 (complete)4389708OPT8 153.816 153.838
choco-solver 2019-06-14 (complete)4393208OPT8 258.606 66.1478
choco-solver 2019-09-16 (complete)4399168OPT8 276.667 70.6548
choco-solver 2019-09-20 (complete)4403668OPT8 438.589 111.249
choco-solver 2019-09-24 parallel (complete)4406968OPT8 521.705 68.1077
choco-solver 2019-09-16 parallel (complete)4399768OPT8 530.628 68.907
choco-solver 2019-06-14 parallel (complete)4393808OPT8 560.693 72.6201
choco-solver 2019-09-20 parallel (complete)4404568OPT8 1135.61 145.1
choco-solver 2019-09-24 (complete)4406068OPT8 1848.68 1840.13
Concrete 3.10 (complete)4387015OPT8 2068.92 2018.95
cosoco 2.0 parallel (complete)4409528OPT8 3538.53 445.364
cosoco 2.O parallel (complete)4398268OPT8 3992.2 502.141
Concrete 3.12.2 (complete)4400968SAT (TO)8 2520.08 2464.53
Concrete 3.12.3 (complete)4402768SAT (TO)8 2520.16 2466.06
Concrete 3.12.2 (complete)4396088SAT (TO)979 2520.14 2479.44

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>