MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
maxcsp/pedigree/
normalized-connell_ext.xml

Jump to solvers results

General information on the benchmark

Namemaxcsp/pedigree/
normalized-connell_ext.xml
MD5SUMbae97c5d5334d51ddebe0c72aebbf7b6
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 benchmark0.029995
Satisfiable
(Un)Satisfiability was proved
Number of variables13
Number of constraints15
Maximum constraint arity3
Maximum domain size6
Number of constraints which are defined in extension15
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-271127158OPTIMUM1 0.010998 0.017252
toulbar2/BTD 2008-06-271127157OPTIMUM1 0.029995 0.0521861
Sugar v1.13+minisat1127156OPTIMUM1 0.600907 0.664171
Sugar++ v1.13+minisat-inc1127155OPTIMUM1 0.614905 0.797109
AbsconMax 112 pc-w1127153OPTIMUM1 30.6473 31.1184
AbsconMax 112 pc-d1127154OPTIMUM1 30.7393 31.0917
Concrete + CSP4J - Tabu Engine 2008-05-301127152MSAT (TO)1 3600 3618.42
Concrete + CSP4J - MCRW Engine 2008-05-301127151MSAT (TO)1 3600.03 3607.92

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:
3 1 3 1 1 3 3 1 1 3 1 0 -1