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-2_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-2_ext.xml
MD5SUM5983026878197d6df4bff12be0bbadb6
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.092985
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints221
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension221
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-271099721SAT 0.092985 0.098855
Mistral-option 1.3141099730SAT 0.095984 0.0965191
Mistral-prime 1.3131099731SAT 0.198969 0.200555
cpHydra k_401099737SAT 0.229964 0.236297
cpHydra k_101099736SAT 0.232964 0.244195
MDG-probe 2008-06-271099720SAT 0.266959 0.269444
spider 2008-06-141099719SAT 0.528919 0.542102
casper zito1099733SAT 0.560914 0.561688
bpsolver 2008-06-271099725SAT 0.91386 0.928309
choco2_impwdeg 2008-06-261099726SAT 1.04484 1.09729
choco2_dwdeg 2008-06-261099727SAT 1.10583 1.15394
Concrete + CSP4J - Tabu Engine 2008-05-301099716SAT 1.23981 1.31168
Abscon 112v4 ESAC1099735SAT 1.2948 1.31606
Abscon 112v4 AC1099734SAT 1.52677 1.56179
Sugar v1.13+picosat1099723SAT 1.88071 2.01018
Concrete + CPS4J 2008-05-301099718SAT 2.00969 2.05008
Minion/Tailor 2008-07-041106667SAT 2.13667 2.17914
SAT4J CSP 2008-06-131099722SAT 2.58261 2.59146
Sugar v1.13+minisat1099724SAT 2.98554 3.11739
galac E1099729SAT 3.06953 3.193
galac M1099728SAT 3.24251 3.34121
casper zao1099732SAT 6.04508 6.11453
Concrete + CSP4J - WMC Engine 2008-05-301099717? (TO) 1800.03 1808.62

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