CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/aim-50/
normalized-aim-50-6-0-sat-1_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/aim-50/
normalized-aim-50-6-0-sat-1_ext.xml
MD5SUMaaa654d3bd49f8d749ae7a901f7d4a86
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.012997
Satisfiable
(Un)Satisfiability was proved
Number of variables50
Number of constraints290
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension290
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-271053225SAT 0.012997 0.018435
Mistral-option 1.3141053234SAT 0.012997 0.018715
Mistral-prime 1.3131053235SAT 0.012997 0.0186899
MDG-probe 2008-06-271053224SAT 0.012997 0.019633
casper zao1053236SAT 0.015997 0.0242741
casper zito1053237SAT 0.015997 0.023418
spider 2008-06-141053223SAT 0.022996 0.0302881
cpHydra k_401053241SAT 0.024995 0.0302861
cpHydra k_101053240SAT 0.025995 0.0309639
mddc-solv 2008-06-091053222SAT 0.05699 0.063181
bpsolver 2008-06-271053229SAT 0.059989 0.067461
Concrete + CSP4J - WMC Engine 2008-05-301053220SAT 0.442932 0.494041
Concrete + CPS4J 2008-05-301053221SAT 0.458929 0.480317
Minion/Tailor 2008-07-041105106SAT 0.487925 0.511388
choco2_impwdeg 2008-06-261053230SAT 0.541916 0.579984
choco2_dwdeg 2008-06-261053231SAT 0.565913 0.58074
Concrete + CSP4J - Tabu Engine 2008-05-301053219SAT 0.652899 0.706864
Sugar v1.13+minisat1053228SAT 0.766882 0.917615
Sugar v1.13+picosat1053227SAT 0.766883 0.826242
Abscon 112v4 AC1053238SAT 0.836872 0.894687
Abscon 112v4 ESAC1053239SAT 0.85387 0.887817
SAT4J CSP 2008-06-131053226SAT 0.859868 0.87184
galac E1053233SAT 1.21081 1.29502
galac M1053232SAT 1.37379 1.42191

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:
1 0 0 0 1 0 1 1 0 1 1 0 0 0 0 1 1 1 0 1 0 0 0 0 1 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 1 1 1 0 1 0 0 1 1