quad2p (problem 3.2.1, positive)

Percentage Accurate: 51.9% → 85.3%

Time: 12.1s

Alternatives: 9

Speedup: 15.9×

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.9% 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.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -1.1 \cdot 10^{+114}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 1.08 \cdot 10^{-148}:\\ \;\;\;\;\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 -1.1e+114)
   (+ (* -2.0 (/ b_2 a)) (* 0.5 (/ c b_2)))
   (if (<= b_2 1.08e-148)
     (/ (- (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 <= -1.1e+114) {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	} else if (b_2 <= 1.08e-148) {
		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 <= (-1.1d+114)) then
        tmp = ((-2.0d0) * (b_2 / a)) + (0.5d0 * (c / b_2))
    else if (b_2 <= 1.08d-148) 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 <= -1.1e+114) {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	} else if (b_2 <= 1.08e-148) {
		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 <= -1.1e+114:
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2))
	elif b_2 <= 1.08e-148:
		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 <= -1.1e+114)
		tmp = Float64(Float64(-2.0 * Float64(b_2 / a)) + Float64(0.5 * Float64(c / b_2)));
	elseif (b_2 <= 1.08e-148)
		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 <= -1.1e+114)
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	elseif (b_2 <= 1.08e-148)
		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, -1.1e+114], N[(N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 1.08e-148], 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.1e114

   1. Initial program 47.0%

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

      1. +-commutative 47.0%

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

      2. unsub-neg 47.0%

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

   3. Simplified 47.0%

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

   4. Taylor expanded in b_2 around -inf 92.0%

      \[\leadsto \color{blue}{-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}} \]

   if -1.1e114 < b_2 < 1.08000000000000006e-148

   1. Initial program 91.2%

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

      1. +-commutative 91.2%

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

      2. unsub-neg 91.2%

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

   3. Simplified 91.2%

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

   if 1.08000000000000006e-148 < b_2

   1. Initial program 15.3%

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

      1. +-commutative 15.3%

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

      2. unsub-neg 15.3%

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

   3. Simplified 15.3%

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

   4. Taylor expanded in b_2 around inf 83.7%

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

      1. associate-*r/ 83.7%

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

   6. Applied egg-rr 83.7%

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

4. Final simplification 88.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq -1.1 \cdot 10^{+114}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 1.08 \cdot 10^{-148}:\\ \;\;\;\;\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b_2}\\ \end{array} \]

Alternative 2: 80.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -3 \cdot 10^{-97}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 1.08 \cdot 10^{-148}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(-c\right)} - 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 -3e-97)
   (+ (* -2.0 (/ b_2 a)) (* 0.5 (/ c b_2)))
   (if (<= b_2 1.08e-148)
     (/ (- (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 <= -3e-97) {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	} else if (b_2 <= 1.08e-148) {
		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 <= (-3d-97)) then
        tmp = ((-2.0d0) * (b_2 / a)) + (0.5d0 * (c / b_2))
    else if (b_2 <= 1.08d-148) 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 <= -3e-97) {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	} else if (b_2 <= 1.08e-148) {
		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 <= -3e-97:
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2))
	elif b_2 <= 1.08e-148:
		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 <= -3e-97)
		tmp = Float64(Float64(-2.0 * Float64(b_2 / a)) + Float64(0.5 * Float64(c / b_2)));
	elseif (b_2 <= 1.08e-148)
		tmp = Float64(Float64(sqrt(Float64(a * Float64(-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 <= -3e-97)
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	elseif (b_2 <= 1.08e-148)
		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, -3e-97], N[(N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 1.08e-148], 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 < -3.00000000000000024e-97

   1. Initial program 74.0%

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

      1. +-commutative 74.0%

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

      2. unsub-neg 74.0%

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

   3. Simplified 74.0%

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

   4. Taylor expanded in b_2 around -inf 89.5%

      \[\leadsto \color{blue}{-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}} \]

   if -3.00000000000000024e-97 < b_2 < 1.08000000000000006e-148

   1. Initial program 82.4%

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

      1. +-commutative 82.4%

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

      2. unsub-neg 82.4%

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

   3. Simplified 82.4%

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

   4. Taylor expanded in b_2 around 0 75.0%

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

      1. associate-*r* 75.0%

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

      2. neg-mul-1 75.0%

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

      3. *-commutative 75.0%

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

   6. Simplified 75.0%

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

   if 1.08000000000000006e-148 < b_2

   1. Initial program 15.3%

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

      1. +-commutative 15.3%

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

      2. unsub-neg 15.3%

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

   3. Simplified 15.3%

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

   4. Taylor expanded in b_2 around inf 83.7%

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

      1. associate-*r/ 83.7%

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

   6. Applied egg-rr 83.7%

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

4. Final simplification 84.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq -3 \cdot 10^{-97}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 1.08 \cdot 10^{-148}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(-c\right)} - b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b_2}\\ \end{array} \]

Alternative 3: 80.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -3.1 \cdot 10^{-99}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 1.08 \cdot 10^{-148}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(-c\right)}}{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-99)
   (+ (* -2.0 (/ b_2 a)) (* 0.5 (/ c b_2)))
   (if (<= b_2 1.08e-148) (/ (sqrt (* a (- c))) a) (/ (* c -0.5) b_2))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -3.1e-99) {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	} else if (b_2 <= 1.08e-148) {
		tmp = sqrt((a * -c)) / 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-99)) then
        tmp = ((-2.0d0) * (b_2 / a)) + (0.5d0 * (c / b_2))
    else if (b_2 <= 1.08d-148) then
        tmp = sqrt((a * -c)) / 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-99) {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	} else if (b_2 <= 1.08e-148) {
		tmp = Math.sqrt((a * -c)) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -3.1e-99:
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2))
	elif b_2 <= 1.08e-148:
		tmp = math.sqrt((a * -c)) / 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-99)
		tmp = Float64(Float64(-2.0 * Float64(b_2 / a)) + Float64(0.5 * Float64(c / b_2)));
	elseif (b_2 <= 1.08e-148)
		tmp = Float64(sqrt(Float64(a * Float64(-c))) / 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-99)
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	elseif (b_2 <= 1.08e-148)
		tmp = sqrt((a * -c)) / 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-99], N[(N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 1.08e-148], N[(N[Sqrt[N[(a * (-c)), $MachinePrecision]], $MachinePrecision] / a), $MachinePrecision], N[(N[(c * -0.5), $MachinePrecision] / b$95$2), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -3.0999999999999999e-99

   1. Initial program 74.0%

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

      1. +-commutative 74.0%

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

      2. unsub-neg 74.0%

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

   3. Simplified 74.0%

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

   4. Taylor expanded in b_2 around -inf 89.5%

      \[\leadsto \color{blue}{-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}} \]

   if -3.0999999999999999e-99 < b_2 < 1.08000000000000006e-148

   1. Initial program 82.4%

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

      1. +-commutative 82.4%

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

      2. unsub-neg 82.4%

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

   3. Simplified 82.4%

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

      1. prod-diff 82.1%

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

      2. *-commutative 82.1%

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

      3. fma-def 82.1%

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

      4. associate-+l+ 82.1%

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

      5. distribute-rgt-neg-in 82.1%

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

      6. fma-def 81.9%

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

      7. *-commutative 81.9%

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

      8. fma-udef 82.1%

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

      9. distribute-lft-neg-in 82.1%

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

      10. *-commutative 82.1%

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

      11. distribute-rgt-neg-in 82.1%

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

      12. fma-def 81.9%

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

   5. Applied egg-rr 81.9%

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

   6. Taylor expanded in b_2 around 0 73.6%

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

      1. associate-*l/ 73.8%

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

      2. *-lft-identity 73.8%

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

      3. distribute-lft1-in 74.1%

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

      4. metadata-eval 74.1%

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

      5. neg-mul-1 74.1%

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

      6. *-commutative 74.1%

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

      7. distribute-rgt-neg-out 74.1%

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

      8. distribute-rgt-neg-out 74.1%

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

      9. *-commutative 74.1%

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

      10. distribute-rgt-neg-out 74.1%

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

   8. Simplified 74.1%

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

   if 1.08000000000000006e-148 < b_2

   1. Initial program 15.3%

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

      1. +-commutative 15.3%

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

      2. unsub-neg 15.3%

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

   3. Simplified 15.3%

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

   4. Taylor expanded in b_2 around inf 83.7%

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

      1. associate-*r/ 83.7%

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

   6. Applied egg-rr 83.7%

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

4. Final simplification 84.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq -3.1 \cdot 10^{-99}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 1.08 \cdot 10^{-148}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(-c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b_2}\\ \end{array} \]

Alternative 4: 68.4% accurate, 8.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -1 \cdot 10^{-310}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}\\ \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-310)
   (+ (* -2.0 (/ b_2 a)) (* 0.5 (/ c b_2)))
   (/ (* c -0.5) b_2)))

C

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

Python

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

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1e-310)
		tmp = Float64(Float64(-2.0 * Float64(b_2 / a)) + Float64(0.5 * Float64(c / b_2)));
	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-310)
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	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-310], N[(N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(c * -0.5), $MachinePrecision] / b$95$2), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -9.999999999999969e-311

   1. Initial program 75.9%

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

      1. +-commutative 75.9%

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

      2. unsub-neg 75.9%

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

   3. Simplified 75.9%

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

   4. Taylor expanded in b_2 around -inf 72.2%

      \[\leadsto \color{blue}{-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}} \]

   if -9.999999999999969e-311 < b_2

   1. Initial program 24.8%

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

      1. +-commutative 24.8%

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

      2. unsub-neg 24.8%

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

   3. Simplified 24.8%

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

   4. Taylor expanded in b_2 around inf 73.4%

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

      1. associate-*r/ 73.4%

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

   6. Applied egg-rr 73.4%

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

4. Final simplification 72.8%

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

Alternative 5: 48.6% accurate, 15.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq 2.4 \cdot 10^{-308}:\\ \;\;\;\;\frac{-b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b_2} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 2.4e-308) (/ (- b_2) a) (* (/ c b_2) -0.5)))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= 2.4e-308) {
		tmp = -b_2 / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	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.4d-308) then
        tmp = -b_2 / a
    else
        tmp = (c / b_2) * (-0.5d0)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b_2 < 2.40000000000000008e-308

   1. Initial program 76.1%

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

      1. +-commutative 76.1%

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

      2. unsub-neg 76.1%

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

   3. Simplified 76.1%

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

      1. add-sqr-sqrt 75.9%

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

      2. pow2 75.9%

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

      3. pow1/2 75.9%

         \[\leadsto \frac{{\left(\sqrt{\color{blue}{{\left(b_2 \cdot b_2 - a \cdot c\right)}^{0.5}}}\right)}^{2} - b_2}{a} \]

      4. sqrt-pow1 75.9%

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

      5. fma-neg 75.9%

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

      6. *-commutative 75.9%

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

      7. distribute-rgt-neg-in 75.9%

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

      8. metadata-eval 75.9%

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

   5. Applied egg-rr 75.9%

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

   6. Taylor expanded in b_2 around inf 27.0%

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

      1. neg-mul-1 27.0%

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

   8. Simplified 27.0%

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

   if 2.40000000000000008e-308 < b_2

   1. Initial program 24.2%

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

      1. +-commutative 24.2%

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

      2. unsub-neg 24.2%

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

   3. Simplified 24.2%

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

   4. Taylor expanded in b_2 around inf 73.9%

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

4. Final simplification 50.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq 2.4 \cdot 10^{-308}:\\ \;\;\;\;\frac{-b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b_2} \cdot -0.5\\ \end{array} \]

Alternative 6: 48.6% accurate, 15.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq 2.4 \cdot 10^{-308}:\\ \;\;\;\;\frac{-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.4e-308) (/ (- b_2) a) (/ (* c -0.5) b_2)))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= 2.4e-308) {
		tmp = -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.4d-308) then
        tmp = -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.4e-308) {
		tmp = -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.4e-308:
		tmp = -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.4e-308)
		tmp = Float64(Float64(-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.4e-308)
		tmp = -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.4e-308], N[((-b$95$2) / a), $MachinePrecision], N[(N[(c * -0.5), $MachinePrecision] / b$95$2), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < 2.40000000000000008e-308

   1. Initial program 76.1%

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

      1. +-commutative 76.1%

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

      2. unsub-neg 76.1%

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

   3. Simplified 76.1%

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

      1. add-sqr-sqrt 75.9%

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

      2. pow2 75.9%

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

      3. pow1/2 75.9%

         \[\leadsto \frac{{\left(\sqrt{\color{blue}{{\left(b_2 \cdot b_2 - a \cdot c\right)}^{0.5}}}\right)}^{2} - b_2}{a} \]

      4. sqrt-pow1 75.9%

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

      5. fma-neg 75.9%

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

      6. *-commutative 75.9%

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

      7. distribute-rgt-neg-in 75.9%

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

      8. metadata-eval 75.9%

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

   5. Applied egg-rr 75.9%

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

   6. Taylor expanded in b_2 around inf 27.0%

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

      1. neg-mul-1 27.0%

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

   8. Simplified 27.0%

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

   if 2.40000000000000008e-308 < b_2

   1. Initial program 24.2%

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

      1. +-commutative 24.2%

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

      2. unsub-neg 24.2%

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

   3. Simplified 24.2%

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

   4. Taylor expanded in b_2 around inf 73.9%

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

      1. associate-*r/ 73.9%

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

   6. Applied egg-rr 73.9%

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

4. Final simplification 50.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq 2.4 \cdot 10^{-308}:\\ \;\;\;\;\frac{-b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b_2}\\ \end{array} \]

Alternative 7: 68.2% accurate, 15.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq 2.4 \cdot 10^{-308}:\\ \;\;\;\;\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 2.4e-308) (/ (* 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 <= 2.4e-308) {
		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 <= 2.4d-308) 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 <= 2.4e-308) {
		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 <= 2.4e-308:
		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 <= 2.4e-308)
		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 <= 2.4e-308)
		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, 2.4e-308], 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 < 2.40000000000000008e-308

   1. Initial program 76.1%

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

      1. +-commutative 76.1%

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

      2. unsub-neg 76.1%

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

   3. Simplified 76.1%

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

   4. Taylor expanded in b_2 around -inf 71.2%

      \[\leadsto \frac{\color{blue}{-2 \cdot b_2}}{a} \]
   5. Step-by-step derivation

      1. *-commutative 71.2%

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

   6. Simplified 71.2%

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

   if 2.40000000000000008e-308 < b_2

   1. Initial program 24.2%

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

      1. +-commutative 24.2%

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

      2. unsub-neg 24.2%

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

   3. Simplified 24.2%

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

   4. Taylor expanded in b_2 around inf 73.9%

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

      1. associate-*r/ 73.9%

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

   6. Applied egg-rr 73.9%

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

4. Final simplification 72.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq 2.4 \cdot 10^{-308}:\\ \;\;\;\;\frac{b_2 \cdot -2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b_2}\\ \end{array} \]

Alternative 8: 23.7% accurate, 18.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -7.9 \cdot 10^{-292}:\\ \;\;\;\;\frac{-b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{0}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -7.9e-292) (/ (- b_2) a) (/ 0.0 a)))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -7.9e-292) {
		tmp = -b_2 / a;
	} else {
		tmp = 0.0 / a;
	}
	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 <= (-7.9d-292)) then
        tmp = -b_2 / a
    else
        tmp = 0.0d0 / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -7.9e-292) {
		tmp = -b_2 / a;
	} else {
		tmp = 0.0 / a;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -7.9e-292:
		tmp = -b_2 / a
	else:
		tmp = 0.0 / a
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -7.9e-292)
		tmp = Float64(Float64(-b_2) / a);
	else
		tmp = Float64(0.0 / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -7.9e-292)
		tmp = -b_2 / a;
	else
		tmp = 0.0 / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -7.9e-292], N[((-b$95$2) / a), $MachinePrecision], N[(0.0 / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -7.90000000000000018e-292

   1. Initial program 77.5%

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

      1. +-commutative 77.5%

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

      2. unsub-neg 77.5%

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

   3. Simplified 77.5%

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

      1. add-sqr-sqrt 77.2%

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

      2. pow2 77.2%

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

      3. pow1/2 77.2%

         \[\leadsto \frac{{\left(\sqrt{\color{blue}{{\left(b_2 \cdot b_2 - a \cdot c\right)}^{0.5}}}\right)}^{2} - b_2}{a} \]

      4. sqrt-pow1 77.3%

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

      5. fma-neg 77.3%

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

      6. *-commutative 77.3%

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

      7. distribute-rgt-neg-in 77.3%

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

      8. metadata-eval 77.3%

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

   5. Applied egg-rr 77.3%

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

   6. Taylor expanded in b_2 around inf 28.0%

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

      1. neg-mul-1 28.0%

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

   8. Simplified 28.0%

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

   if -7.90000000000000018e-292 < b_2

   1. Initial program 24.9%

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

      1. +-commutative 24.9%

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

      2. unsub-neg 24.9%

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

   3. Simplified 24.9%

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

      1. add-sqr-sqrt 23.2%

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

      2. pow2 23.2%

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

      3. pow1/2 23.2%

         \[\leadsto \frac{{\left(\sqrt{\color{blue}{{\left(b_2 \cdot b_2 - a \cdot c\right)}^{0.5}}}\right)}^{2} - b_2}{a} \]

      4. sqrt-pow1 23.2%

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

      5. fma-neg 23.2%

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

      6. *-commutative 23.2%

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

      7. distribute-rgt-neg-in 23.2%

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

      8. metadata-eval 23.2%

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

   5. Applied egg-rr 23.2%

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

   6. Taylor expanded in b_2 around inf 16.9%

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

      1. distribute-rgt1-in 16.9%

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

      2. metadata-eval 16.9%

         \[\leadsto \frac{\color{blue}{0} \cdot b_2}{a} \]

      3. mul0-lft 16.9%

         \[\leadsto \frac{\color{blue}{0}}{a} \]

   8. Simplified 16.9%

      \[\leadsto \frac{\color{blue}{0}}{a} \]
3. Recombined 2 regimes into one program.

4. Final simplification 22.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq -7.9 \cdot 10^{-292}:\\ \;\;\;\;\frac{-b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{0}{a}\\ \end{array} \]

Alternative 9: 10.9% accurate, 37.3× speedup

Math

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

FPCore

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

C

double code(double a, double b_2, double c) {
	return 0.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 = 0.0d0 / a
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 50.2%

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

   1. +-commutative 50.2%

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

   2. unsub-neg 50.2%

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

3. Simplified 50.2%

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

   1. add-sqr-sqrt 49.2%

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

   2. pow2 49.2%

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

   3. pow1/2 49.2%

      \[\leadsto \frac{{\left(\sqrt{\color{blue}{{\left(b_2 \cdot b_2 - a \cdot c\right)}^{0.5}}}\right)}^{2} - b_2}{a} \]

   4. sqrt-pow1 49.2%

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

   5. fma-neg 49.2%

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

   6. *-commutative 49.2%

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

   7. distribute-rgt-neg-in 49.2%

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

   8. metadata-eval 49.2%

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

5. Applied egg-rr 49.2%

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

6. Taylor expanded in b_2 around inf 10.1%

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

   1. distribute-rgt1-in 10.1%

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

   2. metadata-eval 10.1%

      \[\leadsto \frac{\color{blue}{0} \cdot b_2}{a} \]

   3. mul0-lft 10.1%

      \[\leadsto \frac{\color{blue}{0}}{a} \]

8. Simplified 10.1%

   \[\leadsto \frac{\color{blue}{0}}{a} \]

9. Final simplification 10.1%

   \[\leadsto \frac{0}{a} \]

Developer target: 99.6% accurate, 0.1× 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 2023291 
(FPCore (a b_2 c)
  :name "quad2p (problem 3.2.1, positive)"
  :precision binary64
  :herbie-expected 10

  :herbie-target
  (if (< b_2 0.0) (/ (- (if (== (copysign a c) a) (* (sqrt (- (fabs b_2) (* (sqrt (fabs a)) (sqrt (fabs c))))) (sqrt (+ (fabs b_2) (* (sqrt (fabs a)) (sqrt (fabs c)))))) (hypot b_2 (* (sqrt (fabs a)) (sqrt (fabs c))))) b_2) a) (/ (- c) (+ b_2 (if (== (copysign a c) a) (* (sqrt (- (fabs b_2) (* (sqrt (fabs a)) (sqrt (fabs c))))) (sqrt (+ (fabs b_2) (* (sqrt (fabs a)) (sqrt (fabs c)))))) (hypot b_2 (* (sqrt (fabs a)) (sqrt (fabs c))))))))

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