MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/cnf/3-40-2100-3000/
normalized-cnf-3-40-2500-147422_ext.xml
MD5SUMb1e0592790896c797864f8c9677ae79e
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints210
Best CPU time to get the best result obtained on this benchmark353.787
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints2199
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension2199
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-271127693OPTIMUM210 353.787 355.216
toulbar2 2008-06-271127694OPTIMUM210 375.191 376.681
Concrete + CSP4J - MCRW Engine 2008-05-301127687MSAT (TO)210 3600 3619.03
Concrete + CSP4J - Tabu Engine 2008-05-301127688MSAT (TO)210 3600.02 3628.12
AbsconMax 112 pc-d1127690MSAT (TO)210 3600.08 3602.46
AbsconMax 112 pc-w1127689MSAT (TO)210 3600.12 3634.23
Sugar++ v1.13+minisat-inc1127691MSAT (TO)252 3600.18 3606.91
Sugar v1.13+minisat1127692MSAT (TO)284 3600.09 3625.31

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