CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/composed-75-1-80/
normalized-composed-75-1-80-3_ext.xml
MD5SUM2fb10f5ac1704cf3a2cc008bb8bb1477
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.046992
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
MDG-noprobe 2008-06-271102779UNSAT 0.046992 0.0530531
Mistral-prime 1.3131102789UNSAT 0.047992 0.055069
Mistral-option 1.3141102788UNSAT 0.048992 0.0567779
cpHydra k_101102794UNSAT 0.055991 0.064774
cpHydra k_401102795UNSAT 0.05999 0.0686899
MDG-probe 2008-06-271102778UNSAT 0.068989 0.071345
casper zito1102791UNSAT 0.089985 0.0954671
spider 2008-06-141102777UNSAT 0.103983 0.107879
casper zao1102790UNSAT 0.246961 0.254077
bpsolver 2008-06-271102783UNSAT 0.415936 0.426676
Minion/Tailor 2008-07-041105436UNSAT 0.629904 0.670849
Concrete + CPS4J 2008-05-301102776UNSAT 0.72189 0.747997
choco2_dwdeg 2008-06-261102785UNSAT 0.773881 0.820894
choco2_impwdeg 2008-06-261102784UNSAT 0.815875 0.846125
Abscon 112v4 AC1102792UNSAT 0.943856 0.998097
Abscon 112v4 ESAC1102793UNSAT 1.10383 1.15767
Sugar v1.13+picosat1102781UNSAT 1.22781 1.32595
Sugar v1.13+minisat1102782UNSAT 1.35879 1.46928
galac E1102787UNSAT 1.36279 1.25125
galac M1102786UNSAT 1.52377 1.57421
SAT4J CSP 2008-06-131102780UNSAT 2.48562 2.53982
Concrete + CSP4J - Tabu Engine 2008-05-301102774? (TO) 1800.06 1816.03
Concrete + CSP4J - WMC Engine 2008-05-301102775? (TO) 1800.09 1808.92

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: