CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/tightness0.9/
normalized-rand-2-40-180-84-900-28_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.9/
normalized-rand-2-40-180-84-900-28_ext.xml
MD5SUMafa8a1cb06fb6727c4ad99ca3233ddf8
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 benchmark1.07084
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints84
Maximum constraint arity2
Maximum domain size180
Number of constraints which are defined in extension84
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.3131100765UNSAT 1.07084 1.07591
MDG-noprobe 2008-06-271100755UNSAT 1.15982 1.17532
cpHydra k_101100770UNSAT 1.18382 1.2101
cpHydra k_401100771UNSAT 1.18582 1.19876
MDG-probe 2008-06-271100754UNSAT 2.12768 2.14411
Concrete + CPS4J 2008-05-301100752UNSAT 3.85641 3.88249
Mistral-option 1.3141100764UNSAT 4.10337 4.14154
SAT4J CSP 2008-06-131100756UNSAT 12.843 12.9581
Abscon 112v4 AC1100768UNSAT 14.5488 14.6395
Abscon 112v4 ESAC1100769UNSAT 14.6278 14.8002
spider 2008-06-141100753UNSAT 20.0569 20.2188
Sugar v1.13+picosat1100757UNSAT 23.2855 23.4636
Sugar v1.13+minisat1100758UNSAT 23.7594 24.0853
galac M1100762UNSAT 31.6212 31.769
Minion/Tailor 2008-07-041107256UNSAT 43.6684 44.1217
galac E1100763UNSAT 46.09 46.5189
choco2_impwdeg 2008-06-261100760UNSAT 51.1212 52.1612
choco2_dwdeg 2008-06-261100761UNSAT 51.3182 51.8515
bpsolver 2008-06-271100759UNSAT 253.088 255.337
casper zito1100767UNSAT 261.22 263.47
casper zao1100766UNSAT 278.296 280.513
Concrete + CSP4J - WMC Engine 2008-05-301100751? (TO) 1800.02 1805.13
Concrete + CSP4J - Tabu Engine 2008-05-301100750? (TO) 1800.06 1814.62

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: