CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-100/
normalized-aim-100-1-6-sat-3_ext.xml
MD5SUMb3dc8c970a7ab76da24d5ab138238263
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.010997
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints156
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension156
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
Mistral-prime 1.3131054862SAT 0.010997 0.0116879
Mistral-option 1.3141054861SAT 0.011997 0.0125699
MDG-noprobe 2008-06-271054852SAT 0.011997 0.0135541
casper zao1054863SAT 0.013997 0.0212119
cpHydra k_101054867SAT 0.021996 0.0260779
cpHydra k_401054868SAT 0.021996 0.0329389
MDG-probe 2008-06-271054851SAT 0.029995 0.0297719
casper zito1054864SAT 0.037993 0.044156
spider 2008-06-141054850SAT 0.040993 0.044397
mddc-solv 2008-06-091054849SAT 0.044992 0.0454881
Minion/Tailor 2008-07-041105122SAT 0.345947 0.385283
Concrete + CPS4J 2008-05-301054848SAT 0.44893 0.483486
choco2_dwdeg 2008-06-261054858SAT 0.526919 0.575608
choco2_impwdeg 2008-06-261054857SAT 0.552915 0.578822
Sugar v1.13+minisat1054855SAT 0.644901 0.781076
Sugar v1.13+picosat1054854SAT 0.688894 0.769045
Abscon 112v4 AC1054865SAT 0.836872 0.892119
SAT4J CSP 2008-06-131054853SAT 0.901862 0.932992
galac E1054860SAT 0.905862 0.984438
Abscon 112v4 ESAC1054866SAT 0.967852 0.99014
galac M1054859SAT 0.974851 1.03693
Concrete + CSP4J - WMC Engine 2008-05-301054847SAT 2.14367 2.21329
bpsolver 2008-06-271054856SAT 110.652 111.606
Concrete + CSP4J - Tabu Engine 2008-05-301054846? (TO) 1800.06 1809.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:
0 1 0 0 0 0 0 1 1 1 0 0 0 1 1 0 0 1 1 0 1 1 0 0 0 0 0 0 1 1 0 1 1 1 1 0 0 1 1 1 0 0 0 0 0 1 1 0 1 0 0 0 1 0 0 0 1 1 0 0 0 1 1 0 0 0 1 1 1 0
0 1 0 1 0 1 0 1 1 1 0 0 1 0 1 1 0 0 1 1 1 1 0 1 1 0 0 0 1 0