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 constraints254
Best CPU time to get the best result obtained on this benchmark0.221966
(Un)Satisfiability was proved
Number of variables40
Number of constraints255
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension255
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-17279088OPTIMUM 0.221966 0.229529
aolibdvo 2007-01-17279089OPTIMUM 0.315951 0.327469
AbsconMax 109 PFC279092OPTIMUM 1.00785 1.07402
AbsconMax 109 EPFC279091OPTIMUM 1.19682 1.28495
toolbar 2007-01-12279096OPTIMUM 3.13352 3.13699
Toulbar2 2007-01-12279093OPTIMUM 3.13852 3.14152
Toolbar_BTD 2007-01-12279095OPTIMUM 3.22351 3.35239
Toolbar_MaxSat 2007-01-19279094OPTIMUM 202.557 204.146
CSP4J - MaxCSP 2006-12-19279090MSAT (TO) 2400 2411.84