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

Result page for benchmark
PseudoBoolean/PseudoBoolean-opt-logicSynthesis/
Pb-logic-m100-100-30-30-r.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-opt-logicSynthesis/
Pb-logic-m100-100-30-30-r.xml
MD5SUM99240cf8fa1004889a7bc67b3b097789
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark5
Best CPU time to get the best result obtained on this benchmark29.3066
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints100
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":100}]
Minimum variable degree19
Maximum variable degree44
Distribution of variable degrees[{"degree":19,"count":1},{"degree":22,"count":1},{"degree":24,"count":3},{"degree":25,"count":4},{"degree":26,"count":6},{"degree":27,"count":8},{"degree":28,"count":8},{"degree":29,"count":6},{"degree":30,"count":9},{"degree":31,"count":10},{"degree":32,"count":6},{"degree":33,"count":11},{"degree":34,"count":8},{"degree":35,"count":6},{"degree":36,"count":2},{"degree":37,"count":3},{"degree":38,"count":3},{"degree":39,"count":2},{"degree":40,"count":1},{"degree":41,"count":1},{"degree":44,"count":1}]
Minimum constraint arity30
Maximum constraint arity30
Distribution of constraint arities[{"arity":30,"count":100}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":100}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4395624OPT5 29.3066 29.3126
AbsCon 2019-07-23 (complete)4391244OPT5 351.37 348.148
choco-solver 2019-09-20 parallel (complete)4405004OPT5 406.114 51.8043
choco-solver 2019-06-14 (complete)4394244OPT5 704.456 177.79
choco-solver 2019-09-20 (complete)4404104OPT5 714.075 180.123
choco-solver 2019-09-16 (complete)4400504OPT5 738.166 186.308
choco-solver 2019-09-24 (complete)4406504OPT5 1002.42 997.707
cosoco 2.0 (complete)4397804OPT5 1155.48 1155.42
cosoco 2 (complete)4390344OPT5 1158.35 1158.5
cosoco 2.0 (complete)4409064OPT5 1164.35 1164.39
choco-solver 2019-09-16 parallel (complete)4400204OPT5 1180.05 148.986
choco-solver 2019-09-24 parallel (complete)4407404OPT5 1549.13 195.857
cosoco 2.O parallel (complete)4398704OPT5 1779.83 222.879
cosoco 2.0 parallel (complete)4409964OPT5 1900.78 238.009
choco-solver 2019-06-14 parallel (complete)4394544OPT5 1906.9 240.538
Concrete 3.12.2 (complete)4401404SAT (TO)5 2400.11 2349.85
Concrete 3.10 (complete)4392144SAT (TO)5 2400.12 2347.43
Concrete 3.12.2 (complete)4396524SAT (TO)6 2400.1 2352.93
Concrete 3.12.3 (complete)4403204SAT (TO)6 2400.16 2351.34

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: 5
Solution found:
<instantiation> <list> x[]  </list> <values> 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0   </values> </instantiation>