Quadratic roots, narrow range

Percentage Accurate: 55.5% → 91.7%

Time: 13.0s

Alternatives: 7

Speedup: 29.0×

Specification

\[\left(\left(1.0536712127723509 \cdot 10^{-8} < a \land a < 94906265.62425156\right) \land \left(1.0536712127723509 \cdot 10^{-8} < b \land b < 94906265.62425156\right)\right) \land \left(1.0536712127723509 \cdot 10^{-8} < c \land c < 94906265.62425156\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: 55.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: 91.7% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 0.685:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(\left(-0.25 \cdot \left(\frac{{\left(c \cdot a\right)}^{4}}{a} \cdot \frac{20}{{b}^{7}}\right) - \frac{a \cdot {c}^{2}}{{b}^{3}}\right) - \frac{c}{b}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 0.685)
   (/ (- (sqrt (fma b b (* c (* a -4.0)))) b) (* a 2.0))
   (+
    (* -2.0 (/ (* (pow a 2.0) (pow c 3.0)) (pow b 5.0)))
    (-
     (-
      (* -0.25 (* (/ (pow (* c a) 4.0) a) (/ 20.0 (pow b 7.0))))
      (/ (* a (pow c 2.0)) (pow b 3.0)))
     (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 0.685) {
		tmp = (sqrt(fma(b, b, (c * (a * -4.0)))) - b) / (a * 2.0);
	} else {
		tmp = (-2.0 * ((pow(a, 2.0) * pow(c, 3.0)) / pow(b, 5.0))) + (((-0.25 * ((pow((c * a), 4.0) / a) * (20.0 / pow(b, 7.0)))) - ((a * pow(c, 2.0)) / pow(b, 3.0))) - (c / b));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 0.685)
		tmp = Float64(Float64(sqrt(fma(b, b, Float64(c * Float64(a * -4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(-2.0 * Float64(Float64((a ^ 2.0) * (c ^ 3.0)) / (b ^ 5.0))) + Float64(Float64(Float64(-0.25 * Float64(Float64((Float64(c * a) ^ 4.0) / a) * Float64(20.0 / (b ^ 7.0)))) - Float64(Float64(a * (c ^ 2.0)) / (b ^ 3.0))) - Float64(c / b)));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 0.685], N[(N[(N[Sqrt[N[(b * b + N[(c * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 * N[(N[(N[Power[a, 2.0], $MachinePrecision] * N[Power[c, 3.0], $MachinePrecision]), $MachinePrecision] / N[Power[b, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(-0.25 * N[(N[(N[Power[N[(c * a), $MachinePrecision], 4.0], $MachinePrecision] / a), $MachinePrecision] * N[(20.0 / N[Power[b, 7.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(a * N[Power[c, 2.0], $MachinePrecision]), $MachinePrecision] / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(c / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 0.68500000000000005

   1. Initial program 83.8%

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

   3. Simplified 83.9%

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

   if 0.68500000000000005 < b

   1. Initial program 52.2%

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

      1. *-commutative 52.2%

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

   3. Simplified 52.2%

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

   4. Taylor expanded in b around inf 93.9%

      \[\leadsto \color{blue}{-2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \frac{16 \cdot \left({a}^{4} \cdot {c}^{4}\right) + {\left(-2 \cdot \left({a}^{2} \cdot {c}^{2}\right)\right)}^{2}}{a \cdot {b}^{7}}\right)\right)} \]

   5. Taylor expanded in c around 0 93.9%

      \[\leadsto -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \color{blue}{\frac{{c}^{4} \cdot \left(4 \cdot {a}^{4} + 16 \cdot {a}^{4}\right)}{a \cdot {b}^{7}}}\right)\right) \]
   6. Step-by-step derivation

      1. distribute-rgt-out 93.9%

         \[\leadsto -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \frac{{c}^{4} \cdot \color{blue}{\left({a}^{4} \cdot \left(4 + 16\right)\right)}}{a \cdot {b}^{7}}\right)\right) \]

      2. associate-*l* 93.9%

         \[\leadsto -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \frac{\color{blue}{\left({c}^{4} \cdot {a}^{4}\right) \cdot \left(4 + 16\right)}}{a \cdot {b}^{7}}\right)\right) \]

      3. *-commutative 93.9%

         \[\leadsto -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \frac{\color{blue}{\left({a}^{4} \cdot {c}^{4}\right)} \cdot \left(4 + 16\right)}{a \cdot {b}^{7}}\right)\right) \]

      4. times-frac 93.9%

         \[\leadsto -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \color{blue}{\left(\frac{{a}^{4} \cdot {c}^{4}}{a} \cdot \frac{4 + 16}{{b}^{7}}\right)}\right)\right) \]

   7. Simplified 93.9%

      \[\leadsto -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \color{blue}{\left(\frac{{\left(a \cdot c\right)}^{4}}{a} \cdot \frac{20}{{b}^{7}}\right)}\right)\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 0.685:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(\left(-0.25 \cdot \left(\frac{{\left(c \cdot a\right)}^{4}}{a} \cdot \frac{20}{{b}^{7}}\right) - \frac{a \cdot {c}^{2}}{{b}^{3}}\right) - \frac{c}{b}\right)\\ \end{array} \]

Alternative 2: 88.7% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 19:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{-2 \cdot \left({a}^{2} \cdot {c}^{3}\right)}{{b}^{5}} - \frac{c}{b}\right) - \frac{a}{\frac{{b}^{3}}{{c}^{2}}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 19.0)
   (/ (- (sqrt (fma b b (* c (* a -4.0)))) b) (* a 2.0))
   (-
    (- (/ (* -2.0 (* (pow a 2.0) (pow c 3.0))) (pow b 5.0)) (/ c b))
    (/ a (/ (pow b 3.0) (pow c 2.0))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 19.0) {
		tmp = (sqrt(fma(b, b, (c * (a * -4.0)))) - b) / (a * 2.0);
	} else {
		tmp = (((-2.0 * (pow(a, 2.0) * pow(c, 3.0))) / pow(b, 5.0)) - (c / b)) - (a / (pow(b, 3.0) / pow(c, 2.0)));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 19.0)
		tmp = Float64(Float64(sqrt(fma(b, b, Float64(c * Float64(a * -4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(Float64(Float64(-2.0 * Float64((a ^ 2.0) * (c ^ 3.0))) / (b ^ 5.0)) - Float64(c / b)) - Float64(a / Float64((b ^ 3.0) / (c ^ 2.0))));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 19

   1. Initial program 81.0%

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

   3. Simplified 81.0%

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

   if 19 < b

   1. Initial program 49.3%

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

      1. *-commutative 49.3%

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

   3. Simplified 49.3%

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

   4. Taylor expanded in b around inf 93.4%

      \[\leadsto \color{blue}{-2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + -1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}}\right)} \]
   5. Step-by-step derivation

      1. associate-+r+ 93.4%

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

      2. mul-1-neg 93.4%

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

      3. unsub-neg 93.4%

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

      4. mul-1-neg 93.4%

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

      5. unsub-neg 93.4%

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

      6. associate-*r/ 93.4%

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

      7. *-commutative 93.4%

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

      8. associate-/l* 93.4%

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

   6. Simplified 93.4%

      \[\leadsto \color{blue}{\left(\frac{-2 \cdot \left({c}^{3} \cdot {a}^{2}\right)}{{b}^{5}} - \frac{c}{b}\right) - \frac{a}{\frac{{b}^{3}}{{c}^{2}}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 19:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{-2 \cdot \left({a}^{2} \cdot {c}^{3}\right)}{{b}^{5}} - \frac{c}{b}\right) - \frac{a}{\frac{{b}^{3}}{{c}^{2}}}\\ \end{array} \]

Alternative 3: 76.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{if}\;t_0 \leq -1.5 \cdot 10^{-5}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ (- (sqrt (- (* b b) (* c (* a 4.0)))) b) (* a 2.0))))
   (if (<= t_0 -1.5e-5) t_0 (/ (- c) b))))

C

double code(double a, double b, double c) {
	double t_0 = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	double tmp;
	if (t_0 <= -1.5e-5) {
		tmp = t_0;
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (sqrt(((b * b) - (c * (a * 4.0d0)))) - b) / (a * 2.0d0)
    if (t_0 <= (-1.5d-5)) then
        tmp = t_0
    else
        tmp = -c / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = (Math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	double tmp;
	if (t_0 <= -1.5e-5) {
		tmp = t_0;
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	t_0 = (math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0)
	tmp = 0
	if t_0 <= -1.5e-5:
		tmp = t_0
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	t_0 = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b) / Float64(a * 2.0))
	tmp = 0.0
	if (t_0 <= -1.5e-5)
		tmp = t_0;
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	tmp = 0.0;
	if (t_0 <= -1.5e-5)
		tmp = t_0;
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(c * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -1.5e-5], t$95$0, N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 4 a) c)))) (*.f64 2 a)) < -1.50000000000000004e-5

   1. Initial program 75.4%

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

   if -1.50000000000000004e-5 < (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 4 a) c)))) (*.f64 2 a))

   1. Initial program 35.4%

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

      1. *-commutative 35.4%

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

   3. Simplified 35.4%

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

   4. Taylor expanded in b around inf 81.1%

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

      1. mul-1-neg 81.1%

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

      2. distribute-neg-frac 81.1%

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

   6. Simplified 81.1%

      \[\leadsto \color{blue}{\frac{-c}{b}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 78.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2} \leq -1.5 \cdot 10^{-5}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 4: 84.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 19.5:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b} - \frac{a}{\frac{{b}^{3}}{{c}^{2}}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 19.5)
   (/ (- (sqrt (fma b b (* c (* a -4.0)))) b) (* a 2.0))
   (- (/ (- c) b) (/ a (/ (pow b 3.0) (pow c 2.0))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 19.5) {
		tmp = (sqrt(fma(b, b, (c * (a * -4.0)))) - b) / (a * 2.0);
	} else {
		tmp = (-c / b) - (a / (pow(b, 3.0) / pow(c, 2.0)));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 19.5)
		tmp = Float64(Float64(sqrt(fma(b, b, Float64(c * Float64(a * -4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(Float64(-c) / b) - Float64(a / Float64((b ^ 3.0) / (c ^ 2.0))));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 19.5

   1. Initial program 81.0%

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

   3. Simplified 81.0%

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

   if 19.5 < b

   1. Initial program 49.3%

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

      1. *-commutative 49.3%

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

   3. Simplified 49.3%

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

   4. Taylor expanded in b around inf 87.7%

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

      1. mul-1-neg 87.7%

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

      2. unsub-neg 87.7%

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

      3. mul-1-neg 87.7%

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

      4. distribute-neg-frac 87.7%

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

      5. associate-/l* 87.7%

         \[\leadsto \frac{-c}{b} - \color{blue}{\frac{a}{\frac{{b}^{3}}{{c}^{2}}}} \]

   6. Simplified 87.7%

      \[\leadsto \color{blue}{\frac{-c}{b} - \frac{a}{\frac{{b}^{3}}{{c}^{2}}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 86.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 19.5:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b} - \frac{a}{\frac{{b}^{3}}{{c}^{2}}}\\ \end{array} \]

Alternative 5: 84.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 19:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b} - \frac{a}{\frac{{b}^{3}}{{c}^{2}}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 19.0)
   (/ (- (sqrt (- (* b b) (* c (* a 4.0)))) b) (* a 2.0))
   (- (/ (- c) b) (/ a (/ (pow b 3.0) (pow c 2.0))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 19.0) {
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	} else {
		tmp = (-c / b) - (a / (pow(b, 3.0) / pow(c, 2.0)));
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= 19.0d0) then
        tmp = (sqrt(((b * b) - (c * (a * 4.0d0)))) - b) / (a * 2.0d0)
    else
        tmp = (-c / b) - (a / ((b ** 3.0d0) / (c ** 2.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 19.0) {
		tmp = (Math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	} else {
		tmp = (-c / b) - (a / (Math.pow(b, 3.0) / Math.pow(c, 2.0)));
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 19.0:
		tmp = (math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0)
	else:
		tmp = (-c / b) - (a / (math.pow(b, 3.0) / math.pow(c, 2.0)))
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 19.0)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(Float64(-c) / b) - Float64(a / Float64((b ^ 3.0) / (c ^ 2.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 19.0)
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	else
		tmp = (-c / b) - (a / ((b ^ 3.0) / (c ^ 2.0)));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 19.0], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(c * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[((-c) / b), $MachinePrecision] - N[(a / N[(N[Power[b, 3.0], $MachinePrecision] / N[Power[c, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 19

   1. Initial program 81.0%

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

   if 19 < b

   1. Initial program 49.3%

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

      1. *-commutative 49.3%

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

   3. Simplified 49.3%

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

   4. Taylor expanded in b around inf 87.7%

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

      1. mul-1-neg 87.7%

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

      2. unsub-neg 87.7%

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

      3. mul-1-neg 87.7%

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

      4. distribute-neg-frac 87.7%

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

      5. associate-/l* 87.7%

         \[\leadsto \frac{-c}{b} - \color{blue}{\frac{a}{\frac{{b}^{3}}{{c}^{2}}}} \]

   6. Simplified 87.7%

      \[\leadsto \color{blue}{\frac{-c}{b} - \frac{a}{\frac{{b}^{3}}{{c}^{2}}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 86.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 19:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b} - \frac{a}{\frac{{b}^{3}}{{c}^{2}}}\\ \end{array} \]

Alternative 6: 84.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 19:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2 \cdot \frac{c \cdot a}{b} + -2 \cdot \left(\frac{1}{b} \cdot {\left(c \cdot \frac{a}{b}\right)}^{2}\right)}{a \cdot 2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 19.0)
   (/ (- (sqrt (- (* b b) (* c (* a 4.0)))) b) (* a 2.0))
   (/
    (+ (* -2.0 (/ (* c a) b)) (* -2.0 (* (/ 1.0 b) (pow (* c (/ a b)) 2.0))))
    (* a 2.0))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 19.0) {
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	} else {
		tmp = ((-2.0 * ((c * a) / b)) + (-2.0 * ((1.0 / b) * pow((c * (a / b)), 2.0)))) / (a * 2.0);
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= 19.0d0) then
        tmp = (sqrt(((b * b) - (c * (a * 4.0d0)))) - b) / (a * 2.0d0)
    else
        tmp = (((-2.0d0) * ((c * a) / b)) + ((-2.0d0) * ((1.0d0 / b) * ((c * (a / b)) ** 2.0d0)))) / (a * 2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 19.0) {
		tmp = (Math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	} else {
		tmp = ((-2.0 * ((c * a) / b)) + (-2.0 * ((1.0 / b) * Math.pow((c * (a / b)), 2.0)))) / (a * 2.0);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 19.0:
		tmp = (math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0)
	else:
		tmp = ((-2.0 * ((c * a) / b)) + (-2.0 * ((1.0 / b) * math.pow((c * (a / b)), 2.0)))) / (a * 2.0)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 19.0)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(Float64(-2.0 * Float64(Float64(c * a) / b)) + Float64(-2.0 * Float64(Float64(1.0 / b) * (Float64(c * Float64(a / b)) ^ 2.0)))) / Float64(a * 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 19.0)
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	else
		tmp = ((-2.0 * ((c * a) / b)) + (-2.0 * ((1.0 / b) * ((c * (a / b)) ^ 2.0)))) / (a * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 19

   1. Initial program 81.0%

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

   if 19 < b

   1. Initial program 49.3%

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

      1. *-commutative 49.3%

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

   3. Simplified 49.3%

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

   4. Taylor expanded in b around inf 87.4%

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

      1. *-un-lft-identity 87.4%

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

      2. cube-mult 87.4%

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

      3. times-frac 87.4%

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

      4. pow-prod-down 87.4%

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

      5. pow2 87.4%

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

      6. frac-times 87.4%

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

      7. pow2 87.4%

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

      8. associate-*l/ 87.4%

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

      9. *-commutative 87.4%

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

   6. Applied egg-rr 87.4%

      \[\leadsto \frac{-2 \cdot \frac{a \cdot c}{b} + -2 \cdot \color{blue}{\left(\frac{1}{b} \cdot {\left(c \cdot \frac{a}{b}\right)}^{2}\right)}}{a \cdot 2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 85.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 19:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2 \cdot \frac{c \cdot a}{b} + -2 \cdot \left(\frac{1}{b} \cdot {\left(c \cdot \frac{a}{b}\right)}^{2}\right)}{a \cdot 2}\\ \end{array} \]

Alternative 7: 64.3% accurate, 29.0× 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 56.5%

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

   1. *-commutative 56.5%

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

3. Simplified 56.5%

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

4. Taylor expanded in b around inf 63.5%

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

   1. mul-1-neg 63.5%

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

   2. distribute-neg-frac 63.5%

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

6. Simplified 63.5%

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

7. Final simplification 63.5%

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

Reproduce

herbie shell --seed 2023309 
(FPCore (a b c)
  :name "Quadratic roots, narrow range"
  :precision binary64
  :pre (and (and (and (< 1.0536712127723509e-8 a) (< a 94906265.62425156)) (and (< 1.0536712127723509e-8 b) (< b 94906265.62425156))) (and (< 1.0536712127723509e-8 c) (< c 94906265.62425156)))
  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))