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

Result page for benchmark
OpenStacks/OpenStacks-m1c-s1/
OpenStacks-m1c-wbop-30-15-1.xml

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m1c-s1/
OpenStacks-m1c-wbop-30-15-1.xml
MD5SUM097039f9865a2fa48b7d42a66e75794b
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark10
Best CPU time to get the best result obtained on this benchmark23.5768
Satisfiable
(Un)Satisfiability was proved
Number of variables1380
Number of constraints1366
Number of domains4
Minimum domain size2
Maximum domain size16
Distribution of domain sizes[{"size":2,"count":900},{"size":3,"count":450},{"size":15,"count":15},{"size":16,"count":15}]
Minimum variable degree2
Maximum variable degree31
Distribution of variable degrees[{"degree":2,"count":495},{"degree":3,"count":870},{"degree":31,"count":15}]
Minimum constraint arity2
Maximum constraint arity31
Distribution of constraint arities[{"arity":2,"count":480},{"arity":3,"count":870},{"arity":15,"count":1},{"arity":31,"count":15}]
Number of extensional constraints450
Number of intensional constraints450
Distribution of constraint types[{"type":"extension","count":450},{"type":"intension","count":450},{"type":"allDifferent","count":1},{"type":"sum","count":15},{"type":"element","count":450}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
AbsCon 2019-07-23 (complete)4390878OPT10 23.5768 17.481
choco-solver 2019-09-20 (complete)4403738OPT10 24.9201 6.63803
choco-solver 2019-09-16 (complete)4399238OPT10 26.6864 7.10522
choco-solver 2019-06-14 (complete)4393278OPT10 28.0031 7.43779
choco-solver 2019-09-24 (complete)4406138OPT10 33.7578 28.4284
choco-solver 2019-06-14 parallel (complete)4393878OPT10 43.6154 6.71704
choco-solver 2019-09-24 parallel (complete)4407038OPT10 45.9691 6.67109
choco-solver 2019-09-16 parallel (complete)4399838OPT10 47.787 6.91313
choco-solver 2019-09-20 parallel (complete)4404638OPT10 48.7816 7.07233
PicatSAT 2019-09-12 (complete)4395258OPT10 49.3609 49.3699
Concrete 3.10 (complete)4387505OPT10 379.965 352.44
Concrete 3.12.3 (complete)4402838OPT10 840.876 813.622
Concrete 3.12.2 (complete)4401038OPT10 1016.07 987.12
Concrete 3.12.2 (complete)4396158SAT (TO)10 2520.13 2480.34
cosoco 2.O parallel (complete)4398338SAT (TO)10 20121.5 2520.02
cosoco 2.0 parallel (complete)4409598SAT (TO)10 20122 2520.03
cosoco 2 (complete)4389778SAT (TO)11 2519.95 2520.01
cosoco 2.0 (complete)4408318SAT (TO)11 2520.04 2520.01
cosoco 2.0 (complete)4397058SAT (TO)11 2520.06 2520.01

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