quad2p (problem 3.2.1, positive)

Percentage Accurate: 52.2% → 85.3%

Time: 9.2s

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: 52.2% 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, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -1.1 \cdot 10^{+154}:\\ \;\;\;\;\frac{b_2 \cdot -2}{a}\\ \mathbf{elif}\;b_2 \leq 1.75 \cdot 10^{-147}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(a, -c, b_2 \cdot b_2\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 -1.1e+154)
   (/ (* b_2 -2.0) a)
   (if (<= b_2 1.75e-147)
     (/ (- (sqrt (fma a (- c) (* b_2 b_2))) 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+154) {
		tmp = (b_2 * -2.0) / a;
	} else if (b_2 <= 1.75e-147) {
		tmp = (sqrt(fma(a, -c, (b_2 * b_2))) - 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+154)
		tmp = Float64(Float64(b_2 * -2.0) / a);
	elseif (b_2 <= 1.75e-147)
		tmp = Float64(Float64(sqrt(fma(a, Float64(-c), Float64(b_2 * b_2))) - b_2) / a);
	else
		tmp = Float64(Float64(c * -0.5) / b_2);
	end
	return tmp
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -1.1e+154], N[(N[(b$95$2 * -2.0), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 1.75e-147], N[(N[(N[Sqrt[N[(a * (-c) + N[(b$95$2 * b$95$2), $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.1000000000000001e154

   1. Initial program 37.2%

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

      1. +-commutative 37.2%

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

      2. unsub-neg 37.2%

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

   3. Simplified 37.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 100.0%

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

      1. *-commutative 100.0%

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

   6. Simplified 100.0%

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

   if -1.1000000000000001e154 < b_2 < 1.75000000000000002e-147

   1. Initial program 89.1%

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

      1. /-rgt-identity 89.1%

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

      2. metadata-eval 89.1%

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

      3. metadata-eval 89.1%

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

      4. /-rgt-identity 89.1%

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

      5. +-commutative 89.1%

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

      6. unsub-neg 89.1%

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

      7. cancel-sign-sub-inv 89.1%

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

      8. +-commutative 89.1%

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

      9. distribute-lft-neg-out 89.1%

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

      10. distribute-rgt-neg-out 89.1%

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

      11. fma-def 89.1%

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

   3. Simplified 89.1%

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

   if 1.75000000000000002e-147 < b_2

   1. Initial program 21.2%

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

      1. +-commutative 21.2%

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

      2. unsub-neg 21.2%

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

   3. Simplified 21.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 83.1%

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

      1. *-commutative 83.1%

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

      2. associate-*l/ 83.1%

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

   6. Simplified 83.1%

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

4. Final simplification 88.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq -1.1 \cdot 10^{+154}:\\ \;\;\;\;\frac{b_2 \cdot -2}{a}\\ \mathbf{elif}\;b_2 \leq 1.75 \cdot 10^{-147}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(a, -c, b_2 \cdot b_2\right)} - b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b_2}\\ \end{array} \]

Alternative 2: 85.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -1.04 \cdot 10^{+154}:\\ \;\;\;\;\frac{b_2 \cdot -2}{a}\\ \mathbf{elif}\;b_2 \leq 1.75 \cdot 10^{-147}:\\ \;\;\;\;\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.04e+154)
   (/ (* b_2 -2.0) a)
   (if (<= b_2 1.75e-147)
     (/ (- (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.04e+154) {
		tmp = (b_2 * -2.0) / a;
	} else if (b_2 <= 1.75e-147) {
		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.04d+154)) then
        tmp = (b_2 * (-2.0d0)) / a
    else if (b_2 <= 1.75d-147) 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.04e+154) {
		tmp = (b_2 * -2.0) / a;
	} else if (b_2 <= 1.75e-147) {
		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.04e+154:
		tmp = (b_2 * -2.0) / a
	elif b_2 <= 1.75e-147:
		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.04e+154)
		tmp = Float64(Float64(b_2 * -2.0) / a);
	elseif (b_2 <= 1.75e-147)
		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.04e+154)
		tmp = (b_2 * -2.0) / a;
	elseif (b_2 <= 1.75e-147)
		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.04e+154], N[(N[(b$95$2 * -2.0), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 1.75e-147], 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.04e154

   1. Initial program 37.2%

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

      1. +-commutative 37.2%

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

      2. unsub-neg 37.2%

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

   3. Simplified 37.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 100.0%

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

      1. *-commutative 100.0%

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

   6. Simplified 100.0%

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

   if -1.04e154 < b_2 < 1.75000000000000002e-147

   1. Initial program 89.1%

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

      1. +-commutative 89.1%

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

      2. unsub-neg 89.1%

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

   3. Simplified 89.1%

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

   if 1.75000000000000002e-147 < b_2

   1. Initial program 21.2%

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

      1. +-commutative 21.2%

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

      2. unsub-neg 21.2%

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

   3. Simplified 21.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 83.1%

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

      1. *-commutative 83.1%

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

      2. associate-*l/ 83.1%

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

   6. Simplified 83.1%

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

4. Final simplification 88.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq -1.04 \cdot 10^{+154}:\\ \;\;\;\;\frac{b_2 \cdot -2}{a}\\ \mathbf{elif}\;b_2 \leq 1.75 \cdot 10^{-147}:\\ \;\;\;\;\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 3: 80.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -2.45 \cdot 10^{-32}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 1.75 \cdot 10^{-147}:\\ \;\;\;\;\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 -2.45e-32)
   (+ (* -2.0 (/ b_2 a)) (* 0.5 (/ c b_2)))
   (if (<= b_2 1.75e-147)
     (/ (- (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.45e-32) {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	} else if (b_2 <= 1.75e-147) {
		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.45d-32)) then
        tmp = ((-2.0d0) * (b_2 / a)) + (0.5d0 * (c / b_2))
    else if (b_2 <= 1.75d-147) 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.45e-32) {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	} else if (b_2 <= 1.75e-147) {
		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.45e-32:
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2))
	elif b_2 <= 1.75e-147:
		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.45e-32)
		tmp = Float64(Float64(-2.0 * Float64(b_2 / a)) + Float64(0.5 * Float64(c / b_2)));
	elseif (b_2 <= 1.75e-147)
		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 <= -2.45e-32)
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	elseif (b_2 <= 1.75e-147)
		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.45e-32], 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.75e-147], 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.4499999999999999e-32

   1. Initial program 70.4%

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

      1. +-commutative 70.4%

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

      2. unsub-neg 70.4%

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

   3. Simplified 70.4%

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

   4. Taylor expanded in b_2 around -inf 94.5%

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

   if -2.4499999999999999e-32 < b_2 < 1.75000000000000002e-147

   1. Initial program 83.5%

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

      1. +-commutative 83.5%

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

      2. unsub-neg 83.5%

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

   3. Simplified 83.5%

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

   4. Taylor expanded in b_2 around 0 72.8%

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

      1. associate-*r* 72.8%

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

      2. neg-mul-1 72.8%

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

   6. Simplified 72.8%

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

   if 1.75000000000000002e-147 < b_2

   1. Initial program 21.2%

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

      1. +-commutative 21.2%

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

      2. unsub-neg 21.2%

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

   3. Simplified 21.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 83.1%

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

      1. *-commutative 83.1%

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

      2. associate-*l/ 83.1%

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

   6. Simplified 83.1%

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

4. Final simplification 84.0%

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

Alternative 4: 67.7% accurate, 8.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -5 \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 -5e-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 <= -5e-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 <= (-5d-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 <= -5e-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 <= -5e-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 <= -5e-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 <= -5e-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, -5e-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 < -4.999999999999985e-310

   1. Initial program 75.2%

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

      1. +-commutative 75.2%

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

      2. unsub-neg 75.2%

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

   3. Simplified 75.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 69.5%

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

   if -4.999999999999985e-310 < b_2

   1. Initial program 33.6%

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

      1. +-commutative 33.6%

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

      2. unsub-neg 33.6%

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

   3. Simplified 33.6%

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

   4. Taylor expanded in b_2 around inf 68.2%

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

      1. *-commutative 68.2%

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

      2. associate-*l/ 68.2%

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

   6. Simplified 68.2%

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

4. Final simplification 68.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq -5 \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: 67.3% accurate, 15.9× speedup

Math

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

   1. Initial program 75.6%

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

      1. +-commutative 75.6%

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

      2. unsub-neg 75.6%

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

   3. Simplified 75.6%

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

   4. Taylor expanded in b_2 around -inf 67.0%

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

      1. div-inv 66.8%

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

   6. Applied egg-rr 66.8%

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

   7. Taylor expanded in b_2 around inf 68.2%

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

      1. associate-*r/ 68.2%

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

      2. *-commutative 68.2%

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

      3. *-rgt-identity 68.2%

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

      4. associate-*r/ 68.0%

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

      5. associate-*l* 68.0%

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

      6. associate-*r/ 68.0%

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

      7. metadata-eval 68.0%

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

   9. Simplified 68.0%

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

   if 1.2599999999999999e-301 < b_2

   1. Initial program 32.5%

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

      1. +-commutative 32.5%

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

      2. unsub-neg 32.5%

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

   3. Simplified 32.5%

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

   4. Taylor expanded in b_2 around inf 69.3%

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

      1. *-commutative 69.3%

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

      2. associate-*l/ 69.3%

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

   6. Simplified 69.3%

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

   7. Taylor expanded in c around 0 69.3%

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

      1. *-commutative 69.3%

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

      2. associate-*l/ 69.3%

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

      3. associate-*r/ 69.1%

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

   9. Simplified 69.1%

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

4. Final simplification 68.6%

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

Alternative 6: 67.4% accurate, 15.9× speedup

Math

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

   1. Initial program 75.6%

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

      1. +-commutative 75.6%

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

      2. unsub-neg 75.6%

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

   3. Simplified 75.6%

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

   4. Taylor expanded in b_2 around -inf 68.2%

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

      1. *-commutative 68.2%

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

   6. Simplified 68.2%

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

   if 9.49999999999999991e-302 < b_2

   1. Initial program 32.5%

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

      1. +-commutative 32.5%

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

      2. unsub-neg 32.5%

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

   3. Simplified 32.5%

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

   4. Taylor expanded in b_2 around inf 69.3%

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

      1. *-commutative 69.3%

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

      2. associate-*l/ 69.3%

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

   6. Simplified 69.3%

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

   7. Taylor expanded in c around 0 69.3%

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

      1. *-commutative 69.3%

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

      2. associate-*l/ 69.3%

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

      3. associate-*r/ 69.1%

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

   9. Simplified 69.1%

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

4. Final simplification 68.7%

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

Alternative 7: 67.5% accurate, 15.9× speedup

Math

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

   1. Initial program 75.6%

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

      1. +-commutative 75.6%

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

      2. unsub-neg 75.6%

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

   3. Simplified 75.6%

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

   4. Taylor expanded in b_2 around -inf 68.2%

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

      1. *-commutative 68.2%

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

   6. Simplified 68.2%

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

   if 9.49999999999999991e-302 < b_2

   1. Initial program 32.5%

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

      1. +-commutative 32.5%

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

      2. unsub-neg 32.5%

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

   3. Simplified 32.5%

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

   4. Taylor expanded in b_2 around inf 69.3%

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

      1. *-commutative 69.3%

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

      2. associate-*l/ 69.3%

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

   6. Simplified 69.3%

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

4. Final simplification 68.7%

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

Alternative 8: 34.8% accurate, 22.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 54.9%

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

   1. +-commutative 54.9%

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

   2. unsub-neg 54.9%

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

3. Simplified 54.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 35.8%

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

   1. div-inv 35.7%

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

6. Applied egg-rr 36.3%

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

7. Taylor expanded in b_2 around inf 36.7%

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

   1. associate-*r/ 36.7%

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

   2. *-commutative 36.7%

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

   3. *-rgt-identity 36.7%

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

   4. associate-*r/ 36.6%

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

   5. associate-*l* 36.6%

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

   6. associate-*r/ 36.6%

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

   7. metadata-eval 36.6%

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

9. Simplified 36.6%

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

10. Final simplification 36.6%

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

Alternative 9: 15.1% accurate, 28.0× 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(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 54.9%

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

   1. +-commutative 54.9%

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

   2. unsub-neg 54.9%

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

3. Simplified 54.9%

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

4. Taylor expanded in b_2 around 0 35.2%

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

   1. associate-*r* 35.2%

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

   2. neg-mul-1 35.2%

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

6. Simplified 35.2%

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

7. Taylor expanded in a around 0 15.0%

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

   1. associate-*r/ 15.0%

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

   2. neg-mul-1 15.0%

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

9. Simplified 15.0%

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

10. Final simplification 15.0%

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

Developer target: 99.7% 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 2023339 
(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))