CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/jnhUnsat/
normalized-jnh214_ext.xml
MD5SUMd187ab64774cb7a75e009c189166dfad
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.034994
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.3131065752UNSAT 0.034994 0.0423829
Mistral-option 1.3141065751UNSAT 0.036993 0.044477
MDG-noprobe 2008-06-271065742UNSAT 0.036994 0.0430241
cpHydra k_401065758UNSAT 0.045992 0.053722
cpHydra k_101065757UNSAT 0.048992 0.223815
casper zito1065754UNSAT 0.063989 0.076943
spider 2008-06-141065740UNSAT 0.138978 0.147008
bpsolver 2008-06-271065746UNSAT 0.176972 0.183656
casper zao1065753UNSAT 0.185971 0.199707
MDG-probe 2008-06-271065741UNSAT 0.297954 0.308302
mddc-solv 2008-06-091065739UNSAT 0.488925 0.500289
Minion/Tailor 2008-07-041105821UNSAT 0.774881 0.792445
Concrete + CPS4J 2008-05-301065738UNSAT 0.990848 1.01345
Sugar v1.13+minisat1065745UNSAT 1.00885 1.13224
Sugar v1.13+picosat1065744UNSAT 1.01484 1.05292
choco2_impwdeg 2008-06-261065747UNSAT 1.01884 1.05022
Abscon 112v4 AC1065755UNSAT 1.17182 1.21424
Abscon 112v4 ESAC1065756UNSAT 1.17982 1.19887
choco2_dwdeg 2008-06-261065748UNSAT 1.19382 1.26174
SAT4J CSP 2008-06-131065743UNSAT 1.78173 1.80223
galac E1065750UNSAT 4.03139 4.09718
galac M1065749UNSAT 4.25135 4.51434
Concrete + CSP4J - Tabu Engine 2008-05-301065736? (TO) 1800.04 1800.92
Concrete + CSP4J - WMC Engine 2008-05-301065737? (TO) 1800.06 1809.53

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: