jeff quadratic root 1

Percentage Accurate: 71.8% → 89.8%

Time: 11.5s

Alternatives: 8

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + t\_0}\\ \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)) (/ (* 2.0 c) (+ (- b) t_0)))))

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 = (2.0 * c) / (-b + t_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) :: 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 = (2.0d0 * c) / (-b + t_0)
    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 = (2.0 * c) / (-b + t_0);
	}
	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 = (2.0 * c) / (-b + t_0)
	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(Float64(2.0 * c) / Float64(Float64(-b) + t_0));
	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 = (2.0 * c) / (-b + t_0);
	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[GreaterEqual[b, 0.0], N[(N[((-b) - t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + t$95$0), $MachinePrecision]), $MachinePrecision]]]

Initial Program: 71.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + t\_0}\\ \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)) (/ (* 2.0 c) (+ (- b) t_0)))))

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 = (2.0 * c) / (-b + t_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) :: 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 = (2.0d0 * c) / (-b + t_0)
    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 = (2.0 * c) / (-b + t_0);
	}
	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 = (2.0 * c) / (-b + t_0)
	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(Float64(2.0 * c) / Float64(Float64(-b) + t_0));
	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 = (2.0 * c) / (-b + t_0);
	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[GreaterEqual[b, 0.0], N[(N[((-b) - t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + t$95$0), $MachinePrecision]), $MachinePrecision]]]

Alternative 1: 89.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)}\\ \mathbf{if}\;b \leq -8 \cdot 10^{+153}:\\ \;\;\;\;\left(\frac{c}{b} \cdot 2\right) \cdot -0.5\\ \mathbf{elif}\;b \leq -6.5 \cdot 10^{-182}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(\frac{c}{b \cdot b} - {a}^{-1}\right) \cdot b\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{t\_0 - b}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.75 \cdot 10^{+39}:\\ \;\;\;\;\frac{t\_0 + b}{a} \cdot -0.5\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fma (* c a) -4.0 (* b b)))))
   (if (<= b -8e+153)
     (* (* (/ c b) 2.0) -0.5)
     (if (<= b -6.5e-182)
       (if (>= b 0.0)
         (* (- (/ c (* b b)) (pow a -1.0)) b)
         (/ (* 2.0 c) (- t_0 b)))
       (if (<= b 1.75e+39)
         (* (/ (+ t_0 b) a) -0.5)
         (if (>= b 0.0)
           (fma (/ b a) -1.0 (/ c b))
           (/ (* 2.0 c) (- (- b) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(fma((c * a), -4.0, (b * b)));
	double tmp;
	if (b <= -8e+153) {
		tmp = ((c / b) * 2.0) * -0.5;
	} else if (b <= -6.5e-182) {
		double tmp_1;
		if (b >= 0.0) {
			tmp_1 = ((c / (b * b)) - pow(a, -1.0)) * b;
		} else {
			tmp_1 = (2.0 * c) / (t_0 - b);
		}
		tmp = tmp_1;
	} else if (b <= 1.75e+39) {
		tmp = ((t_0 + b) / a) * -0.5;
	} else if (b >= 0.0) {
		tmp = fma((b / a), -1.0, (c / b));
	} else {
		tmp = (2.0 * c) / (-b - b);
	}
	return tmp;
}

Julia

function code(a, b, c)
	t_0 = sqrt(fma(Float64(c * a), -4.0, Float64(b * b)))
	tmp = 0.0
	if (b <= -8e+153)
		tmp = Float64(Float64(Float64(c / b) * 2.0) * -0.5);
	elseif (b <= -6.5e-182)
		tmp_1 = 0.0
		if (b >= 0.0)
			tmp_1 = Float64(Float64(Float64(c / Float64(b * b)) - (a ^ -1.0)) * b);
		else
			tmp_1 = Float64(Float64(2.0 * c) / Float64(t_0 - b));
		end
		tmp = tmp_1;
	elseif (b <= 1.75e+39)
		tmp = Float64(Float64(Float64(t_0 + b) / a) * -0.5);
	elseif (b >= 0.0)
		tmp = fma(Float64(b / a), -1.0, Float64(c / b));
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) - b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0 + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -8e+153], N[(N[(N[(c / b), $MachinePrecision] * 2.0), $MachinePrecision] * -0.5), $MachinePrecision], If[LessEqual[b, -6.5e-182], If[GreaterEqual[b, 0.0], N[(N[(N[(c / N[(b * b), $MachinePrecision]), $MachinePrecision] - N[Power[a, -1.0], $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(t$95$0 - b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 1.75e+39], N[(N[(N[(t$95$0 + b), $MachinePrecision] / a), $MachinePrecision] * -0.5), $MachinePrecision], If[GreaterEqual[b, 0.0], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) - b), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -8e153

   1. Initial program 35.0%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   4. Applied rewrites 0.0%

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

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{2}}{a} \cdot \left(\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)}\right)\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-/.f64 1.7

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

   7. Applied rewrites 1.7%

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

   8. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}{a}\\ } \end{array}} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sub-sign-inv N/A

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

      4. if-same N/A

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

      5. *-commutative N/A

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

   10. Applied rewrites 1.7%

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

   11. Taylor expanded in b around -inf

       \[\leadsto \left(2 \cdot \frac{c}{b}\right) \cdot \frac{-1}{2} \]
   12. Step-by-step derivation

   13. Applied rewrites 98.6%

       \[\leadsto \left(\frac{c}{b} \cdot 2\right) \cdot -0.5 \]

   if -8e153 < b < -6.49999999999999997e-182

   1. Initial program 90.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
   4. Step-by-step derivation

   5. Applied rewrites 90.8%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ } \end{array}} \]

   6. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;b \cdot \color{blue}{\left(\frac{c}{{b}^{2}} - \frac{1}{a}\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]
   7. Step-by-step derivation

   8. Applied rewrites 90.8%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(\frac{c}{b \cdot b} - \frac{1}{a}\right) \cdot \color{blue}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]

   if -6.49999999999999997e-182 < b < 1.7500000000000001e39

   1. Initial program 85.9%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   4. Applied rewrites 85.9%

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

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{2}}{a} \cdot \left(\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)}\right)\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-/.f64 86.0

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

   7. Applied rewrites 86.0%

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

   8. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}{a}\\ } \end{array}} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sub-sign-inv N/A

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

      4. if-same N/A

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

      5. *-commutative N/A

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

   10. Applied rewrites 86.0%

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

   if 1.7500000000000001e39 < b

   1. Initial program 63.1%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
   4. Step-by-step derivation

   5. Applied rewrites 63.2%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ } \end{array}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-1 \cdot \color{blue}{\frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]
   7. Step-by-step derivation

   8. Applied rewrites 97.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]

   9. Taylor expanded in b around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-1 \cdot b - b}\\ \end{array} \]
   10. Step-by-step derivation

   11. Applied rewrites 97.5%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]

   12. Taylor expanded in c around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-1 \cdot \frac{b}{a} + \color{blue}{\frac{c}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]
   13. Step-by-step derivation

   14. Applied rewrites 97.5%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, \color{blue}{-1}, \frac{c}{b}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]
3. Recombined 4 regimes into one program.

4. Final simplification 92.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -8 \cdot 10^{+153}:\\ \;\;\;\;\left(\frac{c}{b} \cdot 2\right) \cdot -0.5\\ \mathbf{elif}\;b \leq -6.5 \cdot 10^{-182}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(\frac{c}{b \cdot b} - {a}^{-1}\right) \cdot b\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.75 \cdot 10^{+39}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 89.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)}\\ \mathbf{if}\;b \leq -8 \cdot 10^{+153}:\\ \;\;\;\;\left(\frac{c}{b} \cdot 2\right) \cdot -0.5\\ \mathbf{elif}\;b \leq 1.75 \cdot 10^{+39}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{t\_0 + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{t\_0 - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fma (* c a) -4.0 (* b b)))))
   (if (<= b -8e+153)
     (* (* (/ c b) 2.0) -0.5)
     (if (<= b 1.75e+39)
       (if (>= b 0.0) (* (/ (+ t_0 b) a) -0.5) (/ (* 2.0 c) (- t_0 b)))
       (if (>= b 0.0) (fma (/ b a) -1.0 (/ c b)) (/ (* 2.0 c) (- (- b) b)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(fma((c * a), -4.0, (b * b)));
	double tmp;
	if (b <= -8e+153) {
		tmp = ((c / b) * 2.0) * -0.5;
	} else if (b <= 1.75e+39) {
		double tmp_1;
		if (b >= 0.0) {
			tmp_1 = ((t_0 + b) / a) * -0.5;
		} else {
			tmp_1 = (2.0 * c) / (t_0 - b);
		}
		tmp = tmp_1;
	} else if (b >= 0.0) {
		tmp = fma((b / a), -1.0, (c / b));
	} else {
		tmp = (2.0 * c) / (-b - b);
	}
	return tmp;
}

Julia

function code(a, b, c)
	t_0 = sqrt(fma(Float64(c * a), -4.0, Float64(b * b)))
	tmp = 0.0
	if (b <= -8e+153)
		tmp = Float64(Float64(Float64(c / b) * 2.0) * -0.5);
	elseif (b <= 1.75e+39)
		tmp_1 = 0.0
		if (b >= 0.0)
			tmp_1 = Float64(Float64(Float64(t_0 + b) / a) * -0.5);
		else
			tmp_1 = Float64(Float64(2.0 * c) / Float64(t_0 - b));
		end
		tmp = tmp_1;
	elseif (b >= 0.0)
		tmp = fma(Float64(b / a), -1.0, Float64(c / b));
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) - b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0 + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -8e+153], N[(N[(N[(c / b), $MachinePrecision] * 2.0), $MachinePrecision] * -0.5), $MachinePrecision], If[LessEqual[b, 1.75e+39], If[GreaterEqual[b, 0.0], N[(N[(N[(t$95$0 + b), $MachinePrecision] / a), $MachinePrecision] * -0.5), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(t$95$0 - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) - b), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -8e153

   1. Initial program 35.0%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   4. Applied rewrites 0.0%

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

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{2}}{a} \cdot \left(\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)}\right)\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-/.f64 1.7

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

   7. Applied rewrites 1.7%

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

   8. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}{a}\\ } \end{array}} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sub-sign-inv N/A

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

      4. if-same N/A

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

      5. *-commutative N/A

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

   10. Applied rewrites 1.7%

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

   11. Taylor expanded in b around -inf

       \[\leadsto \left(2 \cdot \frac{c}{b}\right) \cdot \frac{-1}{2} \]
   12. Step-by-step derivation

   13. Applied rewrites 98.6%

       \[\leadsto \left(\frac{c}{b} \cdot 2\right) \cdot -0.5 \]

   if -8e153 < b < 1.7500000000000001e39

   1. Initial program 88.4%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
   4. Step-by-step derivation

   5. Applied rewrites 88.4%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ } \end{array}} \]

   if 1.7500000000000001e39 < b

   1. Initial program 63.1%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
   4. Step-by-step derivation

   5. Applied rewrites 63.2%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ } \end{array}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-1 \cdot \color{blue}{\frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]
   7. Step-by-step derivation

   8. Applied rewrites 97.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]

   9. Taylor expanded in b around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-1 \cdot b - b}\\ \end{array} \]
   10. Step-by-step derivation

   11. Applied rewrites 97.5%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]

   12. Taylor expanded in c around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-1 \cdot \frac{b}{a} + \color{blue}{\frac{c}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]
   13. Step-by-step derivation

   14. Applied rewrites 97.5%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, \color{blue}{-1}, \frac{c}{b}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 84.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -6.8 \cdot 10^{-57}:\\ \;\;\;\;\left(\frac{c}{b} \cdot 2\right) \cdot -0.5\\ \mathbf{elif}\;b \leq 1.75 \cdot 10^{+39}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -6.8e-57)
   (* (* (/ c b) 2.0) -0.5)
   (if (<= b 1.75e+39)
     (* (/ (+ (sqrt (fma (* c a) -4.0 (* b b))) b) a) -0.5)
     (if (>= b 0.0) (fma (/ b a) -1.0 (/ c b)) (/ (* 2.0 c) (- (- b) b))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -6.8e-57) {
		tmp = ((c / b) * 2.0) * -0.5;
	} else if (b <= 1.75e+39) {
		tmp = ((sqrt(fma((c * a), -4.0, (b * b))) + b) / a) * -0.5;
	} else if (b >= 0.0) {
		tmp = fma((b / a), -1.0, (c / b));
	} else {
		tmp = (2.0 * c) / (-b - b);
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -6.8e-57)
		tmp = Float64(Float64(Float64(c / b) * 2.0) * -0.5);
	elseif (b <= 1.75e+39)
		tmp = Float64(Float64(Float64(sqrt(fma(Float64(c * a), -4.0, Float64(b * b))) + b) / a) * -0.5);
	elseif (b >= 0.0)
		tmp = fma(Float64(b / a), -1.0, Float64(c / b));
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) - b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -6.8e-57], N[(N[(N[(c / b), $MachinePrecision] * 2.0), $MachinePrecision] * -0.5), $MachinePrecision], If[LessEqual[b, 1.75e+39], N[(N[(N[(N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0 + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + b), $MachinePrecision] / a), $MachinePrecision] * -0.5), $MachinePrecision], If[GreaterEqual[b, 0.0], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) - b), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if b < -6.80000000000000032e-57

   1. Initial program 70.9%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   4. Applied rewrites 17.0%

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

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{2}}{a} \cdot \left(\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)}\right)\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-/.f64 17.8

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

   7. Applied rewrites 17.8%

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

   8. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}{a}\\ } \end{array}} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sub-sign-inv N/A

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

      4. if-same N/A

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

      5. *-commutative N/A

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

   10. Applied rewrites 17.8%

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

   11. Taylor expanded in b around -inf

       \[\leadsto \left(2 \cdot \frac{c}{b}\right) \cdot \frac{-1}{2} \]
   12. Step-by-step derivation

   13. Applied rewrites 90.7%

       \[\leadsto \left(\frac{c}{b} \cdot 2\right) \cdot -0.5 \]

   if -6.80000000000000032e-57 < b < 1.7500000000000001e39

   1. Initial program 83.5%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   4. Applied rewrites 79.2%

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

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{2}}{a} \cdot \left(\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)}\right)\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-/.f64 79.5

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

   7. Applied rewrites 79.5%

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

   8. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}{a}\\ } \end{array}} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sub-sign-inv N/A

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

      4. if-same N/A

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

      5. *-commutative N/A

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

   10. Applied rewrites 79.6%

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

   if 1.7500000000000001e39 < b

   1. Initial program 63.1%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
   4. Step-by-step derivation

   5. Applied rewrites 63.2%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ } \end{array}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-1 \cdot \color{blue}{\frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]
   7. Step-by-step derivation

   8. Applied rewrites 97.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]

   9. Taylor expanded in b around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-1 \cdot b - b}\\ \end{array} \]
   10. Step-by-step derivation

   11. Applied rewrites 97.5%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]

   12. Taylor expanded in c around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-1 \cdot \frac{b}{a} + \color{blue}{\frac{c}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]
   13. Step-by-step derivation

   14. Applied rewrites 97.5%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, \color{blue}{-1}, \frac{c}{b}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 84.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -6.8 \cdot 10^{-57}:\\ \;\;\;\;\left(\frac{c}{b} \cdot 2\right) \cdot -0.5\\ \mathbf{elif}\;b \leq 1.75 \cdot 10^{+39}:\\ \;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)} + b\right) \cdot \frac{-0.5}{a}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -6.8e-57)
   (* (* (/ c b) 2.0) -0.5)
   (if (<= b 1.75e+39)
     (* (+ (sqrt (fma (* -4.0 c) a (* b b))) b) (/ -0.5 a))
     (if (>= b 0.0) (fma (/ b a) -1.0 (/ c b)) (/ (* 2.0 c) (- (- b) b))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -6.8e-57) {
		tmp = ((c / b) * 2.0) * -0.5;
	} else if (b <= 1.75e+39) {
		tmp = (sqrt(fma((-4.0 * c), a, (b * b))) + b) * (-0.5 / a);
	} else if (b >= 0.0) {
		tmp = fma((b / a), -1.0, (c / b));
	} else {
		tmp = (2.0 * c) / (-b - b);
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -6.8e-57)
		tmp = Float64(Float64(Float64(c / b) * 2.0) * -0.5);
	elseif (b <= 1.75e+39)
		tmp = Float64(Float64(sqrt(fma(Float64(-4.0 * c), a, Float64(b * b))) + b) * Float64(-0.5 / a));
	elseif (b >= 0.0)
		tmp = fma(Float64(b / a), -1.0, Float64(c / b));
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) - b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -6.8e-57], N[(N[(N[(c / b), $MachinePrecision] * 2.0), $MachinePrecision] * -0.5), $MachinePrecision], If[LessEqual[b, 1.75e+39], N[(N[(N[Sqrt[N[(N[(-4.0 * c), $MachinePrecision] * a + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + b), $MachinePrecision] * N[(-0.5 / a), $MachinePrecision]), $MachinePrecision], If[GreaterEqual[b, 0.0], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) - b), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if b < -6.80000000000000032e-57

   1. Initial program 70.9%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   4. Applied rewrites 17.0%

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

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{2}}{a} \cdot \left(\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)}\right)\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-/.f64 17.8

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

   7. Applied rewrites 17.8%

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

   8. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}{a}\\ } \end{array}} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sub-sign-inv N/A

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

      4. if-same N/A

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

      5. *-commutative N/A

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

   10. Applied rewrites 17.8%

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

   11. Taylor expanded in b around -inf

       \[\leadsto \left(2 \cdot \frac{c}{b}\right) \cdot \frac{-1}{2} \]
   12. Step-by-step derivation

   13. Applied rewrites 90.7%

       \[\leadsto \left(\frac{c}{b} \cdot 2\right) \cdot -0.5 \]

   if -6.80000000000000032e-57 < b < 1.7500000000000001e39

   1. Initial program 83.5%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   4. Applied rewrites 79.2%

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

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{2}}{a} \cdot \left(\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)}\right)\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-/.f64 79.5

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

   7. Applied rewrites 79.5%

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

   8. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}{a}\\ } \end{array}} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sub-sign-inv N/A

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

      4. if-same N/A

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

      5. *-commutative N/A

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

   10. Applied rewrites 79.6%

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

   12. Applied rewrites 79.4%

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

   if 1.7500000000000001e39 < b

   1. Initial program 63.1%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
   4. Step-by-step derivation

   5. Applied rewrites 63.2%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ } \end{array}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-1 \cdot \color{blue}{\frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]
   7. Step-by-step derivation

   8. Applied rewrites 97.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]

   9. Taylor expanded in b around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-1 \cdot b - b}\\ \end{array} \]
   10. Step-by-step derivation

   11. Applied rewrites 97.5%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]

   12. Taylor expanded in c around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-1 \cdot \frac{b}{a} + \color{blue}{\frac{c}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]
   13. Step-by-step derivation

   14. Applied rewrites 97.5%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, \color{blue}{-1}, \frac{c}{b}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 68.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (>= b 0.0) (/ (- b) a) (/ (* 2.0 c) (- (- b) b))))

C

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

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = -b / a;
	} else {
		tmp = (2.0 * c) / (-b - b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = -b / a
	else:
		tmp = (2.0 * c) / (-b - b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(-b) / a);
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) - b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = -b / a;
	else
		tmp = (2.0 * c) / (-b - b);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Initial program 73.5%

   \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
2. Add Preprocessing

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
4. Step-by-step derivation

5. Applied rewrites 73.5%

   \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ } \end{array}} \]

6. Taylor expanded in a around 0

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-1 \cdot \color{blue}{\frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]
7. Step-by-step derivation

8. Applied rewrites 72.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]

9. Taylor expanded in b around -inf

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-1 \cdot b - b}\\ \end{array} \]
10. Step-by-step derivation

11. Applied rewrites 67.2%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]
12. Add Preprocessing

Alternative 6: 68.6% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\left(-b\right) - b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (>= b 0.0) (/ (- b) a) (* c (/ 2.0 (- (- b) b)))))

C

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

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = -b / a;
	} else {
		tmp = c * (2.0 / (-b - b));
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = -b / a
	else:
		tmp = c * (2.0 / (-b - b))
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(-b) / a);
	else
		tmp = Float64(c * Float64(2.0 / Float64(Float64(-b) - b)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = -b / a;
	else
		tmp = c * (2.0 / (-b - b));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Initial program 73.5%

   \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
2. Add Preprocessing

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
4. Step-by-step derivation

5. Applied rewrites 73.5%

   \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ } \end{array}} \]

6. Taylor expanded in a around 0

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-1 \cdot \color{blue}{\frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]
7. Step-by-step derivation

8. Applied rewrites 72.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)} - b}\\ \end{array} \]

9. Taylor expanded in b around -inf

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-1 \cdot b - b}\\ \end{array} \]
10. Step-by-step derivation

11. Applied rewrites 67.2%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \end{array} \]
12. Step-by-step derivation

13. Applied rewrites 67.1%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\left(-b\right) - b}\\ \end{array} \]
14. Add Preprocessing

Alternative 7: 68.7% accurate, 2.0× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e-310) {
		tmp = ((c / b) * 2.0) * -0.5;
	} else {
		tmp = ((2.0 * b) / a) * -0.5;
	}
	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) * 2.0d0) * (-0.5d0)
    else
        tmp = ((2.0d0 * b) / a) * (-0.5d0)
    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) * 2.0) * -0.5;
	} else {
		tmp = ((2.0 * b) / a) * -0.5;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -4.999999999999985e-310

   1. Initial program 75.4%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   4. Applied rewrites 36.6%

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

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{2}}{a} \cdot \left(\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)}\right)\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-/.f64 37.3

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

   7. Applied rewrites 37.3%

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

   8. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}{a}\\ } \end{array}} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sub-sign-inv N/A

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

      4. if-same N/A

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

      5. *-commutative N/A

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

   10. Applied rewrites 37.3%

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

   11. Taylor expanded in b around -inf

       \[\leadsto \left(2 \cdot \frac{c}{b}\right) \cdot \frac{-1}{2} \]
   12. Step-by-step derivation

   13. Applied rewrites 64.6%

       \[\leadsto \left(\frac{c}{b} \cdot 2\right) \cdot -0.5 \]

   if -4.999999999999985e-310 < b

   1. Initial program 71.5%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Add Preprocessing

   4. Applied rewrites 71.5%

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

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{2}}{a} \cdot \left(\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)}\right)\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-/.f64 71.5

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

   7. Applied rewrites 71.5%

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

   8. Taylor expanded in b around inf

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}{a}\\ } \end{array}} \]
   9. Step-by-step derivation

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sub-sign-inv N/A

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

      4. if-same N/A

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

      5. *-commutative N/A

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

   10. Applied rewrites 71.5%

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

   11. Taylor expanded in a around 0

       \[\leadsto \frac{2 \cdot b}{a} \cdot \frac{-1}{2} \]
   12. Step-by-step derivation

   13. Applied rewrites 69.8%

       \[\leadsto \frac{2 \cdot b}{a} \cdot -0.5 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 35.9% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \left(\frac{c}{b} \cdot 2\right) \cdot -0.5 \end{array} \]

FPCore

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

C

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

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) * 2.0d0) * (-0.5d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 73.5%

   \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
2. Add Preprocessing

4. Applied rewrites 53.7%

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

5. Taylor expanded in a around inf

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{2}}{a} \cdot \left(\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)}\right)\\ \end{array} \]
6. Step-by-step derivation

   1. lower-/.f64 54.1

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

7. Applied rewrites 54.1%

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

8. Taylor expanded in b around inf

   \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}{a}\\ } \end{array}} \]
9. Step-by-step derivation

   1. +-commutative N/A

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

   2. metadata-eval N/A

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

   3. fp-cancel-sub-sign-inv N/A

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

   4. if-same N/A

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

   5. *-commutative N/A

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

10. Applied rewrites 54.1%

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

11. Taylor expanded in b around -inf

    \[\leadsto \left(2 \cdot \frac{c}{b}\right) \cdot \frac{-1}{2} \]
12. Step-by-step derivation

13. Applied rewrites 33.9%

    \[\leadsto \left(\frac{c}{b} \cdot 2\right) \cdot -0.5 \]
14. Add Preprocessing

Reproduce

herbie shell --seed 2024332 
(FPCore (a b c)
  :name "jeff quadratic root 1"
  :precision binary64
  (if (>= b 0.0) (/ (- (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)) (/ (* 2.0 c) (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))))))