MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rand-2-30-15/
normalized-rand-2-30-15-306-230-40_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/rand-2-30-15/
normalized-rand-2-30-15-306-230-40_ext.xml
MD5SUMfcd01f4940aecbe10e6b6d9b4cbeb460
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints1
Best CPU time to get the best result obtained on this benchmark36.6214
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints223
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension223
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
toulbar2/BTD 2008-06-271114789OPTIMUM1 35.8116 35.8355
toulbar2 2008-06-271114790OPTIMUM1 36.6214 36.9509
Sugar v1.13+minisat1114788OPTIMUM1 57.4123 58.8118
Sugar++ v1.13+minisat-inc1114787OPTIMUM1 97.4232 98.771
AbsconMax 112 pc-w1114785OPTIMUM1 1034.14 1056.2
AbsconMax 112 pc-d1114786MSAT (TO)1 1584.13 4000.04
Concrete + CSP4J - Tabu Engine 2008-05-301114784MSAT (TO)1 3600.06 3605.12
Concrete + CSP4J - MCRW Engine 2008-05-301114783MSAT (TO)1 3600.09 3621.23

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:
2 10 7 6 10 0 1 0 6 5 5 4 13 7 1 8 7 2 8 0 10 8 8 8 4 2 8 6 4 6