CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/frb30-15/
normalized-frb30-15-2_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/frb30-15/
normalized-frb30-15-2_ext.xml
MD5SUMd58710f6c8201c02128321d92b749213
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.479926
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints284
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension284
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271035163SAT 0.479926 0.50444
Mistral-prime 1.3131035173SAT 0.741886 0.752892
Concrete + CSP4J - Tabu Engine 2008-05-301035156SAT 0.745886 0.786354
Mistral-option 1.3141035172SAT 0.758884 0.771563
cpHydra k_401046001SAT 0.766883 0.77195
cpHydra k_101045372SAT 0.771882 0.78382
MDG-probe 2008-06-271035162SAT 0.790879 0.861166
bpsolver 2008-06-271035167SAT 1.11783 1.13645
Abscon 112v4 AC1044114SAT 1.17582 1.30301
Abscon 112v4 ESAC1044743SAT 1.22681 1.25459
Sugar v1.13+minisat1035166SAT 2.37164 2.49204
Concrete + CPS4J 2008-05-301035158SAT 3.17452 3.23849
choco2_dwdeg 2008-06-261035169SAT 3.55046 3.60014
galac E1035171SAT 3.90641 3.99578
casper zao1042856SAT 4.22736 4.26324
Sugar v1.13+picosat1035165SAT 4.91025 4.90909
choco2_impwdeg 2008-06-261035168SAT 6.61149 3.20553
spider 2008-06-141035159SAT 6.99194 7.05304
SAT4J CSP 2008-06-131035164SAT 7.67883 7.71432
Minion/Tailor 2008-07-041104184SAT 7.81781 7.70975
galac M1035170SAT 8.5377 8.64267
casper zito1043485SAT 12.847 12.9212
Concrete + CSP4J - WMC Engine 2008-05-301035157? (TO) 1800.01 1802.02

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found:
6 14 11 3 0 9 7 9 10 2 9 8 6 13 0 14 8 2 4 5 4 11 4 0 2 14 0 2 12 7