CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/fapp/fapp24/
normalized-fapp24-2000-2.xml

Jump to solvers results

General information on the benchmark

Namecsp/fapp/fapp24/
normalized-fapp24-2000-2.xml
MD5SUM1f2ebc90aacefa2bf62f5cb29b948cb3
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 benchmark8.71867
Satisfiable
(Un)Satisfiability was proved
Number of variables2000
Number of constraints26753
Maximum constraint arity2
Maximum domain size302
Number of constraints which are defined in extension0
Number of constraints which are defined in intension26753
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
bpsolver 2008-06-271086718UNSAT 8.71867 8.80932
Abscon 112v4 ESAC1086728UNSAT 25.7301 26.5107
Abscon 112v4 AC1086727UNSAT 25.9001 26.3764
choco2_impwdeg 2008-06-261086719UNSAT 43.0665 43.3816
choco2_dwdeg 2008-06-261086720UNSAT 47.4718 47.6788
cpHydra k_101086729UNSAT 94.0767 94.4322
cpHydra k_401086730UNSAT 102.138 103.299
Mistral-prime 1.3131086724UNSAT 138.172 139.367
Concrete + CSP4J - WMC Engine 2008-05-301086711UNSAT 210.045 223.713
Concrete + CSP4J - Tabu Engine 2008-05-301086710UNSAT 212.19 209.926
Concrete + CPS4J 2008-05-301086712UNSAT 286.592 286.833
MDG-noprobe 2008-06-271086714UNSAT 368.102 369.596
MDG-probe 2008-06-271086713UNSAT 747.201 749.343
Minion/Tailor 2008-07-041105560UNSAT 1714.11 1724.06
Sugar v1.13+minisat1086717? 445.024 453.002
Sugar v1.13+picosat1086716? 465.473 474.311
SAT4J CSP 2008-06-131086715? 1467.21 1473.12
galac E1086722? (problem) 0.424934 0.507362
galac M1086721? (problem) 0.584911 0.67438
casper zito1086726? (TO) 1800.08 1808.02
Mistral-option 1.3141086723? (TO) 1800.08 1804.34
casper zao1086725? (TO) 1800.11 1815.66

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: