CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/composed-25-1-80/
normalized-composed-25-1-80-8_ext.xml
MD5SUM2ba98a840a9a02d73e44cd6cf680c46b
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.021996
Satisfiable
(Un)Satisfiability was proved
Number of variables33
Number of constraints302
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension302
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-271097917UNSAT 0.021996 0.023535
Mistral-prime 1.3131097927UNSAT 0.023996 0.0296129
Mistral-option 1.3141097926UNSAT 0.024995 0.0308811
casper zito1097929UNSAT 0.032994 0.0342991
cpHydra k_101097932UNSAT 0.033993 0.0340539
cpHydra k_401097933UNSAT 0.034993 0.0366421
spider 2008-06-141097915UNSAT 0.047992 0.053511
MDG-probe 2008-06-271097916UNSAT 0.06399 0.0694961
casper zao1097928UNSAT 0.098984 0.105981
bpsolver 2008-06-271097921UNSAT 0.176973 0.177401
Concrete + CPS4J 2008-05-301097914UNSAT 0.573911 0.580705
Minion/Tailor 2008-07-041105418UNSAT 0.573912 0.627911
choco2_dwdeg 2008-06-261097923UNSAT 0.644901 0.685351
choco2_impwdeg 2008-06-261097922UNSAT 0.662899 0.686748
Abscon 112v4 ESAC1097931UNSAT 0.833872 0.887108
Abscon 112v4 AC1097930UNSAT 0.84787 0.885988
galac M1097924UNSAT 0.966852 0.982384
Sugar v1.13+picosat1097919UNSAT 1.00685 1.13784
galac E1097925UNSAT 1.00885 1.0642
Sugar v1.13+minisat1097920UNSAT 1.3108 1.39493
SAT4J CSP 2008-06-131097918UNSAT 1.88571 1.91663
Concrete + CSP4J - Tabu Engine 2008-05-301097912? (TO) 1800.02 1802.22
Concrete + CSP4J - WMC Engine 2008-05-301097913? (TO) 1800.09 1808.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: