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

Result page for benchmark
SteelMillSlab/
SteelMillSlab-m2-simple_c18.xml

Jump to solvers results

General information on the benchmark

NameSteelMillSlab/
SteelMillSlab-m2-simple_c18.xml
MD5SUMea7dbfc1e7b5db2e963c0551f07c3a1e
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark1.79336
Satisfiable
(Un)Satisfiability was proved
Number of variables160
Number of constraints233
Number of domains4
Minimum domain size2
Maximum domain size19
Distribution of domain sizes[{"size":2,"count":130},{"size":5,"count":10},{"size":10,"count":10},{"size":19,"count":10}]
Minimum variable degree2
Maximum variable degree21
Distribution of variable degrees[{"degree":2,"count":110},{"degree":3,"count":10},{"degree":4,"count":20},{"degree":6,"count":10},{"degree":20,"count":8},{"degree":21,"count":2}]
Minimum constraint arity2
Maximum constraint arity11
Distribution of constraint arities[{"arity":2,"count":211},{"arity":3,"count":10},{"arity":10,"count":2},{"arity":11,"count":10}]
Number of extensional constraints10
Number of intensional constraints201
Distribution of constraint types[{"type":"extension","count":10},{"type":"intension","count":201},{"type":"ordered","count":1},{"type":"sum","count":21}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Mistral-2.0 2018-08-01 (complete)4312749OPT0 0.097866 0.098435
Choco-solver 4.0.7b seq (e747e1e) (complete)4302149OPT0 1.79336 0.779606
OscaR - Hybrid 2018-08-14 (complete)4310432OPT0 2.46173 1.36555
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312292OPT0 2.59603 1.38193
Sat4j-CSP 2018-07-11 (complete)4302150OPT0 2.83526 1.51039
Concrete 3.9.2 (complete)4302456OPT0 9.03807 4.75393
Concrete 3.9.2-SuperNG (complete)4302806OPT0 9.44936 4.52324
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310082SAT0 252.06 247.365
cosoco 1.12 (complete)4302151SAT8 0.092681 0.093847

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: 0
Solution found:
<instantiation type="optimum" cost="0"> <list> slab[0] slab[1] slab[2] slab[3] slab[4] slab[5] slab[6] slab[7] slab[8] slab[9] load[0]
load[1] load[2] load[3] load[4] load[5] load[6] load[7] load[8] load[9] loss[0] loss[1] loss[2] loss[3] loss[4] loss[5] loss[6] loss[7]
loss[8] loss[9] y[0][0] y[0][1] y[0][2] y[0][3] y[0][4] y[0][5] y[0][6] y[0][7] y[0][8] y[0][9] y[1][0] y[1][1] y[1][2] y[1][3] y[1][4]
y[1][5] y[1][6] y[1][7] y[1][8] y[1][9] y[2][0] y[2][1] y[2][2] y[2][3] y[2][4] y[2][5] y[2][6] y[2][7] y[2][8] y[2][9] y[3][0] y[3][1]
y[3][2] y[3][3] y[3][4] y[3][5] y[3][6] y[3][7] y[3][8] y[3][9] y[4][0] y[4][1] y[4][2] y[4][3] y[4][4] y[4][5] y[4][6] y[4][7] y[4][8]
y[4][9] y[5][0] y[5][1] y[5][2] y[5][3] y[5][4] y[5][5] y[5][6] y[5][7] y[5][8] y[5][9] y[6][0] y[6][1] y[6][2] y[6][3] y[6][4] y[6][5]
y[6][6] y[6][7] y[6][8] y[6][9] y[7][0] y[7][1] y[7][2] y[7][3] y[7][4] y[7][5] y[7][6] y[7][7] y[7][8] y[7][9] y[8][0] y[8][1] y[8][2]
y[8][3] y[8][4] y[8][5] y[8][6] y[8][7] y[8][8] y[8][9] y[9][0] y[9][1] y[9][2] y[9][3] y[9][4] y[9][5] y[9][6] y[9][7] y[9][8] y[9][9]
z[0][0] z[0][1] z[0][2] z[1][0] z[1][1] z[1][2] z[2][0] z[2][1] z[2][2] z[3][0] z[3][1] z[3][2] z[4][0] z[4][1] z[4][2] z[5][0] z[5][1]
z[5][2] z[6][0] z[6][1] z[6][2] z[7][0] z[7][1] z[7][2] z[8][0] z[8][1] z[8][2] z[9][0] z[9][1] z[9][2] </list> <values> 3 4 1 1 2 0 3 3 5 4
11 11 9 7 5 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0
1 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 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 1 1 0 1 0 1 1 0 1 1 0
0 1 0 0 1 0 0 0 0 0 0 </values> </instantiation>