CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/jnhUnsat/
normalized-jnh219_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/jnhUnsat/
normalized-jnh219_ext.xml
MD5SUM56bfcd28a9ea792bd2e6018e80b9952e
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.033994
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints799
Maximum constraint arity11
Maximum domain size2
Number of constraints which are defined in extension799
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.3131065798UNSAT 0.033994 0.0352879
Mistral-option 1.3141065797UNSAT 0.038993 0.045304
MDG-noprobe 2008-06-271065788UNSAT 0.038993 0.0440219
cpHydra k_101065803UNSAT 0.044992 0.0473401
cpHydra k_401065804UNSAT 0.047992 0.0542671
casper zito1065800UNSAT 0.083986 0.0917201
casper zao1065799UNSAT 0.161974 0.177537
bpsolver 2008-06-271065792UNSAT 0.197969 0.216588
spider 2008-06-141065786UNSAT 0.294954 0.300377
MDG-probe 2008-06-271065787UNSAT 0.304953 0.309219
mddc-solv 2008-06-091065785UNSAT 0.637902 0.720377
Minion/Tailor 2008-07-041105824UNSAT 0.963853 1.02796
Sugar v1.13+picosat1065790UNSAT 0.97985 1.10062
Sugar v1.13+minisat1065791UNSAT 1.07983 1.20379
Abscon 112v4 AC1065801UNSAT 1.10683 1.2013
Concrete + CPS4J 2008-05-301065784UNSAT 1.14582 1.20287
choco2_dwdeg 2008-06-261065794UNSAT 1.19182 1.25807
Abscon 112v4 ESAC1065802UNSAT 1.19782 1.25787
choco2_impwdeg 2008-06-261065793UNSAT 1.26581 1.31944
SAT4J CSP 2008-06-131065789UNSAT 1.83672 2.06044
galac E1065796UNSAT 4.04738 4.07748
galac M1065795UNSAT 4.72828 5.09435
Concrete + CSP4J - WMC Engine 2008-05-301065783? (TO) 1800.01 1808.32
Concrete + CSP4J - Tabu Engine 2008-05-301065782? (TO) 1800.02 1808.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: