quadp (p42, positive)

Percentage Accurate: 50.9% → 85.3%

Time: 8.5s

Alternatives: 10

Speedup: 2.5×

Specification

Math

\[\begin{array}{l} \\ \frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{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(4.0 * Float64(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[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Initial Program: 50.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{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(4.0 * Float64(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[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Alternative 1: 85.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4 \cdot 10^{+151}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 7.5 \cdot 10^{-58}:\\ \;\;\;\;\frac{-0.5 \cdot \left(b - \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{c}{b} \cdot a, \frac{c}{b}, c\right)}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4e+151)
   (/ (- b) a)
   (if (<= b 7.5e-58)
     (/ (* -0.5 (- b (sqrt (fma -4.0 (* c a) (* b b))))) a)
     (/ (fma (* (/ c b) a) (/ c b) c) (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4e+151) {
		tmp = -b / a;
	} else if (b <= 7.5e-58) {
		tmp = (-0.5 * (b - sqrt(fma(-4.0, (c * a), (b * b))))) / a;
	} else {
		tmp = fma(((c / b) * a), (c / b), c) / -b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4e+151)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 7.5e-58)
		tmp = Float64(Float64(-0.5 * Float64(b - sqrt(fma(-4.0, Float64(c * a), Float64(b * b))))) / a);
	else
		tmp = Float64(fma(Float64(Float64(c / b) * a), Float64(c / b), c) / Float64(-b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4e+151], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 7.5e-58], N[(N[(-0.5 * N[(b - N[Sqrt[N[(-4.0 * N[(c * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(N[(N[(N[(c / b), $MachinePrecision] * a), $MachinePrecision] * N[(c / b), $MachinePrecision] + c), $MachinePrecision] / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.00000000000000007e151

   1. Initial program 51.1%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 95.4

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

   5. Applied rewrites 95.4%

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

   if -4.00000000000000007e151 < b < 7.50000000000000002e-58

   1. Initial program 82.8%

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

   4. Applied rewrites 83.5%

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

   if 7.50000000000000002e-58 < b

   1. Initial program 8.3%

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

   4. Applied rewrites 7.2%

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

   5. Taylor expanded in c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 94.4

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

   7. Applied rewrites 94.4%

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

   8. Taylor expanded in b around inf

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

      1. distribute-lft-out N/A

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

      2. associate-/l* N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. +-commutative N/A

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

      7. unpow2 N/A

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

      8. associate-*r* N/A

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

      9. unpow2 N/A

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

      10. times-frac N/A

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

      11. lower-fma.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. lower-/.f64 94.7

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

   10. Applied rewrites 94.7%

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

4. Final simplification 89.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4 \cdot 10^{+151}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 7.5 \cdot 10^{-58}:\\ \;\;\;\;\frac{-0.5 \cdot \left(b - \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{c}{b} \cdot a, \frac{c}{b}, c\right)}{-b}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 85.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4 \cdot 10^{+151}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 3.75 \cdot 10^{-93}:\\ \;\;\;\;\frac{-0.5 \cdot \left(b - \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4e+151)
   (/ (- b) a)
   (if (<= b 3.75e-93)
     (/ (* -0.5 (- b (sqrt (fma -4.0 (* c a) (* b b))))) a)
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4e+151) {
		tmp = -b / a;
	} else if (b <= 3.75e-93) {
		tmp = (-0.5 * (b - sqrt(fma(-4.0, (c * a), (b * b))))) / a;
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4e+151)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 3.75e-93)
		tmp = Float64(Float64(-0.5 * Float64(b - sqrt(fma(-4.0, Float64(c * a), Float64(b * b))))) / a);
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4e+151], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 3.75e-93], N[(N[(-0.5 * N[(b - N[Sqrt[N[(-4.0 * N[(c * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.00000000000000007e151

   1. Initial program 51.1%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 95.4

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

   5. Applied rewrites 95.4%

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

   if -4.00000000000000007e151 < b < 3.75000000000000017e-93

   1. Initial program 85.7%

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

   4. Applied rewrites 86.5%

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

   if 3.75000000000000017e-93 < b

   1. Initial program 11.6%

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

   3. Taylor expanded in c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 90.3

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

   5. Applied rewrites 90.3%

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

4. Final simplification 89.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4 \cdot 10^{+151}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 3.75 \cdot 10^{-93}:\\ \;\;\;\;\frac{-0.5 \cdot \left(b - \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 85.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -3.9 \cdot 10^{+84}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 3.75 \cdot 10^{-93}:\\ \;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)} - b\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3.9e+84)
   (/ (- b) a)
   (if (<= b 3.75e-93)
     (* (- (sqrt (fma -4.0 (* c a) (* b b))) b) (/ 0.5 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.9e+84) {
		tmp = -b / a;
	} else if (b <= 3.75e-93) {
		tmp = (sqrt(fma(-4.0, (c * a), (b * b))) - b) * (0.5 / a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3.9e+84)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 3.75e-93)
		tmp = Float64(Float64(sqrt(fma(-4.0, Float64(c * a), Float64(b * b))) - b) * Float64(0.5 / a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.9e+84], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 3.75e-93], N[(N[(N[Sqrt[N[(-4.0 * N[(c * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.90000000000000016e84

   1. Initial program 64.7%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 96.7

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

   5. Applied rewrites 96.7%

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

   if -3.90000000000000016e84 < b < 3.75000000000000017e-93

   1. Initial program 83.5%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 84.2

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-neg.f64 N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 84.2

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

   4. Applied rewrites 84.2%

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

   if 3.75000000000000017e-93 < b

   1. Initial program 11.6%

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

   3. Taylor expanded in c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 90.3

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

   5. Applied rewrites 90.3%

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

4. Final simplification 89.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -3.9 \cdot 10^{+84}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 3.75 \cdot 10^{-93}:\\ \;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)} - b\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 81.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.95 \cdot 10^{-95}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\frac{c}{b}}{b}, b, \frac{-b}{a}\right)\\ \mathbf{elif}\;b \leq 3.75 \cdot 10^{-93}:\\ \;\;\;\;\frac{\left(b - \sqrt{\left(c \cdot a\right) \cdot -4}\right) \cdot -0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.95e-95)
   (fma (/ (/ c b) b) b (/ (- b) a))
   (if (<= b 3.75e-93)
     (/ (* (- b (sqrt (* (* c a) -4.0))) -0.5) a)
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.95e-95) {
		tmp = fma(((c / b) / b), b, (-b / a));
	} else if (b <= 3.75e-93) {
		tmp = ((b - sqrt(((c * a) * -4.0))) * -0.5) / a;
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.95e-95)
		tmp = fma(Float64(Float64(c / b) / b), b, Float64(Float64(-b) / a));
	elseif (b <= 3.75e-93)
		tmp = Float64(Float64(Float64(b - sqrt(Float64(Float64(c * a) * -4.0))) * -0.5) / a);
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.95e-95], N[(N[(N[(c / b), $MachinePrecision] / b), $MachinePrecision] * b + N[((-b) / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.75e-93], N[(N[(N[(b - N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision] / a), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.95e-95

   1. Initial program 77.9%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. distribute-rgt-in N/A

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

      3. distribute-neg-in N/A

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

      4. mul-1-neg N/A

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

      5. distribute-lft-neg-out N/A

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

      6. remove-double-neg N/A

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

      7. associate-*l/ N/A

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

      8. *-lft-identity N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. associate-/r* N/A

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

      12. lower-/.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. distribute-frac-neg N/A

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

      15. lower-/.f64 N/A

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

      16. lower-neg.f64 90.9

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

   5. Applied rewrites 90.9%

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

   if -1.95e-95 < b < 3.75000000000000017e-93

   1. Initial program 75.2%

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

   4. Applied rewrites 76.8%

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

   5. Taylor expanded in c around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 75.1

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

   7. Applied rewrites 75.1%

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

   if 3.75000000000000017e-93 < b

   1. Initial program 11.6%

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

   3. Taylor expanded in c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 90.3

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

   5. Applied rewrites 90.3%

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

4. Final simplification 87.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.95 \cdot 10^{-95}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\frac{c}{b}}{b}, b, \frac{-b}{a}\right)\\ \mathbf{elif}\;b \leq 3.75 \cdot 10^{-93}:\\ \;\;\;\;\frac{\left(b - \sqrt{\left(c \cdot a\right) \cdot -4}\right) \cdot -0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 80.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.95 \cdot 10^{-95}:\\ \;\;\;\;\left(\frac{c}{b \cdot b} - \frac{1}{a}\right) \cdot b\\ \mathbf{elif}\;b \leq 3.75 \cdot 10^{-93}:\\ \;\;\;\;\frac{\left(b - \sqrt{\left(c \cdot a\right) \cdot -4}\right) \cdot -0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.95e-95)
   (* (- (/ c (* b b)) (/ 1.0 a)) b)
   (if (<= b 3.75e-93)
     (/ (* (- b (sqrt (* (* c a) -4.0))) -0.5) a)
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.95e-95) {
		tmp = ((c / (b * b)) - (1.0 / a)) * b;
	} else if (b <= 3.75e-93) {
		tmp = ((b - sqrt(((c * a) * -4.0))) * -0.5) / 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 <= (-1.95d-95)) then
        tmp = ((c / (b * b)) - (1.0d0 / a)) * b
    else if (b <= 3.75d-93) then
        tmp = ((b - sqrt(((c * a) * (-4.0d0)))) * (-0.5d0)) / 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 <= -1.95e-95) {
		tmp = ((c / (b * b)) - (1.0 / a)) * b;
	} else if (b <= 3.75e-93) {
		tmp = ((b - Math.sqrt(((c * a) * -4.0))) * -0.5) / a;
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.95e-95:
		tmp = ((c / (b * b)) - (1.0 / a)) * b
	elif b <= 3.75e-93:
		tmp = ((b - math.sqrt(((c * a) * -4.0))) * -0.5) / a
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.95e-95)
		tmp = Float64(Float64(Float64(c / Float64(b * b)) - Float64(1.0 / a)) * b);
	elseif (b <= 3.75e-93)
		tmp = Float64(Float64(Float64(b - sqrt(Float64(Float64(c * a) * -4.0))) * -0.5) / a);
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.95e-95)
		tmp = ((c / (b * b)) - (1.0 / a)) * b;
	elseif (b <= 3.75e-93)
		tmp = ((b - sqrt(((c * a) * -4.0))) * -0.5) / a;
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.95e-95], N[(N[(N[(c / N[(b * b), $MachinePrecision]), $MachinePrecision] - N[(1.0 / a), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision], If[LessEqual[b, 3.75e-93], N[(N[(N[(b - N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision] / a), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.95e-95

   1. Initial program 77.9%

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

   4. Applied rewrites 56.8%

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

   5. Taylor expanded in b around -inf

      \[\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. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. mul-1-neg N/A

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

      7. unsub-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 90.6

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

   7. Applied rewrites 90.6%

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

   if -1.95e-95 < b < 3.75000000000000017e-93

   1. Initial program 75.2%

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

   4. Applied rewrites 76.8%

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

   5. Taylor expanded in c around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 75.1

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

   7. Applied rewrites 75.1%

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

   if 3.75000000000000017e-93 < b

   1. Initial program 11.6%

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

   3. Taylor expanded in c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 90.3

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

   5. Applied rewrites 90.3%

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

4. Final simplification 87.0%

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

Alternative 6: 80.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.95 \cdot 10^{-95}:\\ \;\;\;\;\left(\frac{c}{b \cdot b} - \frac{1}{a}\right) \cdot b\\ \mathbf{elif}\;b \leq 3.75 \cdot 10^{-93}:\\ \;\;\;\;\left(\sqrt{\left(c \cdot a\right) \cdot -4} - b\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.95e-95)
   (* (- (/ c (* b b)) (/ 1.0 a)) b)
   (if (<= b 3.75e-93)
     (* (- (sqrt (* (* c a) -4.0)) b) (/ 0.5 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.95e-95) {
		tmp = ((c / (b * b)) - (1.0 / a)) * b;
	} else if (b <= 3.75e-93) {
		tmp = (sqrt(((c * a) * -4.0)) - b) * (0.5 / 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 <= (-1.95d-95)) then
        tmp = ((c / (b * b)) - (1.0d0 / a)) * b
    else if (b <= 3.75d-93) then
        tmp = (sqrt(((c * a) * (-4.0d0))) - b) * (0.5d0 / 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 <= -1.95e-95) {
		tmp = ((c / (b * b)) - (1.0 / a)) * b;
	} else if (b <= 3.75e-93) {
		tmp = (Math.sqrt(((c * a) * -4.0)) - b) * (0.5 / a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.95e-95:
		tmp = ((c / (b * b)) - (1.0 / a)) * b
	elif b <= 3.75e-93:
		tmp = (math.sqrt(((c * a) * -4.0)) - b) * (0.5 / a)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.95e-95)
		tmp = Float64(Float64(Float64(c / Float64(b * b)) - Float64(1.0 / a)) * b);
	elseif (b <= 3.75e-93)
		tmp = Float64(Float64(sqrt(Float64(Float64(c * a) * -4.0)) - b) * Float64(0.5 / a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.95e-95)
		tmp = ((c / (b * b)) - (1.0 / a)) * b;
	elseif (b <= 3.75e-93)
		tmp = (sqrt(((c * a) * -4.0)) - b) * (0.5 / a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.95e-95], N[(N[(N[(c / N[(b * b), $MachinePrecision]), $MachinePrecision] - N[(1.0 / a), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision], If[LessEqual[b, 3.75e-93], N[(N[(N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.95e-95

   1. Initial program 77.9%

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

   4. Applied rewrites 56.8%

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

   5. Taylor expanded in b around -inf

      \[\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. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. mul-1-neg N/A

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

      7. unsub-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 90.6

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

   7. Applied rewrites 90.6%

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

   if -1.95e-95 < b < 3.75000000000000017e-93

   1. Initial program 75.2%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 76.6

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-neg.f64 N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 76.6

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

   4. Applied rewrites 76.6%

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

   5. Taylor expanded in c around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 74.9

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

   7. Applied rewrites 74.9%

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

   if 3.75000000000000017e-93 < b

   1. Initial program 11.6%

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

   3. Taylor expanded in c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 90.3

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

   5. Applied rewrites 90.3%

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

4. Final simplification 86.9%

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

Alternative 7: 68.0% accurate, 2.5× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2e-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 <= (-2d-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 <= -2e-310) {
		tmp = -b / a;
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

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

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2e-310)
		tmp = Float64(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 <= -2e-310)
		tmp = -b / a;
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -1.999999999999994e-310

   1. Initial program 80.3%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 75.3

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

   5. Applied rewrites 75.3%

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

   if -1.999999999999994e-310 < b

   1. Initial program 25.6%

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

   3. Taylor expanded in c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 73.6

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

   5. Applied rewrites 73.6%

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

Alternative 8: 42.6% accurate, 2.5× speedup

Math

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

FPCore

(FPCore (a b c) :precision binary64 (if (<= b 8.1e+15) (/ (- b) a) (/ c b)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 8.1e+15) {
		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 <= 8.1d+15) 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 <= 8.1e+15) {
		tmp = -b / a;
	} else {
		tmp = c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 8.1e+15:
		tmp = -b / a
	else:
		tmp = c / b
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 8.1e15

   1. Initial program 68.5%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 50.1

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

   5. Applied rewrites 50.1%

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

   if 8.1e15 < b

   1. Initial program 8.1%

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

   4. Applied rewrites 6.8%

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

   5. Taylor expanded in c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 95.6

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

   7. Applied rewrites 95.6%

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

   9. Applied rewrites 28.0%

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

Alternative 9: 10.9% accurate, 4.2× 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.6%

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

4. Applied rewrites 42.2%

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

5. Taylor expanded in c around 0

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

   1. associate-*r/ N/A

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

   2. lower-/.f64 N/A

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

   3. mul-1-neg N/A

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

   4. lower-neg.f64 41.2

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

7. Applied rewrites 41.2%

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

9. Applied rewrites 10.2%

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

Alternative 10: 2.6% accurate, 4.2× 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.6%

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

3. Taylor expanded in b around -inf

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

   1. associate-*r/ N/A

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

   2. mul-1-neg N/A

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

   3. lower-/.f64 N/A

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

   4. lower-neg.f64 35.9

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

5. Applied rewrites 35.9%

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

7. Applied rewrites 29.0%

   \[\leadsto \frac{\frac{0 - b \cdot b}{0 + b}}{a} \]
8. Step-by-step derivation

9. Applied rewrites 2.6%

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

Developer Target 1: 99.7% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left|\frac{b}{2}\right|\\ t_1 := \sqrt{\left|a\right|} \cdot \sqrt{\left|c\right|}\\ t_2 := \begin{array}{l} \mathbf{if}\;\mathsf{copysign}\left(a, c\right) = a:\\ \;\;\;\;\sqrt{t\_0 - t\_1} \cdot \sqrt{t\_0 + t\_1}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\frac{b}{2}, t\_1\right)\\ \end{array}\\ \mathbf{if}\;b < 0:\\ \;\;\;\;\frac{t\_2 - \frac{b}{2}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{\frac{b}{2} + t\_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (fabs (/ b 2.0)))
        (t_1 (* (sqrt (fabs a)) (sqrt (fabs c))))
        (t_2
         (if (== (copysign a c) a)
           (* (sqrt (- t_0 t_1)) (sqrt (+ t_0 t_1)))
           (hypot (/ b 2.0) t_1))))
   (if (< b 0.0) (/ (- t_2 (/ b 2.0)) a) (/ (- c) (+ (/ b 2.0) t_2)))))

C

double code(double a, double b, double c) {
	double t_0 = fabs((b / 2.0));
	double t_1 = sqrt(fabs(a)) * sqrt(fabs(c));
	double tmp;
	if (copysign(a, c) == a) {
		tmp = sqrt((t_0 - t_1)) * sqrt((t_0 + t_1));
	} else {
		tmp = hypot((b / 2.0), t_1);
	}
	double t_2 = tmp;
	double tmp_1;
	if (b < 0.0) {
		tmp_1 = (t_2 - (b / 2.0)) / a;
	} else {
		tmp_1 = -c / ((b / 2.0) + t_2);
	}
	return tmp_1;
}

Java

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

Python

def code(a, b, c):
	t_0 = math.fabs((b / 2.0))
	t_1 = math.sqrt(math.fabs(a)) * math.sqrt(math.fabs(c))
	tmp = 0
	if math.copysign(a, c) == a:
		tmp = math.sqrt((t_0 - t_1)) * math.sqrt((t_0 + t_1))
	else:
		tmp = math.hypot((b / 2.0), t_1)
	t_2 = tmp
	tmp_1 = 0
	if b < 0.0:
		tmp_1 = (t_2 - (b / 2.0)) / a
	else:
		tmp_1 = -c / ((b / 2.0) + t_2)
	return tmp_1

Julia

function code(a, b, c)
	t_0 = abs(Float64(b / 2.0))
	t_1 = Float64(sqrt(abs(a)) * sqrt(abs(c)))
	tmp = 0.0
	if (copysign(a, c) == a)
		tmp = Float64(sqrt(Float64(t_0 - t_1)) * sqrt(Float64(t_0 + t_1)));
	else
		tmp = hypot(Float64(b / 2.0), t_1);
	end
	t_2 = tmp
	tmp_1 = 0.0
	if (b < 0.0)
		tmp_1 = Float64(Float64(t_2 - Float64(b / 2.0)) / a);
	else
		tmp_1 = Float64(Float64(-c) / Float64(Float64(b / 2.0) + t_2));
	end
	return tmp_1
end

MATLAB

function tmp_3 = code(a, b, c)
	t_0 = abs((b / 2.0));
	t_1 = sqrt(abs(a)) * sqrt(abs(c));
	tmp = 0.0;
	if ((sign(c) * abs(a)) == a)
		tmp = sqrt((t_0 - t_1)) * sqrt((t_0 + t_1));
	else
		tmp = hypot((b / 2.0), t_1);
	end
	t_2 = tmp;
	tmp_2 = 0.0;
	if (b < 0.0)
		tmp_2 = (t_2 - (b / 2.0)) / a;
	else
		tmp_2 = -c / ((b / 2.0) + t_2);
	end
	tmp_3 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Abs[N[(b / 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[Abs[a], $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Abs[c], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = If[Equal[N[With[{TMP1 = Abs[a], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], a], N[(N[Sqrt[N[(t$95$0 - t$95$1), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(t$95$0 + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(b / 2.0), $MachinePrecision] ^ 2 + t$95$1 ^ 2], $MachinePrecision]]}, If[Less[b, 0.0], N[(N[(t$95$2 - N[(b / 2.0), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[((-c) / N[(N[(b / 2.0), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]]]]]

Reproduce

herbie shell --seed 2024272 
(FPCore (a b c)
  :name "quadp (p42, positive)"
  :precision binary64
  :herbie-expected 10

  :alt
  (! :herbie-platform default (let ((sqtD (let ((x (* (sqrt (fabs a)) (sqrt (fabs c))))) (if (== (copysign a c) a) (* (sqrt (- (fabs (/ b 2)) x)) (sqrt (+ (fabs (/ b 2)) x))) (hypot (/ b 2) x))))) (if (< b 0) (/ (- sqtD (/ b 2)) a) (/ (- c) (+ (/ b 2) sqtD)))))

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