MAX-CSP 2006 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameMaxCSP/randomMaxCSP/sparseLoose/
vcsp-40-10-13-60-1_ext.xml
MD5SUM074334a74b9cca65d3467805ba0e1d32
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 benchmark4.41833
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-12281076OPTIMUM 4.41833 4.42691
Toolbar_BTD 2007-01-12281075OPTIMUM 4.69329 4.70008
Toulbar2 2007-01-12281073OPTIMUM 7.45287 7.53733
aolibdvo 2007-01-17281069OPTIMUM 8.73867 8.7745
aolibpvo 2007-01-17281068OPTIMUM 15.5826 15.6371
AbsconMax 109 EPFC281071OPTIMUM 109.111 110.077
AbsconMax 109 PFC281072OPTIMUM 138.157 138.223
CSP4J - MaxCSP 2006-12-19281070MSAT (TO) 2400.03 2411.51
Toolbar_MaxSat 2007-01-19281074? (TO) 2400.1 2401.07