CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/composed-25-1-80/
normalized-composed-25-1-80-0_ext.xml
MD5SUMf3bb51f5d49e3f8496ef86cd257fb978
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.022996
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
Mistral-prime 1.3131097861UNSAT 0.022996 0.023785
Mistral-option 1.3141097860UNSAT 0.024995 0.0316811
MDG-noprobe 2008-06-271097851UNSAT 0.027995 0.033192
cpHydra k_101097866UNSAT 0.035993 0.0431339
cpHydra k_401097867UNSAT 0.035993 0.0422991
casper zito1097863UNSAT 0.036993 0.04257
MDG-probe 2008-06-271097850UNSAT 0.042992 0.0494141
spider 2008-06-141097849UNSAT 0.047992 0.0535639
casper zao1097862UNSAT 0.049991 0.057752
bpsolver 2008-06-271097855UNSAT 0.18897 0.193922
Minion/Tailor 2008-07-041105415UNSAT 0.527919 0.572375
Concrete + CPS4J 2008-05-301097848UNSAT 0.594909 0.634201
choco2_impwdeg 2008-06-261097856UNSAT 0.685895 0.739614
Abscon 112v4 AC1097864UNSAT 0.812876 0.838132
choco2_dwdeg 2008-06-261097857UNSAT 0.822874 0.84395
Abscon 112v4 ESAC1097865UNSAT 0.826873 0.823564
galac M1097858UNSAT 0.994848 1.03626
Sugar v1.13+picosat1097853UNSAT 1.08083 1.23079
Sugar v1.13+minisat1097854UNSAT 1.16782 1.2315
galac E1097859UNSAT 1.25281 1.28659
SAT4J CSP 2008-06-131097852UNSAT 1.72774 1.79021
Concrete + CSP4J - Tabu Engine 2008-05-301097846? (TO) 1800.01 1816.82
Concrete + CSP4J - WMC Engine 2008-05-301097847? (TO) 1800.04 1803.32

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: