CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/varDimacs/
normalized-hole-07_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/varDimacs/
normalized-hole-07_ext.xml
MD5SUMd0dfb06c2c1647e5949b7f71273b876a
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.020995
Satisfiable
(Un)Satisfiability was proved
Number of variables56
Number of constraints204
Maximum constraint arity7
Maximum domain size2
Number of constraints which are defined in extension204
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
casper zito1082979UNSAT 0.020995 0.021599
casper zao1082978UNSAT 0.020996 0.0226101
MDG-noprobe 2008-06-271082967UNSAT 0.091985 0.0991661
Mistral-prime 1.3131082977UNSAT 0.095985 0.101375
cpHydra k_401082983UNSAT 0.106983 0.113428
cpHydra k_101082982UNSAT 0.118981 0.123379
Mistral-option 1.3141082976UNSAT 0.12198 0.128026
MDG-probe 2008-06-271082966UNSAT 0.12698 0.126766
bpsolver 2008-06-271082971UNSAT 0.242962 0.251035
Minion/Tailor 2008-07-041107361UNSAT 0.578911 0.596636
Sugar v1.13+picosat1082969UNSAT 0.763883 0.765706
galac M1082974UNSAT 0.768882 0.818609
Sugar v1.13+minisat1082970UNSAT 0.775881 0.871495
mddc-solv 2008-06-091082964UNSAT 0.813876 0.817532
Abscon 112v4 ESAC1082981UNSAT 0.863868 0.905856
Abscon 112v4 AC1082980UNSAT 0.904861 0.952602
galac E1082975UNSAT 0.907861 0.936955
spider 2008-06-141082965UNSAT 1.08983 1.10612
SAT4J CSP 2008-06-131082968UNSAT 1.27081 1.30298
choco2_dwdeg 2008-06-261082973UNSAT 1.64775 1.67439
Concrete + CPS4J 2008-05-301082963UNSAT 1.74873 1.77514
choco2_impwdeg 2008-06-261082972UNSAT 2.19267 2.26738
Concrete + CSP4J - Tabu Engine 2008-05-301082961? (TO) 1800.04 1821.72
Concrete + CSP4J - WMC Engine 2008-05-301082962? (TO) 1800.06 1801.22

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found: