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

Result page for benchmark
PseudoBoolean-opt/
Pb-garden-7x7_c18.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean-opt/
Pb-garden-7x7_c18.xml
MD5SUMb012ef5fa7bba6c8b791df977729af7d
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 benchmark266.318
Satisfiable
(Un)Satisfiability was proved
Number of variables49
Number of constraints49
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":49}]
Minimum variable degree4
Maximum variable degree6
Distribution of variable degrees[{"degree":4,"count":4},{"degree":5,"count":20},{"degree":6,"count":25}]
Minimum constraint arity3
Maximum constraint arity5
Distribution of constraint arities[{"arity":3,"count":4},{"arity":4,"count":20},{"arity":5,"count":25}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":49}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
OscaR - Parallel with EPS 2018-07-02 (complete)4291079OPT12 99.3981 14.2789
OscaR - Parallel with EPS 2018-08-14 (complete)4308848OPT12 105.156 14.9164
Choco-solver 4.0.7b par (e747e1e) (complete)4297492OPT12 266.318 37.4827

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> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20]
x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43]
x[44] x[45] x[46] x[47] x[48] </list> <values> 0 1 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 1 0 1 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0
1 0 </values> </instantiation>