CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/composed-75-1-40/
normalized-composed-75-1-40-5_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/composed-75-1-40/
normalized-composed-75-1-40-5_ext.xml
MD5SUMcda0453d2dc2adf7f01e5f798439ac6b
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.048992
Satisfiable
(Un)Satisfiability was proved
Number of variables83
Number of constraints662
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension662
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.3131097949UNSAT 0.048992 0.053755
MDG-noprobe 2008-06-271097939UNSAT 0.049992 0.0563139
cpHydra k_401097955UNSAT 0.05799 0.0615779
Mistral-option 1.3141097948UNSAT 0.05899 0.0703419
cpHydra k_101097954UNSAT 0.05999 0.072682
casper zito1097951UNSAT 0.078987 0.0801441
spider 2008-06-141097937UNSAT 0.100983 0.106936
casper zao1097950UNSAT 0.128979 0.134445
MDG-probe 2008-06-271097938UNSAT 0.203968 0.21068
bpsolver 2008-06-271097943UNSAT 0.378942 0.378356
Concrete + CPS4J 2008-05-301097936UNSAT 0.757883 0.835739
choco2_dwdeg 2008-06-261097945UNSAT 0.77988 0.843755
Minion/Tailor 2008-07-041105432UNSAT 0.814875 0.841856
choco2_impwdeg 2008-06-261097944UNSAT 0.906862 0.956934
Abscon 112v4 AC1097952UNSAT 0.945855 0.990134
Abscon 112v4 ESAC1097953UNSAT 1.11083 1.14957
Sugar v1.13+minisat1097942UNSAT 1.15982 1.25602
galac M1097946UNSAT 1.39579 1.42538
galac E1097947UNSAT 1.42178 1.47004
Sugar v1.13+picosat1097941UNSAT 1.45578 1.53404
SAT4J CSP 2008-06-131097940UNSAT 2.35564 2.37653
Concrete + CSP4J - Tabu Engine 2008-05-301097934? (TO) 1800.05 1809.92
Concrete + CSP4J - WMC Engine 2008-05-301097935? (TO) 1800.07 1809.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: