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

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

Jump to solvers results

General information on the benchmark

NameGracefulGraph/
GracefulGraph-K05-P02_c18.xml
MD5SUM803795f7a37fd3a40686e408980b1bff
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 benchmark18.133
Satisfiable
(Un)Satisfiability was proved
Number of variables65
Number of constraints27
Number of domains2
Minimum domain size25
Maximum domain size26
Distribution of domain sizes[{"size":25,"count":25},{"size":26,"count":10}]
Minimum variable degree0
Maximum variable degree6
Distribution of variable degrees[{"degree":0,"count":30},{"degree":2,"count":25},{"degree":6,"count":10}]
Minimum constraint arity3
Maximum constraint arity25
Distribution of constraint arities[{"arity":3,"count":25},{"arity":10,"count":1},{"arity":25,"count":1}]
Number of extensional constraints0
Number of intensional constraints25
Distribution of constraint types[{"type":"intension","count":25},{"type":"allDifferent","count":2}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
scop both+glucose-syrup (2018-07-31) (complete)4307398SAT 18.133 4.37373
scop order+glucose-syrup (2018-07-07) (complete)4296978SAT 18.4162 3.92318
Choco-solver 4.0.7b par (e747e1e) (complete)4297713SAT 19.0275 2.88397
OscaR - Parallel with EPS 2018-07-02 (complete)4291300SAT 20.4666 4.18808
OscaR - Parallel with EPS 2018-08-14 (complete)4309069SAT 24.3377 4.64688
scop order+glucose-syrup (2018-07-31) (complete)4307162SAT 34.3003 6.56959
scop both+glucose-syrup (2018-07-07) (complete)4297214SAT 119.693 16.3908

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[0][4] cn[1][0] cn[1][1] cn[1][2] cn[1][3] cn[1][4] ce[0][0][1] ce[0][0][2]
ce[0][0][3] ce[0][0][4] ce[0][1][2] ce[0][1][3] ce[0][1][4] ce[0][2][3] ce[0][2][4] ce[0][3][4] ce[1][0][1] ce[1][0][2] ce[1][0][3]
ce[1][0][4] ce[1][1][2] ce[1][1][3] ce[1][1][4] ce[1][2][3] ce[1][2][4] ce[1][3][4] cie[0][0] cie[0][1] cie[0][2] cie[0][3] cie[0][4]</list>
<values>21 6 7 25 0 11 22 19 2 24 15 14 4 21 1 19 6 18 7 25 11 8 9 13 3 20 2 17 5 22 10 16 12 23 24</values> </instantiation>