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

Result page for benchmark
Eternity/
Eternity-05-05_c18.xml

Jump to solvers results

General information on the benchmark

NameEternity/
Eternity-05-05_c18.xml
MD5SUMc4864a898575c3e068596f0b6cab168e
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 benchmark3.02228
Satisfiable
(Un)Satisfiability was proved
Number of variables85
Number of constraints46
Number of domains2
Minimum domain size8
Maximum domain size25
Distribution of domain sizes[{"size":8,"count":60},{"size":25,"count":25}]
Minimum variable degree1
Maximum variable degree6
Distribution of variable degrees[{"degree":1,"count":4},{"degree":2,"count":80},{"degree":6,"count":1}]
Minimum constraint arity1
Maximum constraint arity25
Distribution of constraint arities[{"arity":1,"count":20},{"arity":5,"count":25},{"arity":25,"count":1}]
Number of extensional constraints25
Number of intensional constraints20
Distribution of constraint types[{"type":"extension","count":25},{"type":"intension","count":20},{"type":"allDifferent","count":1}]
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)4297694SAT 3.02228 0.885859
OscaR - Parallel with EPS 2018-08-14 (complete)4309050SAT 6.18637 2.6763
OscaR - Parallel with EPS 2018-07-02 (complete)4291281SAT 6.67796 2.77518
scop order+glucose-syrup (2018-07-07) (complete)4296959SAT 15.2395 4.78616
scop both+glucose-syrup (2018-07-07) (complete)4297195SAT 15.5377 4.76092
scop both+glucose-syrup (2018-07-31) (complete)4307379SAT 16.3964 5.4074
scop order+glucose-syrup (2018-07-31) (complete)4307143SAT 16.6707 5.44658

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