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-45_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-45_ext.xml
MD5SUMb38f381f6b5c5e67eeecf03fdaae10f2
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.05999
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints226
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension226
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-271099501SAT 0.05999 0.0671091
Mistral-option 1.3141099510SAT 0.114982 0.115789
Mistral-prime 1.3131099511SAT 0.144977 0.15233
cpHydra k_101099516SAT 0.158975 0.16602
cpHydra k_401099517SAT 0.159975 0.172211
MDG-probe 2008-06-271099500SAT 0.261959 0.265381
bpsolver 2008-06-271099505SAT 0.502923 0.503601
Concrete + CSP4J - Tabu Engine 2008-05-301099496SAT 0.672897 0.686925
Abscon 112v4 AC1099514SAT 0.837871 0.897214
spider 2008-06-141099499SAT 0.909861 0.917792
Concrete + CSP4J - WMC Engine 2008-05-301099497SAT 0.909861 0.95859
Abscon 112v4 ESAC1099515SAT 0.934857 0.995843
Concrete + CPS4J 2008-05-301099498SAT 1.15482 1.20373
Sugar v1.13+picosat1099503SAT 1.3048 1.41599
choco2_dwdeg 2008-06-261099507SAT 1.3178 1.35257
choco2_impwdeg 2008-06-261099506SAT 1.39879 1.4665
Sugar v1.13+minisat1099504SAT 1.79773 1.95442
galac E1099509SAT 2.15267 2.23169
Minion/Tailor 2008-07-041106673SAT 2.26466 2.30869
galac M1099508SAT 2.54161 2.7021
casper zito1099513SAT 3.2485 3.27236
SAT4J CSP 2008-06-131099502SAT 3.87541 3.88827
casper zao1099512SAT 19.0401 19.048

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