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

Result page for benchmark
Tpp/Tpp-zinc-s1/
Tpp-7-3-20-1.xml

Jump to solvers results

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-7-3-20-1.xml
MD5SUM38f06f34c6c373f6142c39e9ab89bcc1
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark125
Best CPU time to get the best result obtained on this benchmark0.251194
Satisfiable
(Un)Satisfiability was proved
Number of variables82
Number of constraints463
Number of domains43
Minimum domain size2
Maximum domain size21
Distribution of domain sizes[{"size":2,"count":1},{"size":3,"count":4},{"size":4,"count":13},{"size":5,"count":3},{"size":11,"count":3},{"size":12,"count":3},{"size":13,"count":5},{"size":14,"count":4},{"size":15,"count":5},{"size":20,"count":20},{"size":21,"count":21}]
Minimum variable degree2
Maximum variable degree23
Distribution of variable degrees[{"degree":2,"count":41},{"degree":22,"count":40},{"degree":23,"count":1}]
Minimum constraint arity1
Maximum constraint arity21
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":461},{"arity":21,"count":1}]
Number of extensional constraints41
Number of intensional constraints421
Distribution of constraint types[{"type":"extension","count":41},{"type":"intension","count":421},{"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)4390226OPT125 0.251194 0.252491
cosoco 2.0 (complete)4397686OPT125 0.253512 0.254997
cosoco 2.0 (complete)4408946OPT125 0.262341 0.264061
cosoco 2.O parallel (complete)4398586OPT125 0.757203 0.266575
cosoco 2.0 parallel (complete)4409846OPT125 1.26285 0.327908
choco-solver 2019-09-24 (complete)4406386OPT125 3.52772 1.87352
AbsCon 2019-07-23 (complete)4391126OPT125 4.97866 2.67981
choco-solver 2019-09-16 (complete)4400386OPT125 8.43881 2.67202
choco-solver 2019-06-14 (complete)4394126OPT125 9.66432 3.07855
Concrete 3.12.3 (complete)4403086OPT125 9.93003 4.24989
choco-solver 2019-09-16 parallel (complete)4400086OPT125 10.0645 2.38977
choco-solver 2019-09-24 parallel (complete)4407286OPT125 10.2088 2.35104
choco-solver 2019-06-14 parallel (complete)4394426OPT125 10.3125 2.36214
Concrete 3.12.2 (complete)4401286OPT125 11.3675 4.71631
Concrete 3.12.2 (complete)4396406OPT125 12.7701 4.95082
PicatSAT 2019-09-12 (complete)4395506OPT125 20.609 20.6155
Concrete 3.10 (complete)4392026Wrong Opt.175 10.5018 4.37244
choco-solver 2019-09-20 (complete)4403986Wrong UNSAT 4.27901 1.48815
choco-solver 2019-09-20 parallel (complete)4404886Wrong UNSAT 6.93076 1.84734

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: 125
Solution found:
<instantiation type='solution' cost='125'> <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[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[18] d[19] d[1] d[20] 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[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[18] s[19] s[1] s[20] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list> <values>4 1 1 5 4 1 2 4 5 2 2 1 1 9 5 5 2 3 1 9 0 7
1 1 18 0 0 0 16 10 1 0 4 0 0 0 0 0 0 0 0 13 19 19 19 10 13 11 18 18 19 10 17 18 19 12 17 11 10 10 11 0 11 12 13 20 14 15 16 10 17 18 1 19 2
3 4 5 6 7 8 9 </values> </instantiation>