CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/tightness0.2/
normalized-rand-2-40-11-414-200-57_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.2/
normalized-rand-2-40-11-414-200-57_ext.xml
MD5SUM00d2ce8b2fbe21b9d22036f19f76e059
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.6489
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints414
Maximum constraint arity2
Maximum domain size11
Number of constraints which are defined in extension414
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.3131096783SAT 0.6489 0.659957
cpHydra k_401096789SAT 0.672897 0.684778
cpHydra k_101096788SAT 0.690894 0.697986
MDG-noprobe 2008-06-271096773SAT 0.733887 0.745063
bpsolver 2008-06-271096777SAT 0.807876 0.820978
choco2_impwdeg 2008-06-261096778SAT 2.6036 2.65255
choco2_dwdeg 2008-06-261096779SAT 3.00354 3.07682
MDG-probe 2008-06-271096772SAT 3.80442 3.82392
Sugar v1.13+minisat1096776SAT 5.73313 5.907
Mistral-option 1.3141096782SAT 9.38057 9.46129
Concrete + CSP4J - Tabu Engine 2008-05-301096768SAT 9.39157 9.45224
galac E1096781SAT 11.1443 11.2996
galac M1096780SAT 12.0562 12.1029
Minion/Tailor 2008-07-041107175SAT 13.446 13.6437
Abscon 112v4 ESAC1096787SAT 17.1254 17.3287
Abscon 112v4 AC1096786SAT 17.4683 17.6492
spider 2008-06-141096771SAT 19.3321 19.4969
Concrete + CPS4J 2008-05-301096770SAT 37.5983 37.6659
Sugar v1.13+picosat1096775SAT 49.2825 49.8272
casper zito1096785SAT 74.7586 75.0668
SAT4J CSP 2008-06-131096774SAT 126.891 126.964
casper zao1096784SAT 141.101 141.79
Concrete + CSP4J - WMC Engine 2008-05-301096769? (TO) 1800.08 1800.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:
3 3 2 10 1 3 3 5 1 6 3 4 2 2 2 8 1 6 3 0 7 4 5 6 2 2 10 9 6 1 0 8 4 7 6 10 8 2 4 1