CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/super-os/super-os-taillard-5/
normalized-super-os-taillard-5-21.xml

Jump to solvers results

General information on the benchmark

Namecsp/super-os/super-os-taillard-5/
normalized-super-os-taillard-5-21.xml
MD5SUM211a31b34cdccac40457a597ad4f15a8
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.030994
Satisfiable
(Un)Satisfiability was proved
Number of variables50
Number of constraints325
Maximum constraint arity2
Maximum domain size285
Number of constraints which are defined in extension0
Number of constraints which are defined in intension325
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-prime 1.3131082543UNSAT 0.030994 0.0415711
MDG-noprobe 2008-06-271082533UNSAT 0.040993 0.0492689
cpHydra k_101082548UNSAT 0.05599 0.0628429
cpHydra k_401082549UNSAT 0.057991 0.061372
bpsolver 2008-06-271082537UNSAT 0.101983 0.106801
MDG-probe 2008-06-271082532UNSAT 0.501923 0.510028
choco2_impwdeg 2008-06-261082538UNSAT 0.933857 0.990494
choco2_dwdeg 2008-06-261082539UNSAT 0.971851 1.00017
Sugar v1.13+minisat1082536UNSAT 1.3438 1.40852
Sugar v1.13+picosat1082535UNSAT 2.48662 2.61319
Minion/Tailor 2008-07-041107113UNSAT 5.70013 5.78514
Concrete + CPS4J 2008-05-301082531UNSAT 40.3999 40.8384
casper zao1082544UNSAT 42.7735 43.1276
casper zito1082545UNSAT 60.9057 61.3952
Mistral-option 1.3141082542UNSAT 67.9577 68.5935
SAT4J CSP 2008-06-131082534UNSAT 140.937 143.18
galac E1082541UNSAT 177.786 178.576
galac M1082540UNSAT 204.122 208.024
Abscon 112v4 AC1082546UNSAT 491.438 493.436
Abscon 112v4 ESAC1082547UNSAT 520.481 528.67
Concrete + CSP4J - WMC Engine 2008-05-301082530? (TO) 1800.07 1820.22
Concrete + CSP4J - Tabu Engine 2008-05-301082529? (TO) 1800.07 1815.92

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: