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

Result page for benchmark
StillLife/StillLife-m1-s1/
StillLife-07-10.xml

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-07-10.xml
MD5SUMebe39bf25244fda615bb1bf8fe88192a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark39
Best CPU time to get the best result obtained on this benchmark31.4095
Satisfiable
(Un)Satisfiability was proved
Number of variables140
Number of constraints166
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":26},{"degree":10,"count":40}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":70},{"arity":3,"count":26},{"arity":4,"count":4},{"arity":6,"count":26},{"arity":9,"count":40}]
Number of extensional constraints96
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":96},{"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)4395600OPT39 31.4095 31.4207
choco-solver 2019-09-24 (complete)4406480OPT39 392.871 388.237
choco-solver 2019-09-16 (complete)4400480OPT39 426.532 108.093
choco-solver 2019-09-20 (complete)4404080OPT39 438.17 110.906
choco-solver 2019-06-14 (complete)4394220OPT39 495.029 127.105
choco-solver 2019-09-16 parallel (complete)4400180OPT39 908.694 115.227
choco-solver 2019-09-24 parallel (complete)4407380OPT39 915.05 116.06
choco-solver 2019-09-20 parallel (complete)4404980OPT39 932.458 118.368
choco-solver 2019-06-14 parallel (complete)4394520OPT39 988.986 125.868
cosoco 2.O parallel (complete)4398680SAT (TO)39 2012.53 252.021
cosoco 2.0 parallel (complete)4409940SAT (TO)39 2012.6 252.02
cosoco 2.0 (complete)4409040SAT (TO)39 2400.03 2400.01
Concrete 3.10 (complete)4392120SAT (TO)39 2400.05 2346.33
Concrete 3.12.2 (complete)4396500SAT (TO)39 2400.06 2363.43
Concrete 3.12.2 (complete)4401380SAT (TO)39 2400.07 2359.23
cosoco 2 (complete)4390320SAT (TO)39 2400.08 2400.11
cosoco 2.0 (complete)4397780SAT (TO)39 2400.1 2400.11
Concrete 3.12.3 (complete)4403180SAT (TO)39 2400.13 2356.14
AbsCon 2019-07-23 (complete)4391220SAT (TO)38 2400.09 2389.91

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