Solver Isomap for UF

In this diagram two solvers are close if they are similar with respect to their solving times at the competitions. See below for a detailed explanation. The trail connects the annual versions of a solver.

1. Fetch all the competition results for the given logic.
2. If requested (it is), remove the solvers that have less than 100 benchmarks in common with 50% of the other solvers.
3. Compute the distance between each solver pair. It is the cosine distance between the wall-clock time of the common benchmarks. More precisely, when if two solvers have n benchmarks in common, we use an n-dimensional space. The coordinate of each solver is the wall-clock time for each benchmarks regardless of the result. The cosine distance is then the angle between the two solvers at the origin.
4. Compute a standard Isomap from the cosine distances.

Solvers removed in step 2:

• Yices 2006 (2006-08-21)
• CVC3 2006 (2006-08-21)
• Yices 2007 (2007-07-03)
• CVC3 2007 (2007-07-03)
• Fx7 2007 (2007-07-03)
• Z3 2007 (2007-07-03)
• CVC3 2008 (2008-07-07)
• Z3 2008 (2008-07-07)
• Alt-Ergo 2008 (2008-07-07)
• CVC3 2009 (2009-08-02)
• Z3 2009 (2009-08-02)
• CVC3 2010 (2010-07-15)
• Z3 2010 (2010-07-15)
• CVC3 2011 (2011-06-30)
• Z3 2011 (2011-06-30)
• CVC3 2011 (2011-07-14)
• Z3 2011 (2011-07-14)
• CVC3 2013 (2013-07-02)
• Z3 2013 (2013-07-02)
• veriT 2013 (2013-07-02)
• CVC4 2013 (2013-07-02)
• Boolector 2016 (2016-07-02)
• Q3B 2016 (2016-07-02)
• Boolector 2017 (2017-07-23)
• Q3B 2017 (2017-07-23)
• Boolector 2018 (2018-07-14)
• Q3B 2018 (2018-07-14)