CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/fapp/fapp35/
normalized-fapp35-1500-3.xml

Jump to solvers results

General information on the benchmark

Namecsp/fapp/fapp35/
normalized-fapp35-1500-3.xml
MD5SUMe300dafa26bcab4445d58a8b5c31c7b7
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark30.4124
Satisfiable
(Un)Satisfiability was proved
Number of variables1500
Number of constraints22067
Maximum constraint arity2
Maximum domain size698
Number of constraints which are defined in extension0
Number of constraints which are defined in intension22067
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Minion/Tailor 2008-07-041105592UNSAT 21.6317 22.09
Abscon 112v4 AC1086601UNSAT 30.4124 30.68
Abscon 112v4 ESAC1086602UNSAT 30.7123 30.8315
Concrete + CPS4J 2008-05-301086586UNSAT 203.113 205.303
cpHydra k_401086604UNSAT 255.162 257.913
cpHydra k_101086603UNSAT 259.656 261.119
Mistral-prime 1.3131086598UNSAT 302.701 305.02
MDG-noprobe 2008-06-271086588UNSAT 343.365 345.454
Concrete + CSP4J - WMC Engine 2008-05-301086585UNSAT 391.828 393.086
Concrete + CSP4J - Tabu Engine 2008-05-301086584UNSAT 412.047 416.01
MDG-probe 2008-06-271086587UNSAT 677.568 678.701
SAT4J CSP 2008-06-131086589? 0.804877 1.01271
Sugar v1.13+picosat1086590? 733.884 740.987
Sugar v1.13+minisat1086591? 735.109 745.781
galac M1086595? (problem) 0.458929 0.781053
galac E1086596? (problem) 0.607906 0.680262
Mistral-option 1.3141086597? (TO) 1800.03 1808.83
casper zito1086600? (TO) 1800.05 1811.32
bpsolver 2008-06-271086592? (TO) 1800.09 1801.22
casper zao1086599? (TO) 1800.12 1807.96
choco2_dwdeg 2008-06-261086594? (TO) 1800.15 1800.82
choco2_impwdeg 2008-06-261086593? (TO) 1800.22 1812.76

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: