quadp (p42, positive)

Percentage Accurate: 52.2% → 85.3%

Time: 13.7s

Alternatives: 7

Speedup: 12.9×

Specification

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))

C

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

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - (4.0d0 * (a * c))))) / (2.0d0 * a)
end function

Java

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

Python

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

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c))))) / Float64(2.0 * a))
end

MATLAB

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

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Initial Program: 52.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))

C

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

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - (4.0d0 * (a * c))))) / (2.0d0 * a)
end function

Java

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

Python

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

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c))))) / Float64(2.0 * a))
end

MATLAB

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

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Alternative 1: 85.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{+151}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.1 \cdot 10^{-46}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(\frac{-1}{b} - a \cdot \frac{c}{{b}^{3}}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5e+151)
   (- (/ c b) (/ b a))
   (if (<= b 2.1e-46)
     (/ (- (sqrt (- (* b b) (* 4.0 (* a c)))) b) (* a 2.0))
     (* c (- (/ -1.0 b) (* a (/ c (pow b 3.0))))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e+151) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.1e-46) {
		tmp = (sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	} else {
		tmp = c * ((-1.0 / b) - (a * (c / pow(b, 3.0))));
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-5d+151)) then
        tmp = (c / b) - (b / a)
    else if (b <= 2.1d-46) then
        tmp = (sqrt(((b * b) - (4.0d0 * (a * c)))) - b) / (a * 2.0d0)
    else
        tmp = c * (((-1.0d0) / b) - (a * (c / (b ** 3.0d0))))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e+151) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.1e-46) {
		tmp = (Math.sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	} else {
		tmp = c * ((-1.0 / b) - (a * (c / Math.pow(b, 3.0))));
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -5e+151:
		tmp = (c / b) - (b / a)
	elif b <= 2.1e-46:
		tmp = (math.sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0)
	else:
		tmp = c * ((-1.0 / b) - (a * (c / math.pow(b, 3.0))))
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5e+151)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 2.1e-46)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(c * Float64(Float64(-1.0 / b) - Float64(a * Float64(c / (b ^ 3.0)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -5e+151)
		tmp = (c / b) - (b / a);
	elseif (b <= 2.1e-46)
		tmp = (sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	else
		tmp = c * ((-1.0 / b) - (a * (c / (b ^ 3.0))));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -5e+151], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.1e-46], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(c * N[(N[(-1.0 / b), $MachinePrecision] - N[(a * N[(c / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -5.0000000000000002e151

   1. Initial program 43.4%

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

      1. *-commutative 43.4%

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

   3. Simplified 43.4%

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

   5. Taylor expanded in b around -inf 97.3%

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

      1. mul-1-neg 97.3%

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

      2. *-commutative 97.3%

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

      3. distribute-rgt-neg-in 97.3%

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

      4. +-commutative 97.3%

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

      5. mul-1-neg 97.3%

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

      6. unsub-neg 97.3%

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

   7. Simplified 97.3%

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

   8. Taylor expanded in a around inf 98.1%

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

   if -5.0000000000000002e151 < b < 2.09999999999999987e-46

   1. Initial program 75.8%

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

   if 2.09999999999999987e-46 < b

   1. Initial program 17.2%

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

      1. *-commutative 17.2%

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

   3. Simplified 17.2%

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

   5. Taylor expanded in c around 0 88.8%

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

      1. mul-1-neg 88.8%

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

      2. associate-/l* 90.0%

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

   7. Simplified 90.0%

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

4. Final simplification 84.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{+151}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.1 \cdot 10^{-46}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(\frac{-1}{b} - a \cdot \frac{c}{{b}^{3}}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 78.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -3.5 \cdot 10^{+23}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 3.8 \cdot 10^{-54}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(c \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(\frac{-1}{b} - a \cdot \frac{c}{{b}^{3}}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3.5e+23)
   (- (/ c b) (/ b a))
   (if (<= b 3.8e-54)
     (/ (- (sqrt (* a (* c -4.0))) b) (* a 2.0))
     (* c (- (/ -1.0 b) (* a (/ c (pow b 3.0))))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.5e+23) {
		tmp = (c / b) - (b / a);
	} else if (b <= 3.8e-54) {
		tmp = (sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	} else {
		tmp = c * ((-1.0 / b) - (a * (c / pow(b, 3.0))));
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-3.5d+23)) then
        tmp = (c / b) - (b / a)
    else if (b <= 3.8d-54) then
        tmp = (sqrt((a * (c * (-4.0d0)))) - b) / (a * 2.0d0)
    else
        tmp = c * (((-1.0d0) / b) - (a * (c / (b ** 3.0d0))))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.5e+23) {
		tmp = (c / b) - (b / a);
	} else if (b <= 3.8e-54) {
		tmp = (Math.sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	} else {
		tmp = c * ((-1.0 / b) - (a * (c / Math.pow(b, 3.0))));
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -3.5e+23:
		tmp = (c / b) - (b / a)
	elif b <= 3.8e-54:
		tmp = (math.sqrt((a * (c * -4.0))) - b) / (a * 2.0)
	else:
		tmp = c * ((-1.0 / b) - (a * (c / math.pow(b, 3.0))))
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3.5e+23)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 3.8e-54)
		tmp = Float64(Float64(sqrt(Float64(a * Float64(c * -4.0))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(c * Float64(Float64(-1.0 / b) - Float64(a * Float64(c / (b ^ 3.0)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -3.5e+23)
		tmp = (c / b) - (b / a);
	elseif (b <= 3.8e-54)
		tmp = (sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	else
		tmp = c * ((-1.0 / b) - (a * (c / (b ^ 3.0))));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.5e+23], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.8e-54], N[(N[(N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(c * N[(N[(-1.0 / b), $MachinePrecision] - N[(a * N[(c / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.5000000000000002e23

   1. Initial program 67.7%

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

      1. *-commutative 67.7%

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

   3. Simplified 67.7%

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

   5. Taylor expanded in b around -inf 92.1%

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

      1. mul-1-neg 92.1%

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

      2. *-commutative 92.1%

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

      3. distribute-rgt-neg-in 92.1%

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

      4. +-commutative 92.1%

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

      5. mul-1-neg 92.1%

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

      6. unsub-neg 92.1%

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

   7. Simplified 92.1%

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

   8. Taylor expanded in a around inf 92.7%

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

   if -3.5000000000000002e23 < b < 3.8000000000000002e-54

   1. Initial program 65.5%

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

      1. *-commutative 65.5%

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

   3. Simplified 65.5%

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

   5. Taylor expanded in b around 0 58.7%

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

      1. *-commutative 58.7%

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

      2. associate-*r* 58.7%

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

   7. Simplified 58.7%

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

   if 3.8000000000000002e-54 < b

   1. Initial program 18.0%

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

      1. *-commutative 18.0%

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

   3. Simplified 18.0%

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

   5. Taylor expanded in c around 0 87.9%

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

      1. mul-1-neg 87.9%

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

      2. associate-/l* 89.1%

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

   7. Simplified 89.1%

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

4. Final simplification 80.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -3.5 \cdot 10^{+23}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 3.8 \cdot 10^{-54}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(c \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(\frac{-1}{b} - a \cdot \frac{c}{{b}^{3}}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 78.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -3.5 \cdot 10^{+23}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.25 \cdot 10^{-54}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(c \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3.5e+23)
   (- (/ c b) (/ b a))
   (if (<= b 2.25e-54)
     (/ (- (sqrt (* a (* c -4.0))) b) (* a 2.0))
     (/ c (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.5e+23) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.25e-54) {
		tmp = (sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-3.5d+23)) then
        tmp = (c / b) - (b / a)
    else if (b <= 2.25d-54) then
        tmp = (sqrt((a * (c * (-4.0d0)))) - b) / (a * 2.0d0)
    else
        tmp = c / -b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.5e+23) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.25e-54) {
		tmp = (Math.sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -3.5e+23:
		tmp = (c / b) - (b / a)
	elif b <= 2.25e-54:
		tmp = (math.sqrt((a * (c * -4.0))) - b) / (a * 2.0)
	else:
		tmp = c / -b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3.5e+23)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 2.25e-54)
		tmp = Float64(Float64(sqrt(Float64(a * Float64(c * -4.0))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(c / Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -3.5e+23)
		tmp = (c / b) - (b / a);
	elseif (b <= 2.25e-54)
		tmp = (sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.5e+23], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.25e-54], N[(N[(N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(c / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.5000000000000002e23

   1. Initial program 67.7%

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

      1. *-commutative 67.7%

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

   3. Simplified 67.7%

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

   5. Taylor expanded in b around -inf 92.1%

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

      1. mul-1-neg 92.1%

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

      2. *-commutative 92.1%

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

      3. distribute-rgt-neg-in 92.1%

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

      4. +-commutative 92.1%

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

      5. mul-1-neg 92.1%

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

      6. unsub-neg 92.1%

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

   7. Simplified 92.1%

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

   8. Taylor expanded in a around inf 92.7%

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

   if -3.5000000000000002e23 < b < 2.2499999999999999e-54

   1. Initial program 65.5%

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

      1. *-commutative 65.5%

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

   3. Simplified 65.5%

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

   5. Taylor expanded in b around 0 58.7%

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

      1. *-commutative 58.7%

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

      2. associate-*r* 58.7%

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

   7. Simplified 58.7%

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

   if 2.2499999999999999e-54 < b

   1. Initial program 18.0%

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

      1. *-commutative 18.0%

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

   3. Simplified 18.0%

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

   5. Taylor expanded in b around inf 89.0%

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

      1. associate-*r/ 89.0%

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

      2. neg-mul-1 89.0%

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

   7. Simplified 89.0%

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

4. Final simplification 80.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -3.5 \cdot 10^{+23}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.25 \cdot 10^{-54}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(c \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 68.4% accurate, 9.7× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4e-311) (- (/ c b) (/ b a)) (/ c (- b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4e-311) {
		tmp = (c / b) - (b / a);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-4d-311)) then
        tmp = (c / b) - (b / a)
    else
        tmp = c / -b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -4e-311) {
		tmp = (c / b) - (b / a);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -3.99999999999979e-311

   1. Initial program 69.0%

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

      1. *-commutative 69.0%

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

   3. Simplified 69.0%

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

   5. Taylor expanded in b around -inf 67.1%

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

      1. mul-1-neg 67.1%

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

      2. *-commutative 67.1%

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

      3. distribute-rgt-neg-in 67.1%

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

      4. +-commutative 67.1%

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

      5. mul-1-neg 67.1%

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

      6. unsub-neg 67.1%

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

   7. Simplified 67.1%

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

   8. Taylor expanded in a around inf 69.2%

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

   if -3.99999999999979e-311 < b

   1. Initial program 30.1%

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

      1. *-commutative 30.1%

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

   3. Simplified 30.1%

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

   5. Taylor expanded in b around inf 65.6%

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

      1. associate-*r/ 65.6%

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

      2. neg-mul-1 65.6%

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

   7. Simplified 65.6%

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

4. Final simplification 67.5%

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

Alternative 5: 44.6% accurate, 12.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4 \cdot 10^{-311}:\\ \;\;\;\;-\frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (if (<= b -4e-311) (- (/ b a)) 0.0))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4e-311) {
		tmp = -(b / a);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-4d-311)) then
        tmp = -(b / a)
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -4e-311) {
		tmp = -(b / a);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -4e-311:
		tmp = -(b / a)
	else:
		tmp = 0.0
	return tmp

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4e-311], (-N[(b / a), $MachinePrecision]), 0.0]

Derivation

1. Split input into 2 regimes

2. if b < -3.99999999999979e-311

   1. Initial program 69.0%

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

      1. *-commutative 69.0%

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

   3. Simplified 69.0%

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

   5. Taylor expanded in b around -inf 68.7%

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

      1. associate-*r/ 68.7%

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

      2. mul-1-neg 68.7%

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

   7. Simplified 68.7%

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

   if -3.99999999999979e-311 < b

   1. Initial program 30.1%

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

      1. *-commutative 30.1%

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

   3. Simplified 30.1%

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

   6. Applied egg-rr 28.2%

      \[\leadsto \color{blue}{\mathsf{hypot}\left(b, \sqrt{a \cdot \left(c \cdot -4\right)}\right) \cdot \frac{0.5}{a} - 0.5 \cdot \frac{b}{a}} \]
   7. Step-by-step derivation

      1. fma-neg 23.0%

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

      2. *-commutative 23.0%

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

      3. distribute-rgt-neg-in 23.0%

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

      4. metadata-eval 23.0%

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

   8. Applied egg-rr 23.0%

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

   9. Taylor expanded in a around 0 17.7%

      \[\leadsto \color{blue}{\frac{-0.5 \cdot b + 0.5 \cdot b}{a}} \]
   10. Step-by-step derivation

       1. distribute-rgt-out 17.7%

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

       2. metadata-eval 17.7%

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

       3. associate-*l/ 10.6%

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

       4. mul0-rgt 17.7%

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

   11. Simplified 17.7%

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

4. Final simplification 44.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4 \cdot 10^{-311}:\\ \;\;\;\;-\frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 68.2% accurate, 12.9× speedup

Math

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

FPCore

(FPCore (a b c) :precision binary64 (if (<= b 5e-296) (- (/ b a)) (/ c (- b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 5e-296) {
		tmp = -(b / a);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= 5d-296) then
        tmp = -(b / a)
    else
        tmp = c / -b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 5e-296) {
		tmp = -(b / a);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 5.0000000000000003e-296

   1. Initial program 69.4%

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

      1. *-commutative 69.4%

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

   3. Simplified 69.4%

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

   5. Taylor expanded in b around -inf 67.7%

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

      1. associate-*r/ 67.7%

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

      2. mul-1-neg 67.7%

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

   7. Simplified 67.7%

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

   if 5.0000000000000003e-296 < b

   1. Initial program 28.9%

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

      1. *-commutative 28.9%

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

   3. Simplified 28.9%

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

   5. Taylor expanded in b around inf 66.6%

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

      1. associate-*r/ 66.6%

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

      2. neg-mul-1 66.6%

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

   7. Simplified 66.6%

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

4. Final simplification 67.2%

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

Alternative 7: 11.2% accurate, 116.0× speedup

Math

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

FPCore

(FPCore (a b c) :precision binary64 0.0)

C

double code(double a, double b, double c) {
	return 0.0;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = 0.0d0
end function

Java

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

Python

def code(a, b, c):
	return 0.0

Julia

function code(a, b, c)
	return 0.0
end

MATLAB

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

Wolfram

code[a_, b_, c_] := 0.0

Derivation

1. Initial program 50.1%

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

   1. *-commutative 50.1%

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

3. Simplified 50.1%

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

6. Applied egg-rr 47.0%

   \[\leadsto \color{blue}{\mathsf{hypot}\left(b, \sqrt{a \cdot \left(c \cdot -4\right)}\right) \cdot \frac{0.5}{a} - 0.5 \cdot \frac{b}{a}} \]
7. Step-by-step derivation

   1. fma-neg 44.5%

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

   2. *-commutative 44.5%

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

   3. distribute-rgt-neg-in 44.5%

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

   4. metadata-eval 44.5%

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

8. Applied egg-rr 44.5%

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

9. Taylor expanded in a around 0 9.9%

   \[\leadsto \color{blue}{\frac{-0.5 \cdot b + 0.5 \cdot b}{a}} \]
10. Step-by-step derivation

    1. distribute-rgt-out 9.9%

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

    2. metadata-eval 9.9%

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

    3. associate-*l/ 6.3%

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

    4. mul0-rgt 9.9%

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

11. Simplified 9.9%

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

12. Final simplification 9.9%

    \[\leadsto 0 \]
13. Add Preprocessing

Developer target: 99.7% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :alt
  (if (< b 0.0) (/ (- (if (== (copysign a c) a) (* (sqrt (- (fabs (/ b 2.0)) (* (sqrt (fabs a)) (sqrt (fabs c))))) (sqrt (+ (fabs (/ b 2.0)) (* (sqrt (fabs a)) (sqrt (fabs c)))))) (hypot (/ b 2.0) (* (sqrt (fabs a)) (sqrt (fabs c))))) (/ b 2.0)) a) (/ (- c) (+ (/ b 2.0) (if (== (copysign a c) a) (* (sqrt (- (fabs (/ b 2.0)) (* (sqrt (fabs a)) (sqrt (fabs c))))) (sqrt (+ (fabs (/ b 2.0)) (* (sqrt (fabs a)) (sqrt (fabs c)))))) (hypot (/ b 2.0) (* (sqrt (fabs a)) (sqrt (fabs c))))))))

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