Quadratic roots, wide range

Percentage Accurate: 17.5% → 99.9%

Time: 10.2s

Alternatives: 4

Speedup: 3.6×

Specification

\[\left(\left(4.930380657631324 \cdot 10^{-32} < a \land a < 2.028240960365167 \cdot 10^{+31}\right) \land \left(4.930380657631324 \cdot 10^{-32} < b \land b < 2.028240960365167 \cdot 10^{+31}\right)\right) \land \left(4.930380657631324 \cdot 10^{-32} < c \land c < 2.028240960365167 \cdot 10^{+31}\right)\]

Math

\[\begin{array}{l} \\ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))

C

double code(double a, double b, double c) {
	return (-b + sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a);
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - ((4.0d0 * a) * c)))) / (2.0d0 * a)
end function

Java

public static double code(double a, double b, double c) {
	return (-b + Math.sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a);
}

Python

def code(a, b, c):
	return (-b + math.sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a)

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))) / Float64(2.0 * a))
end

MATLAB

function tmp = code(a, b, c)
	tmp = (-b + sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a);
end

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Initial Program: 17.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))

C

double code(double a, double b, double c) {
	return (-b + sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a);
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - ((4.0d0 * a) * c)))) / (2.0d0 * a)
end function

Java

public static double code(double a, double b, double c) {
	return (-b + Math.sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a);
}

Python

def code(a, b, c):
	return (-b + math.sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a)

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))) / Float64(2.0 * a))
end

MATLAB

function tmp = code(a, b, c)
	tmp = (-b + sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a);
end

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{c \cdot 2}{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (* c 2.0) (- (- b) (sqrt (fma -4.0 (* c a) (* b b))))))

C

double code(double a, double b, double c) {
	return (c * 2.0) / (-b - sqrt(fma(-4.0, (c * a), (b * b))));
}

Julia

function code(a, b, c)
	return Float64(Float64(c * 2.0) / Float64(Float64(-b) - sqrt(fma(-4.0, Float64(c * a), Float64(b * b)))))
end

Wolfram

code[a_, b_, c_] := N[(N[(c * 2.0), $MachinePrecision] / N[((-b) - N[Sqrt[N[(-4.0 * N[(c * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 18.9%

   \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

      \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}}{2 \cdot a} \]

   2. +-commutative N/A

      \[\leadsto \frac{\color{blue}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(\mathsf{neg}\left(b\right)\right)}}{2 \cdot a} \]

   3. lift-neg.f64 N/A

      \[\leadsto \frac{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \color{blue}{\left(\mathsf{neg}\left(b\right)\right)}}{2 \cdot a} \]

   4. unsub-neg N/A

      \[\leadsto \frac{\color{blue}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} - b}}{2 \cdot a} \]

   5. lower--.f64 18.9

      \[\leadsto \frac{\color{blue}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} - b}}{2 \cdot a} \]

   6. lift--.f64 N/A

      \[\leadsto \frac{\sqrt{\color{blue}{b \cdot b - \left(4 \cdot a\right) \cdot c}} - b}{2 \cdot a} \]

   7. sub-neg N/A

      \[\leadsto \frac{\sqrt{\color{blue}{b \cdot b + \left(\mathsf{neg}\left(\left(4 \cdot a\right) \cdot c\right)\right)}} - b}{2 \cdot a} \]

   8. +-commutative N/A

      \[\leadsto \frac{\sqrt{\color{blue}{\left(\mathsf{neg}\left(\left(4 \cdot a\right) \cdot c\right)\right) + b \cdot b}} - b}{2 \cdot a} \]

   9. lift-*.f64 N/A

      \[\leadsto \frac{\sqrt{\left(\mathsf{neg}\left(\color{blue}{\left(4 \cdot a\right) \cdot c}\right)\right) + b \cdot b} - b}{2 \cdot a} \]

   10. *-commutative N/A

       \[\leadsto \frac{\sqrt{\left(\mathsf{neg}\left(\color{blue}{c \cdot \left(4 \cdot a\right)}\right)\right) + b \cdot b} - b}{2 \cdot a} \]

   11. distribute-rgt-neg-in N/A

       \[\leadsto \frac{\sqrt{\color{blue}{c \cdot \left(\mathsf{neg}\left(4 \cdot a\right)\right)} + b \cdot b} - b}{2 \cdot a} \]

   12. lower-fma.f64 N/A

       \[\leadsto \frac{\sqrt{\color{blue}{\mathsf{fma}\left(c, \mathsf{neg}\left(4 \cdot a\right), b \cdot b\right)}} - b}{2 \cdot a} \]

   13. lift-*.f64 N/A

       \[\leadsto \frac{\sqrt{\mathsf{fma}\left(c, \mathsf{neg}\left(\color{blue}{4 \cdot a}\right), b \cdot b\right)} - b}{2 \cdot a} \]

   14. *-commutative N/A

       \[\leadsto \frac{\sqrt{\mathsf{fma}\left(c, \mathsf{neg}\left(\color{blue}{a \cdot 4}\right), b \cdot b\right)} - b}{2 \cdot a} \]

   15. distribute-rgt-neg-in N/A

       \[\leadsto \frac{\sqrt{\mathsf{fma}\left(c, \color{blue}{a \cdot \left(\mathsf{neg}\left(4\right)\right)}, b \cdot b\right)} - b}{2 \cdot a} \]

   16. lower-*.f64 N/A

       \[\leadsto \frac{\sqrt{\mathsf{fma}\left(c, \color{blue}{a \cdot \left(\mathsf{neg}\left(4\right)\right)}, b \cdot b\right)} - b}{2 \cdot a} \]

   17. metadata-eval 18.9

       \[\leadsto \frac{\sqrt{\mathsf{fma}\left(c, a \cdot \color{blue}{-4}, b \cdot b\right)} - b}{2 \cdot a} \]

4. Applied rewrites 18.9%

   \[\leadsto \frac{\color{blue}{\sqrt{\mathsf{fma}\left(c, a \cdot -4, b \cdot b\right)} - b}}{2 \cdot a} \]

6. Applied rewrites 99.5%

   \[\leadsto \color{blue}{\frac{\left(0 - c \cdot \left(a \cdot -4\right)\right) \cdot \frac{0.5}{a}}{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}}} \]

7. Taylor expanded in c around 0

   \[\leadsto \frac{\color{blue}{2 \cdot c}}{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}} \]
8. Step-by-step derivation

   1. lower-*.f64 99.9

      \[\leadsto \frac{\color{blue}{2 \cdot c}}{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}} \]

9. Applied rewrites 99.9%

   \[\leadsto \frac{\color{blue}{2 \cdot c}}{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}} \]

10. Final simplification 99.9%

    \[\leadsto \frac{c \cdot 2}{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}} \]
11. Add Preprocessing

Alternative 2: 95.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \frac{\mathsf{fma}\left(c \cdot c, \frac{a}{b \cdot b}, c\right)}{-b} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (/ (fma (* c c) (/ a (* b b)) c) (- b)))

C

double code(double a, double b, double c) {
	return fma((c * c), (a / (b * b)), c) / -b;
}

Julia

function code(a, b, c)
	return Float64(fma(Float64(c * c), Float64(a / Float64(b * b)), c) / Float64(-b))
end

Wolfram

code[a_, b_, c_] := N[(N[(N[(c * c), $MachinePrecision] * N[(a / N[(b * b), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision] / (-b)), $MachinePrecision]

Derivation

1. Initial program 18.9%

   \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \]
2. Add Preprocessing

3. Taylor expanded in b around inf

   \[\leadsto \color{blue}{\frac{-1 \cdot c + -1 \cdot \frac{a \cdot {c}^{2}}{{b}^{2}}}{b}} \]
4. Step-by-step derivation

   1. distribute-lft-out N/A

      \[\leadsto \frac{\color{blue}{-1 \cdot \left(c + \frac{a \cdot {c}^{2}}{{b}^{2}}\right)}}{b} \]

   2. associate-/l* N/A

      \[\leadsto \color{blue}{-1 \cdot \frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b}} \]

   3. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(\frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b}\right)} \]

   4. lower-neg.f64 N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(\frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b}\right)} \]

   5. lower-/.f64 N/A

      \[\leadsto \mathsf{neg}\left(\color{blue}{\frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b}}\right) \]

   6. +-commutative N/A

      \[\leadsto \mathsf{neg}\left(\frac{\color{blue}{\frac{a \cdot {c}^{2}}{{b}^{2}} + c}}{b}\right) \]

   7. *-commutative N/A

      \[\leadsto \mathsf{neg}\left(\frac{\frac{\color{blue}{{c}^{2} \cdot a}}{{b}^{2}} + c}{b}\right) \]

   8. associate-/l* N/A

      \[\leadsto \mathsf{neg}\left(\frac{\color{blue}{{c}^{2} \cdot \frac{a}{{b}^{2}}} + c}{b}\right) \]

   9. lower-fma.f64 N/A

      \[\leadsto \mathsf{neg}\left(\frac{\color{blue}{\mathsf{fma}\left({c}^{2}, \frac{a}{{b}^{2}}, c\right)}}{b}\right) \]

   10. unpow2 N/A

       \[\leadsto \mathsf{neg}\left(\frac{\mathsf{fma}\left(\color{blue}{c \cdot c}, \frac{a}{{b}^{2}}, c\right)}{b}\right) \]

   11. lower-*.f64 N/A

       \[\leadsto \mathsf{neg}\left(\frac{\mathsf{fma}\left(\color{blue}{c \cdot c}, \frac{a}{{b}^{2}}, c\right)}{b}\right) \]

   12. lower-/.f64 N/A

       \[\leadsto \mathsf{neg}\left(\frac{\mathsf{fma}\left(c \cdot c, \color{blue}{\frac{a}{{b}^{2}}}, c\right)}{b}\right) \]

   13. unpow2 N/A

       \[\leadsto \mathsf{neg}\left(\frac{\mathsf{fma}\left(c \cdot c, \frac{a}{\color{blue}{b \cdot b}}, c\right)}{b}\right) \]

   14. lower-*.f64 95.3

       \[\leadsto -\frac{\mathsf{fma}\left(c \cdot c, \frac{a}{\color{blue}{b \cdot b}}, c\right)}{b} \]

5. Applied rewrites 95.3%

   \[\leadsto \color{blue}{-\frac{\mathsf{fma}\left(c \cdot c, \frac{a}{b \cdot b}, c\right)}{b}} \]

6. Final simplification 95.3%

   \[\leadsto \frac{\mathsf{fma}\left(c \cdot c, \frac{a}{b \cdot b}, c\right)}{-b} \]
7. Add Preprocessing

Alternative 3: 95.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\frac{a}{b} - \frac{b}{c}} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (/ 1.0 (- (/ a b) (/ b c))))

C

double code(double a, double b, double c) {
	return 1.0 / ((a / b) - (b / c));
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = 1.0d0 / ((a / b) - (b / c))
end function

Java

public static double code(double a, double b, double c) {
	return 1.0 / ((a / b) - (b / c));
}

Python

def code(a, b, c):
	return 1.0 / ((a / b) - (b / c))

Julia

function code(a, b, c)
	return Float64(1.0 / Float64(Float64(a / b) - Float64(b / c)))
end

MATLAB

function tmp = code(a, b, c)
	tmp = 1.0 / ((a / b) - (b / c));
end

Wolfram

code[a_, b_, c_] := N[(1.0 / N[(N[(a / b), $MachinePrecision] - N[(b / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 18.9%

   \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \frac{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{\color{blue}{b \cdot b - \left(4 \cdot a\right) \cdot c}}}{2 \cdot a} \]

   2. sub-neg N/A

      \[\leadsto \frac{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{\color{blue}{b \cdot b + \left(\mathsf{neg}\left(\left(4 \cdot a\right) \cdot c\right)\right)}}}{2 \cdot a} \]

   3. lift-*.f64 N/A

      \[\leadsto \frac{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{\color{blue}{b \cdot b} + \left(\mathsf{neg}\left(\left(4 \cdot a\right) \cdot c\right)\right)}}{2 \cdot a} \]

   4. lower-fma.f64 N/A

      \[\leadsto \frac{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{\color{blue}{\mathsf{fma}\left(b, b, \mathsf{neg}\left(\left(4 \cdot a\right) \cdot c\right)\right)}}}{2 \cdot a} \]

   5. lift-*.f64 N/A

      \[\leadsto \frac{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{\mathsf{fma}\left(b, b, \mathsf{neg}\left(\color{blue}{\left(4 \cdot a\right) \cdot c}\right)\right)}}{2 \cdot a} \]

   6. distribute-lft-neg-in N/A

      \[\leadsto \frac{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{\mathsf{fma}\left(b, b, \color{blue}{\left(\mathsf{neg}\left(4 \cdot a\right)\right) \cdot c}\right)}}{2 \cdot a} \]

   7. lift-*.f64 N/A

      \[\leadsto \frac{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{\mathsf{fma}\left(b, b, \left(\mathsf{neg}\left(\color{blue}{4 \cdot a}\right)\right) \cdot c\right)}}{2 \cdot a} \]

   8. *-commutative N/A

      \[\leadsto \frac{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{\mathsf{fma}\left(b, b, \left(\mathsf{neg}\left(\color{blue}{a \cdot 4}\right)\right) \cdot c\right)}}{2 \cdot a} \]

   9. distribute-rgt-neg-in N/A

      \[\leadsto \frac{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{\mathsf{fma}\left(b, b, \color{blue}{\left(a \cdot \left(\mathsf{neg}\left(4\right)\right)\right)} \cdot c\right)}}{2 \cdot a} \]

   10. associate-*l* N/A

       \[\leadsto \frac{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{\mathsf{fma}\left(b, b, \color{blue}{a \cdot \left(\left(\mathsf{neg}\left(4\right)\right) \cdot c\right)}\right)}}{2 \cdot a} \]

   11. lower-*.f64 N/A

       \[\leadsto \frac{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{\mathsf{fma}\left(b, b, \color{blue}{a \cdot \left(\left(\mathsf{neg}\left(4\right)\right) \cdot c\right)}\right)}}{2 \cdot a} \]

   12. lower-*.f64 N/A

       \[\leadsto \frac{\left(\mathsf{neg}\left(b\right)\right) + \sqrt{\mathsf{fma}\left(b, b, a \cdot \color{blue}{\left(\left(\mathsf{neg}\left(4\right)\right) \cdot c\right)}\right)}}{2 \cdot a} \]

   13. metadata-eval 18.9

       \[\leadsto \frac{\left(-b\right) + \sqrt{\mathsf{fma}\left(b, b, a \cdot \left(\color{blue}{-4} \cdot c\right)\right)}}{2 \cdot a} \]

4. Applied rewrites 18.9%

   \[\leadsto \frac{\left(-b\right) + \sqrt{\color{blue}{\mathsf{fma}\left(b, b, a \cdot \left(-4 \cdot c\right)\right)}}}{2 \cdot a} \]

6. Applied rewrites 19.0%

   \[\leadsto \color{blue}{\frac{1}{\frac{a \cdot 2}{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}}} \]

7. Taylor expanded in a around 0

   \[\leadsto \frac{1}{\color{blue}{-1 \cdot \frac{b}{c} + \frac{a}{b}}} \]
8. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \frac{1}{\color{blue}{\frac{a}{b} + -1 \cdot \frac{b}{c}}} \]

   2. mul-1-neg N/A

      \[\leadsto \frac{1}{\frac{a}{b} + \color{blue}{\left(\mathsf{neg}\left(\frac{b}{c}\right)\right)}} \]

   3. unsub-neg N/A

      \[\leadsto \frac{1}{\color{blue}{\frac{a}{b} - \frac{b}{c}}} \]

   4. lower--.f64 N/A

      \[\leadsto \frac{1}{\color{blue}{\frac{a}{b} - \frac{b}{c}}} \]

   5. lower-/.f64 N/A

      \[\leadsto \frac{1}{\color{blue}{\frac{a}{b}} - \frac{b}{c}} \]

   6. lower-/.f64 95.1

      \[\leadsto \frac{1}{\frac{a}{b} - \color{blue}{\frac{b}{c}}} \]

9. Applied rewrites 95.1%

   \[\leadsto \frac{1}{\color{blue}{\frac{a}{b} - \frac{b}{c}}} \]
10. Add Preprocessing

Alternative 4: 90.6% accurate, 3.6× speedup

Math

\[\begin{array}{l} \\ -\frac{c}{b} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (- (/ c b)))

C

double code(double a, double b, double c) {
	return -(c / b);
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = -(c / b)
end function

Java

public static double code(double a, double b, double c) {
	return -(c / b);
}

Python

def code(a, b, c):
	return -(c / b)

Julia

function code(a, b, c)
	return Float64(-Float64(c / b))
end

MATLAB

function tmp = code(a, b, c)
	tmp = -(c / b);
end

Wolfram

code[a_, b_, c_] := (-N[(c / b), $MachinePrecision])

Derivation

1. Initial program 18.9%

   \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \]
2. Add Preprocessing

3. Taylor expanded in b around inf

   \[\leadsto \color{blue}{-1 \cdot \frac{c}{b}} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(\frac{c}{b}\right)} \]

   2. distribute-neg-frac2 N/A

      \[\leadsto \color{blue}{\frac{c}{\mathsf{neg}\left(b\right)}} \]

   3. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{c}{\mathsf{neg}\left(b\right)}} \]

   4. lower-neg.f64 89.7

      \[\leadsto \frac{c}{\color{blue}{-b}} \]

5. Applied rewrites 89.7%

   \[\leadsto \color{blue}{\frac{c}{-b}} \]

6. Final simplification 89.7%

   \[\leadsto -\frac{c}{b} \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024237 
(FPCore (a b c)
  :name "Quadratic roots, wide range"
  :precision binary64
  :pre (and (and (and (< 4.930380657631324e-32 a) (< a 2.028240960365167e+31)) (and (< 4.930380657631324e-32 b) (< b 2.028240960365167e+31))) (and (< 4.930380657631324e-32 c) (< c 2.028240960365167e+31)))
  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))