CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/lard/
normalized-lard-83-83.xml

Jump to solvers results

General information on the benchmark

Namecsp/lard/
normalized-lard-83-83.xml
MD5SUM75503770180b2e5df3e5009c7077c336
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark10.5234
Satisfiable
(Un)Satisfiability was proved
Number of variables83
Number of constraints3403
Maximum constraint arity2
Maximum domain size84
Number of constraints which are defined in extension3403
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.3131034399SAT 10.5234 10.5805
MDG-probe 2008-06-271034388SAT 11.2273 11.3153
Mistral-option 1.3141034398SAT 11.4463 11.5616
MDG-noprobe 2008-06-271034389SAT 11.5642 11.601
cpHydra k_101045329SAT 11.6352 11.7555
cpHydra k_401045958SAT 11.7742 11.9115
Abscon 112v4 AC1044071SAT 15.5626 15.6633
choco2_impwdeg 2008-06-261034394SAT 16.0046 16.1983
choco2_dwdeg 2008-06-261034395SAT 16.3045 16.5175
Abscon 112v4 ESAC1044700SAT 16.6625 16.8515
spider 2008-06-141034385SAT 32.2461 32.5473
Concrete + CSP4J - Tabu Engine 2008-05-301034382SAT 49.8694 50.0406
Concrete + CSP4J - WMC Engine 2008-05-301034383SAT 52.744 53.269
Concrete + CPS4J 2008-05-301034384SAT 53.6678 53.7208
SAT4J CSP 2008-06-131034390SAT 56.0815 56.3374
casper zito1043442? 23.4394 23.6064
casper zao1042813? 25.6981 25.855
galac E1034397? (problem) 133.439 133.738
galac M1034396? (problem) 133.725 134.039
bpsolver 2008-06-271034393? (problem) 295.569 299.89
Minion/Tailor 2008-07-041104141? (exit code) 29.9784 30.3163
Sugar v1.13+picosat1034391? (MO) 24.65 24.8901
Sugar v1.13+minisat1034392? (MO) 25.38 25.8691

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:
0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1