CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/jnhUnsat/
normalized-jnh203_ext.xml
MD5SUMd5eacba767adee4a543961c1d03a6f63
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.035994
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints798
Maximum constraint arity11
Maximum domain size2
Number of constraints which are defined in extension798
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.3131065913UNSAT 0.035994 0.041064
Mistral-option 1.3141065912UNSAT 0.038993 0.044818
MDG-noprobe 2008-06-271065903UNSAT 0.038993 0.0448469
cpHydra k_101065918UNSAT 0.047992 0.055643
cpHydra k_401065919UNSAT 0.047992 0.0546449
casper zito1065915UNSAT 0.086985 0.092722
spider 2008-06-141065901UNSAT 0.153975 0.176567
casper zao1065914UNSAT 0.167974 0.173623
bpsolver 2008-06-271065907UNSAT 0.18797 0.200449
MDG-probe 2008-06-271065902UNSAT 0.340947 0.345715
mddc-solv 2008-06-091065900UNSAT 0.561914 0.56793
Minion/Tailor 2008-07-041105816UNSAT 0.78288 0.666961
choco2_impwdeg 2008-06-261065908UNSAT 0.929857 0.939347
Concrete + CPS4J 2008-05-301065899UNSAT 1.00485 1.06769
choco2_dwdeg 2008-06-261065909UNSAT 1.15482 1.21633
Sugar v1.13+minisat1065906UNSAT 1.19982 1.24355
Abscon 112v4 ESAC1065917UNSAT 1.20582 1.2557
Sugar v1.13+picosat1065905UNSAT 1.20981 1.33906
Abscon 112v4 AC1065916UNSAT 1.26081 1.2854
SAT4J CSP 2008-06-131065904UNSAT 1.87271 1.91616
galac E1065911UNSAT 4.01939 4.09746
galac M1065910UNSAT 4.11637 4.18633
Concrete + CSP4J - WMC Engine 2008-05-301065898? (TO) 1800.06 1816.92
Concrete + CSP4J - Tabu Engine 2008-05-301065897? (TO) 1800.07 1812.52

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: