MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/bddSmall/
normalized-bdd-21-133-18-78-29_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/bddSmall/
normalized-bdd-21-133-18-78-29_ext.xml
MD5SUM2034138d66778207fd18551b97ae971b
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints3
Best CPU time to get the best result obtained on this benchmark274.533
Satisfiable
(Un)Satisfiability was proved
Number of variables21
Number of constraints133
Maximum constraint arity18
Maximum domain size2
Number of constraints which are defined in extension133
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
AbsconMax 112 pc-d1110974OPTIMUM3 274.533 274.782
toulbar2 2008-06-271110978OPTIMUM3 282.289 285.004
AbsconMax 112 pc-w1110973OPTIMUM3 283.137 283.262
toulbar2/BTD 2008-06-271110977OPTIMUM3 458.367 462.822
Concrete + CSP4J - MCRW Engine 2008-05-301110971MSAT (TO)3 3600.05 3634.02
Concrete + CSP4J - Tabu Engine 2008-05-301110972MSAT (TO)3 3600.06 3603.62
Sugar v1.13+minisat1110976? 132.004 133.401
Sugar++ v1.13+minisat-inc1110975? 152.276 152.936

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Number of falsified constraints: 3
Solution found:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1