CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/jnhUnsat/
normalized-jnh15_ext.xml
MD5SUM3a207caf50d587b75baed805584ca88d
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 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.3141065820UNSAT 0.033994 0.036366
Mistral-prime 1.3131065821UNSAT 0.035994 0.0362711
MDG-noprobe 2008-06-271065811UNSAT 0.037993 0.0447629
cpHydra k_101065826UNSAT 0.046992 0.050909
cpHydra k_401065827UNSAT 0.049992 0.06195
casper zito1065823UNSAT 0.056991 0.063272
casper zao1065822UNSAT 0.100984 0.10137
MDG-probe 2008-06-271065810UNSAT 0.12398 0.134337
bpsolver 2008-06-271065815UNSAT 0.236963 0.243732
spider 2008-06-141065809UNSAT 0.283956 0.289517
mddc-solv 2008-06-091065808UNSAT 0.659899 0.670585
choco2_dwdeg 2008-06-261065817UNSAT 0.901862 0.944217
Minion/Tailor 2008-07-041105811UNSAT 0.902862 0.939447
Concrete + CPS4J 2008-05-301065807UNSAT 0.932857 0.959052
Sugar v1.13+picosat1065813UNSAT 1.04184 1.30211
Sugar v1.13+minisat1065814UNSAT 1.13883 1.27928
choco2_impwdeg 2008-06-261065816UNSAT 1.16382 1.20894
Abscon 112v4 ESAC1065825UNSAT 1.18982 1.2565
Abscon 112v4 AC1065824UNSAT 1.38579 1.45616
SAT4J CSP 2008-06-131065812UNSAT 1.77273 1.82029
galac M1065818UNSAT 4.92025 5.01513
galac E1065819UNSAT 5.2332 5.29871
Concrete + CSP4J - WMC Engine 2008-05-301065806? (TO) 1800.04 1812.32
Concrete + CSP4J - Tabu Engine 2008-05-301065805? (TO) 1800.05 1807.42

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: