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

Result page for benchmark
Tal/
Tal-03_c18.xml

Jump to solvers results

General information on the benchmark

NameTal/
Tal-03_c18.xml
MD5SUMfb5ba5d4d49d61a1ee3ee3c25fa47163
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark96
Best CPU time to get the best result obtained on this benchmark32.9798
Satisfiable
(Un)Satisfiability was proved
Number of variables404
Number of constraints286
Number of domains10
Minimum domain size1
Maximum domain size42
Distribution of domain sizes[{"size":1,"count":63},{"size":2,"count":4},{"size":3,"count":5},{"size":4,"count":6},{"size":5,"count":7},{"size":6,"count":43},{"size":7,"count":9},{"size":8,"count":28},{"size":42,"count":62}]
Minimum variable degree0
Maximum variable degree13
Distribution of variable degrees[{"degree":0,"count":177},{"degree":1,"count":63},{"degree":2,"count":47},{"degree":3,"count":8},{"degree":4,"count":9},{"degree":5,"count":25},{"degree":6,"count":17},{"degree":7,"count":12},{"degree":8,"count":12},{"degree":9,"count":17},{"degree":10,"count":8},{"degree":11,"count":5},{"degree":12,"count":3},{"degree":13,"count":1}]
Minimum constraint arity1
Maximum constraint arity10
Distribution of constraint arities[{"arity":1,"count":88},{"arity":2,"count":90},{"arity":3,"count":30},{"arity":4,"count":10},{"arity":5,"count":16},{"arity":6,"count":15},{"arity":7,"count":14},{"arity":8,"count":12},{"arity":9,"count":9},{"arity":10,"count":2}]
Number of extensional constraints49
Number of intensional constraints225
Distribution of constraint types[{"type":"extension","count":49},{"type":"intension","count":225},{"type":"count","count":12}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
AbsCon 2019-07-23 (complete)4391169OPT96 32.9798 27.2938
choco-solver 2019-09-24 (complete)4406429OPT96 75.1542 67.3538
choco-solver 2019-06-14 (complete)4394169OPT96 84.5002 36.9579
choco-solver 2019-06-14 parallel (complete)4394469OPT96 157.032 45.1585
choco-solver 2019-09-16 (complete)4400429OPT96 322.157 90.5095
choco-solver 2019-09-20 (complete)4404029OPT96 333.96 93.5845
choco-solver 2019-09-20 parallel (complete)4404929OPT96 343.411 66.8193
choco-solver 2019-09-24 parallel (complete)4407329OPT96 357.275 68.2763
choco-solver 2019-09-16 parallel (complete)4400129OPT96 378.408 71.2731
PicatSAT 2019-09-12 (complete)4395549OPT96 404.083 404.069
Concrete 3.12.2 (complete)4401329OPT96 1071.29 1047.78
Concrete 3.12.3 (complete)4403129OPT96 1104.58 1080.97
cosoco 2.0 (complete)4408989OPT96 1312.54 1312.37
cosoco 2.0 (complete)4397729OPT96 1319.04 1319.25
cosoco 2 (complete)4390269OPT96 1327.75 1327.96
cosoco 2.O parallel (complete)4398629OPT96 1333.11 167.184
cosoco 2.0 parallel (complete)4409889OPT96 1703.07 213.514
Concrete 3.10 (complete)4392069OPT96 1710.83 1674.5
Concrete 3.12.2 (complete)4396449OPT96 1864.62 1833.31

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: 96
Solution found:
<instantiation id='sol11' type='solution' cost='96'>  <list> c[][] l[][] a[][] i[][] cnt[] </list>  <values> 0 0 0 0 0 0 0 16 16 0 0 4 16 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 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 16 16 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 9 10 12 13 4 16 8 7 7 0 13 5 4 3 7 7 13 5 4 3 0 7 7 13 8 0 3 * 7 7 13 8 3 0 * 7 7 13 3 3 * * 7 7 13 3 3 * * 7
7 2 0 * * * 7 7 2 0 * * * 4 4 3 * * * * 4 4 3 * * * * 6 0 * * * * * 6 0 * * * * * 6 * * * * * * * * * * * * * 1 2 0 1 1 1 1 * * * * * * * 1
1 1 2 0 1 * * * * * * * * 1 1 1 1 1 * * * * * * * * * 1 1 3 0 * * * * * * * * * * 1 1 1 * * * * * * * * * * * 3 0 * * * * * * * * * * * * 1
* * * * * * * * * * * * * * * * * * * * 0 1 3 4 5 6 6 * * * * * * * 0 1 2 3 5 5 * * * * * * * * 0 1 2 3 4 * * * * * * * * * 0 1 2 3 * * * *
* * * * * * 0 1 2 * * * * * * * * * * * 0 1 * * * * * * * * * * * * 1 1 1 1 0 0 1 1 0 0 1 1 </values>  </instantiation>