CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-100/
normalized-aim-100-1-6-sat-1_ext.xml
MD5SUM40080dea49e6a47547b58694b7ab5a0f
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.008997
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints154
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension154
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-271055036SAT 0.008997 0.016872
Mistral-prime 1.3131055046SAT 0.010997 0.0173561
Mistral-option 1.3141055045SAT 0.012997 0.019726
casper zao1055047SAT 0.012997 0.021138
casper zito1055048SAT 0.016996 0.0235771
cpHydra k_101055051SAT 0.021996 0.0286521
cpHydra k_401055052SAT 0.022996 0.0287369
spider 2008-06-141055034SAT 0.024995 0.0474369
MDG-probe 2008-06-271055035SAT 0.034994 0.0413331
mddc-solv 2008-06-091055033SAT 0.056991 0.0630231
Concrete + CPS4J 2008-05-301055032SAT 0.422934 0.478757
Minion/Tailor 2008-07-041105130SAT 0.430933 0.461278
Concrete + CSP4J - WMC Engine 2008-05-301055031SAT 0.442932 0.481264
choco2_impwdeg 2008-06-261055041SAT 0.466928 0.518705
choco2_dwdeg 2008-06-261055042SAT 0.508921 0.531204
Sugar v1.13+picosat1055038SAT 0.741886 0.851836
Sugar v1.13+minisat1055039SAT 0.742886 0.823296
Abscon 112v4 AC1055049SAT 0.836872 0.898608
Abscon 112v4 ESAC1055050SAT 0.853869 0.887037
galac E1055044SAT 0.970852 1.05865
SAT4J CSP 2008-06-131055037SAT 0.972851 1.02929
galac M1055043SAT 1.17882 1.25385
bpsolver 2008-06-271055040SAT 30.8653 31.1413
Concrete + CSP4J - Tabu Engine 2008-05-301055030? (TO) 1800.04 1816.42

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