MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints2019
Best CPU time to get the best result obtained on this benchmark713.635
(Un)Satisfiability was proved
Number of variables40
Number of constraints2239
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension2239
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-12278331OPTIMUM 713.635 718.492
Toolbar_BTD 2007-01-12278330OPTIMUM 771.501 778.402
Toolbar_MaxSat 2007-01-19278329OPTIMUM 782.274 789.598
Toulbar2 2007-01-12278328OPTIMUM 2150.19 2170.16
CSP4J - MaxCSP 2006-12-19278325MSAT (TO) 2400.06 2411.63
AbsconMax 109 EPFC278326MSAT (TO) 2400.09 2413.34
AbsconMax 109 PFC278327MSAT (TO) 2400.12 2403.05
aolibpvo 2007-01-17278323? (TO) 2400.05 2404.66
aolibdvo 2007-01-17278324? (TO) 2400.09 2416.79