MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/dubois/
normalized-dubois-100_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/dubois/
normalized-dubois-100_ext.xml
MD5SUM751ddd7218f8f782ca5fbeab1c665c06
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints1
Best CPU time to get the best result obtained on this benchmark0.263959
Satisfiable
(Un)Satisfiability was proved
Number of variables300
Number of constraints200
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension200
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
toulbar2/BTD 2008-06-271110637OPTIMUM1 0.263959 0.26846
Sugar++ v1.13+minisat-inc1110635OPTIMUM1 2.6236 2.84901
Sugar v1.13+minisat1110636OPTIMUM1 2.99054 3.28172
Concrete + CSP4J - MCRW Engine 2008-05-301110631MSAT (TO)1 3600.06 3601.42
Concrete + CSP4J - Tabu Engine 2008-05-301110632MSAT (TO)1 3600.09 3633.33
AbsconMax 112 pc-w1110633MSAT (TO)1 3600.11 3634.04
AbsconMax 112 pc-d1110634MSAT (TO)1 3600.13 3614.95
toulbar2 2008-06-271110638? (TO) 3600.05 3620.01

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: 1
Solution found:
0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1