CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/jnhSat/
normalized-jnh17_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/jnhSat/
normalized-jnh17_ext.xml
MD5SUM14fc882a70b97c9c8d63b0b73526ea96
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.032994
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints847
Maximum constraint arity11
Maximum domain size2
Number of constraints which are defined in extension847
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-option 1.3141046782SAT 0.032994 0.034283
Mistral-prime 1.3131046783SAT 0.034994 0.0358379
MDG-noprobe 2008-06-271046773SAT 0.041993 0.0412419
cpHydra k_101046788SAT 0.046992 0.0466849
cpHydra k_401046789SAT 0.047992 0.0486939
MDG-probe 2008-06-271046772SAT 0.083986 0.0964259
casper zito1046785SAT 0.083986 0.084074
casper zao1046784SAT 0.183971 0.184274
bpsolver 2008-06-271046777SAT 0.198969 0.199173
spider 2008-06-141046771SAT 0.213966 0.21454
mddc-solv 2008-06-091046770SAT 0.492924 0.493647
Concrete + CSP4J - WMC Engine 2008-05-301046768SAT 0.702892 0.581259
Concrete + CSP4J - Tabu Engine 2008-05-301046767SAT 0.781881 0.678055
Minion/Tailor 2008-07-041105080SAT 0.825873 0.864273
Concrete + CPS4J 2008-05-301046769SAT 0.861868 0.736373
choco2_impwdeg 2008-06-261046778SAT 0.877866 0.714452
Sugar v1.13+minisat1046776SAT 0.996848 0.8712
Sugar v1.13+picosat1046775SAT 1.03884 1.0207
Abscon 112v4 AC1046786SAT 1.05784 0.838319
choco2_dwdeg 2008-06-261046779SAT 1.09383 1.01834
Abscon 112v4 ESAC1046787SAT 1.11483 0.893256
SAT4J CSP 2008-06-131046774SAT 1.62575 1.1435
galac M1046780SAT 4.71228 4.43718
galac E1046781SAT 4.72728 4.44738

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