quad2p (problem 3.2.1, positive)

Percentage Accurate: 51.8% → 85.6%

Time: 8.3s

Alternatives: 8

Speedup: 1.7×

Specification

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))

C

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

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a
end function

Java

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

Python

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

Julia

function code(a, b_2, c)
	return Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a)
end

MATLAB

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

Wolfram

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

Initial Program: 51.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))

C

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

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a
end function

Java

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

Python

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

Julia

function code(a, b_2, c)
	return Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a)
end

MATLAB

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

Wolfram

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

Alternative 1: 85.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1 \cdot 10^{+116}:\\ \;\;\;\;\frac{b\_2 \cdot -2}{a}\\ \mathbf{elif}\;b\_2 \leq 6 \cdot 10^{-96}:\\ \;\;\;\;\frac{\sqrt{b\_2 \cdot b\_2 - a \cdot c} - b\_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b\_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -1e+116)
   (/ (* b_2 -2.0) a)
   (if (<= b_2 6e-96)
     (/ (- (sqrt (- (* b_2 b_2) (* a c))) b_2) a)
     (/ (* c -0.5) b_2))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1e+116) {
		tmp = (b_2 * -2.0) / a;
	} else if (b_2 <= 6e-96) {
		tmp = (sqrt(((b_2 * b_2) - (a * c))) - b_2) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-1d+116)) then
        tmp = (b_2 * (-2.0d0)) / a
    else if (b_2 <= 6d-96) then
        tmp = (sqrt(((b_2 * b_2) - (a * c))) - b_2) / a
    else
        tmp = (c * (-0.5d0)) / b_2
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1e+116) {
		tmp = (b_2 * -2.0) / a;
	} else if (b_2 <= 6e-96) {
		tmp = (Math.sqrt(((b_2 * b_2) - (a * c))) - b_2) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1e+116:
		tmp = (b_2 * -2.0) / a
	elif b_2 <= 6e-96:
		tmp = (math.sqrt(((b_2 * b_2) - (a * c))) - b_2) / a
	else:
		tmp = (c * -0.5) / b_2
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1e+116)
		tmp = Float64(Float64(b_2 * -2.0) / a);
	elseif (b_2 <= 6e-96)
		tmp = Float64(Float64(sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c))) - b_2) / a);
	else
		tmp = Float64(Float64(c * -0.5) / b_2);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1e+116)
		tmp = (b_2 * -2.0) / a;
	elseif (b_2 <= 6e-96)
		tmp = (sqrt(((b_2 * b_2) - (a * c))) - b_2) / a;
	else
		tmp = (c * -0.5) / b_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -1e+116], N[(N[(b$95$2 * -2.0), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 6e-96], N[(N[(N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b$95$2), $MachinePrecision] / a), $MachinePrecision], N[(N[(c * -0.5), $MachinePrecision] / b$95$2), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -1.00000000000000002e116

   1. Initial program 52.1%

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

   3. Taylor expanded in b_2 around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 93.4

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

   5. Simplified 93.4%

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

   if -1.00000000000000002e116 < b_2 < 6e-96

   1. Initial program 84.6%

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

   if 6e-96 < b_2

   1. Initial program 11.8%

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

   3. Taylor expanded in b_2 around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 88.7

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

   5. Simplified 88.7%

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

4. Final simplification 88.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -1 \cdot 10^{+116}:\\ \;\;\;\;\frac{b\_2 \cdot -2}{a}\\ \mathbf{elif}\;b\_2 \leq 6 \cdot 10^{-96}:\\ \;\;\;\;\frac{\sqrt{b\_2 \cdot b\_2 - a \cdot c} - b\_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b\_2}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 80.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -2.6 \cdot 10^{-43}:\\ \;\;\;\;\frac{b\_2 \cdot -2}{a}\\ \mathbf{elif}\;b\_2 \leq 1.06 \cdot 10^{-97}:\\ \;\;\;\;\frac{\sqrt{-a \cdot c} - b\_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b\_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -2.6e-43)
   (/ (* b_2 -2.0) a)
   (if (<= b_2 1.06e-97) (/ (- (sqrt (- (* a c))) b_2) a) (/ (* c -0.5) b_2))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2.6e-43) {
		tmp = (b_2 * -2.0) / a;
	} else if (b_2 <= 1.06e-97) {
		tmp = (sqrt(-(a * c)) - b_2) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-2.6d-43)) then
        tmp = (b_2 * (-2.0d0)) / a
    else if (b_2 <= 1.06d-97) then
        tmp = (sqrt(-(a * c)) - b_2) / a
    else
        tmp = (c * (-0.5d0)) / b_2
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2.6e-43) {
		tmp = (b_2 * -2.0) / a;
	} else if (b_2 <= 1.06e-97) {
		tmp = (Math.sqrt(-(a * c)) - b_2) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -2.6e-43:
		tmp = (b_2 * -2.0) / a
	elif b_2 <= 1.06e-97:
		tmp = (math.sqrt(-(a * c)) - b_2) / a
	else:
		tmp = (c * -0.5) / b_2
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -2.6e-43)
		tmp = Float64(Float64(b_2 * -2.0) / a);
	elseif (b_2 <= 1.06e-97)
		tmp = Float64(Float64(sqrt(Float64(-Float64(a * c))) - b_2) / a);
	else
		tmp = Float64(Float64(c * -0.5) / b_2);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -2.6e-43)
		tmp = (b_2 * -2.0) / a;
	elseif (b_2 <= 1.06e-97)
		tmp = (sqrt(-(a * c)) - b_2) / a;
	else
		tmp = (c * -0.5) / b_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -2.6e-43], N[(N[(b$95$2 * -2.0), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 1.06e-97], N[(N[(N[Sqrt[(-N[(a * c), $MachinePrecision])], $MachinePrecision] - b$95$2), $MachinePrecision] / a), $MachinePrecision], N[(N[(c * -0.5), $MachinePrecision] / b$95$2), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -2.6e-43

   1. Initial program 70.8%

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

   3. Taylor expanded in b_2 around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 90.9

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

   5. Simplified 90.9%

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

   if -2.6e-43 < b_2 < 1.06000000000000006e-97

   1. Initial program 77.0%

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

   3. Taylor expanded in b_2 around 0

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

      1. mul-1-neg N/A

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

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

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

      3. mul-1-neg N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 71.3

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

   5. Simplified 71.3%

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

      1. lift-neg.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-sqrt.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-/.f64 71.3

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lift-neg.f64 N/A

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

      10. unsub-neg N/A

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

      11. lower--.f64 71.3

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

      12. lift-*.f64 N/A

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

      13. lift-neg.f64 N/A

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

      14. distribute-rgt-neg-out N/A

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

      15. lift-*.f64 N/A

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

      16. lower-neg.f64 71.3

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

   7. Applied egg-rr 71.3%

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

   if 1.06000000000000006e-97 < b_2

   1. Initial program 11.8%

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

   3. Taylor expanded in b_2 around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 88.7

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

   5. Simplified 88.7%

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

Alternative 3: 67.5% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 3.1e-295) (/ (* b_2 -2.0) a) (/ (* c -0.5) b_2)))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= 3.1e-295) {
		tmp = (b_2 * -2.0) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= 3.1d-295) then
        tmp = (b_2 * (-2.0d0)) / a
    else
        tmp = (c * (-0.5d0)) / b_2
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= 3.1e-295) {
		tmp = (b_2 * -2.0) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= 3.1e-295:
		tmp = (b_2 * -2.0) / a
	else:
		tmp = (c * -0.5) / b_2
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= 3.1e-295)
		tmp = Float64(Float64(b_2 * -2.0) / a);
	else
		tmp = Float64(Float64(c * -0.5) / b_2);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= 3.1e-295)
		tmp = (b_2 * -2.0) / a;
	else
		tmp = (c * -0.5) / b_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, 3.1e-295], N[(N[(b$95$2 * -2.0), $MachinePrecision] / a), $MachinePrecision], N[(N[(c * -0.5), $MachinePrecision] / b$95$2), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < 3.1000000000000002e-295

   1. Initial program 75.8%

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

   3. Taylor expanded in b_2 around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 65.9

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

   5. Simplified 65.9%

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

   if 3.1000000000000002e-295 < b_2

   1. Initial program 22.2%

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

   3. Taylor expanded in b_2 around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 74.9

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

   5. Simplified 74.9%

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

Alternative 4: 67.4% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 3.1e-295) (/ (* b_2 -2.0) a) (* c (/ -0.5 b_2))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= 3.1e-295) {
		tmp = (b_2 * -2.0) / a;
	} else {
		tmp = c * (-0.5 / b_2);
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= 3.1d-295) then
        tmp = (b_2 * (-2.0d0)) / a
    else
        tmp = c * ((-0.5d0) / b_2)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= 3.1e-295) {
		tmp = (b_2 * -2.0) / a;
	} else {
		tmp = c * (-0.5 / b_2);
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= 3.1e-295:
		tmp = (b_2 * -2.0) / a
	else:
		tmp = c * (-0.5 / b_2)
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= 3.1e-295)
		tmp = Float64(Float64(b_2 * -2.0) / a);
	else
		tmp = Float64(c * Float64(-0.5 / b_2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= 3.1e-295)
		tmp = (b_2 * -2.0) / a;
	else
		tmp = c * (-0.5 / b_2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, 3.1e-295], N[(N[(b$95$2 * -2.0), $MachinePrecision] / a), $MachinePrecision], N[(c * N[(-0.5 / b$95$2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < 3.1000000000000002e-295

   1. Initial program 75.8%

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

   3. Taylor expanded in b_2 around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 65.9

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

   5. Simplified 65.9%

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

   if 3.1000000000000002e-295 < b_2

   1. Initial program 22.2%

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

   3. Taylor expanded in b_2 around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 74.9

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

   5. Simplified 74.9%

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 74.7

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

   7. Applied egg-rr 74.7%

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

4. Final simplification 69.9%

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

Alternative 5: 67.3% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 3.1e-295) (* b_2 (/ -2.0 a)) (* c (/ -0.5 b_2))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= 3.1e-295) {
		tmp = b_2 * (-2.0 / a);
	} else {
		tmp = c * (-0.5 / b_2);
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= 3.1d-295) then
        tmp = b_2 * ((-2.0d0) / a)
    else
        tmp = c * ((-0.5d0) / b_2)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= 3.1e-295) {
		tmp = b_2 * (-2.0 / a);
	} else {
		tmp = c * (-0.5 / b_2);
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= 3.1e-295:
		tmp = b_2 * (-2.0 / a)
	else:
		tmp = c * (-0.5 / b_2)
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= 3.1e-295)
		tmp = Float64(b_2 * Float64(-2.0 / a));
	else
		tmp = Float64(c * Float64(-0.5 / b_2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= 3.1e-295)
		tmp = b_2 * (-2.0 / a);
	else
		tmp = c * (-0.5 / b_2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, 3.1e-295], N[(b$95$2 * N[(-2.0 / a), $MachinePrecision]), $MachinePrecision], N[(c * N[(-0.5 / b$95$2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < 3.1000000000000002e-295

   1. Initial program 75.8%

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

   3. Taylor expanded in b_2 around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 65.9

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

   5. Simplified 65.9%

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 65.8

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

   7. Applied egg-rr 65.8%

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

   if 3.1000000000000002e-295 < b_2

   1. Initial program 22.2%

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

   3. Taylor expanded in b_2 around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 74.9

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

   5. Simplified 74.9%

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 74.7

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

   7. Applied egg-rr 74.7%

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

4. Final simplification 69.9%

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

Alternative 6: 35.5% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ b\_2 \cdot \frac{-2}{a} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = b_2 * ((-2.0d0) / a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b$95$2_, c_] := N[(b$95$2 * N[(-2.0 / a), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 51.3%

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

3. Taylor expanded in b_2 around -inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 37.0

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

5. Simplified 37.0%

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

   1. associate-/l* N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 37.0

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

7. Applied egg-rr 37.0%

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

8. Final simplification 37.0%

   \[\leadsto b\_2 \cdot \frac{-2}{a} \]
9. Add Preprocessing

Alternative 7: 15.6% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b$95$2_, c_] := N[(b$95$2 / (-a)), $MachinePrecision]

Derivation

1. Initial program 51.3%

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

3. Taylor expanded in b_2 around 0

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

   1. mul-1-neg N/A

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

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

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

   3. mul-1-neg N/A

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

   4. lower-*.f64 N/A

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

   5. mul-1-neg N/A

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

   6. lower-neg.f64 31.2

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

5. Simplified 31.2%

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

6. Taylor expanded in b_2 around inf

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

   1. mul-1-neg N/A

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

   2. distribute-neg-frac2 N/A

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

   3. mul-1-neg N/A

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

   4. lower-/.f64 N/A

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

   5. mul-1-neg N/A

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

   6. lower-neg.f64 15.8

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

8. Simplified 15.8%

   \[\leadsto \color{blue}{\frac{b\_2}{-a}} \]
9. Add Preprocessing

Alternative 8: 2.6% accurate, 3.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 51.3%

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

3. Taylor expanded in b_2 around 0

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

   1. mul-1-neg N/A

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

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

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

   3. mul-1-neg N/A

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

   4. lower-*.f64 N/A

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

   5. mul-1-neg N/A

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

   6. lower-neg.f64 31.2

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

5. Simplified 31.2%

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

6. Taylor expanded in b_2 around inf

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

   1. mul-1-neg N/A

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

   2. distribute-neg-frac2 N/A

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

   3. mul-1-neg N/A

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

   4. lower-/.f64 N/A

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

   5. mul-1-neg N/A

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

   6. lower-neg.f64 15.8

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

8. Simplified 15.8%

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

10. Applied egg-rr 2.4%

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

Developer Target 1: 99.7% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024215 
(FPCore (a b_2 c)
  :name "quad2p (problem 3.2.1, 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_2 0) (/ (- sqtD b_2) a) (/ (- c) (+ b_2 sqtD)))))

  (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))