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

Result page for benchmark
PrizeCollecting/PrizeCollecting-jok-s1/
PrizeCollecting-20-4-5-0.xml

Jump to solvers results

General information on the benchmark

NamePrizeCollecting/PrizeCollecting-jok-s1/
PrizeCollecting-20-4-5-0.xml
MD5SUM74d82578b46c9040964d6b10ded07847
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark54
Best CPU time to get the best result obtained on this benchmark6.10992
Satisfiable
(Un)Satisfiability was proved
Number of variables60
Number of constraints81
Number of domains21
Minimum domain size3
Maximum domain size21
Distribution of domain sizes[{"size":3,"count":1},{"size":4,"count":6},{"size":5,"count":10},{"size":6,"count":3},{"size":21,"count":40}]
Minimum variable degree2
Maximum variable degree23
Distribution of variable degrees[{"degree":2,"count":20},{"degree":21,"count":19},{"degree":22,"count":1},{"degree":23,"count":20}]
Minimum constraint arity1
Maximum constraint arity21
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":40},{"arity":20,"count":20},{"arity":21,"count":20}]
Number of extensional constraints40
Number of intensional constraints21
Distribution of constraint types[{"type":"extension","count":40},{"type":"intension","count":21},{"type":"count","count":20}]
Optimization problemYES
Type of objectivemax SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 2.O parallel (complete)4398718OPT54 5.85172 0.876798
cosoco 2.0 parallel (complete)4409978OPT54 6.10992 0.907093
AbsCon 2019-07-23 (complete)4391258OPT54 11.3904 7.8702
choco-solver 2019-09-24 (complete)4406518OPT54 12.0941 6.25465
choco-solver 2019-09-20 (complete)4404118OPT54 13.2373 3.69081
choco-solver 2019-06-14 (complete)4394258OPT54 18.1335 5.30888
choco-solver 2019-09-24 parallel (complete)4407418OPT54 20.0366 3.4119
choco-solver 2019-09-20 parallel (complete)4405018OPT54 20.1651 3.39678
choco-solver 2019-09-16 (complete)4400518OPT54 20.3207 5.96344
choco-solver 2019-09-16 parallel (complete)4400218OPT54 20.5024 3.54222
choco-solver 2019-06-14 parallel (complete)4394558OPT54 22.5098 3.84063
Concrete 3.10 (complete)4392158OPT54 47.8497 37.4038
Concrete 3.12.3 (complete)4403218OPT54 58.0986 47.748
PicatSAT 2019-09-12 (complete)4395638OPT54 97.0996 97.0924
Concrete 3.12.2 (complete)4396538OPT54 108.873 95.2836
cosoco 2 (complete)4390358SAT (TO)-19000 2400.04 2400.11
cosoco 2.0 (complete)4409078SAT (TO)-19000 2400.07 2400.11
cosoco 2.0 (complete)4397818SAT (TO)-19000 2400.11 2399.9
Concrete 3.12.2 (complete)4401418? (TO) 2400.11 2371.83

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