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

Result page for benchmark
PeacableArmies/
PeacableArmies-m2-15_c18.xml

Jump to solvers results

General information on the benchmark

NamePeacableArmies/
PeacableArmies-m2-15_c18.xml
MD5SUMdbf6b3e5a2b5c107908327293d925ea5
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark29
Best CPU time to get the best result obtained on this benchmark2400.29
Satisfiable
(Un)Satisfiability was proved
Number of variables227
Number of constraints5183
Number of domains2
Minimum domain size3
Maximum domain size112
Distribution of domain sizes[{"size":3,"count":225},{"size":112,"count":2}]
Minimum variable degree2
Maximum variable degree58
Distribution of variable degrees[{"degree":2,"count":1},{"degree":3,"count":1},{"degree":44,"count":56},{"degree":46,"count":48},{"degree":48,"count":40},{"degree":50,"count":32},{"degree":52,"count":24},{"degree":54,"count":16},{"degree":56,"count":8},{"degree":58,"count":1}]
Minimum constraint arity2
Maximum constraint arity226
Distribution of constraint arities[{"arity":2,"count":5181},{"arity":226,"count":2}]
Number of extensional constraints0
Number of intensional constraints5181
Distribution of constraint types[{"type":"intension","count":5181},{"type":"count","count":2}]
Optimization problemYES
Type of objectivemax VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Sat4j-CSP 2018-07-11 (complete)4289805SAT (TO)29 2400.29 2392.42
Concrete 3.8 2018-06-13 (complete)4295166SAT (TO)26 2520.08 2457.04
Mistral-2.0 2018-06-15 (complete)4289584SAT (TO)24 2400.08 2400.11
Mistral-2.0 2018-08-01 (complete)4303604SAT (TO)24 2519.89 2520.01
OscaR - Hybrid 2018-08-14 (complete)4308422SAT (TO)23 2520.04 2470.52
Concrete 3.8-SuperNG 2018-06-13 (complete)4295167SAT (TO)21 2520.14 2473.34
Choco-solver 4.0.7 seq (493a269) (complete)4292248SAT (TO)13 2400.04 2365.72
OscaR - Hybrid 2018-07-02 (complete)4291490SAT (TO)13 2400.09 2357.12
Choco-solver 4.0.7b seq (e747e1e) (complete)4306542SAT (TO)13 2520.04 2487.62
cosoco 1.12 (complete)4295168SAT (TO)12 2519.92 2520.01
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290292? (TO) 2400.12 2380.91
PicatSAT 2018-06-15 (complete)4295169? (TO) 2519.89 2520.01
PicatSAT 2018-08-02 (complete)4303018? (TO) 2519.95 2520.02
PicatSAT 2018-08-14 (complete)4309358? (TO) 2519.96 2520.02
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4307836? (TO) 2520.03 2501.51
Concrete 3.9.2 (complete)4304619? (TO) 2520.06 2458.04
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311572? (TO) 2520.08 2501.61
Concrete 3.9.2-SuperNG (complete)4304620? (TO) 2520.13 2455.06

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: 29
Solution found:
<instantiation type="solution"> <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[0][14] 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[1][14] 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[2][14] 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[3][14]
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[4][14] 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[5][14] 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[6][14] 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[7][14] 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[8][14] 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] x[9][14] 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[10][12] x[10][13] x[10][14] 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] x[11][12] x[11][13] x[11][14] x[12][0] x[12][1] x[12][2] x[12][3] x[12][4] x[12][5] x[12][6] x[12][7] x[12][8] x[12][9]
x[12][10] x[12][11] x[12][12] x[12][13] x[12][14] x[13][0] x[13][1] x[13][2] x[13][3] x[13][4] x[13][5] x[13][6] x[13][7] x[13][8] x[13][9]
x[13][10] x[13][11] x[13][12] x[13][13] x[13][14] x[14][0] x[14][1] x[14][2] x[14][3] x[14][4] x[14][5] x[14][6] x[14][7] x[14][8] x[14][9]
x[14][10] x[14][11] x[14][12] x[14][13] x[14][14] nb nw </list> <values> 0 0 0 0 0 0 0 2 2 2 2 2 2 2 0 0 0 0 0 0 0 2 2 2 2 2 2 2 0 0 0 0 0 0
0 0 2 2 2 2 2 2 0 0 0 0 0 0 0 0 0 2 2 2 2 2 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 2 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 2 2 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0
0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 1 0 1 1 1 1 1 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 1 29 29 </values> </instantiation>