MAX-CSP 2006 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameMaxCSP/randomMaxCSP/sparseLoose/
vcsp-40-10-13-60-33_ext.xml
MD5SUM5ee1c01b688244fb571971d2bab5b4b1
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints97
Best CPU time to get the best result obtained on this benchmark5.9011
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_BTD 2007-01-12280994OPTIMUM 5.9011 5.94406
toolbar 2007-01-12280995OPTIMUM 5.97509 6.03272
Toulbar2 2007-01-12280992OPTIMUM 15.6896 15.7078
AbsconMax 109 PFC280991OPTIMUM 391.869 392.509
AbsconMax 109 EPFC280990OPTIMUM 650.487 651.82
CSP4J - MaxCSP 2006-12-19280989MSAT (TO) 2400.12 2413.66
Toolbar_MaxSat 2007-01-19280993? (TO) 2400.09 2411.67
aolibpvo 2007-01-17280987Signal 0.055991 0.0576321
aolibdvo 2007-01-17280988Signal 28.9716 29.192