CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/composed-25-1-40/
normalized-composed-25-1-40-5_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/composed-25-1-40/
normalized-composed-25-1-40-5_ext.xml
MD5SUMb2833ad3d2dc03269ef05f64a007089d
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.019996
Satisfiable
(Un)Satisfiability was proved
Number of variables33
Number of constraints262
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension262
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.3131099885UNSAT 0.019996 0.021398
MDG-noprobe 2008-06-271099875UNSAT 0.021996 0.022215
Mistral-option 1.3141099884UNSAT 0.023995 0.028786
casper zito1099887UNSAT 0.030994 0.0383859
cpHydra k_401099891UNSAT 0.031994 0.0399139
cpHydra k_101099890UNSAT 0.033994 0.0398669
MDG-probe 2008-06-271099874UNSAT 0.038993 0.0456459
spider 2008-06-141099873UNSAT 0.040993 0.047456
casper zao1099886UNSAT 0.046992 0.0554201
bpsolver 2008-06-271099879UNSAT 0.163974 0.162947
Concrete + CPS4J 2008-05-301099872UNSAT 0.540917 0.573684
choco2_dwdeg 2008-06-261099881UNSAT 0.624904 0.675392
Minion/Tailor 2008-07-041105414UNSAT 0.625903 0.664356
choco2_impwdeg 2008-06-261099880UNSAT 0.661898 0.675256
Abscon 112v4 AC1099888UNSAT 0.804876 0.841849
Abscon 112v4 ESAC1099889UNSAT 0.858869 0.900391
Sugar v1.13+minisat1099878UNSAT 0.973851 1.1187
galac E1099883UNSAT 0.996847 1.018
galac M1099882UNSAT 1.05684 1.09693
Sugar v1.13+picosat1099877UNSAT 1.22181 1.30743
SAT4J CSP 2008-06-131099876UNSAT 1.79673 1.86523
Concrete + CSP4J - WMC Engine 2008-05-301099871? (TO) 1800.01 1812.12
Concrete + CSP4J - Tabu Engine 2008-05-301099870? (TO) 1800.09 1814.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: