2019 XCSP3 competition: main track (CSP and COP, 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 benchmark30.2814
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)4395324OPT5 30.2814 30.2868
AbsCon 2019-07-23 (complete)4390944OPT5 342.861 339.593
choco-solver 2019-09-16 parallel (complete)4399904OPT5 530.164 67.1785
choco-solver 2019-09-20 parallel (complete)4404704OPT5 679.046 86.0633
choco-solver 2019-06-14 (complete)4393344OPT5 717.138 180.917
choco-solver 2019-09-20 (complete)4403804OPT5 725.947 183.162
choco-solver 2019-09-16 (complete)4399304OPT5 733.785 185.347
choco-solver 2019-09-24 (complete)4406204OPT5 1020.19 1015.28
cosoco 2.0 (complete)4397124OPT5 1163.09 1163.13
cosoco 2.0 (complete)4408384OPT5 1164.87 1164.8
cosoco 2 (complete)4389844OPT5 1332.87 1332.97
choco-solver 2019-09-24 parallel (complete)4407104OPT5 1695.11 214.097
choco-solver 2019-06-14 parallel (complete)4393944OPT5 1713.26 240.463
cosoco 2.0 parallel (complete)4409664OPT5 2160.24 270.472
cosoco 2.O parallel (complete)4398404OPT5 5555.27 695.586
Concrete 3.12.2 (complete)4401104SAT (TO)5 2520.15 2468.84
Concrete 3.12.3 (complete)4402904SAT (TO)6 2520.13 2468.94
Concrete 3.10 (complete)4387377SAT (TO)6 2520.13 2463.13
Concrete 3.12.2 (complete)4396224SAT (TO)6 2520.14 2470.82

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>