CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/composed-75-1-40/
normalized-composed-75-1-40-2_ext.xml
MD5SUM5fc19e0e20ad84ce522431fbae7f7fdc
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.049991
Satisfiable
(Un)Satisfiability was proved
Number of variables83
Number of constraints662
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension662
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-prime 1.3131098037UNSAT 0.049991 0.0567639
MDG-noprobe 2008-06-271098027UNSAT 0.051991 0.0570541
Mistral-option 1.3141098036UNSAT 0.052991 0.0588669
cpHydra k_101098042UNSAT 0.061989 0.0684239
cpHydra k_401098043UNSAT 0.065989 0.0702899
casper zito1098039UNSAT 0.080987 0.087738
spider 2008-06-141098025UNSAT 0.099984 0.108228
casper zao1098038UNSAT 0.128979 0.134416
MDG-probe 2008-06-271098026UNSAT 0.204968 0.213176
bpsolver 2008-06-271098031UNSAT 0.406937 0.413275
Minion/Tailor 2008-07-041105431UNSAT 0.658899 0.677888
Concrete + CPS4J 2008-05-301098024UNSAT 0.798878 0.858788
choco2_dwdeg 2008-06-261098033UNSAT 0.803877 0.845656
Abscon 112v4 AC1098040UNSAT 0.937856 0.937755
choco2_impwdeg 2008-06-261098032UNSAT 1.00085 1.05221
Abscon 112v4 ESAC1098041UNSAT 1.02884 1.06036
Sugar v1.13+minisat1098030UNSAT 1.20582 1.33055
galac M1098034UNSAT 1.36879 1.42143
Sugar v1.13+picosat1098029UNSAT 1.37179 1.5124
galac E1098035UNSAT 1.45878 1.52026
SAT4J CSP 2008-06-131098028UNSAT 2.49562 2.54359
Concrete + CSP4J - Tabu Engine 2008-05-301098022? (TO) 1800.04 1802.72
Concrete + CSP4J - WMC Engine 2008-05-301098023? (TO) 1800.07 1818.72

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: