CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rand-2-30-15/
normalized-rand-2-30-15-306-230-24_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/rand-2-30-15/
normalized-rand-2-30-15-306-230-24_ext.xml
MD5SUM0ebb78416df7170723a3d81dcb6221bf
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.034994
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints208
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension208
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-271099237SAT 0.034994 0.041308
Mistral-prime 1.3131099247SAT 0.038993 0.048727
cpHydra k_101099252SAT 0.048991 0.0555269
cpHydra k_401099253SAT 0.048991 0.055772
casper zito1099249SAT 0.12598 0.13147
MDG-probe 2008-06-271099236SAT 0.226964 0.228235
spider 2008-06-141099235SAT 0.247962 0.260833
Mistral-option 1.3141099246SAT 0.381941 0.389579
bpsolver 2008-06-271099241SAT 0.406937 0.407965
Concrete + CSP4J - WMC Engine 2008-05-301099233SAT 0.629903 0.685794
Concrete + CPS4J 2008-05-301099234SAT 0.683895 0.70042
choco2_dwdeg 2008-06-261099243SAT 0.788879 0.836829
Concrete + CSP4J - Tabu Engine 2008-05-301099232SAT 0.887864 0.904373
choco2_impwdeg 2008-06-261099242SAT 0.930857 0.949967
Minion/Tailor 2008-07-041106683SAT 0.931858 0.965291
Sugar v1.13+picosat1099239SAT 1.48677 1.6325
Abscon 112v4 ESAC1099251SAT 2.20167 2.23987
Abscon 112v4 AC1099250SAT 2.26965 2.30179
casper zao1099248SAT 2.91156 2.94042
galac E1099245SAT 2.99254 3.08245
SAT4J CSP 2008-06-131099238SAT 3.58545 3.5903
Sugar v1.13+minisat1099240SAT 4.13337 4.26443
galac M1099244SAT 6.22405 6.29032

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:
6 6 6 9 9 8 14 5 6 0 0 6 7 9 11 14 13 2 0 8 5 6 2 1 3 10 8 7 2 2