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

Result page for benchmark
CrosswordDesign/
CrosswordDesign-03-4-rom_c18.xml

Jump to solvers results

General information on the benchmark

NameCrosswordDesign/
CrosswordDesign-03-4-rom_c18.xml
MD5SUM72d3aa8b8ce65786440ef6159c4b95ee
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark12
Best CPU time to get the best result obtained on this benchmark5.20015
Satisfiable
(Un)Satisfiability was proved
Number of variables81
Number of constraints24
Number of domains5
Minimum domain size2
Maximum domain size1359
Distribution of domain sizes[{"size":2,"count":6},{"size":4,"count":42},{"size":27,"count":9},{"size":1359,"count":24}]
Minimum variable degree1
Maximum variable degree8
Distribution of variable degrees[{"degree":1,"count":30},{"degree":2,"count":42},{"degree":8,"count":9}]
Minimum constraint arity6
Maximum constraint arity7
Distribution of constraint arities[{"arity":6,"count":6},{"arity":7,"count":18}]
Number of extensional constraints24
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":24}]
Optimization problemYES
Type of objectivemax SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Choco-solver 4.0.7b par (e747e1e) (complete)4297393OPT12 5.20015 1.61049
OscaR - Parallel with EPS 2018-08-14 (complete)4308749OPT12 14.9835 5.37908
OscaR - Parallel with EPS 2018-07-02 (complete)4290980OPT12 15.835 5.61092

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: 12
Solution found:
<instantiation> <list>r[0][0] r[0][1] r[0][2] r[0][3] r[1][0] r[1][1] r[1][2] r[1][3] r[2][0] r[2][1] r[2][2] r[2][3] c[0][0] c[0][1]
c[0][2] c[0][3] c[1][0] c[1][1] c[1][2] c[1][3] c[2][0] c[2][1] c[2][2] c[2][3] pr[0][0] pr[0][1] pr[0][2] pr[0][3] pr[1][0] pr[1][1]
pr[1][2] pr[1][3] pr[2][0] pr[2][1] pr[2][2] pr[2][3] pc[0][0] pc[0][1] pc[0][2] pc[0][3] pc[1][0] pc[1][1] pc[1][2] pc[1][3] pc[2][0]
pc[2][1] pc[2][2] pc[2][3] br[0][0] br[0][1] br[0][2] br[0][3] br[1][0] br[1][1] br[1][2] br[1][3] br[2][0] br[2][1] br[2][2] br[2][3]
bc[0][0] bc[0][1] bc[0][2] bc[0][3] bc[1][0] bc[1][1] bc[1][2] bc[1][3] bc[2][0] bc[2][1] bc[2][2] bc[2][3] x[0][0] x[0][1] x[0][2] x[1][0]
x[1][1] x[1][2] x[2][0] x[2][1] x[2][2] </list> <values>865 -1 -1 -1 860 -1 -1 -1 860 -1 -1 -1 865 -1 -1 -1 860 -1 -1 -1 860 -1 -1 -1 1 -1
-1 -1 0 -1 -1 -1 0 -1 -1 -1 1 -1 -1 -1 0 -1 -1 -1 0 -1 -1 -1 0 0 0 0 3 0 0 0 3 0 0 0 0 0 0 0 3 0 0 0 3 0 0 0 26 15 15 15 14 14 15 14 14
</values> </instantiation>