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

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

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-06-11.xml
MD5SUM5296a674fcd135b0317e95ffe6d81fd1
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark34
Best CPU time to get the best result obtained on this benchmark38.7624
Satisfiable
(Un)Satisfiability was proved
Number of variables132
Number of constraints158
Number of domains2
Minimum domain size2
Maximum domain size9
Distribution of domain sizes[{"size":2,"count":66},{"size":9,"count":66}]
Minimum variable degree2
Maximum variable degree10
Distribution of variable degrees[{"degree":2,"count":66},{"degree":7,"count":4},{"degree":8,"count":26},{"degree":10,"count":36}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":66},{"arity":3,"count":26},{"arity":4,"count":4},{"arity":6,"count":26},{"arity":9,"count":36}]
Number of extensional constraints92
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":92},{"type":"sum","count":66}]
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)4395602OPT34 38.7624 38.7654
choco-solver 2019-09-20 (complete)4404082OPT34 559.846 141.637
choco-solver 2019-06-14 (complete)4394222OPT34 568.74 143.946
choco-solver 2019-09-16 (complete)4400482OPT34 571.86 144.667
choco-solver 2019-09-24 (complete)4406482OPT34 591.966 586.865
choco-solver 2019-09-24 parallel (complete)4407382OPT34 1222.18 154.667
AbsCon 2019-07-23 (complete)4391222OPT34 1225.15 1218.68
choco-solver 2019-09-16 parallel (complete)4400182OPT34 1294.27 163.839
choco-solver 2019-09-20 parallel (complete)4404982OPT34 1296.74 164.273
choco-solver 2019-06-14 parallel (complete)4394522OPT34 1394.06 175.814
cosoco 2.0 parallel (complete)4409942SAT (TO)34 2012.56 252.02
cosoco 2.O parallel (complete)4398682SAT (TO)34 2012.63 252.024
cosoco 2 (complete)4390322SAT (TO)34 2400.02 2399.9
cosoco 2.0 (complete)4409042SAT (TO)34 2400.04 2400.01
cosoco 2.0 (complete)4397782SAT (TO)34 2400.06 2400.2
Concrete 3.12.2 (complete)4396502SAT (TO)34 2400.07 2363.04
Concrete 3.12.2 (complete)4401382SAT (TO)34 2400.09 2357.63
Concrete 3.12.3 (complete)4403182SAT (TO)34 2400.15 2365.48
Concrete 3.10 (complete)4392122SAT (TO)34 2400.15 2347.74

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