2018 XCSP3 competition: parallel solvers tracks: solvers results per benchmarks

Result page for benchmark
GracefulGraph/
GracefulGraph-K04-P02_c18.xml

Jump to solvers results

General information on the benchmark

NameGracefulGraph/
GracefulGraph-K04-P02_c18.xml
MD5SUMdf122225b0586fd0ab127ca5658303c8
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark2.12551
Satisfiable
(Un)Satisfiability was proved
Number of variables44
Number of constraints18
Number of domains2
Minimum domain size16
Maximum domain size17
Distribution of domain sizes[{"size":16,"count":16},{"size":17,"count":8}]
Minimum variable degree0
Maximum variable degree5
Distribution of variable degrees[{"degree":0,"count":20},{"degree":2,"count":16},{"degree":5,"count":8}]
Minimum constraint arity3
Maximum constraint arity16
Distribution of constraint arities[{"arity":3,"count":16},{"arity":8,"count":1},{"arity":16,"count":1}]
Number of extensional constraints0
Number of intensional constraints16
Distribution of constraint types[{"type":"intension","count":16},{"type":"allDifferent","count":2}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Choco-solver 4.0.7b par (e747e1e) (complete)4297710SAT 2.12551 0.757807
scop both+glucose-syrup (2018-07-07) (complete)4297211SAT 3.54876 1.64175
scop order+glucose-syrup (2018-07-07) (complete)4296975SAT 3.56883 1.66997
scop order+glucose-syrup (2018-07-31) (complete)4307159SAT 4.67383 2.45235
scop both+glucose-syrup (2018-07-31) (complete)4307395SAT 4.69984 2.55231
OscaR - Parallel with EPS 2018-08-14 (complete)4309066SAT 5.23206 2.1313
OscaR - Parallel with EPS 2018-07-02 (complete)4291297SAT 5.54607 2.63218

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function:
Solution found:
<instantiation> <list>cn[0][0] cn[0][1] cn[0][2] cn[0][3] cn[1][0] cn[1][1] cn[1][2] cn[1][3] ce[0][0][1] ce[0][0][2] ce[0][0][3]
ce[0][1][2] ce[0][1][3] ce[0][2][3] ce[1][0][1] ce[1][0][2] ce[1][0][3] ce[1][1][2] ce[1][1][3] ce[1][2][3] cie[0][0] cie[0][1] cie[0][2]
cie[0][3] </list> <values>16 0 9 4 1 2 15 12 16 7 12 9 4 5 1 14 11 13 10 3 15 2 6 8 </values> </instantiation>