MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
maxcsp/randomMaxCSP/sparseLoose/
normalized-vcsp-80-10-6-60-8_ext.xml

Jump to solvers results

General information on the benchmark

Namemaxcsp/randomMaxCSP/sparseLoose/
normalized-vcsp-80-10-6-60-8_ext.xml
MD5SUM562cdbfd3eceeb05905dc19e990d69c0
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints3
Best CPU time to get the best result obtained on this benchmark153.115
Satisfiable
(Un)Satisfiability was proved
Number of variables80
Number of constraints190
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension190
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-271116502OPTIMUM3 153.115 154.421
Sugar v1.13+minisat1116500OPTIMUM3 257.926 260.548
Sugar++ v1.13+minisat-inc1116499OPTIMUM3 337.287 340.536
toulbar2/BTD 2008-06-271116501OPTIMUM3 381.96 384.884
Concrete + CSP4J - MCRW Engine 2008-05-301116495MSAT (TO)3 3600.01 3601.52
Concrete + CSP4J - Tabu Engine 2008-05-301116496MSAT (TO)3 3600.08 3631.32
AbsconMax 112 pc-w1116497MSAT (TO)4 1577.7 4000.05
AbsconMax 112 pc-d1116498MSAT (TO)4 1599.9 4000.03

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: 3
Solution found:
0 9 2 8 0 3 9 4 3 2 5 4 3 2 3 5 1 5 5 8 8 0 9 3 5 0 2 1 0 0 2 0 8 6 0 6 3 5 1 2 9 5 9 1 3 4 8 3 3 7 1 2 6 0 8 1 0 0 5 1 4 3 2 2 2 2 0 3 9 2
1 0 9 7 7 2 2 4 4 2