CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/composed-25-1-40/
normalized-composed-25-1-40-0_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/composed-25-1-40/
normalized-composed-25-1-40-0_ext.xml
MD5SUMb62793c8560f268511dfeafda304a0f0
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.021995
Satisfiable
(Un)Satisfiability was proved
Number of variables33
Number of constraints262
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension262
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.3141099818UNSAT 0.021995 0.0302191
Mistral-prime 1.3131099819UNSAT 0.021996 0.028328
MDG-noprobe 2008-06-271099809UNSAT 0.022995 0.0294471
cpHydra k_101099824UNSAT 0.033993 0.040658
cpHydra k_401099825UNSAT 0.033994 0.032959
casper zito1099821UNSAT 0.035993 0.042021
spider 2008-06-141099807UNSAT 0.037993 0.0417219
MDG-probe 2008-06-271099808UNSAT 0.051991 0.0573879
casper zao1099820UNSAT 0.073988 0.075306
bpsolver 2008-06-271099813UNSAT 0.162974 0.167312
Minion/Tailor 2008-07-041105410UNSAT 0.51892 0.571016
Concrete + CPS4J 2008-05-301099806UNSAT 0.539917 0.575197
choco2_impwdeg 2008-06-261099814UNSAT 0.632903 0.682697
choco2_dwdeg 2008-06-261099815UNSAT 0.760883 0.809162
Abscon 112v4 ESAC1099823UNSAT 0.808876 0.829685
Abscon 112v4 AC1099822UNSAT 0.85187 0.898428
galac M1099816UNSAT 0.929857 0.976053
Sugar v1.13+picosat1099811UNSAT 1.00385 1.09984
galac E1099817UNSAT 1.00885 1.06571
Sugar v1.13+minisat1099812UNSAT 1.25881 1.32206
SAT4J CSP 2008-06-131099810UNSAT 1.66475 1.68774
Concrete + CSP4J - WMC Engine 2008-05-301099805? (TO) 1800.04 1817.12
Concrete + CSP4J - Tabu Engine 2008-05-301099804? (TO) 1800.07 1810.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: