MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/randomMaxCSP/sparseLoose/
normalized-vcsp-60-10-8-60-4_ext.xml
MD5SUM495299e13be2421b0ab9b22fb2864c07
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 benchmark6.544
Satisfiable
(Un)Satisfiability was proved
Number of variables60
Number of constraints142
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension142
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
Sugar++ v1.13+minisat-inc1117067OPTIMUM3 6.544 7.91185
toulbar2 2008-06-271117070OPTIMUM3 6.79497 6.8682
Sugar v1.13+minisat1117068OPTIMUM3 7.18091 7.51756
toulbar2/BTD 2008-06-271117069OPTIMUM3 11.0153 11.0661
AbsconMax 112 pc-w1117065MSAT (TO)3 1584.46 4000.05
AbsconMax 112 pc-d1117066MSAT (TO)3 1601.36 4000.05
Concrete + CSP4J - Tabu Engine 2008-05-301117064MSAT (TO)3 3600.02 3615.22
Concrete + CSP4J - MCRW Engine 2008-05-301117063MSAT (TO)3 3600.09 3609.12

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