CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/fapp/fapp18/
normalized-fapp18-0350-4.xml

Jump to solvers results

General information on the benchmark

Namecsp/fapp/fapp18/
normalized-fapp18-0350-4.xml
MD5SUMf804db01db52be6b23e45bb99d4155e0
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 benchmark0.972852
Satisfiable
(Un)Satisfiability was proved
Number of variables350
Number of constraints3812
Maximum constraint arity2
Maximum domain size302
Number of constraints which are defined in extension0
Number of constraints which are defined in intension3812
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
casper zito1094961UNSAT 0.372942 0.386537
bpsolver 2008-06-271094953UNSAT 0.972852 0.983475
MDG-probe 2008-06-271094948UNSAT 6.19406 6.24751
Mistral-prime 1.3131094959UNSAT 6.24405 6.29866
cpHydra k_101094964UNSAT 6.40802 6.4726
Mistral-option 1.3141094958UNSAT 6.42102 6.46167
cpHydra k_401094965UNSAT 6.556 6.62716
MDG-noprobe 2008-06-271094949UNSAT 7.06193 7.12619
choco2_dwdeg 2008-06-261094955UNSAT 11.9702 12.0192
choco2_impwdeg 2008-06-261094954UNSAT 12.87 13.1615
Abscon 112v4 AC1094962UNSAT 21.2828 21.3408
Abscon 112v4 ESAC1094963UNSAT 21.3078 21.3911
Minion/Tailor 2008-07-041105541UNSAT 22.8115 22.9649
Concrete + CSP4J - WMC Engine 2008-05-301094946UNSAT 27.8808 27.9432
Concrete + CSP4J - Tabu Engine 2008-05-301094945UNSAT 30.0114 30.3257
casper zao1094960UNSAT 38.7371 39.0402
Sugar v1.13+minisat1094952UNSAT 56.5724 57.9178
Concrete + CPS4J 2008-05-301094947UNSAT 58.963 59.286
Sugar v1.13+picosat1094951UNSAT 140.927 142.617
SAT4J CSP 2008-06-131094950? 411.35 414.027
galac M1094956? (problem) 0.420935 0.531762
galac E1094957? (problem) 0.45493 0.521299

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: