2018 XCSP3 competition: fast COP track: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NamePeacableArmies/
PeacableArmies-m2-07_c18.xml
MD5SUMd533abf730bec48b9e0ac1943d19d6b7
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark7
Best CPU time to get the best result obtained on this benchmark22.2788
Satisfiable
(Un)Satisfiability was proved
Number of variables51
Number of constraints479
Number of domains2
Minimum domain size3
Maximum domain size24
Distribution of domain sizes[{"size":3,"count":49},{"size":24,"count":2}]
Minimum variable degree2
Maximum variable degree26
Distribution of variable degrees[{"degree":2,"count":1},{"degree":3,"count":1},{"degree":20,"count":24},{"degree":22,"count":16},{"degree":24,"count":8},{"degree":26,"count":1}]
Minimum constraint arity2
Maximum constraint arity50
Distribution of constraint arities[{"arity":2,"count":477},{"arity":50,"count":2}]
Number of extensional constraints0
Number of intensional constraints477
Distribution of constraint types[{"type":"intension","count":477},{"type":"count","count":2}]
Optimization problemYES
Type of objectivemax VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Choco-solver 4.0.7b seq (e747e1e) (complete)4301981OPT7 22.2788 18.3009
Sat4j-CSP 2018-07-11 (complete)4301982OPT7 30.6477 28.5882
Mistral-2.0 2018-08-01 (complete)4312693SAT (TO)7 252.009 252.01
cosoco 1.12 (complete)4301983SAT (TO)7 252.012 252.011
OscaR - Hybrid 2018-08-14 (complete)4310292SAT (TO)7 252.13 244.031
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312152SAT6 251.321 247.372
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309942SAT4 251.533 247.368
Concrete 3.9.2 (complete)4302316? (TO) 252.089 240.637
Concrete 3.9.2-SuperNG (complete)4302666? (TO) 252.129 237.939

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: 7
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[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6]
x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[4][0] x[4][1] x[4][2]
x[4][3] x[4][4] x[4][5] x[4][6] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5]
x[6][6] nb nw </list> <values>0 0 0 0 0 2 0 0 0 0 0 2 0 2 1 1 1 0 0 0 0 0 0 0 0 2 0 2 0 0 0 0 0 2 2 0 1 0 1 0 0 0 1 0 1 0 0 0 0 7 7
</values> </instantiation>