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

Result page for benchmark
PrizeCollecting/PrizeCollecting-jok-s1/
PrizeCollecting-25-5-5-5.xml

Jump to solvers results

General information on the benchmark

NamePrizeCollecting/PrizeCollecting-jok-s1/
PrizeCollecting-25-5-5-5.xml
MD5SUMa365ee41b1fa653da2199bfa573a8fac
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark57
Best CPU time to get the best result obtained on this benchmark62.0919
Satisfiable
(Un)Satisfiability was proved
Number of variables75
Number of constraints101
Number of domains25
Minimum domain size3
Maximum domain size26
Distribution of domain sizes[{"size":3,"count":2},{"size":4,"count":9},{"size":5,"count":7},{"size":6,"count":7},{"size":26,"count":50}]
Minimum variable degree2
Maximum variable degree28
Distribution of variable degrees[{"degree":2,"count":25},{"degree":26,"count":24},{"degree":27,"count":1},{"degree":28,"count":25}]
Minimum constraint arity1
Maximum constraint arity26
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":50},{"arity":25,"count":25},{"arity":26,"count":25}]
Number of extensional constraints50
Number of intensional constraints26
Distribution of constraint types[{"type":"extension","count":50},{"type":"intension","count":26},{"type":"count","count":25}]
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)4406369OPT57 62.0919 56.9119
cosoco 2.O parallel (complete)4398569OPT57 76.1582 9.86101
cosoco 2.0 parallel (complete)4409829OPT57 116.748 14.9326
choco-solver 2019-09-20 parallel (complete)4404869OPT57 126.769 17.2939
choco-solver 2019-09-16 (complete)4400369OPT57 130.274 33.2758
AbsCon 2019-07-23 (complete)4391109OPT57 149.386 145.782
choco-solver 2019-09-20 (complete)4403969OPT57 157.692 40.2161
choco-solver 2019-09-16 parallel (complete)4400069OPT57 161.87 21.931
choco-solver 2019-09-24 parallel (complete)4407269OPT57 167.044 22.3755
choco-solver 2019-06-14 parallel (complete)4394409OPT57 213.978 31.534
choco-solver 2019-06-14 (complete)4394109OPT57 219.017 68.3974
PicatSAT 2019-09-12 (complete)4395489OPT57 282.16 282.172
Concrete 3.12.3 (complete)4403069SAT (TO)-933 2400.11 2382.05
Concrete 3.10 (complete)4392009SAT (TO)-944 2400.07 2376.74
cosoco 2.0 (complete)4408929SAT (TO)-25000 2400.03 2400.11
cosoco 2.0 (complete)4397669SAT (TO)-25000 2400.03 2399.8
cosoco 2 (complete)4390209SAT (TO)-25000 2400.04 2400.2
Concrete 3.12.2 (complete)4401269? (TO) 2400.09 2363.53
Concrete 3.12.2 (complete)4396389? (TO) 2400.13 2362.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: 57
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] 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] 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] </list> <values>5 0 1 2 3 6 11 -1 9 4 -1 16 13 8 -1 20 15 12 17 18 21 22 23 24 19 0 21 20 19 18 1 2 -1 16 17 -1 3 14
15 -1 5 4 13 12 11 6 7 8 9 10 -7 6 8 8 -3 4 1 0 3 3 0 6 4 6 0 4 -5 -3 8 3 -2 -1 9 5 0 </values> </instantiation>