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

Result page for benchmark
Tpp/Tpp-zinc-s1/
Tpp-6-3-30-1.xml

Jump to solvers results

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-6-3-30-1.xml
MD5SUMf61e90724cd8b66989ec046e8a3ea41c
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark164
Best CPU time to get the best result obtained on this benchmark0.326088
Satisfiable
(Un)Satisfiability was proved
Number of variables96
Number of constraints590
Number of domains50
Minimum domain size3
Maximum domain size18
Distribution of domain sizes[{"size":3,"count":6},{"size":4,"count":9},{"size":5,"count":3},{"size":7,"count":1},{"size":9,"count":2},{"size":10,"count":3},{"size":11,"count":9},{"size":12,"count":9},{"size":13,"count":5},{"size":14,"count":1},{"size":17,"count":30},{"size":18,"count":18}]
Minimum variable degree2
Maximum variable degree33
Distribution of variable degrees[{"degree":2,"count":48},{"degree":19,"count":30},{"degree":32,"count":17},{"degree":33,"count":1}]
Minimum constraint arity1
Maximum constraint arity18
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":588},{"arity":18,"count":1}]
Number of extensional constraints48
Number of intensional constraints541
Distribution of constraint types[{"type":"extension","count":48},{"type":"intension","count":541},{"type":"circuit","count":1}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 2 (complete)4390271OPT164 0.326088 0.330425
cosoco 2.0 (complete)4408991OPT164 0.329048 0.333363
cosoco 2.0 (complete)4397731OPT164 0.330599 0.330927
cosoco 2.O parallel (complete)4398631OPT164 0.923403 0.333301
cosoco 2.0 parallel (complete)4409891OPT164 1.03296 0.348744
choco-solver 2019-09-24 (complete)4406431OPT164 3.45507 1.24996
AbsCon 2019-07-23 (complete)4391171OPT164 7.25402 3.43006
choco-solver 2019-09-16 (complete)4400431OPT164 8.97111 2.87439
choco-solver 2019-09-16 parallel (complete)4400131OPT164 10.3341 2.47192
choco-solver 2019-09-24 parallel (complete)4407331OPT164 10.6836 2.49905
choco-solver 2019-06-14 parallel (complete)4394471OPT164 11.4745 2.59728
Concrete 3.12.2 (complete)4401331OPT164 11.885 4.53639
Concrete 3.12.3 (complete)4403131OPT164 12.0267 4.88506
PicatSAT 2019-09-12 (complete)4395551OPT164 15.2357 15.2366
Concrete 3.12.2 (complete)4396451OPT164 15.6389 5.91349
choco-solver 2019-06-14 (complete)4394171SAT (MO)308 5.20533 1.74343
Concrete 3.10 (complete)4392071Wrong Opt.204 10.3485 4.2106
choco-solver 2019-09-20 (complete)4404031Wrong Opt.240 6.15652 2.09115
choco-solver 2019-09-20 parallel (complete)4404931Wrong Opt.240 7.67229 1.97153

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: 164
Solution found:
<instantiation type='solution' cost='164'> <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[20] c[21] c[22]
c[23] c[24] c[25] c[26] c[27] c[28] c[29] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] d[0] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[1]
d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] l[0] l[10] l[11] l[12] l[13] l[14] l[15] l[16] l[17] l[18] l[19] l[1] l[20] l[21] l[22] l[23] l[24]
l[25] l[26] l[27] l[28] l[29] l[2] l[3] l[4] l[5] l[6] l[7] l[8] l[9] s[0] s[10] s[11] s[12] s[13] s[14] s[15] s[16] s[17] s[1] s[2] s[3]
s[4] s[5] s[6] s[7] s[8] s[9] </list> <values>4 3 3 7 4 1 4 5 1 4 2 4 9 1 2 1 7 2 2 3 4 10 7 6 8 4 2 1 4 8 0 4 1 0 0 0 1 13 16 0 0 0 0 0 0 0
0 6 9 10 10 9 16 9 11 11 10 9 16 9 16 11 11 15 15 10 10 16 9 16 15 16 11 16 15 15 9 11 0 11 17 12 13 14 9 15 16 1 2 3 4 5 6 7 8 10 </values>
</instantiation>