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

Result page for benchmark
PseudoBoolean-opt/
Pb-garden-4x4_c18.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean-opt/
Pb-garden-4x4_c18.xml
MD5SUM854371ae6c45321a117efbc84c9832b3
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark4
Best CPU time to get the best result obtained on this benchmark0.005835
Satisfiable
(Un)Satisfiability was proved
Number of variables16
Number of constraints16
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":16}]
Minimum variable degree4
Maximum variable degree6
Distribution of variable degrees[{"degree":4,"count":4},{"degree":5,"count":8},{"degree":6,"count":4}]
Minimum constraint arity3
Maximum constraint arity5
Distribution of constraint arities[{"arity":3,"count":4},{"arity":4,"count":8},{"arity":5,"count":4}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":16}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 1.12 (complete)4301344OPT4 0.005835 0.00793502
Mistral-2.0 2018-08-01 (complete)4312484OPT4 0.006412 0.0072551
Sat4j-CSP 2018-07-11 (complete)4301343OPT4 0.614996 0.569734
Choco-solver 4.0.7b seq (e747e1e) (complete)4301342OPT4 0.878296 0.478785
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312229OPT4 1.53189 1.02473
OscaR - Hybrid 2018-08-14 (complete)4310369OPT4 1.55955 1.04694
Concrete 3.9.2-SuperNG (complete)4302743OPT4 7.08905 3.65102
Concrete 3.9.2 (complete)4302393OPT4 7.10535 3.63975
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310019SAT4 251.16 247.365

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: 4
Solution found:
<instantiation type='solution' cost='4'> <list>x[0] x[10] x[11] x[12] x[13] x[14] x[15] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] </list>
<values>0 0 0 0 0 1 0 1 0 0 0 0 0 1 1 0 </values> </instantiation>