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

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

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m1-s1/
OpenStacks-m1-wbop-30-15-1.xml
MD5SUMb5169c90aef0d626aba0e990e84095c1
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 benchmark22.9143
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)4390854OPT10 22.9143 17.4965
choco-solver 2019-09-16 (complete)4399214OPT10 23.9583 6.38646
choco-solver 2019-09-20 (complete)4403714OPT10 24.8375 6.60057
choco-solver 2019-06-14 (complete)4393254OPT10 27.3968 7.25877
choco-solver 2019-09-24 (complete)4406114OPT10 32.971 27.8408
PicatSAT 2019-09-12 (complete)4395234OPT10 47.8127 47.824
choco-solver 2019-09-20 parallel (complete)4404614OPT10 48.0784 6.95332
choco-solver 2019-09-16 parallel (complete)4399814OPT10 49.8157 7.18008
choco-solver 2019-09-24 parallel (complete)4407014OPT10 51.443 7.42555
choco-solver 2019-06-14 parallel (complete)4393854OPT10 54.4314 7.74911
Concrete 3.12.2 (complete)4401014SAT (TO)10 2520.06 2471.53
Concrete 3.12.3 (complete)4402814SAT (TO)10 2520.08 2471.63
Concrete 3.12.2 (complete)4396134SAT (TO)10 2520.1 2476.83
Concrete 3.10 (complete)4387154SAT (TO)10 2520.12 2459.44
cosoco 2.0 parallel (complete)4409574SAT (TO)10 20120 2520.03
cosoco 2.O parallel (complete)4398314SAT (TO)10 20120.2 2520.02
cosoco 2.0 (complete)4408294SAT (TO)11 2519.78 2520.01
cosoco 2.0 (complete)4397034SAT (TO)11 2520.04 2520.01
cosoco 2 (complete)4389754SAT (TO)11 2520.09 2519.9

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>