PB'25 competition WBO: ranking of solvers
All selected instances (including those not supported by some solvers)

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 "WBO, both soft and hard constraints, linear constraints" (PARTIAL-LIN): 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: 208
Virtual Best Solver (VBS)201200 MOPT, 1 UNSAT97%100%12809.373.0663.73----
1OR-Tools CP-SAT9.14.2172172 MOPT83%86%19330.771.34112.399971.831.0257.981.94
2SCIP2024-07-07159158 MOPT, 1 UNSAT76%79%18426.081.41115.8918488.961.42116.281.00
3Exact2025-06-02158157 MOPT, 1 UNSAT76%79%66253.55359.25419.3366449.44360.19420.571.00
4Exact_no_dombreaking2025-06-16157156 MOPT, 1 UNSAT75%78%62688.82359.22399.2962881.87360.15400.521.00
5NaPSnaps-1.03a6146145 MOPT, 1 UNSAT70%73%12612.253.0886.3912651.933.1086.661.00
6toulbar22025-06-13144143 MOPT, 1 UNSAT69%72%29406.933.71204.2129488.903.73204.781.00
7Sat4j Resolution2025-06-06133132 MOPT, 1 UNSAT64%66%4098.861.8830.823913.551.0329.431.05
8Sat4j CP2025-06-06115115 MOPT55%57%9180.351.3579.838961.510.7977.931.02
9PRINTEMPS2025-05-2800%0%0.000.00-0.000.00--

Category "WBO, both soft and hard constraints, linear constraints" (PARTIAL-LIN): 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: 208
Virtual Best Solver (VBS)20096%100%12806.310.0064.03----
1OR-Tools CP-SAT9.14.217283%86%19330.771.34112.399971.831.0257.981.94
2SCIP2024-07-0715876%79%18397.791.40116.4418460.341.42116.841.00
3Exact2025-06-0215775%79%65868.42359.24419.5466063.22360.17420.781.00
4Exact_no_dombreaking2025-06-1615675%78%62306.22359.22399.4062498.12360.15400.631.00
5NaPSnaps-1.03a614570%73%12608.463.0586.9512648.133.0787.231.00
6toulbar22025-06-1314369%72%29403.873.71205.6229485.833.73206.191.00
7Sat4j Resolution2025-06-0613263%66%4045.911.8730.653862.721.0229.261.05
8Sat4j CP2025-06-0611555%58%9180.351.3579.838961.510.7977.931.02
9PRINTEMPS2025-05-2800%0%0.000.00-0.000.00--

Category "WBO, both soft and hard constraints, linear constraints" (PARTIAL-LIN): 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: 208
Virtual Best Solver (VBS)10%100%3.063.063.06----
1toulbar22025-06-1310%100%3.063.063.063.073.073.071.00
2NaPSnaps-1.03a610%100%3.793.793.793.803.803.801.00
3SCIP2024-07-0710%100%28.2928.2928.2928.6228.6228.620.99
4Sat4j Resolution2025-06-0610%100%52.9552.9552.9550.8350.8350.831.04
5Exact_no_dombreaking2025-06-1610%100%382.59382.59382.59383.76383.76383.761.00
6Exact2025-06-0210%100%385.14385.14385.14386.22386.22386.221.00
7PRINTEMPS2025-05-2800%0%0.000.00-0.000.00--
8Sat4j CP2025-06-0600%0%0.000.00-0.000.00--
9OR-Tools CP-SAT9.14.200%0%0.000.00-0.000.00--

Category "WBO, only soft constraints, linear constraints" (SOFT-LIN): 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: 60
Virtual Best Solver (VBS)5959 MOPT98%100%859.510.0014.57----
1Exact_no_dombreaking2025-06-165959 MOPT98%100%25300.57359.32428.8225377.79360.40430.131.00
2OR-Tools CP-SAT9.14.25858 MOPT97%98%7848.092.18135.313978.911.4068.601.97
3Exact2025-06-025858 MOPT97%98%22514.52359.34388.1822582.88360.37389.361.00
4SCIP2024-07-074949 MOPT82%83%7279.122.62148.557304.812.64149.081.00
5Sat4j Resolution2025-06-064141 MOPT68%69%3831.5611.7293.453745.028.3991.341.02
6NaPSnaps-1.03a63535 MOPT58%59%4770.4550.15136.304784.4950.31136.701.00
7Sat4j CP2025-06-063232 MOPT53%54%984.990.8930.78955.170.5429.851.03
8toulbar22025-06-131515 MOPT25%25%8565.46405.92571.038589.51406.90572.631.00
9PRINTEMPS2025-05-2800%0%0.000.00-0.000.00--

Category "WBO, only soft constraints, linear constraints" (SOFT-LIN): 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: 60
Virtual Best Solver (VBS)5998%100%859.510.0014.57----
1Exact_no_dombreaking2025-06-165998%100%25300.57359.32428.8225377.79360.40430.131.00
2OR-Tools CP-SAT9.14.25897%98%7848.092.18135.313978.911.4068.601.97
3Exact2025-06-025897%98%22514.52359.34388.1822582.88360.37389.361.00
4SCIP2024-07-074982%83%7279.122.62148.557304.812.64149.081.00
5Sat4j Resolution2025-06-064168%69%3831.5611.7293.453745.028.3991.341.02
6NaPSnaps-1.03a63558%59%4770.4550.15136.304784.4950.31136.701.00
7Sat4j CP2025-06-063253%54%984.990.8930.78955.170.5429.851.03
8toulbar22025-06-131525%25%8565.46405.92571.038589.51406.90572.631.00
9PRINTEMPS2025-05-2800%0%0.000.00-0.000.00--

Category "WBO, only soft constraints, linear constraints" (SOFT-LIN): 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: 60
Virtual Best Solver (VBS)00%-0.000.00-----
1Exact2025-06-0200%-0.000.00-0.000.00--
2Exact_no_dombreaking2025-06-1600%-0.000.00-0.000.00--
3NaPSnaps-1.03a600%-0.000.00-0.000.00--
4PRINTEMPS2025-05-2800%-0.000.00-0.000.00--
5Sat4j Resolution2025-06-0600%-0.000.00-0.000.00--
6Sat4j CP2025-06-0600%-0.000.00-0.000.00--
7SCIP2024-07-0700%-0.000.00-0.000.00--
8toulbar22025-06-1300%-0.000.00-0.000.00--
9OR-Tools CP-SAT9.14.200%-0.000.00-0.000.00--

Ranking on the 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.

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.

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.

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.