The quadratic formula (r1)

Percentage Accurate: 51.7% → 85.7%

Time: 16.3s

Alternatives: 8

Speedup: 12.9×

Specification

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: 51.7% 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: 85.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1e+121)
   (/ (- (* a (/ c b)) b) a)
   (if (<= b 2.65e-47)
     (/ (- (sqrt (- (* b b) (* c (* a 4.0)))) b) (* a 2.0))
     (- (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e+121) {
		tmp = ((a * (c / b)) - b) / a;
	} else if (b <= 2.65e-47) {
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.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) :: tmp
    if (b <= (-1d+121)) then
        tmp = ((a * (c / b)) - b) / a
    else if (b <= 2.65d-47) then
        tmp = (sqrt(((b * b) - (c * (a * 4.0d0)))) - b) / (a * 2.0d0)
    else
        tmp = -(c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e+121) {
		tmp = ((a * (c / b)) - b) / a;
	} else if (b <= 2.65e-47) {
		tmp = (Math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	} else {
		tmp = -(c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1e+121:
		tmp = ((a * (c / b)) - b) / a
	elif b <= 2.65e-47:
		tmp = (math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0)
	else:
		tmp = -(c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1e+121)
		tmp = Float64(Float64(Float64(a * Float64(c / b)) - b) / a);
	elseif (b <= 2.65e-47)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(-Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1e+121)
		tmp = ((a * (c / b)) - b) / a;
	elseif (b <= 2.65e-47)
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	else
		tmp = -(c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1e+121], N[(N[(N[(a * N[(c / b), $MachinePrecision]), $MachinePrecision] - b), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b, 2.65e-47], 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[(c / b), $MachinePrecision])]]

Derivation

1. Split input into 3 regimes

2. if b < -1.00000000000000004e121

   1. Initial program 44.7%

      \[\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 44.7%

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

   3. Simplified 44.7%

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

   5. Taylor expanded in b around -inf 94.5%

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

      1. mul-1-neg 94.5%

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

      2. distribute-rgt-neg-in 94.5%

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

      3. +-commutative 94.5%

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

      4. mul-1-neg 94.5%

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

      5. unsub-neg 94.5%

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

   7. Simplified 94.5%

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

   8. Taylor expanded in a around 0 86.9%

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

      1. mul-1-neg 86.9%

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

      2. +-commutative 86.9%

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

      3. unsub-neg 86.9%

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

      4. associate-/l* 95.1%

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

   10. Simplified 95.1%

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

   if -1.00000000000000004e121 < b < 2.64999999999999999e-47

   1. Initial program 83.3%

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

   if 2.64999999999999999e-47 < b

   1. Initial program 11.1%

      \[\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 11.1%

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

   3. Simplified 11.1%

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

   5. Taylor expanded in b around inf 88.5%

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

      1. associate-*r/ 88.5%

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

      2. mul-1-neg 88.5%

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

   7. Simplified 88.5%

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

4. Final simplification 87.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1 \cdot 10^{+121}:\\ \;\;\;\;\frac{a \cdot \frac{c}{b} - b}{a}\\ \mathbf{elif}\;b \leq 2.65 \cdot 10^{-47}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;-\frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 80.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.1 \cdot 10^{-23}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.22 \cdot 10^{-47}:\\ \;\;\;\;\frac{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;-\frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.1e-23)
   (- (/ c b) (/ b a))
   (if (<= b 1.22e-47)
     (/ (- (sqrt (* -4.0 (* a c))) b) (* a 2.0))
     (- (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.1e-23) {
		tmp = (c / b) - (b / a);
	} else if (b <= 1.22e-47) {
		tmp = (sqrt((-4.0 * (a * c))) - b) / (a * 2.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) :: tmp
    if (b <= (-2.1d-23)) then
        tmp = (c / b) - (b / a)
    else if (b <= 1.22d-47) then
        tmp = (sqrt(((-4.0d0) * (a * c))) - b) / (a * 2.0d0)
    else
        tmp = -(c / b)
    end if
    code = tmp
end function

Java

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

Python

def code(a, b, c):
	tmp = 0
	if b <= -2.1e-23:
		tmp = (c / b) - (b / a)
	elif b <= 1.22e-47:
		tmp = (math.sqrt((-4.0 * (a * c))) - b) / (a * 2.0)
	else:
		tmp = -(c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2.1e-23)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 1.22e-47)
		tmp = Float64(Float64(sqrt(Float64(-4.0 * Float64(a * c))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(-Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2.1e-23)
		tmp = (c / b) - (b / a);
	elseif (b <= 1.22e-47)
		tmp = (sqrt((-4.0 * (a * c))) - b) / (a * 2.0);
	else
		tmp = -(c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.1e-23], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.22e-47], N[(N[(N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], (-N[(c / b), $MachinePrecision])]]

Derivation

1. Split input into 3 regimes

2. if b < -2.1000000000000001e-23

   1. Initial program 62.1%

      \[\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 62.1%

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

   3. Simplified 62.1%

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

   5. Taylor expanded in b around -inf 87.5%

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

      1. mul-1-neg 87.5%

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

      2. distribute-rgt-neg-in 87.5%

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

      3. +-commutative 87.5%

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

      4. mul-1-neg 87.5%

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

      5. unsub-neg 87.5%

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

   7. Simplified 87.5%

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

   8. Taylor expanded in a around inf 87.9%

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

      1. +-commutative 87.9%

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

      2. mul-1-neg 87.9%

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

      3. unsub-neg 87.9%

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

   10. Simplified 87.9%

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

   if -2.1000000000000001e-23 < b < 1.2199999999999999e-47

   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

      1. *-commutative 81.0%

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

   3. Simplified 81.0%

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

   6. Applied egg-rr 80.7%

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

      1. sub-neg 80.7%

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

      2. distribute-rgt-out-- 80.7%

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

   8. Simplified 80.7%

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

      1. pow1/2 80.7%

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

      2. pow-to-exp 75.2%

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

   10. Applied egg-rr 75.2%

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

   11. Taylor expanded in a around -inf 42.6%

       \[\leadsto \frac{0.5}{a} \cdot \left(e^{\color{blue}{\left(\log \left(4 \cdot c\right) + -1 \cdot \log \left(\frac{-1}{a}\right)\right)} \cdot 0.5} - b\right) \]
   12. Step-by-step derivation

       1. mul-1-neg 42.6%

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

       2. unsub-neg 42.6%

          \[\leadsto \frac{0.5}{a} \cdot \left(e^{\color{blue}{\left(\log \left(4 \cdot c\right) - \log \left(\frac{-1}{a}\right)\right)} \cdot 0.5} - b\right) \]

       3. *-commutative 42.6%

          \[\leadsto \frac{0.5}{a} \cdot \left(e^{\left(\log \color{blue}{\left(c \cdot 4\right)} - \log \left(\frac{-1}{a}\right)\right) \cdot 0.5} - b\right) \]

   13. Simplified 42.6%

       \[\leadsto \frac{0.5}{a} \cdot \left(e^{\color{blue}{\left(\log \left(c \cdot 4\right) - \log \left(\frac{-1}{a}\right)\right)} \cdot 0.5} - b\right) \]
   14. Step-by-step derivation

       1. *-commutative 42.6%

          \[\leadsto \color{blue}{\left(e^{\left(\log \left(c \cdot 4\right) - \log \left(\frac{-1}{a}\right)\right) \cdot 0.5} - b\right) \cdot \frac{0.5}{a}} \]

       2. clear-num 42.6%

          \[\leadsto \left(e^{\left(\log \left(c \cdot 4\right) - \log \left(\frac{-1}{a}\right)\right) \cdot 0.5} - b\right) \cdot \color{blue}{\frac{1}{\frac{a}{0.5}}} \]

       3. un-div-inv 42.6%

          \[\leadsto \color{blue}{\frac{e^{\left(\log \left(c \cdot 4\right) - \log \left(\frac{-1}{a}\right)\right) \cdot 0.5} - b}{\frac{a}{0.5}}} \]

       4. exp-prod 37.2%

          \[\leadsto \frac{\color{blue}{{\left(e^{\log \left(c \cdot 4\right) - \log \left(\frac{-1}{a}\right)}\right)}^{0.5}} - b}{\frac{a}{0.5}} \]

       5. unpow1/2 37.2%

          \[\leadsto \frac{\color{blue}{\sqrt{e^{\log \left(c \cdot 4\right) - \log \left(\frac{-1}{a}\right)}}} - b}{\frac{a}{0.5}} \]

       6. diff-log 66.9%

          \[\leadsto \frac{\sqrt{e^{\color{blue}{\log \left(\frac{c \cdot 4}{\frac{-1}{a}}\right)}}} - b}{\frac{a}{0.5}} \]

       7. add-exp-log 71.8%

          \[\leadsto \frac{\sqrt{\color{blue}{\frac{c \cdot 4}{\frac{-1}{a}}}} - b}{\frac{a}{0.5}} \]

       8. *-commutative 71.8%

          \[\leadsto \frac{\sqrt{\frac{\color{blue}{4 \cdot c}}{\frac{-1}{a}}} - b}{\frac{a}{0.5}} \]

       9. div-inv 71.8%

          \[\leadsto \frac{\sqrt{\frac{4 \cdot c}{\color{blue}{-1 \cdot \frac{1}{a}}}} - b}{\frac{a}{0.5}} \]

       10. times-frac 71.8%

           \[\leadsto \frac{\sqrt{\color{blue}{\frac{4}{-1} \cdot \frac{c}{\frac{1}{a}}}} - b}{\frac{a}{0.5}} \]

       11. metadata-eval 71.8%

           \[\leadsto \frac{\sqrt{\color{blue}{-4} \cdot \frac{c}{\frac{1}{a}}} - b}{\frac{a}{0.5}} \]

       12. div-inv 71.8%

           \[\leadsto \frac{\sqrt{-4 \cdot \frac{c}{\frac{1}{a}}} - b}{\color{blue}{a \cdot \frac{1}{0.5}}} \]

       13. metadata-eval 71.8%

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

   15. Applied egg-rr 71.8%

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

       1. associate-/r/ 71.8%

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

       2. /-rgt-identity 71.8%

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

   17. Simplified 71.8%

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

   if 1.2199999999999999e-47 < b

   1. Initial program 11.1%

      \[\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 11.1%

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

   3. Simplified 11.1%

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

   5. Taylor expanded in b around inf 88.5%

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

      1. associate-*r/ 88.5%

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

      2. mul-1-neg 88.5%

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

   7. Simplified 88.5%

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

4. Final simplification 83.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.1 \cdot 10^{-23}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.22 \cdot 10^{-47}:\\ \;\;\;\;\frac{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;-\frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 80.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.3 \cdot 10^{-21}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 3.7 \cdot 10^{-47}:\\ \;\;\;\;\frac{0.5}{a} \cdot \left(\sqrt{a \cdot \left(c \cdot -4\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;-\frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.3e-21)
   (- (/ c b) (/ b a))
   (if (<= b 3.7e-47)
     (* (/ 0.5 a) (- (sqrt (* a (* c -4.0))) b))
     (- (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.3e-21) {
		tmp = (c / b) - (b / a);
	} else if (b <= 3.7e-47) {
		tmp = (0.5 / a) * (sqrt((a * (c * -4.0))) - b);
	} 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) :: tmp
    if (b <= (-2.3d-21)) then
        tmp = (c / b) - (b / a)
    else if (b <= 3.7d-47) then
        tmp = (0.5d0 / a) * (sqrt((a * (c * (-4.0d0)))) - b)
    else
        tmp = -(c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.3e-21) {
		tmp = (c / b) - (b / a);
	} else if (b <= 3.7e-47) {
		tmp = (0.5 / a) * (Math.sqrt((a * (c * -4.0))) - b);
	} else {
		tmp = -(c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -2.3e-21:
		tmp = (c / b) - (b / a)
	elif b <= 3.7e-47:
		tmp = (0.5 / a) * (math.sqrt((a * (c * -4.0))) - b)
	else:
		tmp = -(c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2.3e-21)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 3.7e-47)
		tmp = Float64(Float64(0.5 / a) * Float64(sqrt(Float64(a * Float64(c * -4.0))) - b));
	else
		tmp = Float64(-Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2.3e-21)
		tmp = (c / b) - (b / a);
	elseif (b <= 3.7e-47)
		tmp = (0.5 / a) * (sqrt((a * (c * -4.0))) - b);
	else
		tmp = -(c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.3e-21], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.7e-47], N[(N[(0.5 / a), $MachinePrecision] * N[(N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision], (-N[(c / b), $MachinePrecision])]]

Derivation

1. Split input into 3 regimes

2. if b < -2.29999999999999999e-21

   1. Initial program 62.1%

      \[\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 62.1%

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

   3. Simplified 62.1%

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

   5. Taylor expanded in b around -inf 87.5%

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

      1. mul-1-neg 87.5%

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

      2. distribute-rgt-neg-in 87.5%

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

      3. +-commutative 87.5%

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

      4. mul-1-neg 87.5%

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

      5. unsub-neg 87.5%

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

   7. Simplified 87.5%

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

   8. Taylor expanded in a around inf 87.9%

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

      1. +-commutative 87.9%

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

      2. mul-1-neg 87.9%

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

      3. unsub-neg 87.9%

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

   10. Simplified 87.9%

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

   if -2.29999999999999999e-21 < b < 3.7e-47

   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

      1. *-commutative 81.0%

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

   3. Simplified 81.0%

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

   6. Applied egg-rr 80.7%

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

      1. sub-neg 80.7%

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

      2. distribute-rgt-out-- 80.7%

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

   8. Simplified 80.7%

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

   9. Taylor expanded in a around inf 71.5%

      \[\leadsto \frac{0.5}{a} \cdot \left(\sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}} - b\right) \]
   10. Step-by-step derivation

       1. *-commutative 71.5%

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

       2. associate-*r* 71.5%

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

   11. Simplified 71.5%

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

   if 3.7e-47 < b

   1. Initial program 11.1%

      \[\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 11.1%

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

   3. Simplified 11.1%

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

   5. Taylor expanded in b around inf 88.5%

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

      1. associate-*r/ 88.5%

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

      2. mul-1-neg 88.5%

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

   7. Simplified 88.5%

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

4. Final simplification 83.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.3 \cdot 10^{-21}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 3.7 \cdot 10^{-47}:\\ \;\;\;\;\frac{0.5}{a} \cdot \left(\sqrt{a \cdot \left(c \cdot -4\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;-\frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 68.0% accurate, 9.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;-\frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5e-310) (- (/ c b) (/ b a)) (- (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e-310) {
		tmp = (c / b) - (b / a);
	} 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) :: tmp
    if (b <= (-5d-310)) then
        tmp = (c / b) - (b / a)
    else
        tmp = -(c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e-310) {
		tmp = (c / b) - (b / a);
	} else {
		tmp = -(c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -5e-310:
		tmp = (c / b) - (b / a)
	else:
		tmp = -(c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5e-310)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	else
		tmp = Float64(-Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -5e-310)
		tmp = (c / b) - (b / a);
	else
		tmp = -(c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -5e-310], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], (-N[(c / b), $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if b < -4.999999999999985e-310

   1. Initial program 69.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 69.5%

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

   3. Simplified 69.5%

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

   5. Taylor expanded in b around -inf 65.0%

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

      1. mul-1-neg 65.0%

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

      2. distribute-rgt-neg-in 65.0%

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

      3. +-commutative 65.0%

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

      4. mul-1-neg 65.0%

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

      5. unsub-neg 65.0%

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

   7. Simplified 65.0%

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

   8. Taylor expanded in a around inf 66.2%

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

      1. +-commutative 66.2%

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

      2. mul-1-neg 66.2%

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

      3. unsub-neg 66.2%

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

   10. Simplified 66.2%

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

   if -4.999999999999985e-310 < b

   1. Initial program 30.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 30.3%

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

   3. Simplified 30.3%

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

   5. Taylor expanded in b around inf 65.5%

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

      1. associate-*r/ 65.5%

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

      2. mul-1-neg 65.5%

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

   7. Simplified 65.5%

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

4. Final simplification 65.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;-\frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 67.8% accurate, 12.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{else}:\\ \;\;\;\;-\frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5e-310) (/ b (- a)) (- (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e-310) {
		tmp = b / -a;
	} 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) :: tmp
    if (b <= (-5d-310)) then
        tmp = b / -a
    else
        tmp = -(c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e-310) {
		tmp = b / -a;
	} else {
		tmp = -(c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -5e-310:
		tmp = b / -a
	else:
		tmp = -(c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5e-310)
		tmp = Float64(b / Float64(-a));
	else
		tmp = Float64(-Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -5e-310)
		tmp = b / -a;
	else
		tmp = -(c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -5e-310], N[(b / (-a)), $MachinePrecision], (-N[(c / b), $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if b < -4.999999999999985e-310

   1. Initial program 69.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 69.5%

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

   3. Simplified 69.5%

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

   5. Taylor expanded in b around -inf 65.8%

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

      1. mul-1-neg 65.8%

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

      2. distribute-neg-frac2 65.8%

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

   7. Simplified 65.8%

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

   if -4.999999999999985e-310 < b

   1. Initial program 30.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 30.3%

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

   3. Simplified 30.3%

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

   5. Taylor expanded in b around inf 65.5%

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

      1. associate-*r/ 65.5%

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

      2. mul-1-neg 65.5%

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

   7. Simplified 65.5%

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

4. Final simplification 65.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{else}:\\ \;\;\;\;-\frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 43.0% accurate, 12.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 2.22 \cdot 10^{-41}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (if (<= b 2.22e-41) (/ b (- a)) (/ c b)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.22e-41) {
		tmp = b / -a;
	} 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) :: tmp
    if (b <= 2.22d-41) then
        tmp = b / -a
    else
        tmp = c / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.22e-41) {
		tmp = b / -a;
	} else {
		tmp = c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 2.22e-41:
		tmp = b / -a
	else:
		tmp = c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 2.22e-41)
		tmp = Float64(b / Float64(-a));
	else
		tmp = Float64(c / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 2.22e-41)
		tmp = b / -a;
	else
		tmp = c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 2.22e-41], N[(b / (-a)), $MachinePrecision], N[(c / b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 2.2200000000000001e-41

   1. Initial program 70.8%

      \[\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 70.8%

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

   3. Simplified 70.8%

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

   5. Taylor expanded in b around -inf 51.5%

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

      1. mul-1-neg 51.5%

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

      2. distribute-neg-frac2 51.5%

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

   7. Simplified 51.5%

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

   if 2.2200000000000001e-41 < b

   1. Initial program 11.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 11.2%

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

   3. Simplified 11.2%

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

   5. Taylor expanded in b around -inf 2.3%

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

      1. mul-1-neg 2.3%

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

      2. distribute-rgt-neg-in 2.3%

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

      3. +-commutative 2.3%

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

      4. mul-1-neg 2.3%

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

      5. unsub-neg 2.3%

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

   7. Simplified 2.3%

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

   8. Taylor expanded in b around 0 25.0%

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

Alternative 7: 11.0% accurate, 38.7× 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(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 50.1%

   \[\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 50.1%

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

3. Simplified 50.1%

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

5. Taylor expanded in b around -inf 33.8%

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

   1. mul-1-neg 33.8%

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

   2. distribute-rgt-neg-in 33.8%

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

   3. +-commutative 33.8%

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

   4. mul-1-neg 33.8%

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

   5. unsub-neg 33.8%

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

7. Simplified 33.8%

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

8. Taylor expanded in b around 0 10.9%

   \[\leadsto \color{blue}{\frac{c}{b}} \]
9. Add Preprocessing

Alternative 8: 2.5% accurate, 38.7× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	return b / 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 / a
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 50.1%

   \[\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 50.1%

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

3. Simplified 50.1%

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

   1. *-un-lft-identity 50.1%

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

   2. *-un-lft-identity 50.1%

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

   3. prod-diff 50.1%

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

   4. *-commutative 50.1%

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

   5. *-un-lft-identity 50.1%

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

   6. fma-define 50.1%

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

   7. *-un-lft-identity 50.1%

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

   8. +-commutative 50.1%

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

   9. add-sqr-sqrt 35.0%

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

   10. sqrt-unprod 48.2%

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

   11. sqr-neg 48.2%

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

   12. sqrt-prod 13.3%

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

   13. add-sqr-sqrt 32.6%

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

   14. pow2 32.6%

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

   15. add-sqr-sqrt 19.5%

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

   16. sqrt-unprod 32.6%

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

   17. sqr-neg 32.6%

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

   18. sqrt-prod 13.3%

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

   19. add-sqr-sqrt 32.3%

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

   20. *-commutative 32.3%

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

   21. *-un-lft-identity 32.3%

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

6. Applied egg-rr 32.3%

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

   1. +-commutative 32.3%

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

   2. associate-+l+ 31.9%

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

   3. fma-undefine 31.9%

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

   4. *-rgt-identity 31.9%

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

8. Simplified 31.9%

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

9. Taylor expanded in b around -inf 2.5%

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

Developer target: 70.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b < 0:\\ \;\;\;\;\frac{\left(-b\right) + t\_0}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{a \cdot \frac{\left(-b\right) - t\_0}{2 \cdot a}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* (* 4.0 a) c)))))
   (if (< b 0.0)
     (/ (+ (- b) t_0) (* 2.0 a))
     (/ c (* a (/ (- (- b) t_0) (* 2.0 a)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b < 0.0) {
		tmp = (-b + t_0) / (2.0 * a);
	} else {
		tmp = c / (a * ((-b - t_0) / (2.0 * a)));
	}
	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) - ((4.0d0 * a) * c)))
    if (b < 0.0d0) then
        tmp = (-b + t_0) / (2.0d0 * a)
    else
        tmp = c / (a * ((-b - t_0) / (2.0d0 * a)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024093 
(FPCore (a b c)
  :name "The quadratic formula (r1)"
  :precision binary64

  :alt
  (if (< b 0.0) (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)) (/ c (* a (/ (- (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))))

  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))