CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/jnhUnsat/
normalized-jnh09_ext.xml
MD5SUM57cc469fb89ab8e2dbf0d14ec5db3e5f
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.037993
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints849
Maximum constraint arity10
Maximum domain size2
Number of constraints which are defined in extension849
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
MDG-noprobe 2008-06-271065627UNSAT 0.037993 0.0390791
Mistral-option 1.3141065636UNSAT 0.038993 0.0466901
Mistral-prime 1.3131065637UNSAT 0.039993 0.044033
cpHydra k_101065642UNSAT 0.053991 0.0586551
cpHydra k_401065643UNSAT 0.054991 0.06452
casper zito1065639UNSAT 0.05599 0.0632341
casper zao1065638UNSAT 0.071988 0.078667
MDG-probe 2008-06-271065626UNSAT 0.12498 0.131949
spider 2008-06-141065625UNSAT 0.25296 0.259449
bpsolver 2008-06-271065631UNSAT 0.421935 0.428844
mddc-solv 2008-06-091065624UNSAT 0.512922 0.520742
Minion/Tailor 2008-07-041105806UNSAT 0.779881 0.721812
choco2_impwdeg 2008-06-261065632UNSAT 0.824873 0.834018
Sugar v1.13+minisat1065630UNSAT 1.01184 1.13239
Concrete + CPS4J 2008-05-301065623UNSAT 1.01884 1.07696
choco2_dwdeg 2008-06-261065633UNSAT 1.07084 1.10168
Sugar v1.13+picosat1065629UNSAT 1.14882 1.28997
Abscon 112v4 AC1065640UNSAT 1.26181 1.30407
Abscon 112v4 ESAC1065641UNSAT 1.3338 1.41166
SAT4J CSP 2008-06-131065628UNSAT 1.77673 1.81672
galac E1065635UNSAT 4.02139 4.10083
galac M1065634UNSAT 5.65314 5.7483
Concrete + CSP4J - WMC Engine 2008-05-301065622? (TO) 1800.02 1808.52
Concrete + CSP4J - Tabu Engine 2008-05-301065621? (TO) 1800.07 1809.62

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: