2019 XCSP3 competition: main track (CSP and COP, 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 benchmark33.2263
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)4390869OPT96 33.2263 28.0189
choco-solver 2019-09-24 (complete)4406129OPT96 72.9036 66.7457
choco-solver 2019-06-14 (complete)4393269OPT96 76.6893 33.5323
choco-solver 2019-09-20 (complete)4403729OPT96 148.782 46.7266
choco-solver 2019-06-14 parallel (complete)4393869OPT96 149.077 43.3195
choco-solver 2019-09-16 (complete)4399229OPT96 247.294 71.6362
choco-solver 2019-09-16 parallel (complete)4399829OPT96 368.233 69.6572
choco-solver 2019-09-24 parallel (complete)4407029OPT96 464.878 82.0809
choco-solver 2019-09-20 parallel (complete)4404629OPT96 469.634 82.4371
PicatSAT 2019-09-12 (complete)4395249OPT96 503.273 503.291
Concrete 3.12.2 (complete)4401029OPT96 1103.73 1079.14
cosoco 2.0 parallel (complete)4409589OPT96 1175.57 147.492
cosoco 2.0 (complete)4397049OPT96 1314.66 1314.69
cosoco 2.0 (complete)4408309OPT96 1320.79 1320.75
cosoco 2 (complete)4389769OPT96 1420.78 1420.71
cosoco 2.O parallel (complete)4398329OPT96 1496.66 187.719
Concrete 3.12.3 (complete)4402829OPT96 1876.4 1844.87
Concrete 3.10 (complete)4387513SAT (TO)96 2520.06 2470.93
Concrete 3.12.2 (complete)4396149SAT (TO)96 2520.13 2483.33

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>