CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/fapp/fapp36/
normalized-fapp36-2000-3.xml

Jump to solvers results

General information on the benchmark

Namecsp/fapp/fapp36/
normalized-fapp36-2000-3.xml
MD5SUM1d1f1cebdc92b091f3f5ffe18a2e82b4
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 benchmark28.1067
Satisfiable
(Un)Satisfiability was proved
Number of variables2000
Number of constraints18600
Maximum constraint arity2
Maximum domain size454
Number of constraints which are defined in extension0
Number of constraints which are defined in intension18600
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Minion/Tailor 2008-07-041105596UNSAT 19.1331 19.34
Abscon 112v4 ESAC1087610UNSAT 28.1067 28.1628
Abscon 112v4 AC1087609UNSAT 28.4467 28.7586
choco2_impwdeg 2008-06-261087601UNSAT 36.6504 36.8703
choco2_dwdeg 2008-06-261087602UNSAT 37.4643 37.887
MDG-noprobe 2008-06-271087596UNSAT 89.3664 90.0526
Mistral-prime 1.3131087606UNSAT 94.6236 95.4405
cpHydra k_101087611UNSAT 108.585 109.101
cpHydra k_401087612UNSAT 119.976 120.691
Concrete + CPS4J 2008-05-301087594UNSAT 174.756 175.718
Concrete + CSP4J - Tabu Engine 2008-05-301087592UNSAT 291.136 287.074
MDG-probe 2008-06-271087595UNSAT 630.425 633.349
Sugar v1.13+picosat1087598? 573.289 596.332
Sugar v1.13+minisat1087599? 585.986 595.671
SAT4J CSP 2008-06-131087597? 956.804 960.148
galac E1087604? (problem) 0.434933 0.523708
galac M1087603? (problem) 0.495924 0.968719
Concrete + CSP4J - WMC Engine 2008-05-301087593? (TO) 1800.06 1809.52
casper zito1087608? (TO) 1800.07 1809.42
casper zao1087607? (TO) 1800.07 1804.96
Mistral-option 1.3141087605? (TO) 1800.1 1809.13
bpsolver 2008-06-271087600? (TO) 1800.11 1800.92

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: