CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/aim-200/
normalized-aim-200-1-6-sat-2_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-1-6-sat-2_ext.xml
MD5SUMb77214efc8470237190a0ee7c9876647
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.025995
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints316
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension316
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
casper zao1053630SAT 0.025995 0.0270581
MDG-noprobe 2008-06-271053619SAT 0.026995 0.028307
Mistral-prime 1.3131053629SAT 0.029994 0.0327529
Mistral-option 1.3141053628SAT 0.039993 0.041573
cpHydra k_101053634SAT 0.043993 0.043303
cpHydra k_401053635SAT 0.046991 0.0528851
MDG-probe 2008-06-271053618SAT 0.046992 0.0488051
spider 2008-06-141053617SAT 0.101983 0.111874
mddc-solv 2008-06-091053616SAT 0.111982 0.112093
casper zito1053631SAT 0.12798 0.128408
Minion/Tailor 2008-07-041105042SAT 0.511921 0.572971
Concrete + CPS4J 2008-05-301053615SAT 0.660898 0.68985
Sugar v1.13+minisat1053622SAT 0.818875 0.879452
Sugar v1.13+picosat1053621SAT 0.819874 0.879951
choco2_dwdeg 2008-06-261053625SAT 0.852869 0.888471
Abscon 112v4 AC1053632SAT 1.03784 1.10218
Abscon 112v4 ESAC1053633SAT 1.12083 1.16378
choco2_impwdeg 2008-06-261053624SAT 1.21481 1.25522
SAT4J CSP 2008-06-131053620SAT 1.22181 1.24752
galac E1053627SAT 1.25981 1.34316
galac M1053626SAT 1.46878 1.51946
Concrete + CSP4J - WMC Engine 2008-05-301053614? (TO) 1800.02 1802.72
Concrete + CSP4J - Tabu Engine 2008-05-301053613? (TO) 1800.07 1808.52
bpsolver 2008-06-271053623? (TO) 1800.1 1808.01

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