MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/cnf/3-40-2100-3000/
normalized-cnf-3-40-2900-050222_ext.xml
MD5SUM73c4d68fd4d4cc486a72607fe735803e
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints252
Best CPU time to get the best result obtained on this benchmark543.269
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints2501
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension2501
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-271127670OPTIMUM252 447.36 449.521
toulbar2/BTD 2008-06-271127669OPTIMUM252 543.269 547.667
Concrete + CSP4J - Tabu Engine 2008-05-301127664MSAT (TO)252 3600.02 3601.12
Concrete + CSP4J - MCRW Engine 2008-05-301127663MSAT (TO)252 3600.06 3605.62
AbsconMax 112 pc-w1127665MSAT (TO)257 3600.07 3623.35
AbsconMax 112 pc-d1127666MSAT (TO)257 3600.13 3617.63
Sugar++ v1.13+minisat-inc1127667MSAT (TO)312 3600.2 3617.14
Sugar v1.13+minisat1127668MSAT (TO)352 3600.05 3617.74

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