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 constraints33
Best CPU time to get the best result obtained on this benchmark18.0862
(Un)Satisfiability was proved
Number of variables15
Number of constraints105
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension105
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-12281328OPTIMUM 18.0862 18.1184
Toolbar_BTD 2007-01-12281327OPTIMUM 18.8391 18.8618
Toulbar2 2007-01-12281325OPTIMUM 54.1798 54.3964
aolibdvo 2007-01-17281321OPTIMUM 260.889 262.088
aolibpvo 2007-01-17281320OPTIMUM 261.702 262.718
AbsconMax 109 EPFC281323OPTIMUM 641.112 646.53
AbsconMax 109 PFC281324MSAT (TO) 2400.11 2421.09
CSP4J - MaxCSP 2006-12-19281322? (problem) 0.397939 0.450391
Toolbar_MaxSat 2007-01-19281326? (TO) 2400.06 2412.73