MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
MaxCSP/randomMaxCSP/sparseTight/
vcsp-25-10-21-85-31_ext.xml

Jump to solvers results

General information on the benchmark

NameMaxCSP/randomMaxCSP/sparseTight/
vcsp-25-10-21-85-31_ext.xml
MD5SUM870b2efa60768d12d0f047b830505f2d
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints43
Best CPU time to get the best result obtained on this benchmark2.42063
Satisfiable
(Un)Satisfiability was proved
Number of variables25
Number of constraints63
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension63
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
aolibpvo 2007-01-17281671OPTIMUM 2.42063 2.44667
aolibdvo 2007-01-17281672OPTIMUM 2.6036 2.61079
toolbar 2007-01-12281679OPTIMUM 3.82642 3.83459
Toulbar2 2007-01-12281676OPTIMUM 3.9714 4.00912
Toolbar_BTD 2007-01-12281678OPTIMUM 4.05238 4.09902
AbsconMax 109 EPFC281674OPTIMUM 237.469 239.403
AbsconMax 109 PFC281675OPTIMUM 278.404 278.742
CSP4J - MaxCSP 2006-12-19281673? (problem) 0.388939 0.534165
Toolbar_MaxSat 2007-01-19281677? (TO) 2400.02 2401.02