MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rand-3-20-20/
normalized-rand-3-20-20-60-632-2_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/rand-3-20-20/
normalized-rand-3-20-20-60-632-2_ext.xml
MD5SUM7dd14eb3da87adf272f3ba5d037b39c9
Bench CategoryN-ARY-EXT (n-ary 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 benchmark129.316
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints60
Maximum constraint arity3
Maximum domain size20
Number of constraints which are defined in extension60
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
AbsconMax 112 pc-w1112097OPTIMUM1 129.316 130.218
toulbar2 2008-06-271112102OPTIMUM1 150.715 151.597
toulbar2/BTD 2008-06-271112101OPTIMUM1 151.885 153.277
Sugar++ v1.13+minisat-inc1112099OPTIMUM1 386.558 390.486
Sugar v1.13+minisat1112100OPTIMUM1 436.432 440.809
Concrete + CSP4J - Tabu Engine 2008-05-301112096MSAT (TO)1 3600.07 3618.93
Concrete + CSP4J - MCRW Engine 2008-05-301112095MSAT (TO)1 3600.07 3619.32
AbsconMax 112 pc-d1112098MSAT (TO)1 3600.09 3620.74

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:
5 15 8 19 3 2 9 7 9 2 5 1 6 0 2 13 17 9 13 8