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

Result page for benchmark
OpenStacks/OpenStacks-m2c-s1/
OpenStacks-m2c-pb-20-20-1.xml

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m2c-s1/
OpenStacks-m2c-pb-20-20-1.xml
MD5SUMfba97587c84e09253678fbe4a2f6ebc1
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark11
Best CPU time to get the best result obtained on this benchmark244.642
Satisfiable
(Un)Satisfiability was proved
Number of variables480
Number of constraints461
Number of domains3
Minimum domain size2
Maximum domain size21
Distribution of domain sizes[{"size":2,"count":400},{"size":20,"count":60},{"size":21,"count":20}]
Minimum variable degree2
Maximum variable degree21
Distribution of variable degrees[{"degree":2,"count":420},{"degree":5,"count":4},{"degree":7,"count":4},{"degree":9,"count":6},{"degree":11,"count":5},{"degree":13,"count":1},{"degree":21,"count":40}]
Minimum constraint arity2
Maximum constraint arity21
Distribution of constraint arities[{"arity":2,"count":2},{"arity":3,"count":408},{"arity":4,"count":12},{"arity":5,"count":6},{"arity":6,"count":4},{"arity":7,"count":6},{"arity":9,"count":2},{"arity":20,"count":1},{"arity":21,"count":20}]
Number of extensional constraints400
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":400},{"type":"allDifferent","count":1},{"type":"sum","count":20},{"type":"minimum","count":20},{"type":"maximum","count":20}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
AbsCon-basic 2017-06-11 (complete)4257613SAT (TO)11 244.642 240.013
choco-solver 4.0.5 seq (2017-07-26) (complete)4254134SAT (TO)11 244.71001 240.07401
choco-solver 4.0.5 seq (2017-08-18) (complete)4283177SAT (TO)11 244.72 240.02
choco-solver 4.0.5 seq (2017-08-09) (complete)4270427SAT (TO)11 244.826 240.02
Mistral-2.0 2017-07-28 (complete)4259104SAT (TO)11 251.933 252.011
OscaR - Hybrid 2017-07-26 (complete)4256619SAT (TO)11 252.478 240.036
Concrete 3.4 (complete)4259601SAT (TO)11 260.71899 240.035
choco-solver 4.0.5 par (2017-07-26) (complete)4254631SAT (TO)11 1920.6899 241.636
OscaR - Parallel with EPS 2017-07-26 (complete)4257116SAT (TO)11 1920.87 243.925
OscaR - Parallel with EPS 2017-08-22 (complete)4286117SAT (TO)11 1985.24 252.12801
choco-solver 4.0.5 par (2017-08-09) (complete)4271897SAT (TO)11 2002.15 252.10699
choco-solver 4.0.5 par (2017-08-18) (complete)4281707SAT (TO)11 2004 252.118
cosoco 1.12 (complete)4268957SAT (TO)12 240.007 240.00999
cosoco-sat 1.12 (complete)4267026SAT (TO)12 240.03101 240.00999
choco-solver 5a (2017-07-26) (complete)4255128SAT (TO)12 250.42999 240.01801
cosoco 1.1 (complete)4258607SAT (TO)12 251.967 252.00999
OscaR - ALNS 2017-07-26 (complete)4255625SAT (TO)12 252.088 240.02699
choco-solver 5a (2017-08-18) (complete)4284647SAT (TO)12 254.01601 240.02499
OscaR - Conflict Ordering 2017-07-26 (complete)4256122SAT (TO)13 246.12801 240.026
sat4j-CSP 2017-07-05 (complete)4258110? (TO) 256.716 240.228

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