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

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

Jump to solvers results

General information on the benchmark

NameStillLife/StillLife-m1-s1/
StillLife-12-12.xml
MD5SUM34ffd54f86f79986491acf3630731ea6
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark76
Best CPU time to get the best result obtained on this benchmark249.00101
Satisfiable
(Un)Satisfiability was proved
Number of variables288
Number of constraints330
Number of domains2
Minimum domain size2
Maximum domain size9
Distribution of domain sizes[{"size":2,"count":144},{"size":9,"count":144}]
Minimum variable degree2
Maximum variable degree10
Distribution of variable degrees[{"degree":2,"count":144},{"degree":8,"count":44},{"degree":10,"count":100}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":146},{"arity":3,"count":40},{"arity":4,"count":4},{"arity":6,"count":40},{"arity":9,"count":100}]
Number of extensional constraints184
Number of intensional constraints2
Distribution of constraint types[{"type":"extension","count":184},{"type":"intension","count":2},{"type":"sum","count":144}]
Optimization problemYES
Type of objectivemax SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
OscaR - ALNS 2017-07-26 (complete)4255827SAT (TO)76 249.00101 240.028
OscaR - Hybrid 2017-07-26 (complete)4256821SAT (TO)76 249.66 240.01601
Mistral-2.0 2017-07-28 (complete)4259306SAT (TO)76 251.84599 252.009
Concrete 3.4 (complete)4259803SAT (TO)74 257.46701 240.034
choco-solver 4.0.5 par (2017-08-18) (complete)4281593SAT (TO)74 1992.21 252.12399
choco-solver 4.0.5 par (2017-07-26) (complete)4254833SAT (TO)73 1920.02 242.633
choco-solver 4.0.5 par (2017-08-09) (complete)4271783SAT (TO)73 1995.92 252.10201
choco-solver 4.0.5 seq (2017-08-09) (complete)4270313SAT (TO)70 243.30499 240.02299
choco-solver 4.0.5 seq (2017-08-18) (complete)4283063SAT (TO)70 243.57201 240.022
choco-solver 4.0.5 seq (2017-07-26) (complete)4254336SAT (TO)70 243.84 240.00999
choco-solver 5a (2017-08-18) (complete)4284533SAT (TO)69 255.028 240.02499
choco-solver 5a (2017-07-26) (complete)4255330SAT (TO)69 255.3 240.00999
sat4j-CSP 2017-07-05 (complete)4258312SAT (TO)64 243.11099 240.215
cosoco-sat 1.12 (complete)4266912SAT (TO)58 240.024 240.00999
cosoco 1.12 (complete)4268843SAT (TO)50 251.907 252.00999
cosoco 1.1 (complete)4258809SAT (TO)50 252.04201 252.00999
OscaR - Parallel with EPS 2017-08-22 (complete)4286003SAT (TO)48 1979.2 252.12801
OscaR - Parallel with EPS 2017-07-26 (complete)4257318SAT (TO)47 1920.97 244.825
AbsCon-basic 2017-06-11 (complete)4257815SAT (TO)42 243.985 240.013
OscaR - Conflict Ordering 2017-07-26 (complete)4256324SAT (TO)32 243.246 240.02299

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