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 constraints99
Best CPU time to get the best result obtained on this benchmark1.27681
(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
aolibpvo 2007-01-17281032OPTIMUM 1.27681 1.29275
aolibdvo 2007-01-17281033OPTIMUM 1.27681 1.29237
toolbar 2007-01-12281040OPTIMUM 2.92755 2.93657
Toulbar2 2007-01-12281037OPTIMUM 2.99254 3.02566
Toolbar_BTD 2007-01-12281039OPTIMUM 3.00454 3.00815
AbsconMax 109 PFC281036OPTIMUM 39.8299 40.2042
AbsconMax 109 EPFC281035OPTIMUM 43.6814 43.7881
CSP4J - MaxCSP 2006-12-19281034MSAT (TO) 2400.1 2402.6
Toolbar_MaxSat 2007-01-19281038? (TO) 2400.05 2421.59