MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
maxcsp/celar/graphs/
normalized-graphw-07_ext.xml

Jump to solvers results

General information on the benchmark

Namemaxcsp/celar/graphs/
normalized-graphw-07_ext.xml
MD5SUM7737d5e4ecec37ba4d3e307594bfe00e
Bench Category2-ARY-EXT (binary 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 benchmark0.674897
Satisfiable
(Un)Satisfiability was proved
Number of variables142
Number of constraints1945
Maximum constraint arity2
Maximum domain size44
Number of constraints which are defined in extension1945
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-271125366OPTIMUM122 0.674897 0.690092
toulbar2/BTD 2008-06-271125365OPTIMUM122 5.38818 5.43076
Concrete + CSP4J - MCRW Engine 2008-05-301125359MSAT (TO)122 3600.03 3615.32
Concrete + CSP4J - Tabu Engine 2008-05-301125360MSAT (TO)122 3600.1 3642.92
AbsconMax 112 pc-d1125362MSAT (TO)131 1595.84 4000.07
AbsconMax 112 pc-w1125361MSAT (TO)131 1620.13 4000.04
Sugar++ v1.13+minisat-inc1125363MSAT (TO)212 3600.21 3680.51
Sugar v1.13+minisat1125364MSAT (TO)242 3600.08 3621.32

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:
35 0 9 22 1 34 27 2 6 27 0 9 1 27 0 0 31 0 2 2 0 35 34 43 41 4 43 21 4 27 33 31 30 0 35 2 0 31 43 35 39 4 6 0 27 30 2 2 2 2 30 34 0 6 1 1 43
8 2 9 2 43 0 43 4 33 43 43 35 34 7 2 43 34 35 31 36 0 0 8 36 0 8 30 2 2 32 35 33 0 5 34 2 9 5 0 2 27 7 9 43 43 0 19 3 33 4 35 31 3 0 30 0 27
8 35 2 35 0 31 34 43 34 35 1 29 23 19 30 0 2 35 4 0 2 0 8 34 1 30 0 -1