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 constraints203
Best CPU time to get the best result obtained on this benchmark0.555915
(Un)Satisfiability was proved
Number of variables56
Number of constraints204
Maximum constraint arity7
Maximum domain size2
Number of constraints which are defined in extension204
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_MaxSat 2007-01-19277600OPTIMUM 0.555915 0.569579
toolbar 2007-01-12277602OPTIMUM 2.81357 2.85164
Toolbar_BTD 2007-01-12277601OPTIMUM 3.19451 3.23094
Toulbar2 2007-01-12277599OPTIMUM 4.17636 4.21925
AbsconMax 109 PFC277598OPTIMUM 10.6454 10.7564
AbsconMax 109 EPFC277597OPTIMUM 11.3993 11.5456
aolibpvo 2007-01-17277594OPTIMUM 149.108 150.299
aolibdvo 2007-01-17277595OPTIMUM 1006.42 1015.4
CSP4J - MaxCSP 2006-12-19277596MSAT (TO) 2400.01 2406.97