2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Bibd/Bibd-sum-stab1/
Bibd-sum-25-05-01.xml

Jump to solvers results

General information on the benchmark

NameBibd/Bibd-sum-stab1/
Bibd-sum-25-05-01.xml
MD5SUM8664f4f5c29eba7e0c756194721bfaf5
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark21.1993
Satisfiable
(Un)Satisfiability was proved
Number of variables750
Number of constraints356
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":750}]
Minimum variable degree27
Maximum variable degree27
Distribution of variable degrees[{"degree":27,"count":750}]
Minimum constraint arity25
Maximum constraint arity750
Distribution of constraint arities[{"arity":25,"count":30},{"arity":30,"count":25},{"arity":60,"count":300},{"arity":750,"count":1}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"lex","count":1},{"type":"sum","count":355}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4394959SAT 21.1993 21.21
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4387720SAT 24.8807 12.4763
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4387719SAT 26.6841 14.5374
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405239SAT 27.7166 12.5197
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392379SAT 28.5447 12.8509
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392679SAT 34.3962 12.8106
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405539SAT 34.4704 12.7581
choco-solver 2019-09-24 (complete)4405839SAT 63.7364 60.986
choco-solver 2019-09-16 (complete)4398939SAT 234.585 59.3856
choco-solver 2019-09-20 (complete)4403439SAT 243.264 61.5113
AbsCon 2019-07-23 (complete)4390579SAT 353.876 350.738
choco-solver 2019-09-24 parallel (complete)4406739SAT 539.82 68.6245
choco-solver 2019-09-20 parallel (complete)4404339SAT 545.734 69.229
choco-solver 2019-09-16 parallel (complete)4399539SAT 546.432 69.2797
choco-solver 2019-06-14 parallel (complete)4393579SAT 5698.28 715.208
cosoco 2.0 (complete)4408019? (MO) 1276.41 1277.99
cosoco 2.0 (complete)4396759? (MO) 1432.35 1434.44
cosoco 2 (complete)4389479? (MO) 1436.17 1438.13
BTD 19.07.01 (complete)4386714? (TO) 2519.57 2520.01
Concrete 3.12.3 (complete)4402539? (TO) 2520.04 2453.64
Concrete 3.10 (complete)4387085? (TO) 2520.04 2449.23
Concrete 3.12.2 (complete)4395859? (TO) 2520.1 2466.56
Concrete 3.12.2 (complete)4400739? (TO) 2520.14 2460.44
choco-solver 2019-06-14 (complete)4392979? (TO) 2520.32 633.494
cosoco 2.O parallel (complete)4398039? (TO) 2520.79 2523.5
cosoco 2.0 parallel (complete)4409299? (TO) 2520.94 2523.48

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