2019 XCSP3 competition: main track (CSP and COP, 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.7674
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)4395301OPT38 41.7674 41.7769
choco-solver 2019-09-24 (complete)4406181OPT38 917.329 912.24
choco-solver 2019-09-20 (complete)4403781OPT38 1676.05 422.794
choco-solver 2019-06-14 (complete)4393321OPT38 2018.97 508.877
choco-solver 2019-09-16 (complete)4399281OPT38 2106.97 531.522
AbsCon 2019-07-23 (complete)4390921OPT38 2421.18 2412.34
choco-solver 2019-09-20 parallel (complete)4404681OPT38 4494.42 566.468
choco-solver 2019-06-14 parallel (complete)4393921OPT38 4525.83 569.74
choco-solver 2019-09-16 parallel (complete)4399881OPT38 4582.26 577.408
choco-solver 2019-09-24 parallel (complete)4407081OPT38 4839.79 609.749
Concrete 3.12.3 (complete)4402881SAT (TO)38 2520.16 2483.06
cosoco 2.O parallel (complete)4398381SAT (TO)38 20125.2 2520.02
cosoco 2.0 parallel (complete)4409641SAT (TO)38 20126.6 2520.02
cosoco 2.0 (complete)4408361SAT (TO)37 2519.38 2520.01
cosoco 2.0 (complete)4397101SAT (TO)37 2519.94 2520.01
cosoco 2 (complete)4389821SAT (TO)37 2520.04 2520.01
Concrete 3.12.2 (complete)4401081SAT (TO)37 2520.05 2475.23
Concrete 3.12.2 (complete)4396201SAT (TO)37 2520.09 2486.63
Concrete 3.10 (complete)4386981SAT (TO)37 2520.11 2464.63

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>