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

Result page for benchmark
SuperSolutions/SuperSolutions-Taillard-os10/
SuperTaillard-os-10-21.xml

Jump to solvers results

General information on the benchmark

NameSuperSolutions/SuperSolutions-Taillard-os10/
SuperTaillard-os-10-21.xml
MD5SUMab3cfdf6220e1af184bc3e02e1fbde1d
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark45.669
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints2800
Number of domains65
Minimum domain size516
Maximum domain size611
Distribution of domain sizes[{"size":516,"count":6},{"size":517,"count":6},{"size":518,"count":4},{"size":519,"count":2},{"size":520,"count":4},{"size":521,"count":2},{"size":522,"count":2},{"size":523,"count":2},{"size":524,"count":2},{"size":526,"count":2},{"size":527,"count":8},{"size":528,"count":2},{"size":529,"count":2},{"size":530,"count":6},{"size":531,"count":2},{"size":533,"count":2},{"size":540,"count":2},{"size":541,"count":4},{"size":542,"count":2},{"size":543,"count":2},{"size":544,"count":4},{"size":545,"count":2},{"size":546,"count":8},{"size":547,"count":2},{"size":548,"count":2},"...",{"size":571,"count":2}, {"size":572,"count":2}, {"size":573,"count":2}, {"size":574,"count":2}, {"size":575,"count":6}, {"size":576,"count":4}, {"size":579,"count":4}, {"size":580,"count":2}, {"size":582,"count":4}, {"size":584,"count":6}, {"size":585,"count":2}, {"size":587,"count":2}, {"size":588,"count":2}, {"size":589,"count":2}, {"size":591,"count":2}, {"size":593,"count":2}, {"size":595,"count":4}, {"size":596,"count":2}, {"size":597,"count":2}, {"size":601,"count":6}, {"size":602,"count":2}, {"size":605,"count":2}, {"size":607,"count":4}, {"size":610,"count":2}, {"size":611,"count":2}]
Minimum variable degree19
Maximum variable degree37
Distribution of variable degrees[{"degree":19,"count":100},{"degree":37,"count":100}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":2800}]
Number of extensional constraints0
Number of intensional constraints2800
Distribution of constraint types[{"type":"intension","count":2800}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4388218UNSAT 45.669 38.5189
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4388217UNSAT 140.386 133.419
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392663UNSAT 152.74 39.0906
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392363UNSAT 154.787 39.5132
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405223UNSAT 155.935 39.4415
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405523UNSAT 157.049 40.2378
PicatSAT 2019-09-12 (complete)4394943UNSAT 179.387 179.37
choco-solver 2019-06-14 (complete)4392963? 2386.17 788.734
choco-solver 2019-09-16 (complete)4398923? 2394.04 790.852
choco-solver 2019-09-16 parallel (complete)4399523? 5291.9 1070.8
choco-solver 2019-09-24 parallel (complete)4406723? 5714.38 1146.81
choco-solver 2019-09-20 parallel (complete)4404323? 8041.02 1479.71
BTD 19.07.01 (complete)4386880? (TO) 2519.94 2520.01
cosoco 2.0 (complete)4408003? (TO) 2520.01 2519.8
cosoco 2 (complete)4389463? (TO) 2520.01 2519.7
AbsCon 2019-07-23 (complete)4390563? (TO) 2520.03 2514.02
cosoco 2.0 (complete)4396743? (TO) 2520.1 2519.9
Concrete 3.12.2 (complete)4395843? (TO) 2520.14 2312.27
Concrete 3.10 (complete)4387427? (TO) 2520.14 2351.55
Concrete 3.12.2 (complete)4400723? (TO) 2520.16 2303.86
Concrete 3.12.3 (complete)4402523? (TO) 2520.18 2353.95
choco-solver 2019-09-24 (complete)4405823? (TO) 2528.27 818.667
choco-solver 2019-09-20 (complete)4403423? (TO) 2528.53 817.696
choco-solver 2019-06-14 parallel (complete)4393563? (TO) 15715.7 2522.23
cosoco 2.0 parallel (complete)4409283? (TO) 20098 2520.03
cosoco 2.O parallel (complete)4398023? (TO) 20101.3 2520.02

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: