MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pigeons/
normalized-pigeons-30-ord.xml

Jump to solvers results

General information on the benchmark

Namecsp/pigeons/
normalized-pigeons-30-ord.xml
MD5SUMa65fadea1ed073215cc0421208c83f3c
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints1
Best CPU time to get the best result obtained on this benchmark7.18291
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints870
Maximum constraint arity2
Maximum domain size29
Number of constraints which are defined in extension0
Number of constraints which are defined in intension870
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar++ v1.13+minisat-inc1113789OPTIMUM1 7.18291 7.79004
Sugar v1.13+minisat1113790OPTIMUM1 16.4245 16.9366
AbsconMax 112 pc-d1113788OPTIMUM1 297.481 696.151
AbsconMax 112 pc-w1113787MSAT (TO)1 1605.33 4000.04
Concrete + CSP4J - Tabu Engine 2008-05-301113786MSAT (TO)1 3600.01 3613.43
Concrete + CSP4J - MCRW Engine 2008-05-301113785MSAT (TO)1 3600.08 3600.12

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Number of falsified constraints: 1
Solution found:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 26 27 28