2019 XCSP3 competition: fast COP track (sequential and parallel solvers): ranking of solvers
max WC time for any solver=240 s

Ranking on final answers (complete solver point of view)

This section presents the ranking of the different solvers. Solvers are ranked on the number of solved instances, i.e. where a final answer was given. Ties are broken by considering the minimum total solution time.

Solvers which gave a wrong answer in a category are excluded from the ranking in that category.

The Virtual Best Solver (VBS) is a theoretical construction which returns the best answer provided by one of the submitted solver. It corresponds to the 'Best result' column in the bench per bench view of the results. It can be considered as a meta solver which uses a perfect oracle to guess instantaneously which of the submitted solver will be the most efficient to solve the instance. Another way to look at it is to consider this VBS as a solver which would run all other solvers in parallel, bringing together all the solvers strenghs. This VBS is essentially the same notion as State Of The Art (SOTA) solver defined in "Evaluating general purpose automated theorem proving systems", Artificial Intelligence, Volume 131, Issues 1-2, September 2001, Pages 39-54 Geoff Sutcliffe, Christian Suttner. However, SOTA is a more general notion: the VBS can be seen as the least powerful SOTA solver.

Category "optimization problem" (COP): OPT+UNSAT answers

Rank SolverVersion Number of
solved instances
Detail % of all instances% of VBSCumulated CPU time
on solved instances
Median CPU timeAverage CPU time
per solved instance
Cumulated WC time
on solved instances
Median WC timeAverage WC time
per solved instance
CPU/WC
Total number of instances in the category: 300
Virtual Best Solver (VBS)234232 OPT, 2 UNSAT78%100%15914.6122.2168.01----
1choco-solver2019-09-24 parallel204202 OPT, 2 UNSAT68%87%47432.36103.36232.516210.1213.8930.447.64
2AbsCon2019-07-23162160 OPT, 2 UNSAT54%69%6686.5916.9641.286091.8213.6337.601.10
3PicatSAT2019-09-12150149 OPT, 1 UNSAT50%64%9926.1340.0966.179926.8040.1066.181.00
4cosoco2.0 parallel133131 OPT, 2 UNSAT44%57%35728.0556.24268.634526.627.8434.037.89
5choco-solver2019-09-24120119 OPT, 1 UNSAT40%51%5908.4019.7049.245341.6516.7244.511.11
6Concrete3.12.39190 OPT, 1 UNSAT30%39%5900.8146.5564.844884.0333.5953.671.21
7cosoco2.08787 OPT29%37%2984.419.7834.303001.3010.0534.500.99

Category "optimization problem" (COP): OPT answers

Rank SolverVersion Number of
solved instances
% of all instances% of VBSCumulated CPU time
on solved instances
Median CPU timeAverage CPU time
per solved instance
Cumulated WC time
on solved instances
Median WC timeAverage WC time
per solved instance
CPU/WC
Total number of instances in the category: 300
Virtual Best Solver (VBS)23277%100%15881.2922.2168.45----
1choco-solver2019-09-24 parallel20267%87%46574.12103.36230.566100.5813.8930.207.63
2AbsCon2019-07-2316053%69%6651.3316.9641.576060.0813.6337.881.10
3PicatSAT2019-09-1214950%64%9919.5841.4266.579920.2541.4366.581.00
4cosoco2.0 parallel13144%56%34297.3656.24261.814347.467.8433.197.89
5choco-solver2019-09-2411940%51%5814.8319.6148.865252.4316.3644.141.11
6Concrete3.12.39030%39%5733.1643.2163.704723.9832.9352.491.21
7cosoco2.08729%38%2984.419.7834.303001.3010.0534.500.99

Category "optimization problem" (COP): UNSAT answers

Rank SolverVersion Number of
solved instances
% of all instances% of VBSCumulated CPU time
on solved instances
Median CPU timeAverage CPU time
per solved instance
Cumulated WC time
on solved instances
Median WC timeAverage WC time
per solved instance
CPU/WC
Total number of instances in the category: 300
Virtual Best Solver (VBS)21%100%33.3216.6616.66----
1AbsCon2019-07-2321%100%35.2617.6317.6331.7315.8715.871.11
2choco-solver2019-09-24 parallel21%100%858.25429.12429.12109.5454.7754.777.83
3cosoco2.0 parallel21%100%1430.69715.34715.34179.1689.5889.587.99
4PicatSAT2019-09-1210%50%6.556.556.556.556.556.551.00
5choco-solver2019-09-2410%50%93.5793.5793.5789.2289.2289.221.05
6Concrete3.12.310%50%167.65167.65167.65160.05160.05160.051.05
7cosoco2.000%0%0.000.00-0.000.00--

Ranking on number of best answers found (incomplete solver point of view)

Number of best answers found with no further time limit

This section presents the ranking of the different solvers. Solvers are ranked on the number of instances for which they were able to find the best solution obtained by one the solvers within the global time limit. Ties are broken using the cumulated T1 time.

Solvers which gave a wrong answer in a category are excluded from the ranking in that category.

The Virtual Best Solver (VBS) is a theoretical construction which returns the best answer provided by one of the submitted solver. It corresponds to the 'Best result' column in the bench per bench view of the results. It can be considered as a meta solver which uses a perfect oracle to guess instantaneously which of the submitted solver will be the most efficient to solve the instance. Another way to look at it is to consider this VBS as a solver which would run all other solvers in parallel, bringing together all the solvers strenghs. This VBS is essentially the same notion as State Of The Art (SOTA) solver defined in "Evaluating general purpose automated theorem proving systems", Artificial Intelligence, Volume 131, Issues 1-2, September 2001, Pages 39-54 Geoff Sutcliffe, Christian Suttner. However, SOTA is a more general notion: the VBS can be seen as the least powerful SOTA solver.

Category "optimization problem" (COP): answers

Rank SolverVersion Number of best solutions found% of all instances% of VBSCumulated time
Total number of instances in the category: 300
Virtual Best Solver (VBS)24481%100%
1PicatSAT2019-09-1222174%91%44577.54217
2choco-solver2019-09-24 parallel21772%89%29399.158
3AbsCon2019-07-2320267%83%26895.22269
4choco-solver2019-09-2420067%82%49912.0568
5Concrete3.12.317458%71%16048.203
6cosoco2.0 parallel14348%59%12849.809
7cosoco2.012241%50%5925.538

Number of best answers found within 2 times the VBS time

This section presents the ranking of the different solvers. Solvers are ranked on the number of instances for which they were able to find the best solution obtained by one the solvers within 2 times the VBS time. Ties are broken using the cumulated T1 time.

Solvers which gave a wrong answer in a category are excluded from the ranking in that category.

The Virtual Best Solver (VBS) is a theoretical construction which returns the best answer provided by one of the submitted solver. It corresponds to the 'Best result' column in the bench per bench view of the results. It can be considered as a meta solver which uses a perfect oracle to guess instantaneously which of the submitted solver will be the most efficient to solve the instance. Another way to look at it is to consider this VBS as a solver which would run all other solvers in parallel, bringing together all the solvers strenghs. This VBS is essentially the same notion as State Of The Art (SOTA) solver defined in "Evaluating general purpose automated theorem proving systems", Artificial Intelligence, Volume 131, Issues 1-2, September 2001, Pages 39-54 Geoff Sutcliffe, Christian Suttner. However, SOTA is a more general notion: the VBS can be seen as the least powerful SOTA solver.

Category "optimization problem" (COP): answers

Rank SolverVersion Number of best solutions found% of all instances% of VBSCumulated time
Total number of instances in the category: 300
Virtual Best Solver (VBS)24481%100%
1choco-solver2019-09-248930%36%30714.14
2cosoco2.06722%27%433.79
3cosoco2.0 parallel5217%21%1008.53
4AbsCon2019-07-235017%20%1198.91
5choco-solver2019-09-24 parallel3311%14%3844.42
6Concrete3.12.3269%11%2802.67
7PicatSAT2019-09-12238%9%6027.02

Number of best answers found within 4 times the VBS time

This section presents the ranking of the different solvers. Solvers are ranked on the number of instances for which they were able to find the best solution obtained by one the solvers within 4 times the VBS time. Ties are broken using the cumulated T1 time.

Solvers which gave a wrong answer in a category are excluded from the ranking in that category.

The Virtual Best Solver (VBS) is a theoretical construction which returns the best answer provided by one of the submitted solver. It corresponds to the 'Best result' column in the bench per bench view of the results. It can be considered as a meta solver which uses a perfect oracle to guess instantaneously which of the submitted solver will be the most efficient to solve the instance. Another way to look at it is to consider this VBS as a solver which would run all other solvers in parallel, bringing together all the solvers strenghs. This VBS is essentially the same notion as State Of The Art (SOTA) solver defined in "Evaluating general purpose automated theorem proving systems", Artificial Intelligence, Volume 131, Issues 1-2, September 2001, Pages 39-54 Geoff Sutcliffe, Christian Suttner. However, SOTA is a more general notion: the VBS can be seen as the least powerful SOTA solver.

Category "optimization problem" (COP): answers

Rank SolverVersion Number of best solutions found% of all instances% of VBSCumulated time
Total number of instances in the category: 300
Virtual Best Solver (VBS)24481%100%
1choco-solver2019-09-2411739%48%31489.9
2choco-solver2019-09-24 parallel8729%36%7219.65
3AbsCon2019-07-238227%34%4184.91
4cosoco2.07926%32%762.47
5cosoco2.0 parallel7324%30%1389.78
6Concrete3.12.35217%21%3608.62
7PicatSAT2019-09-124214%17%7701

Number of best answers found within 8 times the VBS time

This section presents the ranking of the different solvers. Solvers are ranked on the number of instances for which they were able to find the best solution obtained by one the solvers within 8 times the VBS time. Ties are broken using the cumulated T1 time.

Solvers which gave a wrong answer in a category are excluded from the ranking in that category.

The Virtual Best Solver (VBS) is a theoretical construction which returns the best answer provided by one of the submitted solver. It corresponds to the 'Best result' column in the bench per bench view of the results. It can be considered as a meta solver which uses a perfect oracle to guess instantaneously which of the submitted solver will be the most efficient to solve the instance. Another way to look at it is to consider this VBS as a solver which would run all other solvers in parallel, bringing together all the solvers strenghs. This VBS is essentially the same notion as State Of The Art (SOTA) solver defined in "Evaluating general purpose automated theorem proving systems", Artificial Intelligence, Volume 131, Issues 1-2, September 2001, Pages 39-54 Geoff Sutcliffe, Christian Suttner. However, SOTA is a more general notion: the VBS can be seen as the least powerful SOTA solver.

Category "optimization problem" (COP): answers

Rank SolverVersion Number of best solutions found% of all instances% of VBSCumulated time
Total number of instances in the category: 300
Virtual Best Solver (VBS)24481%100%
1choco-solver2019-09-2413545%55%31992.79
2choco-solver2019-09-24 parallel12241%50%9612.6
3AbsCon2019-07-2311438%47%5412.47
4cosoco2.09732%40%1830.9
5cosoco2.0 parallel9030%37%3379.29
6Concrete3.12.37625%31%4640.52
7PicatSAT2019-09-125719%23%9420.77