CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/composed-75-1-80/
normalized-composed-75-1-80-1_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/composed-75-1-80/
normalized-composed-75-1-80-1_ext.xml
MD5SUM48585bc76f56f4e7178f9d3982b8e6f7
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.048991
Satisfiable
(Un)Satisfiability was proved
Number of variables83
Number of constraints702
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension702
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
Mistral-option 1.3141102876UNSAT 0.048991 0.0569031
Mistral-prime 1.3131102877UNSAT 0.050992 0.0581561
MDG-noprobe 2008-06-271102867UNSAT 0.052991 0.0594629
cpHydra k_401102883UNSAT 0.05999 0.0683389
cpHydra k_101102882UNSAT 0.064989 0.069357
casper zito1102879UNSAT 0.083986 0.0919109
spider 2008-06-141102865UNSAT 0.103983 0.113171
MDG-probe 2008-06-271102866UNSAT 0.154976 0.161712
casper zao1102878UNSAT 0.231963 0.244414
bpsolver 2008-06-271102871UNSAT 0.416936 0.428405
Minion/Tailor 2008-07-041105435UNSAT 0.668898 0.683612
Concrete + CPS4J 2008-05-301102864UNSAT 0.775882 0.790272
choco2_impwdeg 2008-06-261102872UNSAT 0.790878 0.832184
choco2_dwdeg 2008-06-261102873UNSAT 0.825874 0.842376
Abscon 112v4 ESAC1102881UNSAT 1.02284 1.04739
Abscon 112v4 AC1102880UNSAT 1.10883 1.15292
Sugar v1.13+picosat1102869UNSAT 1.23481 1.34105
galac M1102874UNSAT 1.3058 1.36492
Sugar v1.13+minisat1102870UNSAT 1.38579 1.50675
galac E1102875UNSAT 1.58776 1.62441
SAT4J CSP 2008-06-131102868UNSAT 2.67159 2.74648
Concrete + CSP4J - Tabu Engine 2008-05-301102862? (TO) 1800.03 1808.92
Concrete + CSP4J - WMC Engine 2008-05-301102863? (TO) 1800.07 1804.82

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: