CSP 2006 Competition (second round): solvers results per benchmarks

Result page for benchmark
queens/
queens-8.xml

Name	queens/ queens-8.xml
MD5SUM	056ee6d877376d3d3549cc2163accbe7
Bench Category	2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.013997
Satisfiable	YES
(Un)Satisfiability was proved	YES
Number of variables	8
Number of constraints	28
Maximum constraint arity	2
Maximum domain size	8
Number of constraints which are defined in extension	0
Number of constraints which are defined in intension	28
Global constraints used (with number of constraints)

Solver Name	TraceID	Answer	CPU time	Wall clock time
VALCSP 3.0	191998	SAT	0.002998	0.00576092
VALCSP 3.1	267811	SAT	0.002998	0.00744695
Tramontane 2006-12-04	192004	SAT	0.013997	0.0216601
CSPtoSAT+minisat 0.3	192006	SAT	0.015997	0.018257
BPrologCSPSolver70a 2006-12-13	191991	SAT	0.018996	0.0220689
Mistral 2006-12-04	192003	SAT	0.023995	0.0626349
buggy_2_5 2007-01-08	192002	SAT	0.063989	0.074491
buggy_2_5_s 2007-01-08	192001	SAT	0.072987	0.504938
CSP4J - Combo 2006-12-19	191995	SAT	0.45393	0.499464
CSP4J - MAC 2006-12-19	191996	SAT	0.484925	0.522602
CSP4J - MAC 2007-01-16	269770	SAT	0.486925	0.509489
sugar 0.40	192005	SAT	0.55	2.04084
Abscon 109 ESAC	191993	SAT	0.654899	0.708849
Abscon 109 AC	191994	SAT	0.698893	0.828575
galacJ beta 1	191992	SAT	1.11583	1.19276
SAT4JCSP-CACHED 1.7 RC BF3	191999	SAT	1.13883	1.23435
galac 1	191997	SAT	1.20282	1.40623
sat4jCSP 1.7 RC BF3	192000	SAT	1.21381	1.05201