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

Result page for benchmark
StillLife/StillLife-m1-s1/
StillLife-06-12.xml

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-06-12.xml
MD5SUM7162d4a2bfb4649e5ff01c254dbd946c
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark38
Best CPU time to get the best result obtained on this benchmark41.4225
Satisfiable
(Un)Satisfiability was proved
Number of variables144
Number of constraints172
Number of domains2
Minimum domain size2
Maximum domain size9
Distribution of domain sizes[{"size":2,"count":72},{"size":9,"count":72}]
Minimum variable degree2
Maximum variable degree10
Distribution of variable degrees[{"degree":2,"count":72},{"degree":7,"count":4},{"degree":8,"count":28},{"degree":10,"count":40}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":72},{"arity":3,"count":28},{"arity":4,"count":4},{"arity":6,"count":28},{"arity":9,"count":40}]
Number of extensional constraints100
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":100},{"type":"sum","count":72}]
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)4395601OPT38 41.4225 41.4288
choco-solver 2019-09-24 (complete)4406481OPT38 951.217 944.298
choco-solver 2019-09-16 (complete)4400481OPT38 1784.92 449.896
choco-solver 2019-06-14 (complete)4394221OPT38 1827.09 461.108
choco-solver 2019-09-20 (complete)4404081OPT38 1905.97 480.49
choco-solver 2019-06-14 parallel (complete)4394521OPT38 3893.33 530.399
choco-solver 2019-09-16 parallel (complete)4400181SAT (TO)38 1995.37 252.094
choco-solver 2019-09-20 parallel (complete)4404981SAT (TO)38 1995.49 252.117
Concrete 3.10 (complete)4392121SAT (TO)38 2400.06 2346.83
Concrete 3.12.2 (complete)4396501SAT (TO)38 2400.1 2363.43
AbsCon 2019-07-23 (complete)4391221SAT (TO)38 2400.11 2388.51
Concrete 3.12.3 (complete)4403181SAT (TO)38 2400.15 2366.63
choco-solver 2019-09-24 parallel (complete)4407381SAT (TO)37 1995.77 252.1
cosoco 2.O parallel (complete)4398681SAT (TO)37 2012.57 252.02
cosoco 2.0 parallel (complete)4409941SAT (TO)37 2012.83 252.023
cosoco 2.0 (complete)4409041SAT (TO)37 2400.01 2400.2
cosoco 2 (complete)4390321SAT (TO)37 2400.04 2399.9
cosoco 2.0 (complete)4397781SAT (TO)37 2400.09 2400.8
Concrete 3.12.2 (complete)4401381SAT (TO)37 2400.09 2356.14

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