MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
maxcsp/cnf/3-40-2100-3000/
normalized-cnf-3-40-2500-147429_ext.xml

Jump to solvers results

General information on the benchmark

Namemaxcsp/cnf/3-40-2100-3000/
normalized-cnf-3-40-2500-147429_ext.xml
MD5SUM0a2d5e05d9b921f2bf26a2593d6f7614
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints195
Best CPU time to get the best result obtained on this benchmark155.146
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints2220
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension2220
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 2008-06-271127678OPTIMUM195 125.462 125.548
toulbar2/BTD 2008-06-271127677OPTIMUM195 155.146 156.734
Concrete + CSP4J - MCRW Engine 2008-05-301127671MSAT (TO)195 3600 3631.72
Concrete + CSP4J - Tabu Engine 2008-05-301127672MSAT (TO)195 3600.07 3617.52
AbsconMax 112 pc-d1127674MSAT (TO)195 3600.09 3619.27
AbsconMax 112 pc-w1127673MSAT (TO)195 3600.15 3606.15
Sugar v1.13+minisat1127676MSAT (TO)277 3600.05 3617.92
Sugar++ v1.13+minisat-inc1127675MSAT (TO)319 3600.14 3615.41

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