2017 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
PseudoBoolean/PseudoBoolean-opt-domset/
Pb-domset-v500-e2000-w30-mw19-11.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-opt-domset/
Pb-domset-v500-e2000-w30-mw19-11.xml
MD5SUM4a86fdd9abdf3f491c5a6082e8161c48
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark211
Best CPU time to get the best result obtained on this benchmark242.164
Satisfiable
(Un)Satisfiability was proved
Number of variables473
Number of constraints473
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":473}]
Minimum variable degree5
Maximum variable degree18
Distribution of variable degrees[{"degree":5,"count":4},{"degree":6,"count":18},{"degree":7,"count":57},{"degree":8,"count":74},{"degree":9,"count":73},{"degree":10,"count":67},{"degree":11,"count":50},{"degree":12,"count":46},{"degree":13,"count":36},{"degree":14,"count":21},{"degree":15,"count":15},{"degree":16,"count":7},{"degree":17,"count":3},{"degree":18,"count":2}]
Minimum constraint arity4
Maximum constraint arity17
Distribution of constraint arities[{"arity":4,"count":4},{"arity":5,"count":18},{"arity":6,"count":57},{"arity":7,"count":74},{"arity":8,"count":73},{"arity":9,"count":67},{"arity":10,"count":50},{"arity":11,"count":46},{"arity":12,"count":36},{"arity":13,"count":21},{"arity":14,"count":15},{"arity":15,"count":7},{"arity":16,"count":3},{"arity":17,"count":2}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":473}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
AbsCon-basic 2017-06-11 (complete)4257645SAT (TO)211 242.164 240.00999
OscaR - Hybrid 2017-07-26 (complete)4256651SAT (TO)212 248.62 240.033
OscaR - ALNS 2017-07-26 (complete)4255657SAT (TO)212 249.41901 240.02699
choco-solver 4.0.5 par (2017-08-18) (complete)4281445SAT (TO)215 1988.12 252.132
choco-solver 4.0.5 par (2017-08-09) (complete)4271635SAT (TO)215 1993.73 252.105
choco-solver 4.0.5 par (2017-07-26) (complete)4254663SAT (TO)216 1920.5699 243.52499
cosoco-sat 1.12 (complete)4266764SAT (TO)221 240.024 240.00999
Concrete 3.4 (complete)4259633SAT (TO)224 252.112 221.237
choco-solver 4.0.5 seq (2017-07-26) (complete)4254166SAT (TO)225 243.52 240.00999
choco-solver 4.0.5 seq (2017-08-09) (complete)4270165SAT (TO)225 243.56799 240.022
choco-solver 4.0.5 seq (2017-08-18) (complete)4282915SAT (TO)225 243.66901 240.021
cosoco 1.1 (complete)4258639SAT (TO)225 251.938 252.00999
cosoco 1.12 (complete)4268695SAT (TO)225 251.952 252.00999
choco-solver 5a (2017-08-18) (complete)4284385SAT (TO)226 253.658 240.026
choco-solver 5a (2017-07-26) (complete)4255160SAT (TO)226 255.60001 240.00999
Mistral-2.0 2017-07-28 (complete)4259136SAT (TO)228 251.91901 252.009
sat4j-CSP 2017-07-05 (complete)4258142SAT (TO)251 243.43401 240.22701
OscaR - Parallel with EPS 2017-07-26 (complete)4257148SAT (TO)357 1921.3 244.21001
OscaR - Parallel with EPS 2017-08-22 (complete)4285855SAT (TO)357 1981.67 252.13499
OscaR - Conflict Ordering 2017-07-26 (complete)4256154SAT (TO)359 242.515 240.024

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: 211
Solution found:
<instantiation id='sol11' type='solution' cost='211'>  <list> x[] </list>  <values> 0 0 1 0 1 1 0 1 0 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 1 0 1 0
1 0 0 1 0 1 0 1 1 1 0 0 0 1 0 0 1 1 1 0 0 1 0 1 0 1 0 1 0 0 0 0 1 0 1 0 1 1 0 1 0 1 0 0 0 0 0 0 1 1 0 0 1 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 0
0 1 0 1 1 0 0 0 1 1 0 0 1 1 0 0 0 1 1 1 0 0 1 1 0 1 0 0 1 1 0 1 1 0 0 0 0 1 0 1 0 1 0 1 1 0 0 0 0 0 1 0 0 1 1 1 0 0 0 1 0 1 0 0 1 0 0 0 0 1
0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 0 0 1 1 0 0 0 0 1 0 1 1 1 0 0 1 0 0 0 1 0 1 0 1 1 0 1 0 0 1 0 0 1 1 0 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 0 0 1 0 1
1 0 0 0 0 0 1 0 1 0 1 0 1 0 0 1 1 1 0 0 1 1 0 1 0 0 1 0 1 0 0 0 0 0 1 1 1 0 1 0 0 1 1 1 1 1 0 1 1 0 1 0 1 0 1 0 0 1 0 1 1 1 0 0 0 0 1 0 0 1
0 1 0 1 0 0 0 1 0 1 1 0 0 0 0 1 0 0 0 1 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 0 1 0 0 1 1 1 0 1 0 1 0 0 0 1 0 1 1 0 0 1 1 1 0 1 1 0 0 1 0 0 1 0 1 1
0 1 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 1 0 0 1 1 0 1 1 1 0 1 1 0 1 1 0 1 0 1 0 0 1 0 1 1 1 1 0 0 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 0 0 1 1 0 0 1 1 1
0 1 0 1 0 0 1 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 1 1 0 </values>  </instantiation>