quad2p (problem 3.2.1, positive)

Percentage Accurate: 52.0% → 85.2%

Time: 9.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: 52.0% 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.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -1 \cdot 10^{+144}:\\ \;\;\;\;\frac{b_2 \cdot -2}{a}\\ \mathbf{elif}\;b_2 \leq 1.2 \cdot 10^{-34}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-c, a, 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 -1e+144)
   (/ (* b_2 -2.0) a)
   (if (<= b_2 1.2e-34)
     (/ (- (sqrt (fma (- c) a (* 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 <= -1e+144) {
		tmp = (b_2 * -2.0) / a;
	} else if (b_2 <= 1.2e-34) {
		tmp = (sqrt(fma(-c, a, (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 <= -1e+144)
		tmp = Float64(Float64(b_2 * -2.0) / a);
	elseif (b_2 <= 1.2e-34)
		tmp = Float64(Float64(sqrt(fma(Float64(-c), a, 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, -1e+144], N[(N[(b$95$2 * -2.0), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 1.2e-34], N[(N[(N[Sqrt[N[((-c) * a + 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.00000000000000002e144

   1. Initial program 32.4%

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

      1. +-commutative 32.4%

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

      2. unsub-neg 32.4%

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

   3. Simplified 32.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 97.8%

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

      1. *-commutative 97.8%

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

   6. Simplified 97.8%

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

   if -1.00000000000000002e144 < b_2 < 1.19999999999999996e-34

   1. Initial program 84.2%

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

      1. +-commutative 84.2%

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

      2. unsub-neg 84.2%

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

   3. Simplified 84.2%

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

      1. sub-neg 84.2%

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

      2. +-commutative 84.2%

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

      3. *-commutative 84.2%

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

      4. distribute-lft-neg-in 84.2%

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

      5. fma-def 84.3%

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

   5. Applied egg-rr 84.3%

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

   if 1.19999999999999996e-34 < b_2

   1. Initial program 14.3%

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

      1. +-commutative 14.3%

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

      2. unsub-neg 14.3%

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

   3. Simplified 14.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 89.9%

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

      1. associate-*r/ 89.9%

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

   6. Applied egg-rr 89.9%

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

4. Final simplification 88.6%

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

Alternative 2: 85.2% accurate, 1.0× speedup

Math

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

   1. Initial program 32.4%

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

      1. +-commutative 32.4%

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

      2. unsub-neg 32.4%

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

   3. Simplified 32.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 97.8%

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

      1. *-commutative 97.8%

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

   6. Simplified 97.8%

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

   if -3.19999999999999997e133 < b_2 < 1.4500000000000001e-34

   1. Initial program 84.2%

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

      1. +-commutative 84.2%

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

      2. unsub-neg 84.2%

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

   3. Simplified 84.2%

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

   if 1.4500000000000001e-34 < b_2

   1. Initial program 14.3%

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

      1. +-commutative 14.3%

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

      2. unsub-neg 14.3%

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

   3. Simplified 14.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 89.9%

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

      1. associate-*r/ 89.9%

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

   6. Applied egg-rr 89.9%

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

4. Final simplification 88.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq -3.2 \cdot 10^{+133}:\\ \;\;\;\;\frac{b_2 \cdot -2}{a}\\ \mathbf{elif}\;b_2 \leq 1.45 \cdot 10^{-34}:\\ \;\;\;\;\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: 79.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -1.2 \cdot 10^{-84}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 2.7 \cdot 10^{-33}:\\ \;\;\;\;\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 -1.2e-84)
   (+ (* -2.0 (/ b_2 a)) (* 0.5 (/ c b_2)))
   (if (<= b_2 2.7e-33) (/ (- (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 <= -1.2e-84) {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	} else if (b_2 <= 2.7e-33) {
		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 <= (-1.2d-84)) then
        tmp = ((-2.0d0) * (b_2 / a)) + (0.5d0 * (c / b_2))
    else if (b_2 <= 2.7d-33) 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 <= -1.2e-84) {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	} else if (b_2 <= 2.7e-33) {
		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 <= -1.2e-84:
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2))
	elif b_2 <= 2.7e-33:
		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 <= -1.2e-84)
		tmp = Float64(Float64(-2.0 * Float64(b_2 / a)) + Float64(0.5 * Float64(c / b_2)));
	elseif (b_2 <= 2.7e-33)
		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 <= -1.2e-84)
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	elseif (b_2 <= 2.7e-33)
		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, -1.2e-84], 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, 2.7e-33], 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 < -1.20000000000000009e-84

   1. Initial program 64.6%

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

      1. +-commutative 64.6%

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

      2. unsub-neg 64.6%

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

   3. Simplified 64.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 87.3%

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

   if -1.20000000000000009e-84 < b_2 < 2.7000000000000001e-33

   1. Initial program 78.3%

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

      1. +-commutative 78.3%

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

      2. unsub-neg 78.3%

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

   3. Simplified 78.3%

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

   4. Taylor expanded in b_2 around 0 73.9%

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

      1. mul-1-neg 73.9%

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

      2. distribute-rgt-neg-out 73.9%

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

   6. Simplified 73.9%

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

   if 2.7000000000000001e-33 < b_2

   1. Initial program 14.3%

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

      1. +-commutative 14.3%

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

      2. unsub-neg 14.3%

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

   3. Simplified 14.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 89.9%

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

      1. associate-*r/ 89.9%

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

   6. Applied egg-rr 89.9%

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

4. Final simplification 84.6%

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

Alternative 4: 67.0% accurate, 8.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -5 \cdot 10^{-312}:\\ \;\;\;\;-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-312)
   (+ (* -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-312) {
		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-312)) 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-312) {
		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-312:
		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-312)
		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-312)
		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-312], 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 < -5.0000000000022e-312

   1. Initial program 70.6%

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

      1. +-commutative 70.6%

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

      2. unsub-neg 70.6%

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

   3. Simplified 70.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 69.9%

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

   if -5.0000000000022e-312 < b_2

   1. Initial program 29.5%

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

      1. +-commutative 29.5%

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

      2. unsub-neg 29.5%

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

   3. Simplified 29.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.4%

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

      1. associate-*r/ 69.4%

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

   6. Applied egg-rr 69.4%

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

4. Final simplification 69.7%

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

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b_2 < -5.0000000000022e-312

   1. Initial program 70.6%

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

      1. +-commutative 70.6%

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

      2. unsub-neg 70.6%

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

   3. Simplified 70.6%

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

   4. Taylor expanded in b_2 around 0 39.4%

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

      1. mul-1-neg 39.4%

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

      2. distribute-rgt-neg-out 39.4%

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

   6. Simplified 39.4%

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

   7. Taylor expanded in c around 0 23.3%

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

      1. neg-mul-1 23.3%

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

      2. distribute-neg-frac 23.3%

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

   9. Simplified 23.3%

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

   if -5.0000000000022e-312 < b_2

   1. Initial program 29.5%

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

      1. +-commutative 29.5%

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

      2. unsub-neg 29.5%

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

   3. Simplified 29.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.4%

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

4. Final simplification 46.2%

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

Alternative 6: 66.8% accurate, 15.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b_2 < -5.0000000000022e-312

   1. Initial program 70.6%

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

      1. +-commutative 70.6%

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

      2. unsub-neg 70.6%

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

   3. Simplified 70.6%

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

      1. sub-neg 70.6%

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

      2. +-commutative 70.6%

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

      3. add-sqr-sqrt 54.7%

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

      4. hypot-def 67.6%

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

      5. *-commutative 67.6%

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

      6. distribute-rgt-neg-in 67.6%

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

   5. Applied egg-rr 67.6%

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

   6. Taylor expanded in b_2 around -inf 68.4%

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

      1. associate-*r/ 68.4%

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

      2. associate-/l* 68.2%

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

   8. Simplified 68.2%

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

      1. associate-/r/ 68.2%

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

   10. Applied egg-rr 68.2%

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

   if -5.0000000000022e-312 < b_2

   1. Initial program 29.5%

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

      1. +-commutative 29.5%

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

      2. unsub-neg 29.5%

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

   3. Simplified 29.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.4%

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

4. Final simplification 68.8%

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

Alternative 7: 66.8% accurate, 15.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b_2 \leq -5 \cdot 10^{-312}:\\ \;\;\;\;b_2 \cdot \frac{-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 -5e-312) (* 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 <= -5e-312) {
		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 <= (-5d-312)) 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 <= -5e-312) {
		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 <= -5e-312:
		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 <= -5e-312)
		tmp = Float64(b_2 * Float64(-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 <= -5e-312)
		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, -5e-312], N[(b$95$2 * N[(-2.0 / a), $MachinePrecision]), $MachinePrecision], N[(N[(c * -0.5), $MachinePrecision] / b$95$2), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -5.0000000000022e-312

   1. Initial program 70.6%

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

      1. +-commutative 70.6%

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

      2. unsub-neg 70.6%

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

   3. Simplified 70.6%

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

      1. sub-neg 70.6%

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

      2. +-commutative 70.6%

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

      3. add-sqr-sqrt 54.7%

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

      4. hypot-def 67.6%

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

      5. *-commutative 67.6%

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

      6. distribute-rgt-neg-in 67.6%

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

   5. Applied egg-rr 67.6%

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

   6. Taylor expanded in b_2 around -inf 68.4%

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

      1. associate-*r/ 68.4%

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

      2. associate-/l* 68.2%

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

   8. Simplified 68.2%

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

      1. associate-/r/ 68.2%

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

   10. Applied egg-rr 68.2%

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

   if -5.0000000000022e-312 < b_2

   1. Initial program 29.5%

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

      1. +-commutative 29.5%

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

      2. unsub-neg 29.5%

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

   3. Simplified 29.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.4%

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

      1. associate-*r/ 69.4%

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

   6. Applied egg-rr 69.4%

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

4. Final simplification 68.8%

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

Alternative 8: 66.9% accurate, 15.9× speedup

Math

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

   1. Initial program 70.6%

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

      1. +-commutative 70.6%

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

      2. unsub-neg 70.6%

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

   3. Simplified 70.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.4%

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

      1. *-commutative 68.4%

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

   6. Simplified 68.4%

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

   if -5.0000000000022e-312 < b_2

   1. Initial program 29.5%

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

      1. +-commutative 29.5%

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

      2. unsub-neg 29.5%

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

   3. Simplified 29.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.4%

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

      1. associate-*r/ 69.4%

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

   6. Applied egg-rr 69.4%

      \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{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^{-312}:\\ \;\;\;\;\frac{b_2 \cdot -2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b_2}\\ \end{array} \]

Alternative 9: 15.3% 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 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. Taylor expanded in b_2 around 0 31.5%

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

   1. mul-1-neg 31.5%

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

   2. distribute-rgt-neg-out 31.5%

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

6. Simplified 31.5%

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

7. Taylor expanded in c around 0 13.1%

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

   1. neg-mul-1 13.1%

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

   2. distribute-neg-frac 13.1%

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

9. Simplified 13.1%

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

10. Final simplification 13.1%

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

Reproduce

herbie shell --seed 2023238 
(FPCore (a b_2 c)
  :name "quad2p (problem 3.2.1, positive)"
  :precision binary64
  (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))