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

Result page for benchmark
TemplateDesign/
TemplateDesign-m1-1_c18.xml

Jump to solvers results

General information on the benchmark

NameTemplateDesign/
TemplateDesign-m1-1_c18.xml
MD5SUM3db83836fd15e943f67e7808e5ced101
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark2
Best CPU time to get the best result obtained on this benchmark2.17568
Satisfiable
(Un)Satisfiability was proved
Number of variables24
Number of constraints22
Number of domains6
Minimum domain size2
Maximum domain size880
Distribution of domain sizes[{"size":2,"count":3},{"size":5,"count":9},{"size":275,"count":3},{"size":550,"count":3},{"size":801,"count":3},{"size":880,"count":3}]
Minimum variable degree2
Maximum variable degree5
Distribution of variable degrees[{"degree":2,"count":15},{"degree":3,"count":6},{"degree":5,"count":3}]
Minimum constraint arity2
Maximum constraint arity3
Distribution of constraint arities[{"arity":2,"count":6},{"arity":3,"count":16}]
Number of extensional constraints0
Number of intensional constraints15
Distribution of constraint types[{"type":"intension","count":15},{"type":"ordered","count":1},{"type":"sum","count":6}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Choco-solver 4.0.7b par (e747e1e) (complete)4297565OPT2 2.17568 0.783922
OscaR - Parallel with EPS 2018-07-02 (complete)4291152OPT2 10.6084 4.10441
OscaR - Parallel with EPS 2018-08-14 (complete)4308921OPT2 10.666 4.25737

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: 2
Solution found:
<instantiation> <list>d[0][0] d[0][1] d[0][2] d[1][0] d[1][1] d[1][2] d[2][0] d[2][1] d[2][2] npt[0] npt[1] npt[2] u[0] u[1] u[2] nptv[0][0]
nptv[0][1] nptv[0][2] nptv[1][0] nptv[1][1] nptv[1][2] nptv[2][0] nptv[2][1] nptv[2][2] </list> <values>0 2 2 2 0 2 4 0 0 261 119 0 1 1 0 0
522 522 238 0 238 0 0 0 </values> </instantiation>