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

Result page for benchmark
PseudoBoolean/PseudoBoolean-opt-mps/
Pb-mps-v2-20-10-l152lav.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-opt-mps/
Pb-mps-v2-20-10-l152lav.xml
MD5SUMe295f86f2e8232e9b7c8210bbc53418f
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmark
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark
Satisfiable
(Un)Satisfiability was proved
Number of variables1989
Number of constraints97
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":1989}]
Minimum variable degree3
Maximum variable degree8
Distribution of variable degrees[{"degree":3,"count":3},{"degree":4,"count":193},{"degree":5,"count":403},{"degree":6,"count":674},{"degree":7,"count":657},{"degree":8,"count":59}]
Minimum constraint arity3
Maximum constraint arity1989
Distribution of constraint arities[{"arity":3,"count":1},{"arity":5,"count":1},{"arity":10,"count":1},{"arity":14,"count":1},{"arity":19,"count":1},{"arity":21,"count":1},{"arity":22,"count":1},{"arity":24,"count":1},{"arity":26,"count":1},{"arity":27,"count":1},{"arity":31,"count":2},{"arity":32,"count":2},{"arity":35,"count":2},{"arity":37,"count":3},{"arity":40,"count":1},{"arity":42,"count":3},{"arity":43,"count":1},{"arity":44,"count":3},{"arity":45,"count":1},{"arity":46,"count":1},{"arity":47,"count":1},{"arity":48,"count":3},{"arity":49,"count":1},{"arity":50,"count":1},{"arity":52,"count":2},"...",{"arity":93,"count":1}, {"arity":94,"count":1}, {"arity":96,"count":3}, {"arity":97,"count":1}, {"arity":102,"count":2}, {"arity":103,"count":1}, {"arity":104,"count":1}, {"arity":106,"count":1}, {"arity":108,"count":2}, {"arity":112,"count":2}, {"arity":114,"count":1}, {"arity":118,"count":1}, {"arity":121,"count":2}, {"arity":123,"count":1}, {"arity":125,"count":1}, {"arity":128,"count":1}, {"arity":129,"count":1}, {"arity":137,"count":1}, {"arity":152,"count":1}, {"arity":160,"count":1}, {"arity":163,"count":1}, {"arity":171,"count":1}, {"arity":218,"count":1}, {"arity":1011,"count":1}, {"arity":1989,"count":1}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":97}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco-sat 1.12 (complete)4266773? (TO) 240.00999 240.00999
OscaR - ALNS 2017-07-26 (complete)4255666? (TO) 242.07401 240.011
OscaR - Conflict Ordering 2017-07-26 (complete)4256163? (TO) 242.09801 240.011
AbsCon-basic 2017-06-11 (complete)4257654? (TO) 242.198 240.03
OscaR - Hybrid 2017-07-26 (complete)4256660? (TO) 242.209 240.01801
choco-solver 4.0.5 seq (2017-08-18) (complete)4282924? (TO) 243.56 240.021
choco-solver 4.0.5 seq (2017-08-09) (complete)4270174? (TO) 244.299 240.022
choco-solver 4.0.5 seq (2017-07-26) (complete)4254175? (TO) 245.172 240.01199
Mistral-2.0 2017-07-28 (complete)4259145? (TO) 251.856 252.00999
cosoco 1.12 (complete)4268704? (TO) 251.897 252.00999
cosoco 1.1 (complete)4258648? (TO) 251.953 252.00999
choco-solver 5a (2017-08-18) (complete)4284394? (TO) 256.547 240.028
choco-solver 5a (2017-07-26) (complete)4255169? (TO) 257.85999 240.00999
Concrete 3.4 (complete)4259642? (TO) 258.95801 240.29201
sat4j-CSP 2017-07-05 (complete)4258151? (TO) 260.02301 79.168503
OscaR - Parallel with EPS 2017-08-22 (complete)4285864? (TO) 1904.6899 252.12399
choco-solver 4.0.5 par (2017-07-26) (complete)4254672? (TO) 1920.51 241.336
OscaR - Parallel with EPS 2017-07-26 (complete)4257157? (TO) 1921.0699 254.086
choco-solver 4.0.5 par (2017-08-18) (complete)4281454? (TO) 2006.15 252.13
choco-solver 4.0.5 par (2017-08-09) (complete)4271644? (TO) 2006.5601 252.106

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:
Solution found: