MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/composed-25-1-40/
normalized-composed-25-1-40-4_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/composed-25-1-40/
normalized-composed-25-1-40-4_ext.xml
MD5SUM58b8c461a7aaf4f049c79fb4647f388b
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints2
Best CPU time to get the best result obtained on this benchmark0.130979
Satisfiable
(Un)Satisfiability was proved
Number of variables33
Number of constraints262
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension262
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 2008-06-271114846OPTIMUM2 0.130979 0.137922
toulbar2/BTD 2008-06-271114845OPTIMUM2 0.801877 0.808985
Sugar++ v1.13+minisat-inc1114843OPTIMUM2 2.99554 3.16112
Sugar v1.13+minisat1114844OPTIMUM2 3.33349 3.52135
AbsconMax 112 pc-w1114841OPTIMUM2 352.249 851.161
AbsconMax 112 pc-d1114842MSAT (TO)2 1576.96 4000.07
Concrete + CSP4J - Tabu Engine 2008-05-301114840MSAT (TO)2 3600.07 3601.92
Concrete + CSP4J - MCRW Engine 2008-05-301114839MSAT (TO)2 3600.09 3612.72

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