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 constraints252
Best CPU time to get the best result obtained on this benchmark70.6633
(Un)Satisfiability was provedNO
Number of variables23
Number of constraints253
Maximum constraint arity2
Maximum domain size23
Number of constraints which are defined in extension253
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-12275205OPTIMUM 70.6633 71.2219
Toolbar_BTD 2007-01-12275204OPTIMUM 88.6255 89.0271
AbsconMax 109 PFC275201OPTIMUM 621.535 624.643
aolibpvo 2007-01-17275197OPTIMUM 679.957 685.17
aolibdvo 2007-01-17275198OPTIMUM 680.837 686.375
Toulbar2 2007-01-12275202OPTIMUM 1367.48 1373.95
CSP4J - MaxCSP 2006-12-19275199MSAT (TO) 2400 2411.78
AbsconMax 109 EPFC275200MSAT (TO) 2400.11 2412.98
Toolbar_MaxSat 2007-01-19275203? (TO) 2400.06 2404.66