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

Result page for benchmark
queens/
queens-30.xml

Name	queens/ queens-30.xml
MD5SUM	925181bcb23e36db8722e5167f8cd29c
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.036993
Satisfiable	YES
(Un)Satisfiability was proved	YES
Number of variables	30
Number of constraints	435
Maximum constraint arity	2
Maximum domain size	30
Number of constraints which are defined in extension	0
Number of constraints which are defined in intension	435
Global constraints used (with number of constraints)

Solver Name	TraceID	Answer	CPU time	Wall clock time
BPrologCSPSolver70a 2006-12-13	192135	SAT	0.036993	0.0437189
Tramontane 2006-12-04	192148	SAT	0.044992	0.053142
Mistral 2006-12-04	192147	SAT	0.045992	0.0467221
VALCSP 3.0	192142	SAT	0.077987	0.087901
VALCSP 3.1	267820	SAT	0.081986	0.0843269
buggy_2_5 2007-01-08	192146	SAT	0.226964	0.249305
buggy_2_5_s 2007-01-08	192145	SAT	0.249961	0.268005
Abscon 109 ESAC	192137	SAT	0.928858	0.963947
Abscon 109 AC	192138	SAT	0.943856	0.98459
CSP4J - MAC 2006-12-19	192140	SAT	2.28965	2.34785
CSP4J - Combo 2006-12-19	192139	SAT	2.33164	2.51011
CSP4J - MAC 2007-01-16	269779	SAT	2.41963	2.5945
galacJ beta 1	192136	SAT	2.56861	2.69605
galac 1	192141	SAT	3.3155	3.47428
sat4jCSP 1.7 RC BF3	192144	SAT	4.6113	4.23977
sugar 0.40	192149	SAT	4.63429	5.08098
SAT4JCSP-CACHED 1.7 RC BF3	192143	SAT	5.19121	5.10505
CSPtoSAT+minisat 0.3	192150	SAT	103.059	103.165