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

Result page for benchmark
StillLife/StillLife-m1-s1/
StillLife-05-14.xml

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-05-14.xml
MD5SUMff3476fab8d1f67b2009ab5045109208
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark40
Best CPU time to get the best result obtained on this benchmark28.2352
Satisfiable
(Un)Satisfiability was proved
Number of variables140
Number of constraints170
Number of domains2
Minimum domain size2
Maximum domain size9
Distribution of domain sizes[{"size":2,"count":70},{"size":9,"count":70}]
Minimum variable degree2
Maximum variable degree10
Distribution of variable degrees[{"degree":2,"count":70},{"degree":7,"count":4},{"degree":8,"count":30},{"degree":10,"count":36}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":70},{"arity":3,"count":30},{"arity":4,"count":4},{"arity":6,"count":30},{"arity":9,"count":36}]
Number of extensional constraints100
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":100},{"type":"sum","count":70}]
Optimization problemYES
Type of objectivemax SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4395604OPT40 28.2352 28.2392
choco-solver 2019-09-24 (complete)4406484OPT40 425.501 420.586
choco-solver 2019-09-16 (complete)4400484OPT40 613.032 155.443
choco-solver 2019-09-20 (complete)4404084OPT40 786.333 198.685
choco-solver 2019-06-14 (complete)4394224OPT40 806.69 204.033
AbsCon 2019-07-23 (complete)4391224OPT40 835.412 828.3
choco-solver 2019-06-14 parallel (complete)4394524OPT40 1250.35 157.89
choco-solver 2019-09-20 parallel (complete)4404984OPT40 1399.24 177.051
choco-solver 2019-09-16 parallel (complete)4400184OPT40 1400.74 177.252
choco-solver 2019-09-24 parallel (complete)4407384OPT40 1504.83 190.066
cosoco 2.O parallel (complete)4398684SAT (TO)40 2012.56 252.021
cosoco 2 (complete)4390324SAT (TO)40 2400.04 2400.01
cosoco 2.0 (complete)4397784SAT (TO)40 2400.05 2399.8
cosoco 2.0 (complete)4409044SAT (TO)40 2400.07 2400.11
Concrete 3.12.2 (complete)4401384SAT (TO)40 2400.08 2357.23
Concrete 3.10 (complete)4392124SAT (TO)40 2400.14 2346.04
cosoco 2.0 parallel (complete)4409944SAT (TO)39 2012.55 252.021
Concrete 3.12.2 (complete)4396504SAT (TO)39 2400.09 2363.83
Concrete 3.12.3 (complete)4403184SAT (TO)38 2400.14 2356.53

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: 40
Solution found:
<instantiation> <list> x[][] s[][]  </list> <values> 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1
0 1 1 0 1 1 0 1 1 0 1 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1  3 3 4 3 3 4 3 3 4 3 3 4 3 3 3 3 4 3 3 4 3 3 4 3 3 4 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 3 3
4 3 3 4 3 3 4 3 3 4 3 3 3 3 4 3 3 4 3 3 4 3 3 4 3 3   </values> </instantiation>