MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/composed-75-1-40/
normalized-composed-75-1-40-5_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/composed-75-1-40/
normalized-composed-75-1-40-5_ext.xml
MD5SUMcda0453d2dc2adf7f01e5f798439ac6b
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints3
Best CPU time to get the best result obtained on this benchmark5.68613
Satisfiable
(Un)Satisfiability was proved
Number of variables83
Number of constraints662
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension662
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
Sugar++ v1.13+minisat-inc1114547OPTIMUM3 5.68613 6.26136
toulbar2/BTD 2008-06-271114549OPTIMUM3 9.8275 9.91604
Sugar v1.13+minisat1114548OPTIMUM3 10.5114 11.8514
toulbar2 2008-06-271114550OPTIMUM3 17.5913 17.743
AbsconMax 112 pc-w1114545OPTIMUM3 207.638 479.31
AbsconMax 112 pc-d1114546MSAT (TO)3 1582.73 4000.06
Concrete + CSP4J - MCRW Engine 2008-05-301114543MSAT (TO)3 3600.04 3601.82
Concrete + CSP4J - Tabu Engine 2008-05-301114544MSAT (TO)3 3600.08 3632.32

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: 3
Solution found:
6 1 9 9 9 8 3 8 9 7 8 8 8 3 6 7 7 9 8 9 8 5 8 9 9 3 5 1 6 6 9 8 6 1 5 7 6 5 7 9 8 4 0 9 5 6 8 9 5 6 7 8 6 7 9 2 6 3 2 9 7 8 8 7 2 6 9 1 4 9
8 9 1 9 0 7 2 3 9 8 7 5 1