CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-2-30-15-fcd/
normalized-rand-2-30-15-306-230-fcd-24_ext.xml
MD5SUM4cc3e17b3cb8e89c6b9753941fcc9586
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.081987
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
Mistral-prime 1.3131099665SAT 0.081987 0.087458
cpHydra k_401099671SAT 0.092985 0.100539
cpHydra k_101099670SAT 0.095984 0.101921
Mistral-option 1.3141099664SAT 0.147977 0.154277
MDG-probe 2008-06-271099654SAT 0.283956 0.290762
MDG-noprobe 2008-06-271099655SAT 0.378941 0.389157
spider 2008-06-141099653SAT 0.824874 0.82612
bpsolver 2008-06-271099659SAT 0.898862 0.901095
choco2_impwdeg 2008-06-261099660SAT 1.06284 1.09252
choco2_dwdeg 2008-06-261099661SAT 1.07883 1.09952
Minion/Tailor 2008-07-041106663SAT 1.53077 1.57169
Concrete + CPS4J 2008-05-301099652SAT 1.56176 1.61891
Sugar v1.13+picosat1099657SAT 2.07268 2.19282
casper zito1099667SAT 2.39464 2.42106
Abscon 112v4 AC1099668SAT 2.56061 2.60722
Abscon 112v4 ESAC1099669SAT 2.6226 2.66231
galac E1099663SAT 2.81757 2.92827
Sugar v1.13+minisat1099658SAT 3.01254 3.14393
Concrete + CSP4J - Tabu Engine 2008-05-301099650SAT 3.03654 3.08972
galac M1099662SAT 3.41348 3.49735
casper zao1099666SAT 4.89725 4.94339
SAT4J CSP 2008-06-131099656SAT 7.77582 7.79613
Concrete + CSP4J - WMC Engine 2008-05-301099651SAT 1078.74 1080.42

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