2017 XCSP3 competition: fast COP track (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 benchmark74
Best CPU time to get the best result obtained on this benchmark1992.88
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
choco-solver 4.0.5 par (2017-07-26) (complete)4254829SAT (TO)74 1920.02 242.436
choco-solver 4.0.5 par (2017-08-09) (complete)4271779SAT (TO)74 1992.88 252.091
choco-solver 4.0.5 par (2017-08-18) (complete)4281589SAT (TO)74 1993.28 252.11
OscaR - ALNS 2017-07-26 (complete)4255823SAT (TO)73 248.16701 240.017
OscaR - Hybrid 2017-07-26 (complete)4256817SAT (TO)72 248.498 240.017
Concrete 3.4 (complete)4259799SAT (TO)71 257.32901 240.033
choco-solver 4.0.5 seq (2017-07-26) (complete)4254332SAT (TO)69 243.86 240.00999
choco-solver 4.0.5 seq (2017-08-09) (complete)4270309SAT (TO)69 244.112 240.02299
choco-solver 4.0.5 seq (2017-08-18) (complete)4283059SAT (TO)69 244.183 240.021
Mistral-2.0 2017-07-28 (complete)4259302SAT (TO)69 251.957 252.00999
choco-solver 5a (2017-08-18) (complete)4284529SAT (TO)67 255.22501 240.026
choco-solver 5a (2017-07-26) (complete)4255326SAT (TO)67 255.85001 240.011
cosoco 1.12 (complete)4268839SAT (TO)64 251.91 252.009
cosoco 1.1 (complete)4258805SAT (TO)64 252.005 252.00999
cosoco-sat 1.12 (complete)4266908SAT (TO)61 240.02299 240.00999
sat4j-CSP 2017-07-05 (complete)4258308SAT (TO)55 243.196 240.22701
OscaR - Parallel with EPS 2017-07-26 (complete)4257314SAT (TO)48 1921.2 244.791
OscaR - Parallel with EPS 2017-08-22 (complete)4285999SAT (TO)48 1978.24 252.12
AbsCon-basic 2017-06-11 (complete)4257811SAT (TO)39 243.157 240.01199
OscaR - Conflict Ordering 2017-07-26 (complete)4256320SAT (TO)31 243.422 240.013

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: 74
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[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 1 1 0 1 1 0 1 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 1 0 0 1 0 0
0 0 0 1 0 0 1 0 0 0 0 0 0 1 1 0 1 0 0 1 1 1 1 1 1 1 1 0 1 0 1 1 1 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 1 1 0 1 1 0 1 0 1 0 1 1 0 1 1 0 1 1 0 1 1 0
1 1 0 1 3 3 4 3 3 4 3 3 4 3 3 4 3 3 3 3 4 3 3 4 3 3 4 3 3 4 3 3 4 5 5 5 5 5 5 5 5 5 5 5 5 4 2 3 2 3 3 3 3 3 3 2 2 2 3 2 2 5 4 5 3 4 4 3 5 5
5 5 5 3 2 4 3 5 4 4 4 4 4 3 2 4 3 4 2 3 3 3 2 2 2 3 3 6 3 5 2 2 2 5 5 5 5 5 5 6 3 6 2 5 4 4 2 5 3 3 4 3 3 5 3 6 3 5 3 2 2 3 3 4 3 3 4 3 2 4
2 3 4 2 </values> </instantiation>