2018 XCSP3 competition: sequential solvers tracks: solvers results per benchmarks

Result page for benchmark
StillLife/
StillLife-wastage-08_c18.xml

Jump to solvers results

General information on the benchmark

NameStillLife/
StillLife-wastage-08_c18.xml
MD5SUM7fa074241beecf824461849015848bff
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark36
Best CPU time to get the best result obtained on this benchmark3.65099
Satisfiable
(Un)Satisfiability was proved
Number of variables211
Number of constraints152
Number of domains4
Minimum domain size2
Maximum domain size201
Distribution of domain sizes[{"size":2,"count":100},{"size":3,"count":100},{"size":65,"count":1},{"size":201,"count":10}]
Minimum variable degree1
Maximum variable degree11
Distribution of variable degrees[{"degree":1,"count":4},{"degree":2,"count":97},{"degree":3,"count":13},{"degree":4,"count":32},{"degree":8,"count":28},{"degree":9,"count":36},{"degree":11,"count":1}]
Minimum constraint arity2
Maximum constraint arity12
Distribution of constraint arities[{"arity":2,"count":42},{"arity":3,"count":32},{"arity":10,"count":68},{"arity":11,"count":1},{"arity":12,"count":9}]
Number of extensional constraints96
Number of intensional constraints41
Distribution of constraint types[{"type":"extension","count":96},{"type":"intension","count":41},{"type":"sum","count":11},{"type":"instantiation","count":4}]
Optimization problemYES
Type of objectivemax VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 1.12 (complete)4292923OPT36 3.65099 3.65255
Mistral-2.0 2018-06-15 (complete)4289279OPT36 5.11779 5.13308
Mistral-2.0 2018-08-01 (complete)4303543OPT36 5.15306 5.15905
PicatSAT 2018-06-15 (complete)4292924OPT36 7.6285 7.63375
PicatSAT 2018-08-14 (complete)4309297OPT36 8.74018 8.74632
PicatSAT 2018-08-02 (complete)4302957OPT36 8.78324 8.78391
Choco-solver 4.0.7b seq (e747e1e) (complete)4306481OPT36 13.0827 10.1901
Choco-solver 4.0.7 seq (493a269) (complete)4292187OPT36 13.9549 10.3189
Concrete 3.8 2018-06-13 (complete)4292921OPT36 22.0022 12.4657
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311511OPT36 23.1959 19.7961
Concrete 3.8-SuperNG 2018-06-13 (complete)4292922OPT36 25.5015 14.17
Concrete 3.9.2 (complete)4304149OPT36 26.2881 14.7616
Concrete 3.9.2-SuperNG (complete)4304150OPT36 32.3203 20.2227
OscaR - Hybrid 2018-07-02 (complete)4291429SAT (TO)36 2400.05 2363.33
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290231SAT (TO)36 2400.09 2367.81
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4307775SAT (TO)36 2520.02 2489.62
OscaR - Hybrid 2018-08-14 (complete)4308361SAT (TO)36 2520.03 2458.81
Sat4j-CSP 2018-07-11 (complete)4289744? (TO) 2400.11 2376.84

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: 36
Solution found:
<instantiation type='solution' cost='36'> <list>w[0][0] w[0][1] w[0][2] w[0][3] w[0][4] w[0][5] w[0][6] w[0][7] w[0][8] w[0][9] w[1][0]
w[1][1] w[1][2] w[1][3] w[1][4] w[1][5] w[1][6] w[1][7] w[1][8] w[1][9] w[2][0] w[2][1] w[2][2] w[2][3] w[2][4] w[2][5] w[2][6] w[2][7]
w[2][8] w[2][9] w[3][0] w[3][1] w[3][2] w[3][3] w[3][4] w[3][5] w[3][6] w[3][7] w[3][8] w[3][9] w[4][0] w[4][1] w[4][2] w[4][3] w[4][4]
w[4][5] w[4][6] w[4][7] w[4][8] w[4][9] w[5][0] w[5][1] w[5][2] w[5][3] w[5][4] w[5][5] w[5][6] w[5][7] w[5][8] w[5][9] w[6][0] w[6][1]
w[6][2] w[6][3] w[6][4] w[6][5] w[6][6] w[6][7] w[6][8] w[6][9] w[7][0] w[7][1] w[7][2] w[7][3] w[7][4] w[7][5] w[7][6] w[7][7] w[7][8]
w[7][9] w[8][0] w[8][1] w[8][2] w[8][3] w[8][4] w[8][5] w[8][6] w[8][7] w[8][8] w[8][9] w[9][0] w[9][1] w[9][2] w[9][3] w[9][4] w[9][5]
w[9][6] w[9][7] w[9][8] w[9][9] ws[0] ws[1] ws[2] ws[3] ws[4] ws[5] ws[6] ws[7] ws[8] ws[9] 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[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[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[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[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[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[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[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[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[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] z </list> <values>0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 1 0 0 2 0 0 2 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 2 0 0 2 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0
0 1 0 0 0 2 2 2 8 8 8 14 14 14 16 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 1 0 0 1 1 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 1 0 0 1 1
0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 1 1 0 0 1 1 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 36 </values> </instantiation>