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-10-14.xml

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-10-14.xml
MD5SUM2f9116219e9bb224096732f26408ee63
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark72
Best CPU time to get the best result obtained on this benchmark2520.05
Satisfiable
(Un)Satisfiability was proved
Number of variables280
Number of constraints320
Number of domains2
Minimum domain size2
Maximum domain size9
Distribution of domain sizes[{"size":2,"count":140},{"size":9,"count":140}]
Minimum variable degree2
Maximum variable degree10
Distribution of variable degrees[{"degree":2,"count":140},{"degree":7,"count":4},{"degree":8,"count":40},{"degree":10,"count":96}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":140},{"arity":3,"count":40},{"arity":4,"count":4},{"arity":6,"count":40},{"arity":9,"count":96}]
Number of extensional constraints180
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":180},{"type":"sum","count":140}]
Optimization problemYES
Type of objectivemax SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Concrete 3.12.3 (complete)4402954SAT (TO)72 2520.05 2486.04
choco-solver 2019-09-24 (complete)4406254SAT (TO)72 2520.08 2508.45
choco-solver 2019-09-24 parallel (complete)4407154SAT (TO)72 20032.7 2520.14
choco-solver 2019-09-20 (complete)4403854SAT (TO)71 2520.62 635.181
choco-solver 2019-09-20 parallel (complete)4404754SAT (TO)71 20043.9 2520.13
choco-solver 2019-06-14 parallel (complete)4393994SAT (TO)71 20063.7 2520.11
cosoco 2.O parallel (complete)4398454SAT (TO)71 20122.9 2520.02
cosoco 2.0 parallel (complete)4409714SAT (TO)71 20126 2520.02
Concrete 3.10 (complete)4386986SAT (TO)70 2520.04 2461.63
Concrete 3.12.2 (complete)4401154SAT (TO)70 2520.1 2475.23
choco-solver 2019-06-14 (complete)4393394SAT (TO)70 2520.52 635.088
choco-solver 2019-09-16 (complete)4399354SAT (TO)70 2520.68 635.112
choco-solver 2019-09-16 parallel (complete)4399954SAT (TO)70 20030.4 2520.12
Concrete 3.12.2 (complete)4396274SAT (TO)69 2520.13 2484.14
cosoco 2.0 (complete)4408434SAT (TO)66 2519.81 2520.01
cosoco 2 (complete)4389894SAT (TO)66 2520.03 2519.8
cosoco 2.0 (complete)4397174SAT (TO)66 2520.03 2520.01
AbsCon 2019-07-23 (complete)4390994SAT (TO)43 2520.08 2515.71
PicatSAT 2019-09-12 (complete)4395374? (TO) 2519.94 2520.01

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: 72
Solution found:
<instantiation cost = '72'> <list> x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[0][8] x[0][9] x[0][10] x[0][11]
x[0][12] x[0][13] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[1][9] x[1][10] x[1][11] x[1][12] x[1][13]
x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[2][9] x[2][10] x[2][11] x[2][12] x[2][13] x[3][0] x[3][1] x[3][2]
x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[3][9] x[3][10] x[3][11] x[3][12] x[3][13] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5]
x[4][6] x[4][7] x[4][8] x[4][9] x[4][10] x[4][11] x[4][12] x[4][13] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[5][8]
x[5][9] x[5][10] x[5][11] x[5][12] x[5][13] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[6][8] x[6][9] x[6][10]
x[6][11] x[6][12] x[6][13] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[7][9] x[7][10] x[7][11] x[7][12]
x[7][13] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7] x[8][8] x[8][9] x[8][10] x[8][11] x[8][12] x[8][13] x[9][0] x[9][1]
x[9][2] x[9][3] x[9][4] x[9][5] x[9][6] x[9][7] x[9][8] x[9][9] x[9][10] x[9][11] x[9][12] x[9][13] s[0][0] s[0][1] s[0][2] s[0][3] s[0][4]
s[0][5] s[0][6] s[0][7] s[0][8] s[0][9] s[0][10] s[0][11] s[0][12] s[0][13] s[1][0] s[1][1] s[1][2] s[1][3] s[1][4] s[1][5] s[1][6] s[1][7]
s[1][8] s[1][9] s[1][10] s[1][11] s[1][12] s[1][13] s[2][0] s[2][1] s[2][2] s[2][3] s[2][4] s[2][5] s[2][6] s[2][7] s[2][8] s[2][9] s[2][10]
s[2][11] s[2][12] s[2][13] s[3][0] s[3][1] s[3][2] s[3][3] s[3][4] s[3][5] s[3][6] s[3][7] s[3][8] s[3][9] s[3][10] s[3][11] s[3][12]
s[3][13] s[4][0] s[4][1] s[4][2] s[4][3] s[4][4] s[4][5] s[4][6] s[4][7] s[4][8] s[4][9] s[4][10] s[4][11] s[4][12] s[4][13] s[5][0] s[5][1]
s[5][2] s[5][3] s[5][4] s[5][5] s[5][6] s[5][7] s[5][8] s[5][9] s[5][10] s[5][11] s[5][12] s[5][13] s[6][0] s[6][1] s[6][2] s[6][3] s[6][4]
s[6][5] s[6][6] s[6][7] s[6][8] s[6][9] s[6][10] s[6][11] s[6][12] s[6][13] s[7][0] s[7][1] s[7][2] s[7][3] s[7][4] s[7][5] s[7][6] s[7][7]
s[7][8] s[7][9] s[7][10] s[7][11] s[7][12] s[7][13] s[8][0] s[8][1] s[8][2] s[8][3] s[8][4] s[8][5] s[8][6] s[8][7] s[8][8] s[8][9] s[8][10]
s[8][11] s[8][12] s[8][13] s[9][0] s[9][1] s[9][2] s[9][3] s[9][4] s[9][5] s[9][6] s[9][7] s[9][8] s[9][9] s[9][10] s[9][11] s[9][12]
s[9][13] </list> <values> 1 1 0 1 1 0 0 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 1 1 0 0 1 0 1 0 1 0 0 1 0 0 0 1 1 0 1 0 1 0 1 1 1 1 0 1 1 0
1 0 1 0 1 1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 1 1 1 0 0 1 0 1 1 0 1 1 1 1 1 0 0 1 1 1 0 0 1 0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 1 1 1 0 1 0 1 1 1
1 0 0 0 1 0 1 0 1 1 0 1 1 2 2 4 2 3 2 2 2 2 4 2 3 4 2 4 3 5 3 6 2 4 4 3 5 3 5 3 2 3 4 5 2 6 2 5 3 5 6 3 5 4 4 3 3 5 2 6 3 6 3 3 3 2 4 2 2 4
3 5 2 5 2 3 4 5 6 4 4 3 4 2 4 5 3 5 5 5 5 3 3 2 4 5 3 2 3 3 5 3 3 2 3 3 5 4 3 3 2 2 5 3 6 3 6 5 6 4 4 2 5 5 4 2 5 2 4 2 4 3 3 3 5 3 5 3 3 2
3 2 2 2 2 4 3 4 3 2 4 3 3 </values> </instantiation>