CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/composed-75-1-25/
normalized-composed-75-1-25-2_ext.xml
MD5SUMcacd1228634988192f778efdb81c069d
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.050991
Satisfiable
(Un)Satisfiability was proved
Number of variables83
Number of constraints647
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension647
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-271098247UNSAT 0.050991 0.0577849
Mistral-prime 1.3131098257UNSAT 0.051992 0.0614209
Mistral-option 1.3141098256UNSAT 0.055991 0.0612229
cpHydra k_401098263UNSAT 0.06299 0.0686691
cpHydra k_101098262UNSAT 0.063989 0.0699861
casper zito1098259UNSAT 0.079986 0.0857949
spider 2008-06-141098245UNSAT 0.098984 0.105572
MDG-probe 2008-06-271098246UNSAT 0.151976 0.159805
casper zao1098258UNSAT 0.214966 0.222671
bpsolver 2008-06-271098251UNSAT 0.398938 0.40488
Minion/Tailor 2008-07-041105420UNSAT 0.652899 0.675794
choco2_dwdeg 2008-06-261098253UNSAT 0.747885 0.779135
Concrete + CPS4J 2008-05-301098244UNSAT 0.747885 0.80504
choco2_impwdeg 2008-06-261098252UNSAT 0.811876 0.844191
Abscon 112v4 AC1098260UNSAT 0.945855 0.990029
Abscon 112v4 ESAC1098261UNSAT 0.949854 0.989909
Sugar v1.13+picosat1098249UNSAT 1.25881 1.32186
galac M1098254UNSAT 1.37979 1.42116
galac E1098255UNSAT 1.40579 1.46499
Sugar v1.13+minisat1098250UNSAT 1.53577 1.68547
SAT4J CSP 2008-06-131098248UNSAT 2.51162 2.58893
Concrete + CSP4J - Tabu Engine 2008-05-301098242? (TO) 1800 1801.02
Concrete + CSP4J - WMC Engine 2008-05-301098243? (TO) 1800.02 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: