CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/driver/
normalized-driverlogw-01c-sat_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/driver/
normalized-driverlogw-01c-sat_ext.xml
MD5SUM7217f8fab8c71088ecef30ed97fb4567
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 benchmark0.009997
Satisfiable
(Un)Satisfiability was proved
Number of variables71
Number of constraints217
Maximum constraint arity2
Maximum domain size4
Number of constraints which are defined in extension217
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
MDG-noprobe 2008-06-271033975SAT 0.009997 0.0172571
Mistral-prime 1.3131033985SAT 0.009997 0.011813
Mistral-option 1.3141033984SAT 0.009998 0.0115929
MDG-probe 2008-06-271033974SAT 0.010997 0.0168941
casper zito1043419SAT 0.015997 0.0170029
casper zao1042790SAT 0.017996 0.0463881
spider 2008-06-141033971SAT 0.018996 0.0404741
cpHydra k_101045306SAT 0.022996 0.024227
cpHydra k_401045935SAT 0.022996 0.0245171
bpsolver 2008-06-271033979SAT 0.046992 0.04766
Concrete + CPS4J 2008-05-301033970SAT 0.377941 0.376873
Minion/Tailor 2008-07-041104118SAT 0.385941 0.44776
Concrete + CSP4J - WMC Engine 2008-05-301033969SAT 0.38894 0.422577
Concrete + CSP4J - Tabu Engine 2008-05-301033968SAT 0.411936 0.424853
choco2_dwdeg 2008-06-261033981SAT 0.508922 0.565815
choco2_impwdeg 2008-06-261033980SAT 0.51792 0.590463
Sugar v1.13+picosat1033977SAT 0.687895 0.652125
Sugar v1.13+minisat1033978SAT 0.698893 0.861463
Abscon 112v4 ESAC1044677SAT 0.735887 0.79052
Abscon 112v4 AC1044048SAT 0.770882 0.839393
SAT4J CSP 2008-06-131033976SAT 0.843871 0.682371
galac E1033983SAT 0.997848 0.885669
galac M1033982SAT 1.00984 0.823989

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 0 0 0 1 0 0 2 0 0 0 0 1 1 0 1 1 0 0 0 0 0 0 0 0 3 3 0 1 1 1 0 1 0 0 2 2 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 3 3 0 1 1 1 0 1 1 1 0 0 0 0 0 1 1
1