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

Result page for benchmark
PrizeCollecting/PrizeCollecting-jok-s1/
PrizeCollecting-28-4-7-3.xml

Jump to solvers results

General information on the benchmark

NamePrizeCollecting/PrizeCollecting-jok-s1/
PrizeCollecting-28-4-7-3.xml
MD5SUMcd71d797d3091c0a3eabb0588ef8346f
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark77
Best CPU time to get the best result obtained on this benchmark101.167
Satisfiable
(Un)Satisfiability was proved
Number of variables84
Number of constraints113
Number of domains27
Minimum domain size3
Maximum domain size29
Distribution of domain sizes[{"size":3,"count":1},{"size":4,"count":11},{"size":5,"count":13},{"size":6,"count":3},{"size":29,"count":56}]
Minimum variable degree2
Maximum variable degree31
Distribution of variable degrees[{"degree":2,"count":28},{"degree":29,"count":27},{"degree":30,"count":1},{"degree":31,"count":28}]
Minimum constraint arity1
Maximum constraint arity29
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":56},{"arity":28,"count":28},{"arity":29,"count":28}]
Number of extensional constraints56
Number of intensional constraints29
Distribution of constraint types[{"type":"extension","count":56},{"type":"intension","count":29},{"type":"count","count":28}]
Optimization problemYES
Type of objectivemax SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
choco-solver 2019-09-24 (complete)4406209OPT77 101.167 96.8631
cosoco 2.O parallel (complete)4398409OPT77 315.151 39.9426
choco-solver 2019-09-16 (complete)4399309OPT77 333.402 84.5433
PicatSAT 2019-09-12 (complete)4395329OPT77 338.213 338.237
cosoco 2.0 parallel (complete)4409669OPT77 379.936 48.066
choco-solver 2019-09-20 (complete)4403809OPT77 417.298 105.638
choco-solver 2019-09-24 parallel (complete)4407109OPT77 632.246 81.2406
choco-solver 2019-09-16 parallel (complete)4399909OPT77 664.25 85.4858
choco-solver 2019-09-20 parallel (complete)4404709OPT77 688.21 88.3382
AbsCon 2019-07-23 (complete)4390949OPT77 806.613 802.338
choco-solver 2019-06-14 (complete)4393349OPT77 1147.63 364.153
Concrete 3.10 (complete)4387212SAT (TO)-9938 2520.13 2501.74
cosoco 2.0 (complete)4408389SAT (TO)-28000 2519.82 2520.01
cosoco 2.0 (complete)4397129SAT (TO)-28000 2519.88 2520.01
cosoco 2 (complete)4389849SAT (TO)-28000 2520.04 2520
Concrete 3.12.2 (complete)4401109? (TO) 2520.08 2480.14
Concrete 3.12.2 (complete)4396229? (TO) 2520.1 2480.05
Concrete 3.12.3 (complete)4402909? (TO) 2520.13 2480.73
choco-solver 2019-06-14 parallel (complete)4393949Wrong Opt.40 58.313 9.23907

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: 77
Solution found:
<instantiation> <list>s[0] s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] s[10] s[11] s[12] s[13] s[14] s[15] s[16] s[17] s[18] s[19] s[20]
s[21] s[22] s[23] s[24] s[25] s[26] s[27] p[0] p[1] p[2] p[3] p[4] p[5] p[6] p[7] p[8] p[9] p[10] p[11] p[12] p[13] p[14] p[15] p[16] p[17]
p[18] p[19] p[20] p[21] p[22] p[23] p[24] p[25] p[26] p[27] g[0] g[1] g[2] g[3] g[4] g[5] g[6] g[7] g[8] g[9] g[10] g[11] g[12] g[13] g[14]
g[15] g[16] g[17] g[18] g[19] g[20] g[21] g[22] g[23] g[24] g[25] g[26] g[27] </list> <values>7 0 1 2 3 4 -1 8 9 16 11 12 5 -1 21 14 15 10
17 18 19 22 23 24 25 26 27 20 0 25 24 23 22 21 -1 1 2 3 18 19 20 -1 6 5 4 17 16 15 14 7 8 9 10 11 12 13 3 7 4 6 7 4 0 0 8 -2 -1 7 4 0 0 4 6
-3 0 0 4 7 3 -4 4 3 1 5 </values> </instantiation>