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

Result page for benchmark
Rack/
Rack-m1c-s1/Rack-m1c-r4.xml

Jump to solvers results

General information on the benchmark

NameRack/
Rack-m1c-s1/Rack-m1c-r4.xml
MD5SUM82aaf070f4ed513873c305716b97d302
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark1150
Best CPU time to get the best result obtained on this benchmark421.84799
Satisfiable
(Un)Satisfiability was proved
Number of variables90
Number of constraints53
Number of domains7
Minimum domain size2
Maximum domain size11
Distribution of domain sizes[{"size":2,"count":9},{"size":3,"count":18},{"size":5,"count":9},{"size":7,"count":45},{"size":11,"count":9}]
Minimum variable degree2
Maximum variable degree5
Distribution of variable degrees[{"degree":2,"count":27},{"degree":3,"count":52},{"degree":4,"count":9},{"degree":5,"count":2}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":27},{"arity":4,"count":1},{"arity":7,"count":18},{"arity":9,"count":7}]
Number of extensional constraints27
Number of intensional constraints1
Distribution of constraint types[{"type":"extension","count":27},{"type":"intension","count":1},{"type":"ordered","count":1},{"type":"sum","count":24}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
OscaR - Parallel with EPS 2017-08-22 (complete)4286055OPT1150 421.84799 55.118301
OscaR - Parallel with EPS 2017-07-26 (complete)4257199OPT1150 454.59399 58.7127
AbsCon-basic 2017-06-11 (complete)4257696SAT (TO)1150 241.614 240.011
OscaR - Conflict Ordering 2017-07-26 (complete)4256205SAT (TO)1150 243.278 240.02299
choco-solver 4.0.5 seq (2017-07-26) (complete)4254217SAT (TO)1150 243.94 240.00999
choco-solver 4.0.5 seq (2017-08-09) (complete)4270365SAT (TO)1150 244.12801 240.022
sat4j-CSP 2017-07-05 (complete)4258193SAT (TO)1150 244.299 240.226
choco-solver 4.0.5 seq (2017-08-18) (complete)4283115SAT (TO)1150 244.48801 240.02299
OscaR - Hybrid 2017-07-26 (complete)4256702SAT (TO)1150 247.75101 240.02499
OscaR - ALNS 2017-07-26 (complete)4255708SAT (TO)1150 248.19 240.015
choco-solver 5a (2017-08-18) (complete)4284585SAT (TO)1150 253.854 240.02499
choco-solver 5a (2017-07-26) (complete)4255211SAT (TO)1150 254.39 240.00999
Concrete 3.4 (complete)4259684SAT (TO)1150 263.73901 240.034
choco-solver 4.0.5 par (2017-07-26) (complete)4254714SAT (TO)1150 1920.27 243.532
choco-solver 4.0.5 par (2017-08-09) (complete)4271835SAT (TO)1150 1979.9301 252.041
choco-solver 4.0.5 par (2017-08-18) (complete)4281645SAT (TO)1150 1982.6 252.08501
cosoco 1.1 (complete)4258690Signal 0.0049259998 0.32712701
cosoco-sat 1.12 (complete)4266964Signal 0.00501 0.392046
cosoco 1.12 (complete)4268895Signal 0.005072 0.366694
Mistral-2.0 2017-07-28 (complete)4259187Signal 0.0058149998 0.541848

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: 1150
Solution found:
<instantiation> <list> r[0] r[1] r[2] r[3] r[4] r[5] r[6] r[7] r[8] c[0][0] c[0][1] c[0][2] c[0][3] c[0][4] c[0][5] c[1][0] c[1][1] c[1][2]
c[1][3] c[1][4] c[1][5] c[2][0] c[2][1] c[2][2] c[2][3] c[2][4] c[2][5] c[3][0] c[3][1] c[3][2] c[3][3] c[3][4] c[3][5] c[4][0] c[4][1]
c[4][2] c[4][3] c[4][4] c[4][5] c[5][0] c[5][1] c[5][2] c[5][3] c[5][4] c[5][5] c[6][0] c[6][1] c[6][2] c[6][3] c[6][4] c[6][5] c[7][0]
c[7][1] c[7][2] c[7][3] c[7][4] c[7][5] c[8][0] c[8][1] c[8][2] c[8][3] c[8][4] c[8][5] rpw[0] rpw[1] rpw[2] rpw[3] rpw[4] rpw[5] rpw[6]
rpw[7] rpw[8] rcn[0] rcn[1] rcn[2] rcn[3] rcn[4] rcn[5] rcn[6] rcn[7] rcn[8] rpr[0] rpr[1] rpr[2] rpr[3] rpr[4] rpr[5] rpr[6] rpr[7] rpr[8]
</list> <values> 6 6 6 3 2 0 0 0 0 0 1 0 0 1 1 0 5 2 0 0 0 10 0 2 0 0 0 0 0 0 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 300 300 300 150 100 0 0 0 0 64 64 64 8 4 0 0 0 0 300 300 300 150 100 0 0 0 0 </values> </instantiation>