MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
MaxCSP/randomMaxCSP/sparseLoose/
vcsp-40-10-13-60-9_ext.xml

Jump to solvers results

General information on the benchmark

NameMaxCSP/randomMaxCSP/sparseLoose/
vcsp-40-10-13-60-9_ext.xml
MD5SUMa5b6364f7961486618a0d3e6c2b3bd97
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints98
Best CPU time to get the best result obtained on this benchmark3.59145
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints101
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension101
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
toolbar 2007-01-12281112OPTIMUM 3.59145 3.63989
Toolbar_BTD 2007-01-12281111OPTIMUM 3.75943 3.80484
Toulbar2 2007-01-12281109OPTIMUM 4.15237 4.19871
aolibdvo 2007-01-17281105OPTIMUM 10.7674 10.8622
aolibpvo 2007-01-17281104OPTIMUM 32.0881 32.3768
AbsconMax 109 EPFC281107OPTIMUM 57.1843 57.7752
AbsconMax 109 PFC281108OPTIMUM 64.0593 64.422
CSP4J - MaxCSP 2006-12-19281106MSAT (TO) 2400.1 2403.95
Toolbar_MaxSat 2007-01-19281110? (TO) 2400.06 2409.14