MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/pedigree/
normalized-simple_ext.xml
MD5SUMf7ed9839fb67bff9d3b416a2820019e4
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.027995
Satisfiable
(Un)Satisfiability was proved
Number of variables6
Number of constraints6
Maximum constraint arity3
Maximum domain size10
Number of constraints which are defined in extension6
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-271127246OPTIMUM1 0.007997 0.0106399
toulbar2/BTD 2008-06-271127245OPTIMUM1 0.027995 0.033404
Sugar v1.13+minisat1127244OPTIMUM1 0.678895 0.717446
Sugar++ v1.13+minisat-inc1127243OPTIMUM1 0.732887 0.85961
AbsconMax 112 pc-d1127242OPTIMUM1 30.6293 30.8097
AbsconMax 112 pc-w1127241OPTIMUM1 30.6873 31.0578
Concrete + CSP4J - Tabu Engine 2008-05-301127240MSAT (TO)1 3600.03 3604.12
Concrete + CSP4J - MCRW Engine 2008-05-301127239MSAT (TO)1 3600.1 3626.62

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:
8 1 5 2 5 -1