2018 XCSP3 competition: sequential 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 benchmark0.047629
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
Mistral-2.0 2018-06-15 (complete)4289739SAT 0.047629 0.04874
BTD 2018.07.27_3 (complete)4306321SAT 0.083876 0.0842071
BTD 2018.06.11_3 (complete)4296157SAT 0.084193 0.0846019
BTD_12 2018.07.27_12 (complete)4306085SAT 0.111682 0.111723
BTD_12 2018-06-11_12 (complete)4296156SAT 0.111979 0.112293
macht 2018.07.27 (complete)4305849SAT 0.126453 0.126648
macht 2018.06.11 (complete)4296161SAT 0.127409 0.128742
cosoco 1.12 (complete)4296160SAT 0.140008 0.140216
Mistral-2.0 2018-08-01 (complete)4303882SAT 0.170069 0.171029
PicatSAT 2018-08-14 (complete)4309636SAT 1.02644 1.02649
PicatSAT 2018-06-15 (complete)4296162SAT 1.02767 1.03237
PicatSAT 2018-08-02 (complete)4303296SAT 1.03687 1.04154
Choco-solver 4.0.7 seq (493a269) (complete)4292526SAT 1.50359 0.662558
Choco-solver 4.0.7b seq (e747e1e) (complete)4306820SAT 1.53758 0.683368
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311850SAT 2.13301 1.219
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4308114SAT 2.17032 1.24661
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290570SAT 2.29031 1.3662
OscaR - Conflict Ordering 2018-08-14 (complete)4307615SAT 2.37679 1.31897
OscaR - Conflict Ordering 2018-07-02 (complete)4290794SAT 2.49076 1.39023
Concrete 3.9.2-SuperNG (complete)4305292SAT 8.61853 4.02932
Concrete 3.8 2018-06-13 (complete)4296158SAT 8.75693 4.24683
Concrete 3.9.2 (complete)4305291SAT 9.20593 4.17009
Concrete 3.8-SuperNG 2018-06-13 (complete)4296159SAT 10.454 5.14389
scop order+MapleCOMSPS (2018-06-13) (complete)4296164SAT 14.5191 5.10044
scop both+MapleCOMSPS (2018-06-13) (complete)4296163SAT 14.7278 5.31397
scop both+MapleCOMSPS (2018-07-31) (complete)4305613SAT 14.9394 6.09581
scop order+MapleCOMSPS (2018-07-31) (complete)4305377SAT 15.395 5.90805
Sat4j-CSP 2018-07-11 (complete)4290083SAT 136.898 133.246

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 type="solution"> <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> 3 10 9 15 2 4 17 19 24 8 5 16 23 21 12 13 18 22 20 7 0 6 11 14 1 0 0 0
0 0 1 6 5 7 2 1 5 7 7 1 3 4 5 6 3 1 5 7 6 1 0 3 2 2 3 0 4 4 7 6 0 4 6 7 4 0 6 5 4 5 0 1 2 3 2 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>