MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints220
Best CPU time to get the best result obtained on this benchmark61.3937
(Un)Satisfiability was proved
Number of variables30
Number of constraints400
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension400
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_MaxSat 2007-01-19279787OPTIMUM 39.582 39.9156
toolbar 2007-01-12279789OPTIMUM 61.3937 61.7945
Toolbar_BTD 2007-01-12279788OPTIMUM 70.5443 70.8316
aolibpvo 2007-01-17279781OPTIMUM 285.47 287.469
aolibdvo 2007-01-17279782OPTIMUM 323.296 324.819
Toulbar2 2007-01-12279786OPTIMUM 412.774 413.417
CSP4J - MaxCSP 2006-12-19279783MSAT (TO) 2400.05 2407.76
AbsconMax 109 PFC279785MSAT (TO) 2400.13 2410.54
AbsconMax 109 EPFC279784MSAT (TO) 2400.16 2404.34