CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/routing/
normalized-s3-3-3-1.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/routing/
normalized-s3-3-3-1.xml
MD5SUM8b74482a9fe920deb5d6814210633746
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.164974
Satisfiable
(Un)Satisfiability was proved
Number of variables216
Number of constraints584
Maximum constraint arity18
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension584
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-prime 1.3131049798SAT 0.164974 0.173415
casper zito1049800SAT 0.229964 0.237536
casper zao1049799SAT 0.25896 0.271646
cpHydra k_401049804SAT 0.547916 0.559447
cpHydra k_101049803SAT 0.572912 0.595575
MDG-noprobe 2008-06-271049788SAT 0.622904 0.630941
Minion/Tailor 2008-07-041104820SAT 1.13483 1.1693
Mistral-option 1.3141049797SAT 1.20082 1.21748
Sugar v1.13+picosat1049790SAT 1.49777 1.57616
Sugar v1.13+minisat1049791SAT 1.53377 1.63821
MDG-probe 2008-06-271049787SAT 1.66075 1.67516
choco2_dwdeg 2008-06-261049794SAT 1.9727 2.04654
Abscon 112v4 ESAC1049802SAT 10.0005 10.1447
Abscon 112v4 AC1049801SAT 14.1498 14.3222
Concrete + CPS4J 2008-05-301049786SAT 23.8624 23.9207
choco2_impwdeg 2008-06-261049793SAT 30.0964 30.2607
bpsolver 2008-06-271049792SAT 898.823 900.761
SAT4J CSP 2008-06-131049789? 434.334 435.302
Concrete + CSP4J - Tabu Engine 2008-05-301049784? (TO) 1800.02 1806.62
Concrete + CSP4J - WMC Engine 2008-05-301049785? (TO) 1800.09 1815.42
galac E1049796Wrong Cert. 2.81757 2.88764
galac M1049795Wrong Cert. 2.96555 3.10102

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