MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
maxcsp/cnf/3-40-1100-2000/
normalized-cnf-3-40-1600-616125_ext.xml

Jump to solvers results

General information on the benchmark

Namemaxcsp/cnf/3-40-1100-2000/
normalized-cnf-3-40-1600-616125_ext.xml
MD5SUMc8728d8fea45126a11597e0a1ff36b8b
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints122
Best CPU time to get the best result obtained on this benchmark232.084
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints1496
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension1496
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-271127509OPTIMUM122 232.084 233.17
toulbar2 2008-06-271127510OPTIMUM122 251.06 253.217
Concrete + CSP4J - MCRW Engine 2008-05-301127503MSAT (TO)122 3600.01 3617.42
Concrete + CSP4J - Tabu Engine 2008-05-301127504MSAT (TO)122 3600.03 3615.12
AbsconMax 112 pc-w1127505MSAT (TO)122 3600.1 3613.33
AbsconMax 112 pc-d1127506MSAT (TO)122 3600.15 3612.98
Sugar v1.13+minisat1127508MSAT (TO)179 3600.09 3615.67
Sugar++ v1.13+minisat-inc1127507MSAT (TO)194 3600.15 3603.46

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