2019 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
OpenStacks/OpenStacks-m1c-s1/
OpenStacks-m1c-wbp-20-10-1.xml

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m1c-s1/
OpenStacks-m1c-wbp-20-10-1.xml
MD5SUM9a8cbf5cb3e98f462f173e96713d469d
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark8
Best CPU time to get the best result obtained on this benchmark14.9801
Satisfiable
(Un)Satisfiability was proved
Number of variables620
Number of constraints611
Number of domains4
Minimum domain size2
Maximum domain size11
Distribution of domain sizes[{"size":2,"count":400},{"size":3,"count":200},{"size":10,"count":10},{"size":11,"count":10}]
Minimum variable degree2
Maximum variable degree21
Distribution of variable degrees[{"degree":2,"count":230},{"degree":3,"count":380},{"degree":21,"count":10}]
Minimum constraint arity2
Maximum constraint arity21
Distribution of constraint arities[{"arity":2,"count":220},{"arity":3,"count":380},{"arity":10,"count":1},{"arity":21,"count":10}]
Number of extensional constraints200
Number of intensional constraints200
Distribution of constraint types[{"type":"extension","count":200},{"type":"intension","count":200},{"type":"allDifferent","count":1},{"type":"sum","count":10},{"type":"element","count":200}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
(reference) PicatSAT 2019-09-12 (complete)4407879OPT8 14.9801 14.9791
cosoco 2.0 (complete)4408751OPT8 1634.97 1634.95
cosoco 2 (complete)4394824OPT8 1643.84 1643.93
cosoco 2.0 (complete)4397491OPT8 1666.67 1666.73

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: 8
Solution found:
<instantiation> <list> o[][] so[] np[][] r[][] p[]  </list> <values> 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 1 1 0 0 1 1 0 0 0
0 0 0 0 0 0 1 1 1 1 1 1 1 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 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 1 1 0 1 1 1 0 0 0 0 0 0 0 0 1 1 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 1 1 0 0 0 0 0 0 1 1 1
1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0  3 5 7 6 7 7 5 7 8 1  0 0 0 0 0 0 0 1 2 2 0 0 0 0 0 1 1 1 2 2 0 0 0 0 0 0 0 1 2 2 0 1 2 2 2
2 2 2 2 2 0 0 1 1 1 1 1 1 2 2 0 0 1 1 1 2 2 2 2 2 0 0 0 0 1 2 2 2 2 2 1 1 2 2 2 2 2 2 2 2 0 0 0 0 0 0 1 1 2 2 0 0 0 0 0 0 0 1 2 2 0 0 0 1 2
2 2 2 2 2 0 0 0 0 0 0 0 1 2 2 1 1 2 2 2 2 2 2 2 2 0 1 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 0 0 0 0 0 0 0 0 1 2 0 0 0 0 0 1 2 2 2 2 0 0 0 1 1
1 2 2 2 2 0 0 0 1 2 2 2 2 2 2 0 0 1 1 1 2 2 2 2 2  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 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 1 0 0
0 0 0 1 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 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 1 1 0 1 0 1 0 0 0 0 0 0 0 0 1 1 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 1 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 1 1
0 0 0 0 0 0 0 1 0 0 1 0 0 0 0  8 9 0 6 7 5 4 2 1 3   </values> </instantiation>