2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Tpp/Tpp-zinc-s1/
Tpp-4-5-20-1.xml

Jump to solvers results

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-4-5-20-1.xml
MD5SUMe6e5223db5de59749ca81141a6ec4e70
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark115
Best CPU time to get the best result obtained on this benchmark0.249208
Satisfiable
(Un)Satisfiability was proved
Number of variables80
Number of constraints442
Number of domains42
Minimum domain size3
Maximum domain size20
Distribution of domain sizes[{"size":3,"count":7},{"size":4,"count":10},{"size":5,"count":3},{"size":11,"count":3},{"size":12,"count":3},{"size":13,"count":8},{"size":14,"count":2},{"size":15,"count":4},{"size":19,"count":20},{"size":20,"count":20}]
Minimum variable degree2
Maximum variable degree23
Distribution of variable degrees[{"degree":2,"count":40},{"degree":21,"count":20},{"degree":22,"count":19},{"degree":23,"count":1}]
Minimum constraint arity1
Maximum constraint arity20
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":440},{"arity":20,"count":1}]
Number of extensional constraints40
Number of intensional constraints401
Distribution of constraint types[{"type":"extension","count":40},{"type":"intension","count":401},{"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.0 (complete)4408250OPT115 0.249208 0.249669
cosoco 2.0 (complete)4396990OPT115 0.255264 0.259583
cosoco 2 (complete)4389710OPT115 0.307367 0.3075
cosoco 2.0 parallel (complete)4409530OPT115 0.614647 0.237788
cosoco 2.O parallel (complete)4398270OPT115 0.630301 0.240564
choco-solver 2019-09-24 (complete)4406070OPT115 3.14706 1.36685
AbsCon 2019-07-23 (complete)4390810OPT115 5.94997 2.94997
choco-solver 2019-06-14 (complete)4393210OPT115 6.52722 2.14868
choco-solver 2019-09-16 (complete)4399170OPT115 7.20114 2.51472
choco-solver 2019-09-16 parallel (complete)4399770OPT115 9.29155 2.51567
Concrete 3.12.3 (complete)4402770OPT115 9.69329 4.13774
choco-solver 2019-06-14 parallel (complete)4393810OPT115 10.2791 2.36976
Concrete 3.12.2 (complete)4400970OPT115 11.2221 4.41907
choco-solver 2019-09-24 parallel (complete)4406970OPT115 11.3345 2.58704
Concrete 3.12.2 (complete)4396090OPT115 13.9413 5.29592
PicatSAT 2019-09-12 (complete)4395190OPT115 26.8659 26.8663
Concrete 3.10 (complete)4387164Wrong Opt.159 11.7909 4.83923
choco-solver 2019-09-20 (complete)4403670Wrong Opt.235 6.26632 2.47869
choco-solver 2019-09-20 parallel (complete)4404570Wrong Opt.235 8.5897 2.20393

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