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

Result page for benchmark
PrizeCollecting/PrizeCollecting-jok-s1/
PrizeCollecting-24-4-6-7.xml

Jump to solvers results

General information on the benchmark

NamePrizeCollecting/PrizeCollecting-jok-s1/
PrizeCollecting-24-4-6-7.xml
MD5SUMd869450afe9c29c5d3a1d31c4402b074
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark56
Best CPU time to get the best result obtained on this benchmark22.6671
Satisfiable
(Un)Satisfiability was proved
Number of variables72
Number of constraints97
Number of domains24
Minimum domain size3
Maximum domain size25
Distribution of domain sizes[{"size":3,"count":1},{"size":4,"count":8},{"size":5,"count":12},{"size":6,"count":3},{"size":25,"count":48}]
Minimum variable degree2
Maximum variable degree27
Distribution of variable degrees[{"degree":2,"count":24},{"degree":25,"count":23},{"degree":26,"count":1},{"degree":27,"count":24}]
Minimum constraint arity1
Maximum constraint arity25
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":48},{"arity":24,"count":24},{"arity":25,"count":24}]
Number of extensional constraints48
Number of intensional constraints25
Distribution of constraint types[{"type":"extension","count":48},{"type":"intension","count":25},{"type":"count","count":24}]
Optimization problemYES
Type of objectivemax SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 2.0 parallel (complete)4409973OPT56 22.6671 3.11131
choco-solver 2019-09-24 (complete)4406513OPT56 25.4211 21.1733
cosoco 2.O parallel (complete)4398713OPT56 30.1078 4.04397
AbsCon 2019-07-23 (complete)4391253OPT56 32.5361 29.1579
choco-solver 2019-09-16 (complete)4400513OPT56 46.9492 12.332
choco-solver 2019-09-20 (complete)4404113OPT56 47.8939 12.5688
choco-solver 2019-09-24 parallel (complete)4407413OPT56 62.1016 9.15025
choco-solver 2019-09-16 parallel (complete)4400213OPT56 67.7499 10.3447
choco-solver 2019-09-20 parallel (complete)4405013OPT56 75.9148 10.8053
choco-solver 2019-06-14 (complete)4394253OPT56 76.2464 22.0597
PicatSAT 2019-09-12 (complete)4395633OPT56 303.793 303.805
Concrete 3.10 (complete)4392153OPT56 482.159 466.541
Concrete 3.12.3 (complete)4403213OPT56 1114.31 1101.68
cosoco 2 (complete)4390353SAT (TO)-24000 2400.01 2400.01
cosoco 2.0 (complete)4397813SAT (TO)-24000 2400.04 2400.2
cosoco 2.0 (complete)4409073SAT (TO)-24000 2400.05 2400.11
Concrete 3.12.2 (complete)4396533? (TO) 2400.05 2363.04
Concrete 3.12.2 (complete)4401413? (TO) 2400.07 2365.23
choco-solver 2019-06-14 parallel (complete)4394553Wrong Opt.44 23.8317 4.28234

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